NO This is Ultimate 0.2.2-dev-e7f90c1-m [2023-02-13 03:40:31,205 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-13 03:40:31,206 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-13 03:40:31,221 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-13 03:40:31,221 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-13 03:40:31,222 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-13 03:40:31,223 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-13 03:40:31,224 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-13 03:40:31,224 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-13 03:40:31,225 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-13 03:40:31,225 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-13 03:40:31,226 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-13 03:40:31,226 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-13 03:40:31,226 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-13 03:40:31,227 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-13 03:40:31,228 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-13 03:40:31,228 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-13 03:40:31,228 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-13 03:40:31,229 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-13 03:40:31,230 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-13 03:40:31,231 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2023-02-13 03:40:31,232 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-13 03:40:31,232 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-13 03:40:31,233 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-13 03:40:31,233 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-13 03:40:31,235 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-13 03:40:31,235 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-13 03:40:31,235 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-13 03:40:31,235 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-13 03:40:31,236 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-13 03:40:31,236 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-13 03:40:31,236 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-13 03:40:31,236 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-13 03:40:31,237 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-13 03:40:31,237 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-13 03:40:31,238 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-13 03:40:31,238 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-13 03:40:31,238 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-13 03:40:31,238 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-13 03:40:31,238 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-13 03:40:31,239 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-13 03:40:31,239 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-13 03:40:31,240 INFO L101 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/Ultimate/./../termcomp2017.epf [2023-02-13 03:40:31,250 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-13 03:40:31,250 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-13 03:40:31,250 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-13 03:40:31,251 INFO L138 SettingsManager]: * Rewrite not-equals=true [2023-02-13 03:40:31,251 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-13 03:40:31,251 INFO L138 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2023-02-13 03:40:31,251 INFO L138 SettingsManager]: * Use SBE=true [2023-02-13 03:40:31,251 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-02-13 03:40:31,251 INFO L138 SettingsManager]: * Use old map elimination=false [2023-02-13 03:40:31,251 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2023-02-13 03:40:31,251 INFO L138 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2023-02-13 03:40:31,251 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2023-02-13 03:40:31,251 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-02-13 03:40:31,251 INFO L138 SettingsManager]: * Construct termination proof for TermComp=true [2023-02-13 03:40:31,252 INFO L138 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2023-02-13 03:40:31,252 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-13 03:40:31,252 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-13 03:40:31,252 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-13 03:40:31,252 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-13 03:40:31,252 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-02-13 03:40:31,252 INFO L138 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2023-02-13 03:40:31,252 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-13 03:40:31,252 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-13 03:40:31,252 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2023-02-13 03:40:31,252 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2023-02-13 03:40:31,253 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-13 03:40:31,253 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-13 03:40:31,253 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-13 03:40:31,253 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/export/starexec/sandbox/solver/Ultimate/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2023-02-13 03:40:31,387 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-13 03:40:31,401 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-13 03:40:31,403 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-13 03:40:31,404 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-13 03:40:31,404 INFO L275 PluginConnector]: CDTParser initialized [2023-02-13 03:40:31,405 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c [2023-02-13 03:40:31,439 INFO L220 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/cf58820a4e5b45398deebc3e511d9761/FLAGa34c38f40 [2023-02-13 03:40:31,772 INFO L306 CDTParser]: Found 1 translation units. [2023-02-13 03:40:31,773 INFO L160 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c [2023-02-13 03:40:31,776 INFO L349 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/cf58820a4e5b45398deebc3e511d9761/FLAGa34c38f40 [2023-02-13 03:40:32,239 INFO L357 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/cf58820a4e5b45398deebc3e511d9761 [2023-02-13 03:40:32,243 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-13 03:40:32,245 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2023-02-13 03:40:32,246 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-13 03:40:32,246 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-13 03:40:32,252 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-13 03:40:32,254 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.02 03:40:32" (1/1) ... [2023-02-13 03:40:32,256 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a2756ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.02 03:40:32, skipping insertion in model container [2023-02-13 03:40:32,257 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.02 03:40:32" (1/1) ... [2023-02-13 03:40:32,267 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-13 03:40:32,279 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-13 03:40:32,356 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-13 03:40:32,358 INFO L203 MainTranslator]: Completed pre-run [2023-02-13 03:40:32,364 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-13 03:40:32,370 INFO L208 MainTranslator]: Completed translation [2023-02-13 03:40:32,371 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.02 03:40:32 WrapperNode [2023-02-13 03:40:32,371 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-13 03:40:32,371 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-13 03:40:32,372 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-13 03:40:32,372 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-13 03:40:32,376 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.02 03:40:32" (1/1) ... [2023-02-13 03:40:32,378 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.02 03:40:32" (1/1) ... [2023-02-13 03:40:32,386 INFO L137 Inliner]: procedures = 4, calls = 2, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 20 [2023-02-13 03:40:32,386 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-13 03:40:32,387 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-13 03:40:32,387 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-13 03:40:32,387 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-13 03:40:32,391 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.02 03:40:32" (1/1) ... [2023-02-13 03:40:32,391 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.02 03:40:32" (1/1) ... [2023-02-13 03:40:32,392 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.02 03:40:32" (1/1) ... [2023-02-13 03:40:32,392 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.02 03:40:32" (1/1) ... [2023-02-13 03:40:32,393 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.02 03:40:32" (1/1) ... [2023-02-13 03:40:32,395 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.02 03:40:32" (1/1) ... [2023-02-13 03:40:32,395 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.02 03:40:32" (1/1) ... [2023-02-13 03:40:32,395 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-13 03:40:32,396 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-13 03:40:32,396 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-13 03:40:32,396 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-13 03:40:32,397 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.02 03:40:32" (1/1) ... [2023-02-13 03:40:32,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2023-02-13 03:40:32,425 INFO L189 MonitoredProcess]: No working directory specified, using /export/starexec/sandbox/solver/Ultimate/z3 [2023-02-13 03:40:32,436 INFO L229 MonitoredProcess]: Starting monitored process 1 with /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) [2023-02-13 03:40:32,438 INFO L327 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (1)] Waiting until timeout for monitored process [2023-02-13 03:40:32,483 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-13 03:40:32,484 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-13 03:40:32,550 INFO L234 CfgBuilder]: Building ICFG [2023-02-13 03:40:32,551 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-13 03:40:32,628 INFO L275 CfgBuilder]: Performing block encoding [2023-02-13 03:40:32,636 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-13 03:40:32,637 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2023-02-13 03:40:32,639 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.02 03:40:32 BoogieIcfgContainer [2023-02-13 03:40:32,639 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-13 03:40:32,639 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2023-02-13 03:40:32,640 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2023-02-13 03:40:32,641 INFO L275 PluginConnector]: BlockEncodingV2 initialized [2023-02-13 03:40:32,642 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.02 03:40:32" (1/1) ... [2023-02-13 03:40:32,653 INFO L313 BlockEncoder]: Initial Icfg 10 locations, 14 edges [2023-02-13 03:40:32,653 INFO L258 BlockEncoder]: Using Remove infeasible edges [2023-02-13 03:40:32,654 INFO L263 BlockEncoder]: Using Maximize final states [2023-02-13 03:40:32,654 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2023-02-13 03:40:32,654 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2023-02-13 03:40:32,655 INFO L296 BlockEncoder]: Using Remove sink states [2023-02-13 03:40:32,655 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2023-02-13 03:40:32,655 INFO L179 BlockEncoder]: Using Rewrite not-equals [2023-02-13 03:40:32,663 INFO L185 BlockEncoder]: Using Use SBE [2023-02-13 03:40:32,669 INFO L200 BlockEncoder]: SBE split 3 edges [2023-02-13 03:40:32,671 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility [2023-02-13 03:40:32,671 INFO L71 MaximizeFinalStates]: 0 new accepting states [2023-02-13 03:40:32,679 INFO L101 BaseMinimizeStates]: Removed 8 edges and 4 locations by large block encoding [2023-02-13 03:40:32,681 INFO L70 RemoveSinkStates]: Removed 1 edges and 1 locations by removing sink states [2023-02-13 03:40:32,682 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2023-02-13 03:40:32,682 INFO L71 MaximizeFinalStates]: 0 new accepting states [2023-02-13 03:40:32,682 INFO L101 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2023-02-13 03:40:32,682 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2023-02-13 03:40:32,683 INFO L313 BlockEncoder]: Encoded RCFG 5 locations, 11 edges [2023-02-13 03:40:32,683 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 13.02 03:40:32 BasicIcfg [2023-02-13 03:40:32,683 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2023-02-13 03:40:32,684 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-13 03:40:32,684 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-13 03:40:32,687 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-13 03:40:32,687 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.02 03:40:32" (1/4) ... [2023-02-13 03:40:32,688 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66290a12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.02 03:40:32, skipping insertion in model container [2023-02-13 03:40:32,688 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.02 03:40:32" (2/4) ... [2023-02-13 03:40:32,688 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66290a12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.02 03:40:32, skipping insertion in model container [2023-02-13 03:40:32,688 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.02 03:40:32" (3/4) ... [2023-02-13 03:40:32,688 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66290a12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.02 03:40:32, skipping insertion in model container [2023-02-13 03:40:32,688 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 13.02 03:40:32" (4/4) ... [2023-02-13 03:40:32,689 INFO L111 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2023-02-13 03:40:32,700 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2023-02-13 03:40:32,700 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 0 error locations. [2023-02-13 03:40:32,700 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66290a12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.02 03:40:32, skipping insertion in model container [2023-02-13 03:40:32,701 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-13 03:40:32,701 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-02-13 03:40:32,701 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2023-02-13 03:40:32,703 INFO L275 PluginConnector]: BuchiAutomizer initialized [2023-02-13 03:40:32,703 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-02-13 03:40:32,704 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 13.02 03:40:32" (1/4) ... [2023-02-13 03:40:32,704 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2d9329d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.02 03:40:32, skipping insertion in model container [2023-02-13 03:40:32,704 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-02-13 03:40:32,704 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.02 03:40:32" (2/4) ... [2023-02-13 03:40:32,704 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2d9329d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.02 03:40:32, skipping insertion in model container [2023-02-13 03:40:32,704 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-02-13 03:40:32,704 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.02 03:40:32" (3/4) ... [2023-02-13 03:40:32,705 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2d9329d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 13.02 03:40:32, skipping insertion in model container [2023-02-13 03:40:32,705 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-02-13 03:40:32,705 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 13.02 03:40:32" (4/4) ... [2023-02-13 03:40:32,705 INFO L322 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2023-02-13 03:40:32,733 INFO L301 stractBuchiCegarLoop]: Interprodecural is true [2023-02-13 03:40:32,733 INFO L302 stractBuchiCegarLoop]: Hoare is true [2023-02-13 03:40:32,733 INFO L303 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-02-13 03:40:32,733 INFO L304 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-02-13 03:40:32,733 INFO L305 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-02-13 03:40:32,733 INFO L306 stractBuchiCegarLoop]: Difference is false [2023-02-13 03:40:32,733 INFO L307 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-02-13 03:40:32,734 INFO L311 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2023-02-13 03:40:32,736 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 03:40:32,745 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2023-02-13 03:40:32,746 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-13 03:40:32,746 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-13 03:40:32,749 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2023-02-13 03:40:32,749 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2023-02-13 03:40:32,750 INFO L333 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-02-13 03:40:32,750 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 03:40:32,750 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2023-02-13 03:40:32,750 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-13 03:40:32,750 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-13 03:40:32,750 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2023-02-13 03:40:32,750 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2023-02-13 03:40:32,753 INFO L733 eck$LassoCheckResult]: Stem: 3#ULTIMATE.startENTRYtrue [61] ULTIMATE.startENTRY-->L18-1: Formula: (= |v_ULTIMATE.start_main_~up~0#1_8| 0) InVars {} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_14|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_4|, ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_8|, ULTIMATE.start_main_#t~nondet0#1=|v_ULTIMATE.start_main_#t~nondet0#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_~up~0#1, ULTIMATE.start_main_#t~nondet0#1] 4#L18-1true [2023-02-13 03:40:32,754 INFO L735 eck$LassoCheckResult]: Loop: 4#L18-1true [42] L18-1-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~i~0#1_5|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} AuxVars[] AssignedVars[] 6#L12true [48] L12-->L12-2: Formula: (and (= |v_ULTIMATE.start_main_~up~0#1_4| 1) (= |v_ULTIMATE.start_main_~i~0#1_6| 1)) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_6|} OutVars{ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_4|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0#1] 2#L12-2true [37] L12-2-->L15-1: Formula: (and (= |v_ULTIMATE.start_main_~up~0#1_5| 0) (= |v_ULTIMATE.start_main_~i~0#1_8| 10)) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_8|} OutVars{ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_5|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0#1] 5#L15-1true [59] L15-1-->L18-1: Formula: (and (< |v_ULTIMATE.start_main_~up~0#1_7| 1) (= |v_ULTIMATE.start_main_~i~0#1_12| (+ |v_ULTIMATE.start_main_~i~0#1_13| (- 1)))) InVars {ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_7|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_13|} OutVars{ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_7|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] 4#L18-1true [2023-02-13 03:40:32,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 03:40:32,757 INFO L85 PathProgramCache]: Analyzing trace with hash 92, now seen corresponding path program 1 times [2023-02-13 03:40:32,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 03:40:32,763 INFO L335 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283563490] [2023-02-13 03:40:32,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 03:40:32,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 03:40:32,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-13 03:40:32,808 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-13 03:40:32,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-13 03:40:32,819 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-13 03:40:32,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 03:40:32,821 INFO L85 PathProgramCache]: Analyzing trace with hash 2222077, now seen corresponding path program 1 times [2023-02-13 03:40:32,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 03:40:32,821 INFO L335 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322704205] [2023-02-13 03:40:32,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 03:40:32,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 03:40:32,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:32,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-13 03:40:32,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-13 03:40:32,861 INFO L335 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322704205] [2023-02-13 03:40:32,861 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322704205] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-13 03:40:32,861 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-13 03:40:32,862 ERROR L191 FreeRefinementEngine]: {11#true} [11#true, 13#(<= |ULTIMATE.start_main_~i~0#1| 1), 12#false] {12#false} [2023-02-13 03:40:32,862 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-13 03:40:32,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733507875] [2023-02-13 03:40:32,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-13 03:40:32,865 INFO L750 eck$LassoCheckResult]: loop already infeasible [2023-02-13 03:40:32,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-13 03:40:32,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-13 03:40:32,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-13 03:40:32,885 INFO L87 Difference]: Start difference. First operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 03:40:32,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-13 03:40:32,913 INFO L93 Difference]: Finished difference Result 9 states and 18 transitions. [2023-02-13 03:40:32,914 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9 states and 18 transitions. [2023-02-13 03:40:32,915 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2023-02-13 03:40:32,917 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9 states to 9 states and 18 transitions. [2023-02-13 03:40:32,917 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2023-02-13 03:40:32,918 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2023-02-13 03:40:32,918 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 18 transitions. [2023-02-13 03:40:32,918 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-02-13 03:40:32,918 INFO L220 hiAutomatonCegarLoop]: Abstraction has 9 states and 18 transitions. [2023-02-13 03:40:32,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 18 transitions. [2023-02-13 03:40:32,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2023-02-13 03:40:32,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 03:40:32,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 18 transitions. [2023-02-13 03:40:32,933 INFO L242 hiAutomatonCegarLoop]: Abstraction has 9 states and 18 transitions. [2023-02-13 03:40:32,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-13 03:40:32,944 INFO L426 stractBuchiCegarLoop]: Abstraction has 9 states and 18 transitions. [2023-02-13 03:40:32,945 INFO L333 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-02-13 03:40:32,945 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 18 transitions. [2023-02-13 03:40:32,945 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2023-02-13 03:40:32,946 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-13 03:40:32,946 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-13 03:40:32,946 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2023-02-13 03:40:32,946 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2023-02-13 03:40:32,947 INFO L733 eck$LassoCheckResult]: Stem: 27#ULTIMATE.startENTRY [61] ULTIMATE.startENTRY-->L18-1: Formula: (= |v_ULTIMATE.start_main_~up~0#1_8| 0) InVars {} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_14|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_4|, ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_8|, ULTIMATE.start_main_#t~nondet0#1=|v_ULTIMATE.start_main_#t~nondet0#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_~up~0#1, ULTIMATE.start_main_#t~nondet0#1] 25#L18-1 [2023-02-13 03:40:32,947 INFO L735 eck$LassoCheckResult]: Loop: 25#L18-1 [42] L18-1-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~i~0#1_5|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} AuxVars[] AssignedVars[] 26#L12 [48] L12-->L12-2: Formula: (and (= |v_ULTIMATE.start_main_~up~0#1_4| 1) (= |v_ULTIMATE.start_main_~i~0#1_6| 1)) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_6|} OutVars{ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_4|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0#1] 23#L12-2 [58] L12-2-->L15-1: Formula: (< |v_ULTIMATE.start_main_~i~0#1_9| 10) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} AuxVars[] AssignedVars[] 24#L15-1 [44] L15-1-->L18-1: Formula: (and (= |v_ULTIMATE.start_main_~up~0#1_6| 1) (= |v_ULTIMATE.start_main_~i~0#1_10| (+ |v_ULTIMATE.start_main_~i~0#1_11| 1))) InVars {ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_6|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_11|} OutVars{ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_6|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] 25#L18-1 [2023-02-13 03:40:32,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 03:40:32,948 INFO L85 PathProgramCache]: Analyzing trace with hash 92, now seen corresponding path program 2 times [2023-02-13 03:40:32,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 03:40:32,948 INFO L335 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180179919] [2023-02-13 03:40:32,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 03:40:32,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 03:40:32,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-13 03:40:32,953 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-13 03:40:32,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-13 03:40:32,955 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-13 03:40:32,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 03:40:32,956 INFO L85 PathProgramCache]: Analyzing trace with hash 2222713, now seen corresponding path program 1 times [2023-02-13 03:40:32,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 03:40:32,956 INFO L335 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456050836] [2023-02-13 03:40:32,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 03:40:32,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 03:40:32,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-13 03:40:32,963 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-13 03:40:32,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-13 03:40:32,966 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-13 03:40:32,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 03:40:32,966 INFO L85 PathProgramCache]: Analyzing trace with hash 86263124, now seen corresponding path program 1 times [2023-02-13 03:40:32,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 03:40:32,967 INFO L335 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100602166] [2023-02-13 03:40:32,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 03:40:32,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 03:40:32,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-13 03:40:32,971 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-13 03:40:32,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-13 03:40:32,973 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-13 03:40:33,004 INFO L210 LassoAnalysis]: Preferences: [2023-02-13 03:40:33,005 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-13 03:40:33,005 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-13 03:40:33,005 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-13 03:40:33,005 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-02-13 03:40:33,005 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2023-02-13 03:40:33,005 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-13 03:40:33,005 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-13 03:40:33,005 INFO L133 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Loop [2023-02-13 03:40:33,006 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-13 03:40:33,006 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-13 03:40:33,013 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-13 03:40:33,021 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-13 03:40:33,024 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-13 03:40:33,025 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-13 03:40:33,060 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-13 03:40:33,061 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-02-13 03:40:33,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2023-02-13 03:40:33,062 INFO L189 MonitoredProcess]: No working directory specified, using /export/starexec/sandbox/solver/Ultimate/z3 [2023-02-13 03:40:33,063 INFO L229 MonitoredProcess]: Starting monitored process 2 with /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-13 03:40:33,064 INFO L327 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2023-02-13 03:40:33,065 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-13 03:40:33,065 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-13 03:40:33,077 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-13 03:40:33,077 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_1=1} Honda state: {v_rep~unnamed0~0~true_1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-13 03:40:33,110 INFO L540 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2023-02-13 03:40:33,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2023-02-13 03:40:33,112 INFO L189 MonitoredProcess]: No working directory specified, using /export/starexec/sandbox/solver/Ultimate/z3 [2023-02-13 03:40:33,113 INFO L229 MonitoredProcess]: Starting monitored process 3 with /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-13 03:40:33,114 INFO L327 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2023-02-13 03:40:33,114 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-13 03:40:33,114 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-13 03:40:33,122 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-13 03:40:33,122 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_1=0} Honda state: {v_rep~unnamed0~0~false_1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-13 03:40:33,136 INFO L540 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2023-02-13 03:40:33,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2023-02-13 03:40:33,137 INFO L189 MonitoredProcess]: No working directory specified, using /export/starexec/sandbox/solver/Ultimate/z3 [2023-02-13 03:40:33,137 INFO L229 MonitoredProcess]: Starting monitored process 4 with /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-13 03:40:33,139 INFO L327 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2023-02-13 03:40:33,139 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-13 03:40:33,139 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-13 03:40:33,146 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-13 03:40:33,146 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~up~0#1=1} Honda state: {ULTIMATE.start_main_~up~0#1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-13 03:40:33,164 INFO L552 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2023-02-13 03:40:33,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2023-02-13 03:40:33,165 INFO L189 MonitoredProcess]: No working directory specified, using /export/starexec/sandbox/solver/Ultimate/z3 [2023-02-13 03:40:33,165 INFO L229 MonitoredProcess]: Starting monitored process 5 with /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-13 03:40:33,166 INFO L327 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2023-02-13 03:40:33,167 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-13 03:40:33,167 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-13 03:40:33,197 INFO L552 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2023-02-13 03:40:33,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2023-02-13 03:40:33,198 INFO L189 MonitoredProcess]: No working directory specified, using /export/starexec/sandbox/solver/Ultimate/z3 [2023-02-13 03:40:33,198 INFO L229 MonitoredProcess]: Starting monitored process 6 with /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-13 03:40:33,199 INFO L327 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2023-02-13 03:40:33,200 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-02-13 03:40:33,200 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-13 03:40:33,210 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-02-13 03:40:33,243 INFO L540 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2023-02-13 03:40:33,243 INFO L210 LassoAnalysis]: Preferences: [2023-02-13 03:40:33,243 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-13 03:40:33,243 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-13 03:40:33,243 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-13 03:40:33,243 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-02-13 03:40:33,243 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-13 03:40:33,244 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-13 03:40:33,244 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-13 03:40:33,244 INFO L133 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Loop [2023-02-13 03:40:33,244 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-13 03:40:33,244 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-13 03:40:33,245 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-13 03:40:33,248 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-13 03:40:33,252 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-13 03:40:33,257 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-13 03:40:33,293 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-13 03:40:33,299 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-02-13 03:40:33,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-13 03:40:33,301 INFO L189 MonitoredProcess]: No working directory specified, using /export/starexec/sandbox/solver/Ultimate/z3 [2023-02-13 03:40:33,303 INFO L229 MonitoredProcess]: Starting monitored process 7 with /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-13 03:40:33,304 INFO L327 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2023-02-13 03:40:33,305 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-13 03:40:33,310 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-13 03:40:33,311 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-13 03:40:33,311 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-13 03:40:33,311 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-13 03:40:33,316 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-13 03:40:33,317 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-13 03:40:33,326 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-13 03:40:33,350 INFO L552 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2023-02-13 03:40:33,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-13 03:40:33,350 INFO L189 MonitoredProcess]: No working directory specified, using /export/starexec/sandbox/solver/Ultimate/z3 [2023-02-13 03:40:33,352 INFO L229 MonitoredProcess]: Starting monitored process 8 with /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-13 03:40:33,353 INFO L327 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2023-02-13 03:40:33,354 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-13 03:40:33,359 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-13 03:40:33,360 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-13 03:40:33,360 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-13 03:40:33,360 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-13 03:40:33,360 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-13 03:40:33,361 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-13 03:40:33,362 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-13 03:40:33,363 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-13 03:40:33,390 INFO L552 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2023-02-13 03:40:33,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-13 03:40:33,391 INFO L189 MonitoredProcess]: No working directory specified, using /export/starexec/sandbox/solver/Ultimate/z3 [2023-02-13 03:40:33,392 INFO L229 MonitoredProcess]: Starting monitored process 9 with /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-13 03:40:33,393 INFO L327 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2023-02-13 03:40:33,394 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-13 03:40:33,402 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-13 03:40:33,403 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-13 03:40:33,403 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-13 03:40:33,403 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-13 03:40:33,408 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-13 03:40:33,408 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-13 03:40:33,413 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-13 03:40:33,445 INFO L552 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2023-02-13 03:40:33,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-13 03:40:33,448 INFO L189 MonitoredProcess]: No working directory specified, using /export/starexec/sandbox/solver/Ultimate/z3 [2023-02-13 03:40:33,449 INFO L229 MonitoredProcess]: Starting monitored process 10 with /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-13 03:40:33,451 INFO L327 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2023-02-13 03:40:33,452 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-13 03:40:33,460 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-13 03:40:33,461 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-13 03:40:33,461 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-13 03:40:33,461 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-13 03:40:33,462 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-13 03:40:33,464 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-13 03:40:33,464 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-13 03:40:33,470 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-02-13 03:40:33,476 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-02-13 03:40:33,477 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2023-02-13 03:40:33,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-13 03:40:33,479 INFO L189 MonitoredProcess]: No working directory specified, using /export/starexec/sandbox/solver/Ultimate/z3 [2023-02-13 03:40:33,480 INFO L229 MonitoredProcess]: Starting monitored process 11 with /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-13 03:40:33,484 INFO L327 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2023-02-13 03:40:33,484 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-02-13 03:40:33,484 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-02-13 03:40:33,485 INFO L513 LassoAnalysis]: Proved termination. [2023-02-13 03:40:33,486 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = -2*ULTIMATE.start_main_~i~0#1 + 3 Supporting invariants [] [2023-02-13 03:40:33,521 INFO L552 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2023-02-13 03:40:33,529 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-02-13 03:40:33,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 03:40:33,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:33,572 WARN L261 TraceCheckSpWp]: Trace formula consists of 4 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-13 03:40:33,573 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:33,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:33,583 INFO L263 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-13 03:40:33,584 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:33,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-13 03:40:33,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:33,621 INFO L263 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-13 03:40:33,622 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:33,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:33,647 INFO L263 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-13 03:40:33,647 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:33,660 INFO L100 LoopCannibalizer]: 2 predicates before loop cannibalization 3 predicates after loop cannibalization [2023-02-13 03:40:33,662 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2023-02-13 03:40:33,663 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 9 states and 18 transitions. cyclomatic complexity: 10 Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 03:40:33,739 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 9 states and 18 transitions. cyclomatic complexity: 10. Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 42 states and 85 transitions. Complement of second has 11 states. [2023-02-13 03:40:33,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 4 non-accepting loop states 2 accepting loop states [2023-02-13 03:40:33,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 03:40:33,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 42 transitions. [2023-02-13 03:40:33,741 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 42 transitions. Stem has 1 letters. Loop has 4 letters. [2023-02-13 03:40:33,742 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-13 03:40:33,742 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 42 transitions. Stem has 5 letters. Loop has 4 letters. [2023-02-13 03:40:33,742 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-13 03:40:33,742 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 42 transitions. Stem has 1 letters. Loop has 8 letters. [2023-02-13 03:40:33,742 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-13 03:40:33,744 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 85 transitions. [2023-02-13 03:40:33,745 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 20 [2023-02-13 03:40:33,746 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 38 states and 77 transitions. [2023-02-13 03:40:33,746 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2023-02-13 03:40:33,746 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2023-02-13 03:40:33,746 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 77 transitions. [2023-02-13 03:40:33,746 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-13 03:40:33,746 INFO L220 hiAutomatonCegarLoop]: Abstraction has 38 states and 77 transitions. [2023-02-13 03:40:33,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 77 transitions. [2023-02-13 03:40:33,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 32. [2023-02-13 03:40:33,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 2.03125) internal successors, (65), 31 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 03:40:33,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 65 transitions. [2023-02-13 03:40:33,748 INFO L242 hiAutomatonCegarLoop]: Abstraction has 32 states and 65 transitions. [2023-02-13 03:40:33,748 INFO L426 stractBuchiCegarLoop]: Abstraction has 32 states and 65 transitions. [2023-02-13 03:40:33,749 INFO L333 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-02-13 03:40:33,749 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 65 transitions. [2023-02-13 03:40:33,749 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 16 [2023-02-13 03:40:33,749 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-13 03:40:33,749 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-13 03:40:33,749 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-02-13 03:40:33,750 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 2, 1, 1] [2023-02-13 03:40:33,750 INFO L733 eck$LassoCheckResult]: Stem: 150#ULTIMATE.startENTRY [61] ULTIMATE.startENTRY-->L18-1: Formula: (= |v_ULTIMATE.start_main_~up~0#1_8| 0) InVars {} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_14|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_4|, ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_8|, ULTIMATE.start_main_#t~nondet0#1=|v_ULTIMATE.start_main_#t~nondet0#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_~up~0#1, ULTIMATE.start_main_#t~nondet0#1] 151#L18-1 [42] L18-1-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~i~0#1_5|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} AuxVars[] AssignedVars[] 147#L12 [2023-02-13 03:40:33,750 INFO L735 eck$LassoCheckResult]: Loop: 147#L12 [56] L12-->L12-2: Formula: (> |v_ULTIMATE.start_main_~i~0#1_7| 1) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} AuxVars[] AssignedVars[] 171#L12-2 [37] L12-2-->L15-1: Formula: (and (= |v_ULTIMATE.start_main_~up~0#1_5| 0) (= |v_ULTIMATE.start_main_~i~0#1_8| 10)) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_8|} OutVars{ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_5|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0#1] 172#L15-1 [44] L15-1-->L18-1: Formula: (and (= |v_ULTIMATE.start_main_~up~0#1_6| 1) (= |v_ULTIMATE.start_main_~i~0#1_10| (+ |v_ULTIMATE.start_main_~i~0#1_11| 1))) InVars {ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_6|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_11|} OutVars{ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_6|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] 169#L18-1 [42] L18-1-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~i~0#1_5|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} AuxVars[] AssignedVars[] 155#L12 [56] L12-->L12-2: Formula: (> |v_ULTIMATE.start_main_~i~0#1_7| 1) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} AuxVars[] AssignedVars[] 156#L12-2 [37] L12-2-->L15-1: Formula: (and (= |v_ULTIMATE.start_main_~up~0#1_5| 0) (= |v_ULTIMATE.start_main_~i~0#1_8| 10)) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_8|} OutVars{ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_5|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0#1] 170#L15-1 [59] L15-1-->L18-1: Formula: (and (< |v_ULTIMATE.start_main_~up~0#1_7| 1) (= |v_ULTIMATE.start_main_~i~0#1_12| (+ |v_ULTIMATE.start_main_~i~0#1_13| (- 1)))) InVars {ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_7|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_13|} OutVars{ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_7|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] 146#L18-1 [42] L18-1-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~i~0#1_5|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} AuxVars[] AssignedVars[] 147#L12 [2023-02-13 03:40:33,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 03:40:33,750 INFO L85 PathProgramCache]: Analyzing trace with hash 2894, now seen corresponding path program 1 times [2023-02-13 03:40:33,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 03:40:33,750 INFO L335 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970089100] [2023-02-13 03:40:33,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 03:40:33,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 03:40:33,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-13 03:40:33,753 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-13 03:40:33,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-13 03:40:33,755 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-13 03:40:33,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 03:40:33,755 INFO L85 PathProgramCache]: Analyzing trace with hash 1078717864, now seen corresponding path program 1 times [2023-02-13 03:40:33,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 03:40:33,755 INFO L335 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968028674] [2023-02-13 03:40:33,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 03:40:33,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 03:40:33,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:33,763 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-13 03:40:33,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-13 03:40:33,763 INFO L335 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968028674] [2023-02-13 03:40:33,763 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968028674] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-13 03:40:33,763 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-13 03:40:33,764 ERROR L191 FreeRefinementEngine]: {177#true} [177#true, 179#(<= |ULTIMATE.start_main_~up~0#1| 0), 178#false, 178#false, 178#false, 178#false, 178#false] {178#false} [2023-02-13 03:40:33,764 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-13 03:40:33,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640496017] [2023-02-13 03:40:33,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-13 03:40:33,764 INFO L750 eck$LassoCheckResult]: loop already infeasible [2023-02-13 03:40:33,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-13 03:40:33,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-13 03:40:33,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-13 03:40:33,765 INFO L87 Difference]: Start difference. First operand 32 states and 65 transitions. cyclomatic complexity: 36 Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 03:40:33,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-13 03:40:33,775 INFO L93 Difference]: Finished difference Result 54 states and 98 transitions. [2023-02-13 03:40:33,775 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 54 states and 98 transitions. [2023-02-13 03:40:33,776 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 24 [2023-02-13 03:40:33,776 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 54 states to 50 states and 91 transitions. [2023-02-13 03:40:33,776 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 35 [2023-02-13 03:40:33,777 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 35 [2023-02-13 03:40:33,777 INFO L73 IsDeterministic]: Start isDeterministic. Operand 50 states and 91 transitions. [2023-02-13 03:40:33,777 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-13 03:40:33,777 INFO L220 hiAutomatonCegarLoop]: Abstraction has 50 states and 91 transitions. [2023-02-13 03:40:33,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states and 91 transitions. [2023-02-13 03:40:33,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 46. [2023-02-13 03:40:33,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 46 states have (on average 1.8478260869565217) internal successors, (85), 45 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 03:40:33,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 85 transitions. [2023-02-13 03:40:33,779 INFO L242 hiAutomatonCegarLoop]: Abstraction has 46 states and 85 transitions. [2023-02-13 03:40:33,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-13 03:40:33,780 INFO L426 stractBuchiCegarLoop]: Abstraction has 46 states and 85 transitions. [2023-02-13 03:40:33,781 INFO L333 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2023-02-13 03:40:33,781 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states and 85 transitions. [2023-02-13 03:40:33,781 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 24 [2023-02-13 03:40:33,781 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-13 03:40:33,781 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-13 03:40:33,781 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2023-02-13 03:40:33,782 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2023-02-13 03:40:33,782 INFO L733 eck$LassoCheckResult]: Stem: 238#ULTIMATE.startENTRY [61] ULTIMATE.startENTRY-->L18-1: Formula: (= |v_ULTIMATE.start_main_~up~0#1_8| 0) InVars {} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_14|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_4|, ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_8|, ULTIMATE.start_main_#t~nondet0#1=|v_ULTIMATE.start_main_#t~nondet0#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_~up~0#1, ULTIMATE.start_main_#t~nondet0#1] 239#L18-1 [42] L18-1-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~i~0#1_5|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} AuxVars[] AssignedVars[] 241#L12 [55] L12-->L12-2: Formula: (< |v_ULTIMATE.start_main_~i~0#1_7| 1) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} AuxVars[] AssignedVars[] 234#L12-2 [2023-02-13 03:40:33,782 INFO L735 eck$LassoCheckResult]: Loop: 234#L12-2 [58] L12-2-->L15-1: Formula: (< |v_ULTIMATE.start_main_~i~0#1_9| 10) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} AuxVars[] AssignedVars[] 235#L15-1 [59] L15-1-->L18-1: Formula: (and (< |v_ULTIMATE.start_main_~up~0#1_7| 1) (= |v_ULTIMATE.start_main_~i~0#1_12| (+ |v_ULTIMATE.start_main_~i~0#1_13| (- 1)))) InVars {ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_7|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_13|} OutVars{ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_7|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] 260#L18-1 [42] L18-1-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~i~0#1_5|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} AuxVars[] AssignedVars[] 269#L12 [55] L12-->L12-2: Formula: (< |v_ULTIMATE.start_main_~i~0#1_7| 1) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} AuxVars[] AssignedVars[] 234#L12-2 [2023-02-13 03:40:33,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 03:40:33,782 INFO L85 PathProgramCache]: Analyzing trace with hash 89769, now seen corresponding path program 1 times [2023-02-13 03:40:33,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 03:40:33,783 INFO L335 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294740724] [2023-02-13 03:40:33,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 03:40:33,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 03:40:33,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:33,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-13 03:40:33,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-13 03:40:33,791 INFO L335 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294740724] [2023-02-13 03:40:33,791 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294740724] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-13 03:40:33,791 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-13 03:40:33,791 ERROR L191 FreeRefinementEngine]: {281#true} [281#true, 283#(not (<= |ULTIMATE.start_main_~i~0#1| 0))] {282#false} [2023-02-13 03:40:33,791 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-13 03:40:33,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735756227] [2023-02-13 03:40:33,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-13 03:40:33,792 INFO L738 eck$LassoCheckResult]: stem already infeasible [2023-02-13 03:40:33,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 03:40:33,792 INFO L85 PathProgramCache]: Analyzing trace with hash 2709455, now seen corresponding path program 1 times [2023-02-13 03:40:33,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 03:40:33,792 INFO L335 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051074001] [2023-02-13 03:40:33,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 03:40:33,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 03:40:33,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:33,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-13 03:40:33,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-13 03:40:33,800 INFO L335 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051074001] [2023-02-13 03:40:33,800 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051074001] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-13 03:40:33,800 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-13 03:40:33,800 ERROR L191 FreeRefinementEngine]: {284#true} [284#true, 284#true, 286#(not (<= |ULTIMATE.start_main_~i~0#1| 0))] {285#false} [2023-02-13 03:40:33,800 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-13 03:40:33,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955816016] [2023-02-13 03:40:33,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-13 03:40:33,800 INFO L750 eck$LassoCheckResult]: loop already infeasible [2023-02-13 03:40:33,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-13 03:40:33,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-13 03:40:33,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-13 03:40:33,801 INFO L87 Difference]: Start difference. First operand 46 states and 85 transitions. cyclomatic complexity: 42 Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 03:40:33,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-13 03:40:33,808 INFO L93 Difference]: Finished difference Result 45 states and 76 transitions. [2023-02-13 03:40:33,808 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 76 transitions. [2023-02-13 03:40:33,809 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 23 [2023-02-13 03:40:33,809 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 45 states and 76 transitions. [2023-02-13 03:40:33,809 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2023-02-13 03:40:33,809 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2023-02-13 03:40:33,809 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 76 transitions. [2023-02-13 03:40:33,809 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-13 03:40:33,809 INFO L220 hiAutomatonCegarLoop]: Abstraction has 45 states and 76 transitions. [2023-02-13 03:40:33,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 76 transitions. [2023-02-13 03:40:33,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 42. [2023-02-13 03:40:33,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 42 states have (on average 1.7380952380952381) internal successors, (73), 41 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 03:40:33,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 73 transitions. [2023-02-13 03:40:33,812 INFO L242 hiAutomatonCegarLoop]: Abstraction has 42 states and 73 transitions. [2023-02-13 03:40:33,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-13 03:40:33,813 INFO L426 stractBuchiCegarLoop]: Abstraction has 42 states and 73 transitions. [2023-02-13 03:40:33,813 INFO L333 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2023-02-13 03:40:33,813 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 73 transitions. [2023-02-13 03:40:33,813 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2023-02-13 03:40:33,813 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-13 03:40:33,813 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-13 03:40:33,813 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2023-02-13 03:40:33,814 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2023-02-13 03:40:33,814 INFO L733 eck$LassoCheckResult]: Stem: 340#ULTIMATE.startENTRY [61] ULTIMATE.startENTRY-->L18-1: Formula: (= |v_ULTIMATE.start_main_~up~0#1_8| 0) InVars {} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_14|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_4|, ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_8|, ULTIMATE.start_main_#t~nondet0#1=|v_ULTIMATE.start_main_#t~nondet0#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_~up~0#1, ULTIMATE.start_main_#t~nondet0#1] 341#L18-1 [42] L18-1-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~i~0#1_5|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} AuxVars[] AssignedVars[] 347#L12 [56] L12-->L12-2: Formula: (> |v_ULTIMATE.start_main_~i~0#1_7| 1) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} AuxVars[] AssignedVars[] 332#L12-2 [2023-02-13 03:40:33,814 INFO L735 eck$LassoCheckResult]: Loop: 332#L12-2 [37] L12-2-->L15-1: Formula: (and (= |v_ULTIMATE.start_main_~up~0#1_5| 0) (= |v_ULTIMATE.start_main_~i~0#1_8| 10)) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_8|} OutVars{ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_5|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0#1] 333#L15-1 [59] L15-1-->L18-1: Formula: (and (< |v_ULTIMATE.start_main_~up~0#1_7| 1) (= |v_ULTIMATE.start_main_~i~0#1_12| (+ |v_ULTIMATE.start_main_~i~0#1_13| (- 1)))) InVars {ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_7|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_13|} OutVars{ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_7|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] 342#L18-1 [42] L18-1-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~i~0#1_5|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} AuxVars[] AssignedVars[] 373#L12 [56] L12-->L12-2: Formula: (> |v_ULTIMATE.start_main_~i~0#1_7| 1) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} AuxVars[] AssignedVars[] 332#L12-2 [2023-02-13 03:40:33,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 03:40:33,814 INFO L85 PathProgramCache]: Analyzing trace with hash 89770, now seen corresponding path program 1 times [2023-02-13 03:40:33,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 03:40:33,814 INFO L335 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944835499] [2023-02-13 03:40:33,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 03:40:33,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 03:40:33,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-13 03:40:33,817 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-13 03:40:33,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-13 03:40:33,818 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-13 03:40:33,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 03:40:33,819 INFO L85 PathProgramCache]: Analyzing trace with hash 2083845, now seen corresponding path program 1 times [2023-02-13 03:40:33,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 03:40:33,819 INFO L335 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408813819] [2023-02-13 03:40:33,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 03:40:33,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 03:40:33,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-13 03:40:33,821 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-13 03:40:33,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-13 03:40:33,823 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-13 03:40:33,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 03:40:33,824 INFO L85 PathProgramCache]: Analyzing trace with hash 1301261870, now seen corresponding path program 1 times [2023-02-13 03:40:33,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 03:40:33,824 INFO L335 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239533685] [2023-02-13 03:40:33,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 03:40:33,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 03:40:33,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-13 03:40:33,827 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-13 03:40:33,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-13 03:40:33,830 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-13 03:40:33,842 INFO L210 LassoAnalysis]: Preferences: [2023-02-13 03:40:33,842 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-13 03:40:33,842 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-13 03:40:33,842 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-13 03:40:33,842 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-02-13 03:40:33,842 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2023-02-13 03:40:33,842 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-13 03:40:33,842 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-13 03:40:33,842 INFO L133 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration5_Loop [2023-02-13 03:40:33,842 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-13 03:40:33,842 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-13 03:40:33,843 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-13 03:40:33,845 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-13 03:40:33,846 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-13 03:40:33,848 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-13 03:40:33,869 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-13 03:40:33,869 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-02-13 03:40:33,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2023-02-13 03:40:33,869 INFO L189 MonitoredProcess]: No working directory specified, using /export/starexec/sandbox/solver/Ultimate/z3 [2023-02-13 03:40:33,870 INFO L229 MonitoredProcess]: Starting monitored process 12 with /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-13 03:40:33,871 INFO L327 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2023-02-13 03:40:33,871 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-13 03:40:33,871 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-13 03:40:33,879 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-13 03:40:33,879 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_3=0} Honda state: {v_rep~unnamed0~0~false_3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-13 03:40:33,894 INFO L540 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2023-02-13 03:40:33,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2023-02-13 03:40:33,894 INFO L189 MonitoredProcess]: No working directory specified, using /export/starexec/sandbox/solver/Ultimate/z3 [2023-02-13 03:40:33,895 INFO L229 MonitoredProcess]: Starting monitored process 13 with /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-13 03:40:33,896 INFO L327 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2023-02-13 03:40:33,896 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-13 03:40:33,896 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-13 03:40:33,906 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-13 03:40:33,906 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_3=1} Honda state: {v_rep~unnamed0~0~true_3=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-13 03:40:33,923 INFO L552 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2023-02-13 03:40:33,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2023-02-13 03:40:33,923 INFO L189 MonitoredProcess]: No working directory specified, using /export/starexec/sandbox/solver/Ultimate/z3 [2023-02-13 03:40:33,924 INFO L229 MonitoredProcess]: Starting monitored process 14 with /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-13 03:40:33,924 INFO L327 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2023-02-13 03:40:33,925 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-13 03:40:33,925 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-13 03:40:33,931 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-13 03:40:33,931 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~up~0#1=0} Honda state: {ULTIMATE.start_main_~up~0#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-13 03:40:33,945 INFO L552 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2023-02-13 03:40:33,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2023-02-13 03:40:33,946 INFO L189 MonitoredProcess]: No working directory specified, using /export/starexec/sandbox/solver/Ultimate/z3 [2023-02-13 03:40:33,946 INFO L229 MonitoredProcess]: Starting monitored process 15 with /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-13 03:40:33,948 INFO L327 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2023-02-13 03:40:33,948 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-13 03:40:33,948 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-13 03:40:33,990 INFO L552 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2023-02-13 03:40:33,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2023-02-13 03:40:33,990 INFO L189 MonitoredProcess]: No working directory specified, using /export/starexec/sandbox/solver/Ultimate/z3 [2023-02-13 03:40:33,991 INFO L229 MonitoredProcess]: Starting monitored process 16 with /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-13 03:40:33,992 INFO L327 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2023-02-13 03:40:33,993 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-02-13 03:40:33,994 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-13 03:40:34,009 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-02-13 03:40:34,046 INFO L552 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2023-02-13 03:40:34,046 INFO L210 LassoAnalysis]: Preferences: [2023-02-13 03:40:34,046 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-13 03:40:34,046 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-13 03:40:34,046 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-13 03:40:34,047 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-02-13 03:40:34,047 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-13 03:40:34,047 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-13 03:40:34,047 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-13 03:40:34,047 INFO L133 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration5_Loop [2023-02-13 03:40:34,047 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-13 03:40:34,047 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-13 03:40:34,048 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-13 03:40:34,058 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-13 03:40:34,065 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-13 03:40:34,069 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-13 03:40:34,123 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-13 03:40:34,123 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-02-13 03:40:34,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-13 03:40:34,124 INFO L189 MonitoredProcess]: No working directory specified, using /export/starexec/sandbox/solver/Ultimate/z3 [2023-02-13 03:40:34,126 INFO L229 MonitoredProcess]: Starting monitored process 17 with /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-13 03:40:34,130 INFO L327 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2023-02-13 03:40:34,131 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-13 03:40:34,141 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-13 03:40:34,141 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-13 03:40:34,142 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-13 03:40:34,142 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-13 03:40:34,145 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-13 03:40:34,145 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-13 03:40:34,154 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-13 03:40:34,168 INFO L552 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2023-02-13 03:40:34,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-13 03:40:34,169 INFO L189 MonitoredProcess]: No working directory specified, using /export/starexec/sandbox/solver/Ultimate/z3 [2023-02-13 03:40:34,169 INFO L229 MonitoredProcess]: Starting monitored process 18 with /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-13 03:40:34,171 INFO L327 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2023-02-13 03:40:34,171 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-13 03:40:34,181 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-13 03:40:34,181 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-13 03:40:34,182 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-13 03:40:34,182 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-13 03:40:34,182 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-13 03:40:34,184 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-13 03:40:34,184 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-13 03:40:34,189 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-02-13 03:40:34,197 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-02-13 03:40:34,197 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2023-02-13 03:40:34,197 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-13 03:40:34,198 INFO L189 MonitoredProcess]: No working directory specified, using /export/starexec/sandbox/solver/Ultimate/z3 [2023-02-13 03:40:34,202 INFO L229 MonitoredProcess]: Starting monitored process 19 with /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-13 03:40:34,204 INFO L327 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2023-02-13 03:40:34,205 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-02-13 03:40:34,205 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-02-13 03:40:34,205 INFO L513 LassoAnalysis]: Proved termination. [2023-02-13 03:40:34,205 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = 1*ULTIMATE.start_main_~i~0#1 Supporting invariants [] [2023-02-13 03:40:34,241 INFO L552 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2023-02-13 03:40:34,242 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-02-13 03:40:34,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 03:40:34,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:34,259 INFO L263 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-13 03:40:34,259 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:34,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:34,266 INFO L263 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-13 03:40:34,267 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:34,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-13 03:40:34,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:34,299 INFO L263 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-13 03:40:34,299 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:34,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:34,307 INFO L263 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-13 03:40:34,307 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:34,314 INFO L100 LoopCannibalizer]: 4 predicates before loop cannibalization 4 predicates after loop cannibalization [2023-02-13 03:40:34,314 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2023-02-13 03:40:34,315 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 42 states and 73 transitions. cyclomatic complexity: 34 Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 03:40:34,402 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 42 states and 73 transitions. cyclomatic complexity: 34. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 460 states and 789 transitions. Complement of second has 58 states. [2023-02-13 03:40:34,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2023-02-13 03:40:34,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 03:40:34,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 54 transitions. [2023-02-13 03:40:34,403 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 54 transitions. Stem has 3 letters. Loop has 4 letters. [2023-02-13 03:40:34,404 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-13 03:40:34,404 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 54 transitions. Stem has 7 letters. Loop has 4 letters. [2023-02-13 03:40:34,405 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-13 03:40:34,405 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 54 transitions. Stem has 3 letters. Loop has 8 letters. [2023-02-13 03:40:34,405 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-13 03:40:34,406 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 460 states and 789 transitions. [2023-02-13 03:40:34,414 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 103 [2023-02-13 03:40:34,416 INFO L552 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2023-02-13 03:40:34,419 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 460 states to 175 states and 282 transitions. [2023-02-13 03:40:34,419 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 34 [2023-02-13 03:40:34,419 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 62 [2023-02-13 03:40:34,419 INFO L73 IsDeterministic]: Start isDeterministic. Operand 175 states and 282 transitions. [2023-02-13 03:40:34,419 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-13 03:40:34,419 INFO L220 hiAutomatonCegarLoop]: Abstraction has 175 states and 282 transitions. [2023-02-13 03:40:34,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states and 282 transitions. [2023-02-13 03:40:34,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 108. [2023-02-13 03:40:34,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 108 states have (on average 1.8148148148148149) internal successors, (196), 107 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 03:40:34,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 196 transitions. [2023-02-13 03:40:34,425 INFO L242 hiAutomatonCegarLoop]: Abstraction has 108 states and 196 transitions. [2023-02-13 03:40:34,425 INFO L426 stractBuchiCegarLoop]: Abstraction has 108 states and 196 transitions. [2023-02-13 03:40:34,425 INFO L333 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2023-02-13 03:40:34,425 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 108 states and 196 transitions. [2023-02-13 03:40:34,426 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 72 [2023-02-13 03:40:34,426 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-13 03:40:34,426 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-13 03:40:34,426 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2023-02-13 03:40:34,426 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2023-02-13 03:40:34,427 INFO L733 eck$LassoCheckResult]: Stem: 963#ULTIMATE.startENTRY [61] ULTIMATE.startENTRY-->L18-1: Formula: (= |v_ULTIMATE.start_main_~up~0#1_8| 0) InVars {} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_14|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_4|, ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_8|, ULTIMATE.start_main_#t~nondet0#1=|v_ULTIMATE.start_main_#t~nondet0#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_~up~0#1, ULTIMATE.start_main_#t~nondet0#1] 964#L18-1 [42] L18-1-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~i~0#1_5|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} AuxVars[] AssignedVars[] 982#L12 [48] L12-->L12-2: Formula: (and (= |v_ULTIMATE.start_main_~up~0#1_4| 1) (= |v_ULTIMATE.start_main_~i~0#1_6| 1)) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_6|} OutVars{ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_4|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0#1] 978#L12-2 [58] L12-2-->L15-1: Formula: (< |v_ULTIMATE.start_main_~i~0#1_9| 10) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} AuxVars[] AssignedVars[] 972#L15-1 [60] L15-1-->L18-1: Formula: (and (> |v_ULTIMATE.start_main_~up~0#1_7| 1) (= |v_ULTIMATE.start_main_~i~0#1_12| (+ |v_ULTIMATE.start_main_~i~0#1_13| (- 1)))) InVars {ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_7|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_13|} OutVars{ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_7|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] 973#L18-1 [2023-02-13 03:40:34,427 INFO L735 eck$LassoCheckResult]: Loop: 973#L18-1 [42] L18-1-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~i~0#1_5|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} AuxVars[] AssignedVars[] 984#L12 [48] L12-->L12-2: Formula: (and (= |v_ULTIMATE.start_main_~up~0#1_4| 1) (= |v_ULTIMATE.start_main_~i~0#1_6| 1)) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_6|} OutVars{ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_4|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0#1] 979#L12-2 [58] L12-2-->L15-1: Formula: (< |v_ULTIMATE.start_main_~i~0#1_9| 10) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} AuxVars[] AssignedVars[] 974#L15-1 [59] L15-1-->L18-1: Formula: (and (< |v_ULTIMATE.start_main_~up~0#1_7| 1) (= |v_ULTIMATE.start_main_~i~0#1_12| (+ |v_ULTIMATE.start_main_~i~0#1_13| (- 1)))) InVars {ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_7|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_13|} OutVars{ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_7|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] 973#L18-1 [2023-02-13 03:40:34,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 03:40:34,427 INFO L85 PathProgramCache]: Analyzing trace with hash 86263140, now seen corresponding path program 1 times [2023-02-13 03:40:34,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 03:40:34,427 INFO L335 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765781232] [2023-02-13 03:40:34,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 03:40:34,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 03:40:34,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:34,430 INFO L552 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2023-02-13 03:40:34,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-13 03:40:34,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-13 03:40:34,437 INFO L335 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765781232] [2023-02-13 03:40:34,437 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765781232] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-13 03:40:34,437 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-13 03:40:34,437 ERROR L191 FreeRefinementEngine]: {1064#true} [1064#true, 1064#true, 1066#(<= |ULTIMATE.start_main_~up~0#1| 1), 1066#(<= |ULTIMATE.start_main_~up~0#1| 1)] {1065#false} [2023-02-13 03:40:34,437 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-13 03:40:34,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398397227] [2023-02-13 03:40:34,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-13 03:40:34,438 INFO L738 eck$LassoCheckResult]: stem already infeasible [2023-02-13 03:40:34,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 03:40:34,438 INFO L85 PathProgramCache]: Analyzing trace with hash 2222728, now seen corresponding path program 1 times [2023-02-13 03:40:34,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 03:40:34,438 INFO L335 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840127751] [2023-02-13 03:40:34,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 03:40:34,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 03:40:34,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:34,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-13 03:40:34,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-13 03:40:34,445 INFO L335 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840127751] [2023-02-13 03:40:34,445 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840127751] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-13 03:40:34,446 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-13 03:40:34,446 ERROR L191 FreeRefinementEngine]: {1067#true} [1067#true, 1069#(<= 1 |ULTIMATE.start_main_~up~0#1|), 1069#(<= 1 |ULTIMATE.start_main_~up~0#1|)] {1068#false} [2023-02-13 03:40:34,446 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-13 03:40:34,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269059779] [2023-02-13 03:40:34,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-13 03:40:34,446 INFO L750 eck$LassoCheckResult]: loop already infeasible [2023-02-13 03:40:34,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-13 03:40:34,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-13 03:40:34,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-13 03:40:34,446 INFO L87 Difference]: Start difference. First operand 108 states and 196 transitions. cyclomatic complexity: 92 Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 03:40:34,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-13 03:40:34,454 INFO L93 Difference]: Finished difference Result 108 states and 183 transitions. [2023-02-13 03:40:34,454 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 108 states and 183 transitions. [2023-02-13 03:40:34,455 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 72 [2023-02-13 03:40:34,456 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 108 states to 108 states and 183 transitions. [2023-02-13 03:40:34,456 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 35 [2023-02-13 03:40:34,456 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 35 [2023-02-13 03:40:34,456 INFO L73 IsDeterministic]: Start isDeterministic. Operand 108 states and 183 transitions. [2023-02-13 03:40:34,456 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-13 03:40:34,456 INFO L220 hiAutomatonCegarLoop]: Abstraction has 108 states and 183 transitions. [2023-02-13 03:40:34,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states and 183 transitions. [2023-02-13 03:40:34,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2023-02-13 03:40:34,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 108 states have (on average 1.6944444444444444) internal successors, (183), 107 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 03:40:34,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 183 transitions. [2023-02-13 03:40:34,460 INFO L242 hiAutomatonCegarLoop]: Abstraction has 108 states and 183 transitions. [2023-02-13 03:40:34,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-13 03:40:34,461 INFO L426 stractBuchiCegarLoop]: Abstraction has 108 states and 183 transitions. [2023-02-13 03:40:34,461 INFO L333 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2023-02-13 03:40:34,461 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 108 states and 183 transitions. [2023-02-13 03:40:34,461 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 72 [2023-02-13 03:40:34,461 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-13 03:40:34,461 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-13 03:40:34,461 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2023-02-13 03:40:34,462 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2023-02-13 03:40:34,462 INFO L733 eck$LassoCheckResult]: Stem: 1182#ULTIMATE.startENTRY [61] ULTIMATE.startENTRY-->L18-1: Formula: (= |v_ULTIMATE.start_main_~up~0#1_8| 0) InVars {} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_14|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_4|, ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_8|, ULTIMATE.start_main_#t~nondet0#1=|v_ULTIMATE.start_main_#t~nondet0#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_~up~0#1, ULTIMATE.start_main_#t~nondet0#1] 1183#L18-1 [42] L18-1-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~i~0#1_5|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} AuxVars[] AssignedVars[] 1201#L12 [48] L12-->L12-2: Formula: (and (= |v_ULTIMATE.start_main_~up~0#1_4| 1) (= |v_ULTIMATE.start_main_~i~0#1_6| 1)) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_6|} OutVars{ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_4|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0#1] 1197#L12-2 [58] L12-2-->L15-1: Formula: (< |v_ULTIMATE.start_main_~i~0#1_9| 10) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} AuxVars[] AssignedVars[] 1188#L15-1 [60] L15-1-->L18-1: Formula: (and (> |v_ULTIMATE.start_main_~up~0#1_7| 1) (= |v_ULTIMATE.start_main_~i~0#1_12| (+ |v_ULTIMATE.start_main_~i~0#1_13| (- 1)))) InVars {ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_7|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_13|} OutVars{ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_7|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] 1189#L18-1 [2023-02-13 03:40:34,462 INFO L735 eck$LassoCheckResult]: Loop: 1189#L18-1 [42] L18-1-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~i~0#1_5|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} AuxVars[] AssignedVars[] 1205#L12 [48] L12-->L12-2: Formula: (and (= |v_ULTIMATE.start_main_~up~0#1_4| 1) (= |v_ULTIMATE.start_main_~i~0#1_6| 1)) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_6|} OutVars{ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_4|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0#1] 1200#L12-2 [58] L12-2-->L15-1: Formula: (< |v_ULTIMATE.start_main_~i~0#1_9| 10) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} AuxVars[] AssignedVars[] 1195#L15-1 [60] L15-1-->L18-1: Formula: (and (> |v_ULTIMATE.start_main_~up~0#1_7| 1) (= |v_ULTIMATE.start_main_~i~0#1_12| (+ |v_ULTIMATE.start_main_~i~0#1_13| (- 1)))) InVars {ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_7|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_13|} OutVars{ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_7|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] 1189#L18-1 [2023-02-13 03:40:34,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 03:40:34,462 INFO L85 PathProgramCache]: Analyzing trace with hash 86263140, now seen corresponding path program 2 times [2023-02-13 03:40:34,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 03:40:34,462 INFO L335 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536731750] [2023-02-13 03:40:34,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 03:40:34,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 03:40:34,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:34,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-13 03:40:34,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-13 03:40:34,469 INFO L335 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536731750] [2023-02-13 03:40:34,470 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536731750] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-13 03:40:34,470 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-13 03:40:34,470 ERROR L191 FreeRefinementEngine]: {1287#true} [1287#true, 1287#true, 1289#(<= |ULTIMATE.start_main_~up~0#1| 1), 1289#(<= |ULTIMATE.start_main_~up~0#1| 1)] {1288#false} [2023-02-13 03:40:34,470 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-13 03:40:34,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909287275] [2023-02-13 03:40:34,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-13 03:40:34,470 INFO L738 eck$LassoCheckResult]: stem already infeasible [2023-02-13 03:40:34,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 03:40:34,470 INFO L85 PathProgramCache]: Analyzing trace with hash 2222729, now seen corresponding path program 1 times [2023-02-13 03:40:34,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 03:40:34,471 INFO L335 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120058341] [2023-02-13 03:40:34,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 03:40:34,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 03:40:34,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:34,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-13 03:40:34,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-13 03:40:34,477 INFO L335 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120058341] [2023-02-13 03:40:34,477 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120058341] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-13 03:40:34,477 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-13 03:40:34,477 ERROR L191 FreeRefinementEngine]: {1290#true} [1290#true, 1292#(<= |ULTIMATE.start_main_~up~0#1| 1), 1292#(<= |ULTIMATE.start_main_~up~0#1| 1)] {1291#false} [2023-02-13 03:40:34,477 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-13 03:40:34,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438931667] [2023-02-13 03:40:34,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-13 03:40:34,478 INFO L750 eck$LassoCheckResult]: loop already infeasible [2023-02-13 03:40:34,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-13 03:40:34,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-13 03:40:34,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-13 03:40:34,478 INFO L87 Difference]: Start difference. First operand 108 states and 183 transitions. cyclomatic complexity: 79 Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 03:40:34,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-13 03:40:34,485 INFO L93 Difference]: Finished difference Result 68 states and 98 transitions. [2023-02-13 03:40:34,486 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 68 states and 98 transitions. [2023-02-13 03:40:34,486 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 28 [2023-02-13 03:40:34,486 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 68 states to 60 states and 86 transitions. [2023-02-13 03:40:34,486 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2023-02-13 03:40:34,487 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2023-02-13 03:40:34,487 INFO L73 IsDeterministic]: Start isDeterministic. Operand 60 states and 86 transitions. [2023-02-13 03:40:34,487 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-13 03:40:34,487 INFO L220 hiAutomatonCegarLoop]: Abstraction has 60 states and 86 transitions. [2023-02-13 03:40:34,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states and 86 transitions. [2023-02-13 03:40:34,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 53. [2023-02-13 03:40:34,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 53 states have (on average 1.490566037735849) internal successors, (79), 52 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 03:40:34,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 79 transitions. [2023-02-13 03:40:34,488 INFO L242 hiAutomatonCegarLoop]: Abstraction has 53 states and 79 transitions. [2023-02-13 03:40:34,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-13 03:40:34,489 INFO L426 stractBuchiCegarLoop]: Abstraction has 53 states and 79 transitions. [2023-02-13 03:40:34,489 INFO L333 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2023-02-13 03:40:34,489 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states and 79 transitions. [2023-02-13 03:40:34,490 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 25 [2023-02-13 03:40:34,490 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-13 03:40:34,490 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-13 03:40:34,490 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1] [2023-02-13 03:40:34,490 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1] [2023-02-13 03:40:34,491 INFO L733 eck$LassoCheckResult]: Stem: 1367#ULTIMATE.startENTRY [61] ULTIMATE.startENTRY-->L18-1: Formula: (= |v_ULTIMATE.start_main_~up~0#1_8| 0) InVars {} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_14|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_4|, ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_8|, ULTIMATE.start_main_#t~nondet0#1=|v_ULTIMATE.start_main_#t~nondet0#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_~up~0#1, ULTIMATE.start_main_#t~nondet0#1] 1368#L18-1 [42] L18-1-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~i~0#1_5|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} AuxVars[] AssignedVars[] 1387#L12 [56] L12-->L12-2: Formula: (> |v_ULTIMATE.start_main_~i~0#1_7| 1) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} AuxVars[] AssignedVars[] 1361#L12-2 [57] L12-2-->L15-1: Formula: (> |v_ULTIMATE.start_main_~i~0#1_9| 10) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} AuxVars[] AssignedVars[] 1362#L15-1 [59] L15-1-->L18-1: Formula: (and (< |v_ULTIMATE.start_main_~up~0#1_7| 1) (= |v_ULTIMATE.start_main_~i~0#1_12| (+ |v_ULTIMATE.start_main_~i~0#1_13| (- 1)))) InVars {ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_7|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_13|} OutVars{ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_7|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] 1393#L18-1 [42] L18-1-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~i~0#1_5|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} AuxVars[] AssignedVars[] 1384#L12 [2023-02-13 03:40:34,491 INFO L735 eck$LassoCheckResult]: Loop: 1384#L12 [48] L12-->L12-2: Formula: (and (= |v_ULTIMATE.start_main_~up~0#1_4| 1) (= |v_ULTIMATE.start_main_~i~0#1_6| 1)) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_6|} OutVars{ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_4|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0#1] 1380#L12-2 [58] L12-2-->L15-1: Formula: (< |v_ULTIMATE.start_main_~i~0#1_9| 10) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} AuxVars[] AssignedVars[] 1381#L15-1 [44] L15-1-->L18-1: Formula: (and (= |v_ULTIMATE.start_main_~up~0#1_6| 1) (= |v_ULTIMATE.start_main_~i~0#1_10| (+ |v_ULTIMATE.start_main_~i~0#1_11| 1))) InVars {ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_6|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_11|} OutVars{ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_6|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] 1394#L18-1 [42] L18-1-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~i~0#1_5|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} AuxVars[] AssignedVars[] 1395#L12 [56] L12-->L12-2: Formula: (> |v_ULTIMATE.start_main_~i~0#1_7| 1) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} AuxVars[] AssignedVars[] 1382#L12-2 [37] L12-2-->L15-1: Formula: (and (= |v_ULTIMATE.start_main_~up~0#1_5| 0) (= |v_ULTIMATE.start_main_~i~0#1_8| 10)) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_8|} OutVars{ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_5|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0#1] 1362#L15-1 [59] L15-1-->L18-1: Formula: (and (< |v_ULTIMATE.start_main_~up~0#1_7| 1) (= |v_ULTIMATE.start_main_~i~0#1_12| (+ |v_ULTIMATE.start_main_~i~0#1_13| (- 1)))) InVars {ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_7|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_13|} OutVars{ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_7|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] 1393#L18-1 [42] L18-1-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~i~0#1_5|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} AuxVars[] AssignedVars[] 1384#L12 [2023-02-13 03:40:34,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 03:40:34,491 INFO L85 PathProgramCache]: Analyzing trace with hash -1620572578, now seen corresponding path program 1 times [2023-02-13 03:40:34,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 03:40:34,491 INFO L335 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546289641] [2023-02-13 03:40:34,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 03:40:34,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 03:40:34,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-13 03:40:34,494 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-13 03:40:34,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-13 03:40:34,496 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-13 03:40:34,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 03:40:34,496 INFO L85 PathProgramCache]: Analyzing trace with hash 1478845189, now seen corresponding path program 1 times [2023-02-13 03:40:34,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 03:40:34,497 INFO L335 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804664123] [2023-02-13 03:40:34,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 03:40:34,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 03:40:34,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:34,506 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-13 03:40:34,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-13 03:40:34,507 INFO L335 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804664123] [2023-02-13 03:40:34,507 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804664123] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-13 03:40:34,507 INFO L335 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [978075048] [2023-02-13 03:40:34,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 03:40:34,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-13 03:40:34,507 INFO L189 MonitoredProcess]: No working directory specified, using /export/starexec/sandbox/solver/Ultimate/z3 [2023-02-13 03:40:34,508 INFO L229 MonitoredProcess]: Starting monitored process 20 with /export/starexec/sandbox/solver/Ultimate/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-13 03:40:34,509 INFO L327 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2023-02-13 03:40:34,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:34,519 INFO L263 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-13 03:40:34,519 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:34,525 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-13 03:40:34,525 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-13 03:40:34,536 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-13 03:40:34,537 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [978075048] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-13 03:40:34,537 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-13 03:40:34,537 ERROR L197 FreeRefinementEngine]: {1417#true} [1419#(<= |ULTIMATE.start_main_~i~0#1| 1), 1419#(<= |ULTIMATE.start_main_~i~0#1| 1), 1420#(<= |ULTIMATE.start_main_~i~0#1| 2), 1420#(<= |ULTIMATE.start_main_~i~0#1| 2), 1420#(<= |ULTIMATE.start_main_~i~0#1| 2), 1418#false, 1418#false] {1418#false} [2023-02-13 03:40:34,537 ERROR L197 FreeRefinementEngine]: {1417#true} [1419#(<= |ULTIMATE.start_main_~i~0#1| 1), 1419#(<= |ULTIMATE.start_main_~i~0#1| 1), 1420#(<= |ULTIMATE.start_main_~i~0#1| 2), 1420#(<= |ULTIMATE.start_main_~i~0#1| 2), 1420#(<= |ULTIMATE.start_main_~i~0#1| 2), 1418#false, 1418#false] {1418#false} [2023-02-13 03:40:34,537 ERROR L197 FreeRefinementEngine]: {1417#true} [1461#(< |ULTIMATE.start_main_~i~0#1| 9), 1461#(< |ULTIMATE.start_main_~i~0#1| 9), 1451#(not (<= 10 |ULTIMATE.start_main_~i~0#1|)), 1451#(not (<= 10 |ULTIMATE.start_main_~i~0#1|)), 1451#(not (<= 10 |ULTIMATE.start_main_~i~0#1|)), 1418#false, 1418#false] {1418#false} [2023-02-13 03:40:34,537 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2023-02-13 03:40:34,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89951193] [2023-02-13 03:40:34,538 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-13 03:40:34,538 INFO L750 eck$LassoCheckResult]: loop already infeasible [2023-02-13 03:40:34,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-13 03:40:34,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-13 03:40:34,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-02-13 03:40:34,539 INFO L87 Difference]: Start difference. First operand 53 states and 79 transitions. cyclomatic complexity: 31 Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 03:40:34,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-13 03:40:34,563 INFO L93 Difference]: Finished difference Result 83 states and 110 transitions. [2023-02-13 03:40:34,563 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 83 states and 110 transitions. [2023-02-13 03:40:34,564 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 39 [2023-02-13 03:40:34,564 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 83 states to 83 states and 110 transitions. [2023-02-13 03:40:34,564 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 40 [2023-02-13 03:40:34,565 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 40 [2023-02-13 03:40:34,565 INFO L73 IsDeterministic]: Start isDeterministic. Operand 83 states and 110 transitions. [2023-02-13 03:40:34,565 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-13 03:40:34,565 INFO L220 hiAutomatonCegarLoop]: Abstraction has 83 states and 110 transitions. [2023-02-13 03:40:34,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states and 110 transitions. [2023-02-13 03:40:34,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 82. [2023-02-13 03:40:34,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 82 states have (on average 1.329268292682927) internal successors, (109), 81 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 03:40:34,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 109 transitions. [2023-02-13 03:40:34,569 INFO L242 hiAutomatonCegarLoop]: Abstraction has 82 states and 109 transitions. [2023-02-13 03:40:34,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-13 03:40:34,570 INFO L426 stractBuchiCegarLoop]: Abstraction has 82 states and 109 transitions. [2023-02-13 03:40:34,570 INFO L333 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2023-02-13 03:40:34,570 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 82 states and 109 transitions. [2023-02-13 03:40:34,570 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 38 [2023-02-13 03:40:34,571 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-13 03:40:34,571 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-13 03:40:34,571 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1] [2023-02-13 03:40:34,571 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [5, 4, 4, 4, 1, 1, 1] [2023-02-13 03:40:34,571 INFO L733 eck$LassoCheckResult]: Stem: 1557#ULTIMATE.startENTRY [61] ULTIMATE.startENTRY-->L18-1: Formula: (= |v_ULTIMATE.start_main_~up~0#1_8| 0) InVars {} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_14|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_4|, ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_8|, ULTIMATE.start_main_#t~nondet0#1=|v_ULTIMATE.start_main_#t~nondet0#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_~up~0#1, ULTIMATE.start_main_#t~nondet0#1] 1558#L18-1 [42] L18-1-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~i~0#1_5|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} AuxVars[] AssignedVars[] 1561#L12 [56] L12-->L12-2: Formula: (> |v_ULTIMATE.start_main_~i~0#1_7| 1) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} AuxVars[] AssignedVars[] 1548#L12-2 [57] L12-2-->L15-1: Formula: (> |v_ULTIMATE.start_main_~i~0#1_9| 10) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} AuxVars[] AssignedVars[] 1549#L15-1 [59] L15-1-->L18-1: Formula: (and (< |v_ULTIMATE.start_main_~up~0#1_7| 1) (= |v_ULTIMATE.start_main_~i~0#1_12| (+ |v_ULTIMATE.start_main_~i~0#1_13| (- 1)))) InVars {ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_7|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_13|} OutVars{ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_7|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] 1592#L18-1 [42] L18-1-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~i~0#1_5|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} AuxVars[] AssignedVars[] 1581#L12 [2023-02-13 03:40:34,572 INFO L735 eck$LassoCheckResult]: Loop: 1581#L12 [48] L12-->L12-2: Formula: (and (= |v_ULTIMATE.start_main_~up~0#1_4| 1) (= |v_ULTIMATE.start_main_~i~0#1_6| 1)) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_6|} OutVars{ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_4|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0#1] 1579#L12-2 [58] L12-2-->L15-1: Formula: (< |v_ULTIMATE.start_main_~i~0#1_9| 10) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} AuxVars[] AssignedVars[] 1607#L15-1 [44] L15-1-->L18-1: Formula: (and (= |v_ULTIMATE.start_main_~up~0#1_6| 1) (= |v_ULTIMATE.start_main_~i~0#1_10| (+ |v_ULTIMATE.start_main_~i~0#1_11| 1))) InVars {ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_6|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_11|} OutVars{ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_6|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] 1605#L18-1 [42] L18-1-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~i~0#1_5|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} AuxVars[] AssignedVars[] 1586#L12 [56] L12-->L12-2: Formula: (> |v_ULTIMATE.start_main_~i~0#1_7| 1) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} AuxVars[] AssignedVars[] 1566#L12-2 [58] L12-2-->L15-1: Formula: (< |v_ULTIMATE.start_main_~i~0#1_9| 10) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} AuxVars[] AssignedVars[] 1559#L15-1 [44] L15-1-->L18-1: Formula: (and (= |v_ULTIMATE.start_main_~up~0#1_6| 1) (= |v_ULTIMATE.start_main_~i~0#1_10| (+ |v_ULTIMATE.start_main_~i~0#1_11| 1))) InVars {ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_6|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_11|} OutVars{ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_6|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] 1553#L18-1 [42] L18-1-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~i~0#1_5|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} AuxVars[] AssignedVars[] 1554#L12 [56] L12-->L12-2: Formula: (> |v_ULTIMATE.start_main_~i~0#1_7| 1) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} AuxVars[] AssignedVars[] 1602#L12-2 [58] L12-2-->L15-1: Formula: (< |v_ULTIMATE.start_main_~i~0#1_9| 10) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} AuxVars[] AssignedVars[] 1599#L15-1 [44] L15-1-->L18-1: Formula: (and (= |v_ULTIMATE.start_main_~up~0#1_6| 1) (= |v_ULTIMATE.start_main_~i~0#1_10| (+ |v_ULTIMATE.start_main_~i~0#1_11| 1))) InVars {ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_6|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_11|} OutVars{ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_6|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] 1597#L18-1 [42] L18-1-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~i~0#1_5|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} AuxVars[] AssignedVars[] 1584#L12 [56] L12-->L12-2: Formula: (> |v_ULTIMATE.start_main_~i~0#1_7| 1) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} AuxVars[] AssignedVars[] 1585#L12-2 [58] L12-2-->L15-1: Formula: (< |v_ULTIMATE.start_main_~i~0#1_9| 10) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} AuxVars[] AssignedVars[] 1576#L15-1 [44] L15-1-->L18-1: Formula: (and (= |v_ULTIMATE.start_main_~up~0#1_6| 1) (= |v_ULTIMATE.start_main_~i~0#1_10| (+ |v_ULTIMATE.start_main_~i~0#1_11| 1))) InVars {ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_6|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_11|} OutVars{ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_6|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] 1574#L18-1 [42] L18-1-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~i~0#1_5|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} AuxVars[] AssignedVars[] 1575#L12 [56] L12-->L12-2: Formula: (> |v_ULTIMATE.start_main_~i~0#1_7| 1) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} AuxVars[] AssignedVars[] 1580#L12-2 [37] L12-2-->L15-1: Formula: (and (= |v_ULTIMATE.start_main_~up~0#1_5| 0) (= |v_ULTIMATE.start_main_~i~0#1_8| 10)) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_8|} OutVars{ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_5|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0#1] 1549#L15-1 [59] L15-1-->L18-1: Formula: (and (< |v_ULTIMATE.start_main_~up~0#1_7| 1) (= |v_ULTIMATE.start_main_~i~0#1_12| (+ |v_ULTIMATE.start_main_~i~0#1_13| (- 1)))) InVars {ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_7|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_13|} OutVars{ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_7|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] 1592#L18-1 [42] L18-1-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~i~0#1_5|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} AuxVars[] AssignedVars[] 1581#L12 [2023-02-13 03:40:34,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 03:40:34,572 INFO L85 PathProgramCache]: Analyzing trace with hash -1620572578, now seen corresponding path program 2 times [2023-02-13 03:40:34,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 03:40:34,573 INFO L335 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777962734] [2023-02-13 03:40:34,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 03:40:34,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 03:40:34,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-13 03:40:34,575 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-13 03:40:34,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-13 03:40:34,577 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-13 03:40:34,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 03:40:34,578 INFO L85 PathProgramCache]: Analyzing trace with hash 2099878277, now seen corresponding path program 2 times [2023-02-13 03:40:34,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 03:40:34,578 INFO L335 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145590779] [2023-02-13 03:40:34,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 03:40:34,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 03:40:34,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:34,601 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 12 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-13 03:40:34,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-13 03:40:34,601 INFO L335 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145590779] [2023-02-13 03:40:34,601 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145590779] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-13 03:40:34,601 INFO L335 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [40278801] [2023-02-13 03:40:34,601 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-13 03:40:34,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-13 03:40:34,602 INFO L189 MonitoredProcess]: No working directory specified, using /export/starexec/sandbox/solver/Ultimate/z3 [2023-02-13 03:40:34,602 INFO L229 MonitoredProcess]: Starting monitored process 21 with /export/starexec/sandbox/solver/Ultimate/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-13 03:40:34,610 INFO L327 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2023-02-13 03:40:34,626 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-13 03:40:34,626 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-13 03:40:34,626 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-13 03:40:34,627 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:34,647 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 12 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-13 03:40:34,648 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-13 03:40:34,675 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 12 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-13 03:40:34,676 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [40278801] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-13 03:40:34,676 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-13 03:40:34,676 ERROR L197 FreeRefinementEngine]: {1633#true} [1635#(<= |ULTIMATE.start_main_~i~0#1| 1), 1635#(<= |ULTIMATE.start_main_~i~0#1| 1), 1636#(<= |ULTIMATE.start_main_~i~0#1| 2), 1636#(<= |ULTIMATE.start_main_~i~0#1| 2), 1636#(<= |ULTIMATE.start_main_~i~0#1| 2), 1636#(<= |ULTIMATE.start_main_~i~0#1| 2), 1637#(<= |ULTIMATE.start_main_~i~0#1| 3), 1637#(<= |ULTIMATE.start_main_~i~0#1| 3), 1637#(<= |ULTIMATE.start_main_~i~0#1| 3), 1637#(<= |ULTIMATE.start_main_~i~0#1| 3), 1638#(<= |ULTIMATE.start_main_~i~0#1| 4), 1638#(<= |ULTIMATE.start_main_~i~0#1| 4), 1638#(<= |ULTIMATE.start_main_~i~0#1| 4), 1638#(<= |ULTIMATE.start_main_~i~0#1| 4), 1639#(<= |ULTIMATE.start_main_~i~0#1| 5), 1639#(<= |ULTIMATE.start_main_~i~0#1| 5), 1639#(<= |ULTIMATE.start_main_~i~0#1| 5), 1634#false, 1634#false] {1634#false} [2023-02-13 03:40:34,676 ERROR L197 FreeRefinementEngine]: {1633#true} [1635#(<= |ULTIMATE.start_main_~i~0#1| 1), 1635#(<= |ULTIMATE.start_main_~i~0#1| 1), 1636#(<= |ULTIMATE.start_main_~i~0#1| 2), 1636#(<= |ULTIMATE.start_main_~i~0#1| 2), 1636#(<= |ULTIMATE.start_main_~i~0#1| 2), 1636#(<= |ULTIMATE.start_main_~i~0#1| 2), 1637#(<= |ULTIMATE.start_main_~i~0#1| 3), 1637#(<= |ULTIMATE.start_main_~i~0#1| 3), 1637#(<= |ULTIMATE.start_main_~i~0#1| 3), 1637#(<= |ULTIMATE.start_main_~i~0#1| 3), 1638#(<= |ULTIMATE.start_main_~i~0#1| 4), 1638#(<= |ULTIMATE.start_main_~i~0#1| 4), 1638#(<= |ULTIMATE.start_main_~i~0#1| 4), 1638#(<= |ULTIMATE.start_main_~i~0#1| 4), 1639#(<= |ULTIMATE.start_main_~i~0#1| 5), 1639#(<= |ULTIMATE.start_main_~i~0#1| 5), 1639#(<= |ULTIMATE.start_main_~i~0#1| 5), 1634#false, 1634#false] {1634#false} [2023-02-13 03:40:34,676 ERROR L197 FreeRefinementEngine]: {1633#true} [1639#(<= |ULTIMATE.start_main_~i~0#1| 5), 1639#(<= |ULTIMATE.start_main_~i~0#1| 5), 1742#(< |ULTIMATE.start_main_~i~0#1| 7), 1742#(< |ULTIMATE.start_main_~i~0#1| 7), 1742#(< |ULTIMATE.start_main_~i~0#1| 7), 1742#(< |ULTIMATE.start_main_~i~0#1| 7), 1729#(< |ULTIMATE.start_main_~i~0#1| 8), 1729#(< |ULTIMATE.start_main_~i~0#1| 8), 1729#(< |ULTIMATE.start_main_~i~0#1| 8), 1729#(< |ULTIMATE.start_main_~i~0#1| 8), 1716#(< |ULTIMATE.start_main_~i~0#1| 9), 1716#(< |ULTIMATE.start_main_~i~0#1| 9), 1716#(< |ULTIMATE.start_main_~i~0#1| 9), 1716#(< |ULTIMATE.start_main_~i~0#1| 9), 1706#(not (<= 10 |ULTIMATE.start_main_~i~0#1|)), 1706#(not (<= 10 |ULTIMATE.start_main_~i~0#1|)), 1706#(not (<= 10 |ULTIMATE.start_main_~i~0#1|)), 1634#false, 1634#false] {1634#false} [2023-02-13 03:40:34,676 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2023-02-13 03:40:34,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611967818] [2023-02-13 03:40:34,676 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-13 03:40:34,677 INFO L750 eck$LassoCheckResult]: loop already infeasible [2023-02-13 03:40:34,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-13 03:40:34,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-13 03:40:34,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2023-02-13 03:40:34,677 INFO L87 Difference]: Start difference. First operand 82 states and 109 transitions. cyclomatic complexity: 32 Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 03:40:34,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-13 03:40:34,716 INFO L93 Difference]: Finished difference Result 169 states and 212 transitions. [2023-02-13 03:40:34,716 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 169 states and 212 transitions. [2023-02-13 03:40:34,718 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 85 [2023-02-13 03:40:34,719 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 169 states to 169 states and 212 transitions. [2023-02-13 03:40:34,719 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 80 [2023-02-13 03:40:34,719 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 111 [2023-02-13 03:40:34,719 INFO L73 IsDeterministic]: Start isDeterministic. Operand 169 states and 212 transitions. [2023-02-13 03:40:34,720 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-13 03:40:34,720 INFO L220 hiAutomatonCegarLoop]: Abstraction has 169 states and 212 transitions. [2023-02-13 03:40:34,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states and 212 transitions. [2023-02-13 03:40:34,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 168. [2023-02-13 03:40:34,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 168 states have (on average 1.255952380952381) internal successors, (211), 167 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 03:40:34,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 211 transitions. [2023-02-13 03:40:34,726 INFO L242 hiAutomatonCegarLoop]: Abstraction has 168 states and 211 transitions. [2023-02-13 03:40:34,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-13 03:40:34,728 INFO L426 stractBuchiCegarLoop]: Abstraction has 168 states and 211 transitions. [2023-02-13 03:40:34,728 INFO L333 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2023-02-13 03:40:34,728 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 168 states and 211 transitions. [2023-02-13 03:40:34,729 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 84 [2023-02-13 03:40:34,729 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-13 03:40:34,729 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-13 03:40:34,729 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2023-02-13 03:40:34,730 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [11, 10, 10, 9, 2, 1, 1] [2023-02-13 03:40:34,730 INFO L733 eck$LassoCheckResult]: Stem: 1936#ULTIMATE.startENTRY [61] ULTIMATE.startENTRY-->L18-1: Formula: (= |v_ULTIMATE.start_main_~up~0#1_8| 0) InVars {} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_14|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_4|, ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_8|, ULTIMATE.start_main_#t~nondet0#1=|v_ULTIMATE.start_main_#t~nondet0#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_~up~0#1, ULTIMATE.start_main_#t~nondet0#1] 1937#L18-1 [42] L18-1-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~i~0#1_5|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} AuxVars[] AssignedVars[] 1949#L12 [56] L12-->L12-2: Formula: (> |v_ULTIMATE.start_main_~i~0#1_7| 1) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} AuxVars[] AssignedVars[] 1997#L12-2 [58] L12-2-->L15-1: Formula: (< |v_ULTIMATE.start_main_~i~0#1_9| 10) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} AuxVars[] AssignedVars[] 1931#L15-1 [2023-02-13 03:40:34,730 INFO L735 eck$LassoCheckResult]: Loop: 1931#L15-1 [59] L15-1-->L18-1: Formula: (and (< |v_ULTIMATE.start_main_~up~0#1_7| 1) (= |v_ULTIMATE.start_main_~i~0#1_12| (+ |v_ULTIMATE.start_main_~i~0#1_13| (- 1)))) InVars {ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_7|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_13|} OutVars{ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_7|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] 1932#L18-1 [42] L18-1-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~i~0#1_5|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} AuxVars[] AssignedVars[] 1933#L12 [48] L12-->L12-2: Formula: (and (= |v_ULTIMATE.start_main_~up~0#1_4| 1) (= |v_ULTIMATE.start_main_~i~0#1_6| 1)) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_6|} OutVars{ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_4|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0#1] 2039#L12-2 [58] L12-2-->L15-1: Formula: (< |v_ULTIMATE.start_main_~i~0#1_9| 10) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} AuxVars[] AssignedVars[] 2038#L15-1 [44] L15-1-->L18-1: Formula: (and (= |v_ULTIMATE.start_main_~up~0#1_6| 1) (= |v_ULTIMATE.start_main_~i~0#1_10| (+ |v_ULTIMATE.start_main_~i~0#1_11| 1))) InVars {ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_6|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_11|} OutVars{ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_6|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] 2036#L18-1 [42] L18-1-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~i~0#1_5|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} AuxVars[] AssignedVars[] 2037#L12 [56] L12-->L12-2: Formula: (> |v_ULTIMATE.start_main_~i~0#1_7| 1) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} AuxVars[] AssignedVars[] 2034#L12-2 [58] L12-2-->L15-1: Formula: (< |v_ULTIMATE.start_main_~i~0#1_9| 10) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} AuxVars[] AssignedVars[] 2033#L15-1 [44] L15-1-->L18-1: Formula: (and (= |v_ULTIMATE.start_main_~up~0#1_6| 1) (= |v_ULTIMATE.start_main_~i~0#1_10| (+ |v_ULTIMATE.start_main_~i~0#1_11| 1))) InVars {ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_6|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_11|} OutVars{ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_6|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] 2031#L18-1 [42] L18-1-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~i~0#1_5|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} AuxVars[] AssignedVars[] 2032#L12 [56] L12-->L12-2: Formula: (> |v_ULTIMATE.start_main_~i~0#1_7| 1) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} AuxVars[] AssignedVars[] 2028#L12-2 [58] L12-2-->L15-1: Formula: (< |v_ULTIMATE.start_main_~i~0#1_9| 10) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} AuxVars[] AssignedVars[] 2027#L15-1 [44] L15-1-->L18-1: Formula: (and (= |v_ULTIMATE.start_main_~up~0#1_6| 1) (= |v_ULTIMATE.start_main_~i~0#1_10| (+ |v_ULTIMATE.start_main_~i~0#1_11| 1))) InVars {ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_6|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_11|} OutVars{ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_6|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] 2025#L18-1 [42] L18-1-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~i~0#1_5|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} AuxVars[] AssignedVars[] 2026#L12 [56] L12-->L12-2: Formula: (> |v_ULTIMATE.start_main_~i~0#1_7| 1) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} AuxVars[] AssignedVars[] 2045#L12-2 [58] L12-2-->L15-1: Formula: (< |v_ULTIMATE.start_main_~i~0#1_9| 10) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} AuxVars[] AssignedVars[] 2021#L15-1 [44] L15-1-->L18-1: Formula: (and (= |v_ULTIMATE.start_main_~up~0#1_6| 1) (= |v_ULTIMATE.start_main_~i~0#1_10| (+ |v_ULTIMATE.start_main_~i~0#1_11| 1))) InVars {ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_6|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_11|} OutVars{ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_6|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] 2019#L18-1 [42] L18-1-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~i~0#1_5|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} AuxVars[] AssignedVars[] 2020#L12 [56] L12-->L12-2: Formula: (> |v_ULTIMATE.start_main_~i~0#1_7| 1) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} AuxVars[] AssignedVars[] 2042#L12-2 [58] L12-2-->L15-1: Formula: (< |v_ULTIMATE.start_main_~i~0#1_9| 10) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} AuxVars[] AssignedVars[] 2064#L15-1 [44] L15-1-->L18-1: Formula: (and (= |v_ULTIMATE.start_main_~up~0#1_6| 1) (= |v_ULTIMATE.start_main_~i~0#1_10| (+ |v_ULTIMATE.start_main_~i~0#1_11| 1))) InVars {ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_6|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_11|} OutVars{ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_6|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] 2063#L18-1 [42] L18-1-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~i~0#1_5|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} AuxVars[] AssignedVars[] 2046#L12 [56] L12-->L12-2: Formula: (> |v_ULTIMATE.start_main_~i~0#1_7| 1) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} AuxVars[] AssignedVars[] 2047#L12-2 [58] L12-2-->L15-1: Formula: (< |v_ULTIMATE.start_main_~i~0#1_9| 10) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} AuxVars[] AssignedVars[] 2066#L15-1 [44] L15-1-->L18-1: Formula: (and (= |v_ULTIMATE.start_main_~up~0#1_6| 1) (= |v_ULTIMATE.start_main_~i~0#1_10| (+ |v_ULTIMATE.start_main_~i~0#1_11| 1))) InVars {ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_6|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_11|} OutVars{ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_6|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] 2065#L18-1 [42] L18-1-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~i~0#1_5|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} AuxVars[] AssignedVars[] 2043#L12 [56] L12-->L12-2: Formula: (> |v_ULTIMATE.start_main_~i~0#1_7| 1) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} AuxVars[] AssignedVars[] 2044#L12-2 [58] L12-2-->L15-1: Formula: (< |v_ULTIMATE.start_main_~i~0#1_9| 10) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} AuxVars[] AssignedVars[] 2061#L15-1 [44] L15-1-->L18-1: Formula: (and (= |v_ULTIMATE.start_main_~up~0#1_6| 1) (= |v_ULTIMATE.start_main_~i~0#1_10| (+ |v_ULTIMATE.start_main_~i~0#1_11| 1))) InVars {ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_6|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_11|} OutVars{ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_6|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] 2059#L18-1 [42] L18-1-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~i~0#1_5|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} AuxVars[] AssignedVars[] 2048#L12 [56] L12-->L12-2: Formula: (> |v_ULTIMATE.start_main_~i~0#1_7| 1) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} AuxVars[] AssignedVars[] 2049#L12-2 [58] L12-2-->L15-1: Formula: (< |v_ULTIMATE.start_main_~i~0#1_9| 10) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} AuxVars[] AssignedVars[] 2056#L15-1 [44] L15-1-->L18-1: Formula: (and (= |v_ULTIMATE.start_main_~up~0#1_6| 1) (= |v_ULTIMATE.start_main_~i~0#1_10| (+ |v_ULTIMATE.start_main_~i~0#1_11| 1))) InVars {ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_6|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_11|} OutVars{ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_6|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] 2001#L18-1 [42] L18-1-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~i~0#1_5|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} AuxVars[] AssignedVars[] 2002#L12 [56] L12-->L12-2: Formula: (> |v_ULTIMATE.start_main_~i~0#1_7| 1) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} AuxVars[] AssignedVars[] 2040#L12-2 [58] L12-2-->L15-1: Formula: (< |v_ULTIMATE.start_main_~i~0#1_9| 10) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} AuxVars[] AssignedVars[] 2054#L15-1 [44] L15-1-->L18-1: Formula: (and (= |v_ULTIMATE.start_main_~up~0#1_6| 1) (= |v_ULTIMATE.start_main_~i~0#1_10| (+ |v_ULTIMATE.start_main_~i~0#1_11| 1))) InVars {ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_6|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_11|} OutVars{ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_6|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] 2052#L18-1 [42] L18-1-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~i~0#1_5|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} AuxVars[] AssignedVars[] 2050#L12 [56] L12-->L12-2: Formula: (> |v_ULTIMATE.start_main_~i~0#1_7| 1) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} AuxVars[] AssignedVars[] 2051#L12-2 [37] L12-2-->L15-1: Formula: (and (= |v_ULTIMATE.start_main_~up~0#1_5| 0) (= |v_ULTIMATE.start_main_~i~0#1_8| 10)) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_8|} OutVars{ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_5|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0#1] 1930#L15-1 [59] L15-1-->L18-1: Formula: (and (< |v_ULTIMATE.start_main_~up~0#1_7| 1) (= |v_ULTIMATE.start_main_~i~0#1_12| (+ |v_ULTIMATE.start_main_~i~0#1_13| (- 1)))) InVars {ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_7|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_13|} OutVars{ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_7|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] 1988#L18-1 [42] L18-1-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~i~0#1_5|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} AuxVars[] AssignedVars[] 1994#L12 [56] L12-->L12-2: Formula: (> |v_ULTIMATE.start_main_~i~0#1_7| 1) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} AuxVars[] AssignedVars[] 1929#L12-2 [58] L12-2-->L15-1: Formula: (< |v_ULTIMATE.start_main_~i~0#1_9| 10) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} AuxVars[] AssignedVars[] 1931#L15-1 [2023-02-13 03:40:34,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 03:40:34,731 INFO L85 PathProgramCache]: Analyzing trace with hash 2782928, now seen corresponding path program 1 times [2023-02-13 03:40:34,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 03:40:34,731 INFO L335 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991660174] [2023-02-13 03:40:34,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 03:40:34,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 03:40:34,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-13 03:40:34,734 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-13 03:40:34,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-13 03:40:34,736 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-13 03:40:34,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 03:40:34,736 INFO L85 PathProgramCache]: Analyzing trace with hash -1906196202, now seen corresponding path program 3 times [2023-02-13 03:40:34,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 03:40:34,737 INFO L335 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865352662] [2023-02-13 03:40:34,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 03:40:34,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 03:40:34,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-13 03:40:34,744 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-13 03:40:34,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-13 03:40:34,750 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-13 03:40:34,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 03:40:34,751 INFO L85 PathProgramCache]: Analyzing trace with hash -1724875419, now seen corresponding path program 1 times [2023-02-13 03:40:34,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 03:40:34,751 INFO L335 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583861696] [2023-02-13 03:40:34,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 03:40:34,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 03:40:34,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-13 03:40:34,758 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-13 03:40:34,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-13 03:40:34,764 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-13 03:40:34,871 INFO L210 LassoAnalysis]: Preferences: [2023-02-13 03:40:34,871 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-13 03:40:34,871 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-13 03:40:34,872 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-13 03:40:34,872 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-02-13 03:40:34,872 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2023-02-13 03:40:34,872 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-13 03:40:34,872 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-13 03:40:34,873 INFO L133 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration10_Loop [2023-02-13 03:40:34,873 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-13 03:40:34,873 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-13 03:40:34,875 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-13 03:40:34,880 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-13 03:40:34,885 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-13 03:40:34,889 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-13 03:40:34,932 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-13 03:40:34,933 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-02-13 03:40:34,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2023-02-13 03:40:34,933 INFO L189 MonitoredProcess]: No working directory specified, using /export/starexec/sandbox/solver/Ultimate/z3 [2023-02-13 03:40:34,935 INFO L229 MonitoredProcess]: Starting monitored process 22 with /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-13 03:40:34,937 INFO L327 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2023-02-13 03:40:34,938 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-13 03:40:34,938 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-13 03:40:34,976 INFO L552 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2023-02-13 03:40:34,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2023-02-13 03:40:34,977 INFO L189 MonitoredProcess]: No working directory specified, using /export/starexec/sandbox/solver/Ultimate/z3 [2023-02-13 03:40:34,978 INFO L229 MonitoredProcess]: Starting monitored process 23 with /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-13 03:40:34,979 INFO L327 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2023-02-13 03:40:34,980 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-02-13 03:40:34,980 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-13 03:40:34,994 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-02-13 03:40:35,023 INFO L552 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2023-02-13 03:40:35,025 INFO L210 LassoAnalysis]: Preferences: [2023-02-13 03:40:35,026 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-13 03:40:35,026 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-13 03:40:35,026 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-13 03:40:35,026 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-02-13 03:40:35,027 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-13 03:40:35,027 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-13 03:40:35,027 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-13 03:40:35,027 INFO L133 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration10_Loop [2023-02-13 03:40:35,027 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-13 03:40:35,028 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-13 03:40:35,029 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-13 03:40:35,035 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-13 03:40:35,041 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-13 03:40:35,044 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-13 03:40:35,093 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-13 03:40:35,094 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-02-13 03:40:35,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-13 03:40:35,095 INFO L189 MonitoredProcess]: No working directory specified, using /export/starexec/sandbox/solver/Ultimate/z3 [2023-02-13 03:40:35,096 INFO L229 MonitoredProcess]: Starting monitored process 24 with /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-13 03:40:35,098 INFO L327 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2023-02-13 03:40:35,098 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-13 03:40:35,107 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-13 03:40:35,108 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-13 03:40:35,108 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-13 03:40:35,108 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-13 03:40:35,109 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-13 03:40:35,110 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-13 03:40:35,110 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-13 03:40:35,115 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-02-13 03:40:35,120 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-02-13 03:40:35,120 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2023-02-13 03:40:35,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-13 03:40:35,121 INFO L189 MonitoredProcess]: No working directory specified, using /export/starexec/sandbox/solver/Ultimate/z3 [2023-02-13 03:40:35,122 INFO L229 MonitoredProcess]: Starting monitored process 25 with /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-13 03:40:35,125 INFO L327 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2023-02-13 03:40:35,126 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-02-13 03:40:35,126 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-02-13 03:40:35,126 INFO L513 LassoAnalysis]: Proved termination. [2023-02-13 03:40:35,126 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = -2*ULTIMATE.start_main_~i~0#1 + 11 Supporting invariants [] [2023-02-13 03:40:35,163 INFO L552 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2023-02-13 03:40:35,165 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-02-13 03:40:35,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 03:40:35,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:35,183 INFO L263 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-13 03:40:35,184 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:35,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:35,206 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-13 03:40:35,209 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:35,246 INFO L552 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2023-02-13 03:40:35,300 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 40 proven. 27 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2023-02-13 03:40:35,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:35,337 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-13 03:40:35,340 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:35,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:35,495 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-13 03:40:35,497 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:35,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:35,523 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-13 03:40:35,524 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:35,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:35,550 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-13 03:40:35,552 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:35,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:35,573 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-13 03:40:35,575 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:35,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:35,600 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-13 03:40:35,601 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:35,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:35,639 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-13 03:40:35,641 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:35,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:35,685 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-13 03:40:35,687 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:35,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:35,721 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-13 03:40:35,722 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:35,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:35,748 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-13 03:40:35,749 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:35,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:35,774 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-13 03:40:35,775 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:35,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:35,798 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-13 03:40:35,799 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:35,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:35,825 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-13 03:40:35,826 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:35,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:35,859 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-13 03:40:35,860 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:35,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:35,883 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-13 03:40:35,884 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:35,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:35,905 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-13 03:40:35,906 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:35,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:35,933 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-13 03:40:35,934 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:35,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:35,966 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-13 03:40:35,967 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:36,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:36,007 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-13 03:40:36,008 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:36,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:36,043 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-13 03:40:36,046 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:36,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:36,070 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-13 03:40:36,070 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:36,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:36,101 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-13 03:40:36,103 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:36,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:36,147 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-13 03:40:36,147 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:36,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:36,189 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-13 03:40:36,190 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:36,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:36,216 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-13 03:40:36,217 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:36,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:36,246 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-13 03:40:36,247 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:36,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:36,283 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-13 03:40:36,285 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:36,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:36,323 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-13 03:40:36,325 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:36,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:36,373 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-13 03:40:36,374 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:36,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:36,402 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-13 03:40:36,403 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:36,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:36,445 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-13 03:40:36,446 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:36,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:36,474 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-13 03:40:36,475 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:36,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:36,500 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-13 03:40:36,501 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:36,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:36,533 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-13 03:40:36,535 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:36,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:36,573 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-13 03:40:36,574 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:36,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:36,616 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-13 03:40:36,618 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:36,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:36,709 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-13 03:40:36,710 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:36,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:36,768 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-13 03:40:36,769 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:36,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:36,800 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-13 03:40:36,800 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:36,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:36,883 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-13 03:40:36,884 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:36,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:36,947 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-13 03:40:36,948 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:37,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:37,008 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-13 03:40:37,009 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:37,075 INFO L100 LoopCannibalizer]: 5 predicates before loop cannibalization 11 predicates after loop cannibalization [2023-02-13 03:40:37,076 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 11 loop predicates [2023-02-13 03:40:37,077 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 168 states and 211 transitions. cyclomatic complexity: 48 Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 03:40:37,698 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 168 states and 211 transitions. cyclomatic complexity: 48. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 2107 states and 2592 transitions. Complement of second has 518 states. [2023-02-13 03:40:37,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 22 states 1 stem states 19 non-accepting loop states 1 accepting loop states [2023-02-13 03:40:37,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 03:40:37,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 112 transitions. [2023-02-13 03:40:37,700 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 112 transitions. Stem has 4 letters. Loop has 44 letters. [2023-02-13 03:40:37,702 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-13 03:40:37,702 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 112 transitions. Stem has 48 letters. Loop has 44 letters. [2023-02-13 03:40:37,704 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-13 03:40:37,704 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 112 transitions. Stem has 4 letters. Loop has 88 letters. [2023-02-13 03:40:37,708 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-13 03:40:37,709 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2107 states and 2592 transitions. [2023-02-13 03:40:37,717 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 216 [2023-02-13 03:40:37,719 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2107 states to 457 states and 544 transitions. [2023-02-13 03:40:37,719 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 128 [2023-02-13 03:40:37,719 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 202 [2023-02-13 03:40:37,719 INFO L73 IsDeterministic]: Start isDeterministic. Operand 457 states and 544 transitions. [2023-02-13 03:40:37,719 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-13 03:40:37,719 INFO L220 hiAutomatonCegarLoop]: Abstraction has 457 states and 544 transitions. [2023-02-13 03:40:37,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states and 544 transitions. [2023-02-13 03:40:37,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 98. [2023-02-13 03:40:37,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 98 states have (on average 1.2346938775510203) internal successors, (121), 97 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 03:40:37,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 121 transitions. [2023-02-13 03:40:37,722 INFO L242 hiAutomatonCegarLoop]: Abstraction has 98 states and 121 transitions. [2023-02-13 03:40:37,722 INFO L426 stractBuchiCegarLoop]: Abstraction has 98 states and 121 transitions. [2023-02-13 03:40:37,722 INFO L333 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2023-02-13 03:40:37,722 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 98 states and 121 transitions. [2023-02-13 03:40:37,723 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 84 [2023-02-13 03:40:37,723 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-13 03:40:37,723 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-13 03:40:37,723 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2023-02-13 03:40:37,723 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [13, 12, 12, 9, 4, 1, 1] [2023-02-13 03:40:37,723 INFO L733 eck$LassoCheckResult]: Stem: 10347#ULTIMATE.startENTRY [61] ULTIMATE.startENTRY-->L18-1: Formula: (= |v_ULTIMATE.start_main_~up~0#1_8| 0) InVars {} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_14|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_4|, ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_8|, ULTIMATE.start_main_#t~nondet0#1=|v_ULTIMATE.start_main_#t~nondet0#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_~up~0#1, ULTIMATE.start_main_#t~nondet0#1] 10348#L18-1 [42] L18-1-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~i~0#1_5|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} AuxVars[] AssignedVars[] 10361#L12 [56] L12-->L12-2: Formula: (> |v_ULTIMATE.start_main_~i~0#1_7| 1) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} AuxVars[] AssignedVars[] 10358#L12-2 [58] L12-2-->L15-1: Formula: (< |v_ULTIMATE.start_main_~i~0#1_9| 10) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} AuxVars[] AssignedVars[] 10359#L15-1 [59] L15-1-->L18-1: Formula: (and (< |v_ULTIMATE.start_main_~up~0#1_7| 1) (= |v_ULTIMATE.start_main_~i~0#1_12| (+ |v_ULTIMATE.start_main_~i~0#1_13| (- 1)))) InVars {ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_7|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_13|} OutVars{ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_7|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] 10343#L18-1 [2023-02-13 03:40:37,724 INFO L735 eck$LassoCheckResult]: Loop: 10343#L18-1 [42] L18-1-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~i~0#1_5|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} AuxVars[] AssignedVars[] 10344#L12 [56] L12-->L12-2: Formula: (> |v_ULTIMATE.start_main_~i~0#1_7| 1) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} AuxVars[] AssignedVars[] 10339#L12-2 [58] L12-2-->L15-1: Formula: (< |v_ULTIMATE.start_main_~i~0#1_9| 10) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} AuxVars[] AssignedVars[] 10340#L15-1 [59] L15-1-->L18-1: Formula: (and (< |v_ULTIMATE.start_main_~up~0#1_7| 1) (= |v_ULTIMATE.start_main_~i~0#1_12| (+ |v_ULTIMATE.start_main_~i~0#1_13| (- 1)))) InVars {ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_7|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_13|} OutVars{ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_7|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] 10350#L18-1 [42] L18-1-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~i~0#1_5|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} AuxVars[] AssignedVars[] 10351#L12 [56] L12-->L12-2: Formula: (> |v_ULTIMATE.start_main_~i~0#1_7| 1) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} AuxVars[] AssignedVars[] 10352#L12-2 [58] L12-2-->L15-1: Formula: (< |v_ULTIMATE.start_main_~i~0#1_9| 10) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} AuxVars[] AssignedVars[] 10435#L15-1 [59] L15-1-->L18-1: Formula: (and (< |v_ULTIMATE.start_main_~up~0#1_7| 1) (= |v_ULTIMATE.start_main_~i~0#1_12| (+ |v_ULTIMATE.start_main_~i~0#1_13| (- 1)))) InVars {ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_7|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_13|} OutVars{ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_7|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] 10434#L18-1 [42] L18-1-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~i~0#1_5|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} AuxVars[] AssignedVars[] 10362#L12 [48] L12-->L12-2: Formula: (and (= |v_ULTIMATE.start_main_~up~0#1_4| 1) (= |v_ULTIMATE.start_main_~i~0#1_6| 1)) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_6|} OutVars{ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_4|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0#1] 10413#L12-2 [58] L12-2-->L15-1: Formula: (< |v_ULTIMATE.start_main_~i~0#1_9| 10) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} AuxVars[] AssignedVars[] 10412#L15-1 [44] L15-1-->L18-1: Formula: (and (= |v_ULTIMATE.start_main_~up~0#1_6| 1) (= |v_ULTIMATE.start_main_~i~0#1_10| (+ |v_ULTIMATE.start_main_~i~0#1_11| 1))) InVars {ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_6|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_11|} OutVars{ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_6|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] 10410#L18-1 [42] L18-1-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~i~0#1_5|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} AuxVars[] AssignedVars[] 10406#L12 [56] L12-->L12-2: Formula: (> |v_ULTIMATE.start_main_~i~0#1_7| 1) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} AuxVars[] AssignedVars[] 10405#L12-2 [58] L12-2-->L15-1: Formula: (< |v_ULTIMATE.start_main_~i~0#1_9| 10) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} AuxVars[] AssignedVars[] 10404#L15-1 [44] L15-1-->L18-1: Formula: (and (= |v_ULTIMATE.start_main_~up~0#1_6| 1) (= |v_ULTIMATE.start_main_~i~0#1_10| (+ |v_ULTIMATE.start_main_~i~0#1_11| 1))) InVars {ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_6|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_11|} OutVars{ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_6|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] 10403#L18-1 [42] L18-1-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~i~0#1_5|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} AuxVars[] AssignedVars[] 10402#L12 [56] L12-->L12-2: Formula: (> |v_ULTIMATE.start_main_~i~0#1_7| 1) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} AuxVars[] AssignedVars[] 10401#L12-2 [58] L12-2-->L15-1: Formula: (< |v_ULTIMATE.start_main_~i~0#1_9| 10) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} AuxVars[] AssignedVars[] 10400#L15-1 [44] L15-1-->L18-1: Formula: (and (= |v_ULTIMATE.start_main_~up~0#1_6| 1) (= |v_ULTIMATE.start_main_~i~0#1_10| (+ |v_ULTIMATE.start_main_~i~0#1_11| 1))) InVars {ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_6|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_11|} OutVars{ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_6|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] 10398#L18-1 [42] L18-1-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~i~0#1_5|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} AuxVars[] AssignedVars[] 10396#L12 [56] L12-->L12-2: Formula: (> |v_ULTIMATE.start_main_~i~0#1_7| 1) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} AuxVars[] AssignedVars[] 10395#L12-2 [58] L12-2-->L15-1: Formula: (< |v_ULTIMATE.start_main_~i~0#1_9| 10) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} AuxVars[] AssignedVars[] 10394#L15-1 [44] L15-1-->L18-1: Formula: (and (= |v_ULTIMATE.start_main_~up~0#1_6| 1) (= |v_ULTIMATE.start_main_~i~0#1_10| (+ |v_ULTIMATE.start_main_~i~0#1_11| 1))) InVars {ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_6|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_11|} OutVars{ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_6|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] 10393#L18-1 [42] L18-1-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~i~0#1_5|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} AuxVars[] AssignedVars[] 10392#L12 [56] L12-->L12-2: Formula: (> |v_ULTIMATE.start_main_~i~0#1_7| 1) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} AuxVars[] AssignedVars[] 10391#L12-2 [58] L12-2-->L15-1: Formula: (< |v_ULTIMATE.start_main_~i~0#1_9| 10) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} AuxVars[] AssignedVars[] 10390#L15-1 [44] L15-1-->L18-1: Formula: (and (= |v_ULTIMATE.start_main_~up~0#1_6| 1) (= |v_ULTIMATE.start_main_~i~0#1_10| (+ |v_ULTIMATE.start_main_~i~0#1_11| 1))) InVars {ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_6|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_11|} OutVars{ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_6|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] 10389#L18-1 [42] L18-1-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~i~0#1_5|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} AuxVars[] AssignedVars[] 10388#L12 [56] L12-->L12-2: Formula: (> |v_ULTIMATE.start_main_~i~0#1_7| 1) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} AuxVars[] AssignedVars[] 10387#L12-2 [58] L12-2-->L15-1: Formula: (< |v_ULTIMATE.start_main_~i~0#1_9| 10) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} AuxVars[] AssignedVars[] 10386#L15-1 [44] L15-1-->L18-1: Formula: (and (= |v_ULTIMATE.start_main_~up~0#1_6| 1) (= |v_ULTIMATE.start_main_~i~0#1_10| (+ |v_ULTIMATE.start_main_~i~0#1_11| 1))) InVars {ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_6|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_11|} OutVars{ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_6|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] 10385#L18-1 [42] L18-1-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~i~0#1_5|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} AuxVars[] AssignedVars[] 10384#L12 [56] L12-->L12-2: Formula: (> |v_ULTIMATE.start_main_~i~0#1_7| 1) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} AuxVars[] AssignedVars[] 10383#L12-2 [58] L12-2-->L15-1: Formula: (< |v_ULTIMATE.start_main_~i~0#1_9| 10) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} AuxVars[] AssignedVars[] 10382#L15-1 [44] L15-1-->L18-1: Formula: (and (= |v_ULTIMATE.start_main_~up~0#1_6| 1) (= |v_ULTIMATE.start_main_~i~0#1_10| (+ |v_ULTIMATE.start_main_~i~0#1_11| 1))) InVars {ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_6|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_11|} OutVars{ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_6|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] 10381#L18-1 [42] L18-1-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~i~0#1_5|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} AuxVars[] AssignedVars[] 10380#L12 [56] L12-->L12-2: Formula: (> |v_ULTIMATE.start_main_~i~0#1_7| 1) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} AuxVars[] AssignedVars[] 10379#L12-2 [58] L12-2-->L15-1: Formula: (< |v_ULTIMATE.start_main_~i~0#1_9| 10) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} AuxVars[] AssignedVars[] 10378#L15-1 [44] L15-1-->L18-1: Formula: (and (= |v_ULTIMATE.start_main_~up~0#1_6| 1) (= |v_ULTIMATE.start_main_~i~0#1_10| (+ |v_ULTIMATE.start_main_~i~0#1_11| 1))) InVars {ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_6|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_11|} OutVars{ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_6|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] 10377#L18-1 [42] L18-1-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~i~0#1_5|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} AuxVars[] AssignedVars[] 10376#L12 [56] L12-->L12-2: Formula: (> |v_ULTIMATE.start_main_~i~0#1_7| 1) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} AuxVars[] AssignedVars[] 10375#L12-2 [58] L12-2-->L15-1: Formula: (< |v_ULTIMATE.start_main_~i~0#1_9| 10) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} AuxVars[] AssignedVars[] 10370#L15-1 [44] L15-1-->L18-1: Formula: (and (= |v_ULTIMATE.start_main_~up~0#1_6| 1) (= |v_ULTIMATE.start_main_~i~0#1_10| (+ |v_ULTIMATE.start_main_~i~0#1_11| 1))) InVars {ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_6|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_11|} OutVars{ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_6|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] 10374#L18-1 [42] L18-1-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~i~0#1_5|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} AuxVars[] AssignedVars[] 10373#L12 [56] L12-->L12-2: Formula: (> |v_ULTIMATE.start_main_~i~0#1_7| 1) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} AuxVars[] AssignedVars[] 10368#L12-2 [37] L12-2-->L15-1: Formula: (and (= |v_ULTIMATE.start_main_~up~0#1_5| 0) (= |v_ULTIMATE.start_main_~i~0#1_8| 10)) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_8|} OutVars{ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_5|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0#1] 10366#L15-1 [59] L15-1-->L18-1: Formula: (and (< |v_ULTIMATE.start_main_~up~0#1_7| 1) (= |v_ULTIMATE.start_main_~i~0#1_12| (+ |v_ULTIMATE.start_main_~i~0#1_13| (- 1)))) InVars {ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_7|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_13|} OutVars{ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_7|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] 10399#L18-1 [42] L18-1-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~i~0#1_5|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} AuxVars[] AssignedVars[] 10397#L12 [56] L12-->L12-2: Formula: (> |v_ULTIMATE.start_main_~i~0#1_7| 1) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} AuxVars[] AssignedVars[] 10365#L12-2 [58] L12-2-->L15-1: Formula: (< |v_ULTIMATE.start_main_~i~0#1_9| 10) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} AuxVars[] AssignedVars[] 10367#L15-1 [59] L15-1-->L18-1: Formula: (and (< |v_ULTIMATE.start_main_~up~0#1_7| 1) (= |v_ULTIMATE.start_main_~i~0#1_12| (+ |v_ULTIMATE.start_main_~i~0#1_13| (- 1)))) InVars {ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_7|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_13|} OutVars{ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_7|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] 10343#L18-1 [2023-02-13 03:40:37,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 03:40:37,725 INFO L85 PathProgramCache]: Analyzing trace with hash 86270827, now seen corresponding path program 1 times [2023-02-13 03:40:37,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 03:40:37,725 INFO L335 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699302605] [2023-02-13 03:40:37,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 03:40:37,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 03:40:37,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-13 03:40:37,727 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-13 03:40:37,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-13 03:40:37,729 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-13 03:40:37,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 03:40:37,729 INFO L85 PathProgramCache]: Analyzing trace with hash 902070186, now seen corresponding path program 4 times [2023-02-13 03:40:37,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 03:40:37,729 INFO L335 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623010431] [2023-02-13 03:40:37,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 03:40:37,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 03:40:37,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-13 03:40:37,734 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-13 03:40:37,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-13 03:40:37,739 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-13 03:40:37,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 03:40:37,739 INFO L85 PathProgramCache]: Analyzing trace with hash -572857836, now seen corresponding path program 2 times [2023-02-13 03:40:37,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 03:40:37,739 INFO L335 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973352203] [2023-02-13 03:40:37,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 03:40:37,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 03:40:37,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-13 03:40:37,744 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-13 03:40:37,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-13 03:40:37,749 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-13 03:40:37,843 INFO L210 LassoAnalysis]: Preferences: [2023-02-13 03:40:37,843 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-13 03:40:37,844 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-13 03:40:37,844 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-13 03:40:37,844 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-02-13 03:40:37,844 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2023-02-13 03:40:37,844 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-13 03:40:37,844 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-13 03:40:37,844 INFO L133 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration11_Loop [2023-02-13 03:40:37,844 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-13 03:40:37,844 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-13 03:40:37,845 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-13 03:40:37,848 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-13 03:40:37,850 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-13 03:40:37,851 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-13 03:40:37,873 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-13 03:40:37,874 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-02-13 03:40:37,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2023-02-13 03:40:37,874 INFO L189 MonitoredProcess]: No working directory specified, using /export/starexec/sandbox/solver/Ultimate/z3 [2023-02-13 03:40:37,876 INFO L229 MonitoredProcess]: Starting monitored process 26 with /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-13 03:40:37,877 INFO L327 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2023-02-13 03:40:37,878 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-13 03:40:37,878 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-13 03:40:37,888 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-13 03:40:37,888 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~up~0#1=0} Honda state: {ULTIMATE.start_main_~up~0#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-13 03:40:37,915 INFO L552 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2023-02-13 03:40:37,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2023-02-13 03:40:37,916 INFO L189 MonitoredProcess]: No working directory specified, using /export/starexec/sandbox/solver/Ultimate/z3 [2023-02-13 03:40:37,916 INFO L229 MonitoredProcess]: Starting monitored process 27 with /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-13 03:40:37,918 INFO L327 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2023-02-13 03:40:37,919 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-13 03:40:37,919 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-13 03:40:37,936 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-13 03:40:37,937 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_7=1} Honda state: {v_rep~unnamed0~0~true_7=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-13 03:40:37,963 INFO L552 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2023-02-13 03:40:37,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2023-02-13 03:40:37,964 INFO L189 MonitoredProcess]: No working directory specified, using /export/starexec/sandbox/solver/Ultimate/z3 [2023-02-13 03:40:37,965 INFO L229 MonitoredProcess]: Starting monitored process 28 with /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-13 03:40:37,967 INFO L327 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2023-02-13 03:40:37,967 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-13 03:40:37,967 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-13 03:40:37,985 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-13 03:40:37,985 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_7=0} Honda state: {v_rep~unnamed0~0~false_7=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-13 03:40:38,013 INFO L552 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2023-02-13 03:40:38,013 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2023-02-13 03:40:38,013 INFO L189 MonitoredProcess]: No working directory specified, using /export/starexec/sandbox/solver/Ultimate/z3 [2023-02-13 03:40:38,014 INFO L229 MonitoredProcess]: Starting monitored process 29 with /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-13 03:40:38,016 INFO L327 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2023-02-13 03:40:38,017 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-13 03:40:38,017 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-13 03:40:38,060 INFO L552 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2023-02-13 03:40:38,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2023-02-13 03:40:38,061 INFO L189 MonitoredProcess]: No working directory specified, using /export/starexec/sandbox/solver/Ultimate/z3 [2023-02-13 03:40:38,062 INFO L229 MonitoredProcess]: Starting monitored process 30 with /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-13 03:40:38,064 INFO L327 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2023-02-13 03:40:38,064 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-02-13 03:40:38,065 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-13 03:40:38,071 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-02-13 03:40:38,109 INFO L552 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2023-02-13 03:40:38,109 INFO L210 LassoAnalysis]: Preferences: [2023-02-13 03:40:38,109 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-13 03:40:38,109 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-13 03:40:38,109 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-13 03:40:38,110 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-02-13 03:40:38,110 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-13 03:40:38,110 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-13 03:40:38,110 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-13 03:40:38,110 INFO L133 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration11_Loop [2023-02-13 03:40:38,110 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-13 03:40:38,110 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-13 03:40:38,110 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-13 03:40:38,115 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-13 03:40:38,117 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-13 03:40:38,120 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-13 03:40:38,151 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-13 03:40:38,151 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-02-13 03:40:38,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-13 03:40:38,152 INFO L189 MonitoredProcess]: No working directory specified, using /export/starexec/sandbox/solver/Ultimate/z3 [2023-02-13 03:40:38,153 INFO L229 MonitoredProcess]: Starting monitored process 31 with /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-13 03:40:38,155 INFO L327 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2023-02-13 03:40:38,155 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-13 03:40:38,164 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-13 03:40:38,164 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-13 03:40:38,164 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-13 03:40:38,165 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-13 03:40:38,165 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-13 03:40:38,166 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-13 03:40:38,166 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-13 03:40:38,168 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-13 03:40:38,198 INFO L552 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2023-02-13 03:40:38,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-13 03:40:38,199 INFO L189 MonitoredProcess]: No working directory specified, using /export/starexec/sandbox/solver/Ultimate/z3 [2023-02-13 03:40:38,200 INFO L229 MonitoredProcess]: Starting monitored process 32 with /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-13 03:40:38,202 INFO L327 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2023-02-13 03:40:38,202 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-13 03:40:38,211 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-13 03:40:38,211 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-13 03:40:38,211 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-13 03:40:38,211 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-13 03:40:38,213 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-13 03:40:38,213 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-13 03:40:38,217 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-13 03:40:38,239 INFO L552 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2023-02-13 03:40:38,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-13 03:40:38,240 INFO L189 MonitoredProcess]: No working directory specified, using /export/starexec/sandbox/solver/Ultimate/z3 [2023-02-13 03:40:38,241 INFO L229 MonitoredProcess]: Starting monitored process 33 with /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-13 03:40:38,243 INFO L327 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2023-02-13 03:40:38,244 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-13 03:40:38,253 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-13 03:40:38,253 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-13 03:40:38,254 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-13 03:40:38,254 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-13 03:40:38,258 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-13 03:40:38,259 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-13 03:40:38,264 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-13 03:40:38,302 INFO L552 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2023-02-13 03:40:38,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-13 03:40:38,303 INFO L189 MonitoredProcess]: No working directory specified, using /export/starexec/sandbox/solver/Ultimate/z3 [2023-02-13 03:40:38,304 INFO L229 MonitoredProcess]: Starting monitored process 34 with /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-13 03:40:38,306 INFO L327 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2023-02-13 03:40:38,306 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-13 03:40:38,311 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-13 03:40:38,311 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-13 03:40:38,311 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-13 03:40:38,312 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-13 03:40:38,312 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-13 03:40:38,313 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-13 03:40:38,313 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-13 03:40:38,315 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-02-13 03:40:38,319 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-02-13 03:40:38,320 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2023-02-13 03:40:38,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-13 03:40:38,320 INFO L189 MonitoredProcess]: No working directory specified, using /export/starexec/sandbox/solver/Ultimate/z3 [2023-02-13 03:40:38,321 INFO L229 MonitoredProcess]: Starting monitored process 35 with /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-13 03:40:38,323 INFO L327 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2023-02-13 03:40:38,323 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-02-13 03:40:38,324 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-02-13 03:40:38,324 INFO L513 LassoAnalysis]: Proved termination. [2023-02-13 03:40:38,324 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = -2*ULTIMATE.start_main_~i~0#1 + 11 Supporting invariants [] [2023-02-13 03:40:38,361 INFO L540 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2023-02-13 03:40:38,362 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-02-13 03:40:38,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 03:40:38,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:38,379 INFO L263 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-13 03:40:38,380 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:38,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:38,408 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-13 03:40:38,410 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:38,537 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 58 proven. 101 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2023-02-13 03:40:38,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:38,580 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-13 03:40:38,582 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:38,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:38,710 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-13 03:40:38,711 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:38,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:38,825 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-13 03:40:38,827 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:38,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:38,994 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-13 03:40:38,996 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:39,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:39,136 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-13 03:40:39,138 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:39,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:39,264 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-13 03:40:39,266 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:39,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:39,389 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-13 03:40:39,391 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:39,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:39,594 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-13 03:40:39,596 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:39,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:39,756 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-13 03:40:39,758 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:39,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:39,814 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-13 03:40:39,816 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:39,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:39,866 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-13 03:40:39,868 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:39,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:39,913 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-13 03:40:39,915 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:39,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:39,964 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-13 03:40:39,965 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:40,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:40,017 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-13 03:40:40,019 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:40,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:40,064 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-13 03:40:40,066 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:40,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:40,116 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-13 03:40:40,118 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:40,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:40,169 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-13 03:40:40,170 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:40,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:40,219 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-13 03:40:40,221 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:40,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:40,267 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-13 03:40:40,269 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:40,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:40,321 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-13 03:40:40,322 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:40,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:40,370 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-13 03:40:40,370 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:40,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:40,422 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-13 03:40:40,424 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:40,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:40,478 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-13 03:40:40,480 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:40,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:40,531 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-13 03:40:40,533 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:40,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:40,583 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-13 03:40:40,585 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:40,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:40,635 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-13 03:40:40,637 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:40,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:40,694 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-13 03:40:40,695 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:40,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:40,754 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-13 03:40:40,755 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:40,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:40,806 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-13 03:40:40,807 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:40,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:40,859 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-13 03:40:40,861 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:40,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:40,913 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-13 03:40:40,915 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:40,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:40,964 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-13 03:40:40,966 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:41,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:41,018 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-13 03:40:41,019 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:41,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:41,070 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-13 03:40:41,072 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:41,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:41,129 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-13 03:40:41,131 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:41,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:41,183 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-13 03:40:41,185 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:41,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:41,225 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-13 03:40:41,226 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:41,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:41,273 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-13 03:40:41,275 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:41,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:41,332 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-13 03:40:41,333 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:41,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:41,377 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-13 03:40:41,379 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:41,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:41,426 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-13 03:40:41,428 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:41,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:41,478 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-13 03:40:41,480 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:41,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:41,519 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-13 03:40:41,520 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:41,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:41,737 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-13 03:40:41,739 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:41,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:41,826 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-13 03:40:41,827 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:41,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:41,913 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-13 03:40:41,913 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:42,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:42,027 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-13 03:40:42,028 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:42,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:42,153 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-13 03:40:42,154 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:42,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:42,280 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-13 03:40:42,282 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:42,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:42,385 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-13 03:40:42,386 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:42,484 INFO L100 LoopCannibalizer]: 6 predicates before loop cannibalization 17 predicates after loop cannibalization [2023-02-13 03:40:42,485 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 17 loop predicates [2023-02-13 03:40:42,486 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 98 states and 121 transitions. cyclomatic complexity: 26 Second operand has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 03:40:44,350 INFO L552 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Ended with exit code 0 [2023-02-13 03:40:44,407 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 98 states and 121 transitions. cyclomatic complexity: 26. Second operand has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 17655 states and 20877 transitions. Complement of second has 3753 states. [2023-02-13 03:40:44,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 44 states 1 stem states 41 non-accepting loop states 1 accepting loop states [2023-02-13 03:40:44,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 03:40:44,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 211 transitions. [2023-02-13 03:40:44,409 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 211 transitions. Stem has 5 letters. Loop has 52 letters. [2023-02-13 03:40:44,409 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-13 03:40:44,410 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 211 transitions. Stem has 57 letters. Loop has 52 letters. [2023-02-13 03:40:44,410 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-13 03:40:44,410 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 211 transitions. Stem has 5 letters. Loop has 104 letters. [2023-02-13 03:40:44,411 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-13 03:40:44,412 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17655 states and 20877 transitions. [2023-02-13 03:40:44,469 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 308 [2023-02-13 03:40:44,472 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17655 states to 821 states and 947 transitions. [2023-02-13 03:40:44,472 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 208 [2023-02-13 03:40:44,472 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 356 [2023-02-13 03:40:44,472 INFO L73 IsDeterministic]: Start isDeterministic. Operand 821 states and 947 transitions. [2023-02-13 03:40:44,473 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-13 03:40:44,473 INFO L220 hiAutomatonCegarLoop]: Abstraction has 821 states and 947 transitions. [2023-02-13 03:40:44,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 821 states and 947 transitions. [2023-02-13 03:40:44,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 821 to 159. [2023-02-13 03:40:44,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 159 states have (on average 1.1949685534591195) internal successors, (190), 158 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 03:40:44,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 190 transitions. [2023-02-13 03:40:44,477 INFO L242 hiAutomatonCegarLoop]: Abstraction has 159 states and 190 transitions. [2023-02-13 03:40:44,477 INFO L426 stractBuchiCegarLoop]: Abstraction has 159 states and 190 transitions. [2023-02-13 03:40:44,477 INFO L333 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2023-02-13 03:40:44,477 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 159 states and 190 transitions. [2023-02-13 03:40:44,478 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 91 [2023-02-13 03:40:44,478 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-13 03:40:44,478 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-13 03:40:44,478 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1] [2023-02-13 03:40:44,478 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [16, 15, 15, 9, 7, 1, 1] [2023-02-13 03:40:44,478 INFO L733 eck$LassoCheckResult]: Stem: 39786#ULTIMATE.startENTRY [61] ULTIMATE.startENTRY-->L18-1: Formula: (= |v_ULTIMATE.start_main_~up~0#1_8| 0) InVars {} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_14|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_4|, ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_8|, ULTIMATE.start_main_#t~nondet0#1=|v_ULTIMATE.start_main_#t~nondet0#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_~up~0#1, ULTIMATE.start_main_#t~nondet0#1] 39787#L18-1 [42] L18-1-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~i~0#1_5|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} AuxVars[] AssignedVars[] 39808#L12 [56] L12-->L12-2: Formula: (> |v_ULTIMATE.start_main_~i~0#1_7| 1) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} AuxVars[] AssignedVars[] 39806#L12-2 [58] L12-2-->L15-1: Formula: (< |v_ULTIMATE.start_main_~i~0#1_9| 10) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} AuxVars[] AssignedVars[] 39807#L15-1 [59] L15-1-->L18-1: Formula: (and (< |v_ULTIMATE.start_main_~up~0#1_7| 1) (= |v_ULTIMATE.start_main_~i~0#1_12| (+ |v_ULTIMATE.start_main_~i~0#1_13| (- 1)))) InVars {ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_7|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_13|} OutVars{ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_7|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] 39869#L18-1 [42] L18-1-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~i~0#1_5|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} AuxVars[] AssignedVars[] 39790#L12 [2023-02-13 03:40:44,479 INFO L735 eck$LassoCheckResult]: Loop: 39790#L12 [56] L12-->L12-2: Formula: (> |v_ULTIMATE.start_main_~i~0#1_7| 1) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} AuxVars[] AssignedVars[] 39778#L12-2 [58] L12-2-->L15-1: Formula: (< |v_ULTIMATE.start_main_~i~0#1_9| 10) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} AuxVars[] AssignedVars[] 39779#L15-1 [59] L15-1-->L18-1: Formula: (and (< |v_ULTIMATE.start_main_~up~0#1_7| 1) (= |v_ULTIMATE.start_main_~i~0#1_12| (+ |v_ULTIMATE.start_main_~i~0#1_13| (- 1)))) InVars {ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_7|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_13|} OutVars{ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_7|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] 39862#L18-1 [42] L18-1-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~i~0#1_5|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} AuxVars[] AssignedVars[] 39783#L12 [56] L12-->L12-2: Formula: (> |v_ULTIMATE.start_main_~i~0#1_7| 1) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} AuxVars[] AssignedVars[] 39791#L12-2 [58] L12-2-->L15-1: Formula: (< |v_ULTIMATE.start_main_~i~0#1_9| 10) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} AuxVars[] AssignedVars[] 39789#L15-1 [59] L15-1-->L18-1: Formula: (and (< |v_ULTIMATE.start_main_~up~0#1_7| 1) (= |v_ULTIMATE.start_main_~i~0#1_12| (+ |v_ULTIMATE.start_main_~i~0#1_13| (- 1)))) InVars {ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_7|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_13|} OutVars{ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_7|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] 39784#L18-1 [42] L18-1-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~i~0#1_5|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} AuxVars[] AssignedVars[] 39785#L12 [56] L12-->L12-2: Formula: (> |v_ULTIMATE.start_main_~i~0#1_7| 1) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} AuxVars[] AssignedVars[] 39936#L12-2 [58] L12-2-->L15-1: Formula: (< |v_ULTIMATE.start_main_~i~0#1_9| 10) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} AuxVars[] AssignedVars[] 39930#L15-1 [59] L15-1-->L18-1: Formula: (and (< |v_ULTIMATE.start_main_~up~0#1_7| 1) (= |v_ULTIMATE.start_main_~i~0#1_12| (+ |v_ULTIMATE.start_main_~i~0#1_13| (- 1)))) InVars {ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_7|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_13|} OutVars{ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_7|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] 39928#L18-1 [42] L18-1-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~i~0#1_5|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} AuxVars[] AssignedVars[] 39927#L12 [56] L12-->L12-2: Formula: (> |v_ULTIMATE.start_main_~i~0#1_7| 1) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} AuxVars[] AssignedVars[] 39926#L12-2 [58] L12-2-->L15-1: Formula: (< |v_ULTIMATE.start_main_~i~0#1_9| 10) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} AuxVars[] AssignedVars[] 39875#L15-1 [59] L15-1-->L18-1: Formula: (and (< |v_ULTIMATE.start_main_~up~0#1_7| 1) (= |v_ULTIMATE.start_main_~i~0#1_12| (+ |v_ULTIMATE.start_main_~i~0#1_13| (- 1)))) InVars {ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_7|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_13|} OutVars{ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_7|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] 39874#L18-1 [42] L18-1-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~i~0#1_5|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} AuxVars[] AssignedVars[] 39873#L12 [56] L12-->L12-2: Formula: (> |v_ULTIMATE.start_main_~i~0#1_7| 1) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} AuxVars[] AssignedVars[] 39871#L12-2 [58] L12-2-->L15-1: Formula: (< |v_ULTIMATE.start_main_~i~0#1_9| 10) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} AuxVars[] AssignedVars[] 39867#L15-1 [59] L15-1-->L18-1: Formula: (and (< |v_ULTIMATE.start_main_~up~0#1_7| 1) (= |v_ULTIMATE.start_main_~i~0#1_12| (+ |v_ULTIMATE.start_main_~i~0#1_13| (- 1)))) InVars {ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_7|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_13|} OutVars{ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_7|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] 39868#L18-1 [42] L18-1-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~i~0#1_5|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} AuxVars[] AssignedVars[] 39800#L12 [48] L12-->L12-2: Formula: (and (= |v_ULTIMATE.start_main_~up~0#1_4| 1) (= |v_ULTIMATE.start_main_~i~0#1_6| 1)) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_6|} OutVars{ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_4|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0#1] 39799#L12-2 [58] L12-2-->L15-1: Formula: (< |v_ULTIMATE.start_main_~i~0#1_9| 10) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} AuxVars[] AssignedVars[] 39796#L15-1 [44] L15-1-->L18-1: Formula: (and (= |v_ULTIMATE.start_main_~up~0#1_6| 1) (= |v_ULTIMATE.start_main_~i~0#1_10| (+ |v_ULTIMATE.start_main_~i~0#1_11| 1))) InVars {ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_6|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_11|} OutVars{ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_6|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] 39798#L18-1 [42] L18-1-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~i~0#1_5|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} AuxVars[] AssignedVars[] 39852#L12 [56] L12-->L12-2: Formula: (> |v_ULTIMATE.start_main_~i~0#1_7| 1) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} AuxVars[] AssignedVars[] 39851#L12-2 [58] L12-2-->L15-1: Formula: (< |v_ULTIMATE.start_main_~i~0#1_9| 10) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} AuxVars[] AssignedVars[] 39850#L15-1 [44] L15-1-->L18-1: Formula: (and (= |v_ULTIMATE.start_main_~up~0#1_6| 1) (= |v_ULTIMATE.start_main_~i~0#1_10| (+ |v_ULTIMATE.start_main_~i~0#1_11| 1))) InVars {ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_6|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_11|} OutVars{ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_6|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] 39849#L18-1 [42] L18-1-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~i~0#1_5|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} AuxVars[] AssignedVars[] 39848#L12 [56] L12-->L12-2: Formula: (> |v_ULTIMATE.start_main_~i~0#1_7| 1) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} AuxVars[] AssignedVars[] 39847#L12-2 [58] L12-2-->L15-1: Formula: (< |v_ULTIMATE.start_main_~i~0#1_9| 10) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} AuxVars[] AssignedVars[] 39846#L15-1 [44] L15-1-->L18-1: Formula: (and (= |v_ULTIMATE.start_main_~up~0#1_6| 1) (= |v_ULTIMATE.start_main_~i~0#1_10| (+ |v_ULTIMATE.start_main_~i~0#1_11| 1))) InVars {ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_6|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_11|} OutVars{ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_6|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] 39845#L18-1 [42] L18-1-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~i~0#1_5|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} AuxVars[] AssignedVars[] 39844#L12 [56] L12-->L12-2: Formula: (> |v_ULTIMATE.start_main_~i~0#1_7| 1) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} AuxVars[] AssignedVars[] 39843#L12-2 [58] L12-2-->L15-1: Formula: (< |v_ULTIMATE.start_main_~i~0#1_9| 10) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} AuxVars[] AssignedVars[] 39842#L15-1 [44] L15-1-->L18-1: Formula: (and (= |v_ULTIMATE.start_main_~up~0#1_6| 1) (= |v_ULTIMATE.start_main_~i~0#1_10| (+ |v_ULTIMATE.start_main_~i~0#1_11| 1))) InVars {ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_6|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_11|} OutVars{ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_6|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] 39841#L18-1 [42] L18-1-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~i~0#1_5|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} AuxVars[] AssignedVars[] 39840#L12 [56] L12-->L12-2: Formula: (> |v_ULTIMATE.start_main_~i~0#1_7| 1) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} AuxVars[] AssignedVars[] 39839#L12-2 [58] L12-2-->L15-1: Formula: (< |v_ULTIMATE.start_main_~i~0#1_9| 10) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} AuxVars[] AssignedVars[] 39838#L15-1 [44] L15-1-->L18-1: Formula: (and (= |v_ULTIMATE.start_main_~up~0#1_6| 1) (= |v_ULTIMATE.start_main_~i~0#1_10| (+ |v_ULTIMATE.start_main_~i~0#1_11| 1))) InVars {ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_6|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_11|} OutVars{ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_6|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] 39837#L18-1 [42] L18-1-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~i~0#1_5|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} AuxVars[] AssignedVars[] 39836#L12 [56] L12-->L12-2: Formula: (> |v_ULTIMATE.start_main_~i~0#1_7| 1) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} AuxVars[] AssignedVars[] 39835#L12-2 [58] L12-2-->L15-1: Formula: (< |v_ULTIMATE.start_main_~i~0#1_9| 10) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} AuxVars[] AssignedVars[] 39834#L15-1 [44] L15-1-->L18-1: Formula: (and (= |v_ULTIMATE.start_main_~up~0#1_6| 1) (= |v_ULTIMATE.start_main_~i~0#1_10| (+ |v_ULTIMATE.start_main_~i~0#1_11| 1))) InVars {ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_6|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_11|} OutVars{ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_6|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] 39833#L18-1 [42] L18-1-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~i~0#1_5|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} AuxVars[] AssignedVars[] 39832#L12 [56] L12-->L12-2: Formula: (> |v_ULTIMATE.start_main_~i~0#1_7| 1) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} AuxVars[] AssignedVars[] 39831#L12-2 [58] L12-2-->L15-1: Formula: (< |v_ULTIMATE.start_main_~i~0#1_9| 10) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} AuxVars[] AssignedVars[] 39830#L15-1 [44] L15-1-->L18-1: Formula: (and (= |v_ULTIMATE.start_main_~up~0#1_6| 1) (= |v_ULTIMATE.start_main_~i~0#1_10| (+ |v_ULTIMATE.start_main_~i~0#1_11| 1))) InVars {ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_6|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_11|} OutVars{ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_6|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] 39829#L18-1 [42] L18-1-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~i~0#1_5|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} AuxVars[] AssignedVars[] 39828#L12 [56] L12-->L12-2: Formula: (> |v_ULTIMATE.start_main_~i~0#1_7| 1) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} AuxVars[] AssignedVars[] 39827#L12-2 [58] L12-2-->L15-1: Formula: (< |v_ULTIMATE.start_main_~i~0#1_9| 10) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} AuxVars[] AssignedVars[] 39826#L15-1 [44] L15-1-->L18-1: Formula: (and (= |v_ULTIMATE.start_main_~up~0#1_6| 1) (= |v_ULTIMATE.start_main_~i~0#1_10| (+ |v_ULTIMATE.start_main_~i~0#1_11| 1))) InVars {ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_6|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_11|} OutVars{ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_6|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] 39825#L18-1 [42] L18-1-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~i~0#1_5|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} AuxVars[] AssignedVars[] 39824#L12 [56] L12-->L12-2: Formula: (> |v_ULTIMATE.start_main_~i~0#1_7| 1) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} AuxVars[] AssignedVars[] 39823#L12-2 [58] L12-2-->L15-1: Formula: (< |v_ULTIMATE.start_main_~i~0#1_9| 10) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} AuxVars[] AssignedVars[] 39817#L15-1 [44] L15-1-->L18-1: Formula: (and (= |v_ULTIMATE.start_main_~up~0#1_6| 1) (= |v_ULTIMATE.start_main_~i~0#1_10| (+ |v_ULTIMATE.start_main_~i~0#1_11| 1))) InVars {ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_6|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_11|} OutVars{ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_6|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] 39821#L18-1 [42] L18-1-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~i~0#1_5|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} AuxVars[] AssignedVars[] 39819#L12 [56] L12-->L12-2: Formula: (> |v_ULTIMATE.start_main_~i~0#1_7| 1) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} AuxVars[] AssignedVars[] 39816#L12-2 [37] L12-2-->L15-1: Formula: (and (= |v_ULTIMATE.start_main_~up~0#1_5| 0) (= |v_ULTIMATE.start_main_~i~0#1_8| 10)) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_8|} OutVars{ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_5|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0#1] 39813#L15-1 [59] L15-1-->L18-1: Formula: (and (< |v_ULTIMATE.start_main_~up~0#1_7| 1) (= |v_ULTIMATE.start_main_~i~0#1_12| (+ |v_ULTIMATE.start_main_~i~0#1_13| (- 1)))) InVars {ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_7|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_13|} OutVars{ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_7|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] 39812#L18-1 [42] L18-1-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~i~0#1_5|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} AuxVars[] AssignedVars[] 39804#L12 [56] L12-->L12-2: Formula: (> |v_ULTIMATE.start_main_~i~0#1_7| 1) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} AuxVars[] AssignedVars[] 39818#L12-2 [58] L12-2-->L15-1: Formula: (< |v_ULTIMATE.start_main_~i~0#1_9| 10) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} AuxVars[] AssignedVars[] 39792#L15-1 [59] L15-1-->L18-1: Formula: (and (< |v_ULTIMATE.start_main_~up~0#1_7| 1) (= |v_ULTIMATE.start_main_~i~0#1_12| (+ |v_ULTIMATE.start_main_~i~0#1_13| (- 1)))) InVars {ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_7|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_13|} OutVars{ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_7|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] 39793#L18-1 [42] L18-1-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~i~0#1_5|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} AuxVars[] AssignedVars[] 39790#L12 [2023-02-13 03:40:44,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 03:40:44,479 INFO L85 PathProgramCache]: Analyzing trace with hash -1620571617, now seen corresponding path program 2 times [2023-02-13 03:40:44,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 03:40:44,479 INFO L335 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537865188] [2023-02-13 03:40:44,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 03:40:44,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 03:40:44,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-13 03:40:44,482 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-13 03:40:44,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-13 03:40:44,483 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-13 03:40:44,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 03:40:44,484 INFO L85 PathProgramCache]: Analyzing trace with hash -1339909013, now seen corresponding path program 5 times [2023-02-13 03:40:44,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 03:40:44,484 INFO L335 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522211606] [2023-02-13 03:40:44,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 03:40:44,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 03:40:44,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-13 03:40:44,489 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-13 03:40:44,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-13 03:40:44,493 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-13 03:40:44,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 03:40:44,494 INFO L85 PathProgramCache]: Analyzing trace with hash -1498761591, now seen corresponding path program 3 times [2023-02-13 03:40:44,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 03:40:44,494 INFO L335 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787441799] [2023-02-13 03:40:44,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 03:40:44,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 03:40:44,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-13 03:40:44,499 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-13 03:40:44,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-13 03:40:44,504 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-13 03:40:44,686 INFO L210 LassoAnalysis]: Preferences: [2023-02-13 03:40:44,687 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-13 03:40:44,687 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-13 03:40:44,687 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-13 03:40:44,687 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-02-13 03:40:44,688 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2023-02-13 03:40:44,688 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-13 03:40:44,688 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-13 03:40:44,688 INFO L133 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration12_Loop [2023-02-13 03:40:44,689 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-13 03:40:44,689 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-13 03:40:44,690 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-13 03:40:44,697 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-13 03:40:44,700 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-13 03:40:44,702 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-13 03:40:44,752 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-13 03:40:44,752 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-02-13 03:40:44,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2023-02-13 03:40:44,753 INFO L189 MonitoredProcess]: No working directory specified, using /export/starexec/sandbox/solver/Ultimate/z3 [2023-02-13 03:40:44,754 INFO L229 MonitoredProcess]: Starting monitored process 36 with /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-13 03:40:44,757 INFO L327 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2023-02-13 03:40:44,758 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-13 03:40:44,758 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-13 03:40:44,770 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-13 03:40:44,771 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~up~0#1=0} Honda state: {ULTIMATE.start_main_~up~0#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-13 03:40:44,808 INFO L540 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (36)] Forceful destruction successful, exit code 0 [2023-02-13 03:40:44,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2023-02-13 03:40:44,808 INFO L189 MonitoredProcess]: No working directory specified, using /export/starexec/sandbox/solver/Ultimate/z3 [2023-02-13 03:40:44,809 INFO L229 MonitoredProcess]: Starting monitored process 37 with /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-13 03:40:44,811 INFO L327 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2023-02-13 03:40:44,811 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-13 03:40:44,811 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-13 03:40:44,831 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-13 03:40:44,831 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_9=1} Honda state: {v_rep~unnamed0~0~true_9=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-13 03:40:44,863 INFO L552 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (37)] Ended with exit code 0 [2023-02-13 03:40:44,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2023-02-13 03:40:44,864 INFO L189 MonitoredProcess]: No working directory specified, using /export/starexec/sandbox/solver/Ultimate/z3 [2023-02-13 03:40:44,865 INFO L229 MonitoredProcess]: Starting monitored process 38 with /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-13 03:40:44,867 INFO L327 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2023-02-13 03:40:44,868 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-13 03:40:44,868 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-13 03:40:44,877 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-13 03:40:44,877 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_9=0} Honda state: {v_rep~unnamed0~0~false_9=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-13 03:40:44,912 INFO L552 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (38)] Ended with exit code 0 [2023-02-13 03:40:44,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2023-02-13 03:40:44,913 INFO L189 MonitoredProcess]: No working directory specified, using /export/starexec/sandbox/solver/Ultimate/z3 [2023-02-13 03:40:44,914 INFO L229 MonitoredProcess]: Starting monitored process 39 with /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-13 03:40:44,916 INFO L327 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2023-02-13 03:40:44,916 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-13 03:40:44,917 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-13 03:40:44,956 INFO L552 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (39)] Ended with exit code 0 [2023-02-13 03:40:44,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2023-02-13 03:40:44,957 INFO L189 MonitoredProcess]: No working directory specified, using /export/starexec/sandbox/solver/Ultimate/z3 [2023-02-13 03:40:44,958 INFO L229 MonitoredProcess]: Starting monitored process 40 with /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-13 03:40:44,960 INFO L327 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2023-02-13 03:40:44,960 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-02-13 03:40:44,960 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-13 03:40:44,966 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-02-13 03:40:44,980 INFO L552 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (40)] Ended with exit code 0 [2023-02-13 03:40:44,981 INFO L210 LassoAnalysis]: Preferences: [2023-02-13 03:40:44,981 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-13 03:40:44,981 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-13 03:40:44,981 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-13 03:40:44,982 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-02-13 03:40:44,982 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-13 03:40:44,982 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-13 03:40:44,982 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-13 03:40:44,982 INFO L133 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration12_Loop [2023-02-13 03:40:44,983 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-13 03:40:44,983 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-13 03:40:44,984 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-13 03:40:44,986 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-13 03:40:44,991 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-13 03:40:44,994 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-13 03:40:45,038 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-13 03:40:45,038 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-02-13 03:40:45,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-13 03:40:45,039 INFO L189 MonitoredProcess]: No working directory specified, using /export/starexec/sandbox/solver/Ultimate/z3 [2023-02-13 03:40:45,041 INFO L229 MonitoredProcess]: Starting monitored process 41 with /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-13 03:40:45,045 INFO L327 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2023-02-13 03:40:45,045 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-13 03:40:45,055 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-13 03:40:45,055 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-13 03:40:45,055 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-13 03:40:45,056 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-13 03:40:45,058 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-13 03:40:45,058 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-13 03:40:45,064 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-13 03:40:45,099 INFO L540 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Forceful destruction successful, exit code 0 [2023-02-13 03:40:45,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-13 03:40:45,099 INFO L189 MonitoredProcess]: No working directory specified, using /export/starexec/sandbox/solver/Ultimate/z3 [2023-02-13 03:40:45,101 INFO L229 MonitoredProcess]: Starting monitored process 42 with /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-13 03:40:45,103 INFO L327 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2023-02-13 03:40:45,103 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-13 03:40:45,107 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-13 03:40:45,108 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-13 03:40:45,108 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-13 03:40:45,108 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-13 03:40:45,109 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-13 03:40:45,110 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-13 03:40:45,110 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-13 03:40:45,113 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-13 03:40:45,148 INFO L540 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Forceful destruction successful, exit code 0 [2023-02-13 03:40:45,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-13 03:40:45,148 INFO L189 MonitoredProcess]: No working directory specified, using /export/starexec/sandbox/solver/Ultimate/z3 [2023-02-13 03:40:45,149 INFO L229 MonitoredProcess]: Starting monitored process 43 with /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-13 03:40:45,151 INFO L327 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2023-02-13 03:40:45,151 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-13 03:40:45,156 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-13 03:40:45,156 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-13 03:40:45,156 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-13 03:40:45,156 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-13 03:40:45,159 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-13 03:40:45,160 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-13 03:40:45,166 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-13 03:40:45,200 INFO L552 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Ended with exit code 0 [2023-02-13 03:40:45,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-13 03:40:45,201 INFO L189 MonitoredProcess]: No working directory specified, using /export/starexec/sandbox/solver/Ultimate/z3 [2023-02-13 03:40:45,202 INFO L229 MonitoredProcess]: Starting monitored process 44 with /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-13 03:40:45,203 INFO L327 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2023-02-13 03:40:45,204 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-13 03:40:45,213 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-13 03:40:45,214 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-13 03:40:45,214 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-13 03:40:45,214 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-13 03:40:45,214 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-13 03:40:45,216 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-13 03:40:45,216 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-13 03:40:45,220 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-02-13 03:40:45,222 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-02-13 03:40:45,223 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2023-02-13 03:40:45,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-13 03:40:45,223 INFO L189 MonitoredProcess]: No working directory specified, using /export/starexec/sandbox/solver/Ultimate/z3 [2023-02-13 03:40:45,225 INFO L229 MonitoredProcess]: Starting monitored process 45 with /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-13 03:40:45,226 INFO L327 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2023-02-13 03:40:45,226 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-02-13 03:40:45,227 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-02-13 03:40:45,227 INFO L513 LassoAnalysis]: Proved termination. [2023-02-13 03:40:45,227 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = -1*ULTIMATE.start_main_~i~0#1 + 7 Supporting invariants [] [2023-02-13 03:40:45,266 INFO L552 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Ended with exit code 0 [2023-02-13 03:40:45,267 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-02-13 03:40:45,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 03:40:45,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:45,282 INFO L263 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-13 03:40:45,283 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:45,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:45,307 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 11 conjunts are in the unsatisfiable core [2023-02-13 03:40:45,309 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:45,492 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 86 proven. 241 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2023-02-13 03:40:45,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:45,547 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 11 conjunts are in the unsatisfiable core [2023-02-13 03:40:45,549 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:45,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:45,682 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 11 conjunts are in the unsatisfiable core [2023-02-13 03:40:45,684 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:45,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:45,858 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 11 conjunts are in the unsatisfiable core [2023-02-13 03:40:45,860 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:46,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:46,031 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 11 conjunts are in the unsatisfiable core [2023-02-13 03:40:46,033 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:46,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:46,167 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 11 conjunts are in the unsatisfiable core [2023-02-13 03:40:46,172 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:46,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:46,310 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 11 conjunts are in the unsatisfiable core [2023-02-13 03:40:46,312 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:46,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:46,530 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 11 conjunts are in the unsatisfiable core [2023-02-13 03:40:46,532 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:46,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:46,703 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 11 conjunts are in the unsatisfiable core [2023-02-13 03:40:46,704 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:46,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:46,856 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 11 conjunts are in the unsatisfiable core [2023-02-13 03:40:46,857 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:46,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:46,999 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 11 conjunts are in the unsatisfiable core [2023-02-13 03:40:47,001 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:47,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:47,265 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 11 conjunts are in the unsatisfiable core [2023-02-13 03:40:47,266 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:47,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:47,460 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 11 conjunts are in the unsatisfiable core [2023-02-13 03:40:47,462 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:47,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:47,626 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 11 conjunts are in the unsatisfiable core [2023-02-13 03:40:47,628 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:47,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:47,773 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 11 conjunts are in the unsatisfiable core [2023-02-13 03:40:47,774 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:48,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:48,084 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 11 conjunts are in the unsatisfiable core [2023-02-13 03:40:48,086 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:48,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:48,297 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 11 conjunts are in the unsatisfiable core [2023-02-13 03:40:48,299 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:48,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:48,447 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 11 conjunts are in the unsatisfiable core [2023-02-13 03:40:48,448 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:48,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:48,620 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 11 conjunts are in the unsatisfiable core [2023-02-13 03:40:48,622 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:48,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:48,967 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 11 conjunts are in the unsatisfiable core [2023-02-13 03:40:48,968 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:49,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:49,180 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-13 03:40:49,181 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:49,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:49,245 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-13 03:40:49,247 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:49,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:49,319 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-13 03:40:49,320 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:49,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:49,377 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-13 03:40:49,378 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:49,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:49,441 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-13 03:40:49,442 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:49,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:49,506 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-13 03:40:49,507 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:49,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:49,569 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-13 03:40:49,571 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:49,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:49,633 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-13 03:40:49,634 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:49,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:49,701 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-13 03:40:49,702 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:49,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:49,768 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-13 03:40:49,769 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:49,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:49,831 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-13 03:40:49,832 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:49,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:49,895 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-13 03:40:49,896 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:49,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:49,958 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-13 03:40:49,959 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:50,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:50,023 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-13 03:40:50,024 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:50,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:50,089 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-13 03:40:50,090 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:50,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:50,157 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-13 03:40:50,158 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:50,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:50,220 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-13 03:40:50,221 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:50,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:50,286 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-13 03:40:50,288 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:50,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:50,355 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-13 03:40:50,357 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:50,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:50,416 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-13 03:40:50,417 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:50,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:50,481 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-13 03:40:50,482 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:50,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:50,545 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-13 03:40:50,546 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:50,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:50,614 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-13 03:40:50,615 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:50,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:50,697 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-13 03:40:50,698 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:50,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:50,756 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-13 03:40:50,757 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:50,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:50,821 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-13 03:40:50,822 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:50,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:50,889 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-13 03:40:50,890 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:50,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:50,953 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-13 03:40:50,955 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:51,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:51,022 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-13 03:40:51,023 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:51,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:51,089 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-13 03:40:51,090 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:51,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:51,154 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-13 03:40:51,155 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:51,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:51,222 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-13 03:40:51,224 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:51,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:51,290 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-13 03:40:51,292 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:51,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:51,359 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-13 03:40:51,360 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:51,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:51,424 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-13 03:40:51,426 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:51,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:51,812 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-13 03:40:51,813 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:51,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:51,949 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-13 03:40:51,950 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:52,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-13 03:40:52,079 INFO L139 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2023-02-13 03:40:52,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:52,100 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 11 conjunts are in the unsatisfiable core [2023-02-13 03:40:52,101 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:52,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:52,260 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 11 conjunts are in the unsatisfiable core [2023-02-13 03:40:52,261 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:52,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:52,422 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 11 conjunts are in the unsatisfiable core [2023-02-13 03:40:52,423 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:52,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:52,570 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 11 conjunts are in the unsatisfiable core [2023-02-13 03:40:52,572 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:52,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:52,699 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 11 conjunts are in the unsatisfiable core [2023-02-13 03:40:52,701 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:52,813 INFO L100 LoopCannibalizer]: 10 predicates before loop cannibalization 25 predicates after loop cannibalization [2023-02-13 03:40:52,814 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 25 loop predicates [2023-02-13 03:40:52,815 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 159 states and 190 transitions. cyclomatic complexity: 36 Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 03:40:53,672 INFO L540 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Forceful destruction successful, exit code 0 [2023-02-13 03:41:00,824 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 159 states and 190 transitions. cyclomatic complexity: 36. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 245879 states and 276655 transitions. Complement of second has 58187 states. [2023-02-13 03:41:00,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 84 states 1 stem states 81 non-accepting loop states 1 accepting loop states [2023-02-13 03:41:00,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 03:41:00,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 386 transitions. [2023-02-13 03:41:00,829 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 386 transitions. Stem has 6 letters. Loop has 64 letters. [2023-02-13 03:41:00,837 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-13 03:41:00,837 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 386 transitions. Stem has 70 letters. Loop has 64 letters. [2023-02-13 03:41:00,839 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-13 03:41:00,839 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 386 transitions. Stem has 6 letters. Loop has 128 letters. [2023-02-13 03:41:00,844 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-13 03:41:00,846 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 245879 states and 276655 transitions. [2023-02-13 03:41:01,417 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 652 [2023-02-13 03:41:01,421 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 245879 states to 1475 states and 1633 transitions. [2023-02-13 03:41:01,421 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 187 [2023-02-13 03:41:01,421 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 703 [2023-02-13 03:41:01,422 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1475 states and 1633 transitions. [2023-02-13 03:41:01,422 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-13 03:41:01,422 INFO L220 hiAutomatonCegarLoop]: Abstraction has 1475 states and 1633 transitions. [2023-02-13 03:41:01,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1475 states and 1633 transitions. [2023-02-13 03:41:01,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1475 to 157. [2023-02-13 03:41:01,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 157 states have (on average 1.1210191082802548) internal successors, (176), 156 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 03:41:01,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 176 transitions. [2023-02-13 03:41:01,427 INFO L242 hiAutomatonCegarLoop]: Abstraction has 157 states and 176 transitions. [2023-02-13 03:41:01,427 INFO L426 stractBuchiCegarLoop]: Abstraction has 157 states and 176 transitions. [2023-02-13 03:41:01,427 INFO L333 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2023-02-13 03:41:01,427 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 157 states and 176 transitions. [2023-02-13 03:41:01,428 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 121 [2023-02-13 03:41:01,428 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-13 03:41:01,428 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-13 03:41:01,428 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2023-02-13 03:41:01,428 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [17, 16, 16, 9, 8, 1, 1] [2023-02-13 03:41:01,428 INFO L733 eck$LassoCheckResult]: Stem: 355965#ULTIMATE.startENTRY [61] ULTIMATE.startENTRY-->L18-1: Formula: (= |v_ULTIMATE.start_main_~up~0#1_8| 0) InVars {} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_14|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_4|, ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_8|, ULTIMATE.start_main_#t~nondet0#1=|v_ULTIMATE.start_main_#t~nondet0#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_~up~0#1, ULTIMATE.start_main_#t~nondet0#1] 355966#L18-1 [42] L18-1-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~i~0#1_5|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} AuxVars[] AssignedVars[] 355978#L12 [56] L12-->L12-2: Formula: (> |v_ULTIMATE.start_main_~i~0#1_7| 1) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} AuxVars[] AssignedVars[] 355981#L12-2 [58] L12-2-->L15-1: Formula: (< |v_ULTIMATE.start_main_~i~0#1_9| 10) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} AuxVars[] AssignedVars[] 355970#L15-1 [2023-02-13 03:41:01,429 INFO L735 eck$LassoCheckResult]: Loop: 355970#L15-1 [59] L15-1-->L18-1: Formula: (and (< |v_ULTIMATE.start_main_~up~0#1_7| 1) (= |v_ULTIMATE.start_main_~i~0#1_12| (+ |v_ULTIMATE.start_main_~i~0#1_13| (- 1)))) InVars {ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_7|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_13|} OutVars{ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_7|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] 355971#L18-1 [42] L18-1-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~i~0#1_5|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} AuxVars[] AssignedVars[] 356092#L12 [56] L12-->L12-2: Formula: (> |v_ULTIMATE.start_main_~i~0#1_7| 1) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} AuxVars[] AssignedVars[] 356090#L12-2 [58] L12-2-->L15-1: Formula: (< |v_ULTIMATE.start_main_~i~0#1_9| 10) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} AuxVars[] AssignedVars[] 356088#L15-1 [59] L15-1-->L18-1: Formula: (and (< |v_ULTIMATE.start_main_~up~0#1_7| 1) (= |v_ULTIMATE.start_main_~i~0#1_12| (+ |v_ULTIMATE.start_main_~i~0#1_13| (- 1)))) InVars {ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_7|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_13|} OutVars{ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_7|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] 356086#L18-1 [42] L18-1-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~i~0#1_5|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} AuxVars[] AssignedVars[] 356084#L12 [56] L12-->L12-2: Formula: (> |v_ULTIMATE.start_main_~i~0#1_7| 1) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} AuxVars[] AssignedVars[] 356082#L12-2 [58] L12-2-->L15-1: Formula: (< |v_ULTIMATE.start_main_~i~0#1_9| 10) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} AuxVars[] AssignedVars[] 356077#L15-1 [59] L15-1-->L18-1: Formula: (and (< |v_ULTIMATE.start_main_~up~0#1_7| 1) (= |v_ULTIMATE.start_main_~i~0#1_12| (+ |v_ULTIMATE.start_main_~i~0#1_13| (- 1)))) InVars {ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_7|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_13|} OutVars{ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_7|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] 356074#L18-1 [42] L18-1-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~i~0#1_5|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} AuxVars[] AssignedVars[] 356073#L12 [56] L12-->L12-2: Formula: (> |v_ULTIMATE.start_main_~i~0#1_7| 1) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} AuxVars[] AssignedVars[] 356072#L12-2 [58] L12-2-->L15-1: Formula: (< |v_ULTIMATE.start_main_~i~0#1_9| 10) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} AuxVars[] AssignedVars[] 356071#L15-1 [59] L15-1-->L18-1: Formula: (and (< |v_ULTIMATE.start_main_~up~0#1_7| 1) (= |v_ULTIMATE.start_main_~i~0#1_12| (+ |v_ULTIMATE.start_main_~i~0#1_13| (- 1)))) InVars {ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_7|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_13|} OutVars{ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_7|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] 356070#L18-1 [42] L18-1-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~i~0#1_5|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} AuxVars[] AssignedVars[] 356069#L12 [56] L12-->L12-2: Formula: (> |v_ULTIMATE.start_main_~i~0#1_7| 1) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} AuxVars[] AssignedVars[] 356068#L12-2 [58] L12-2-->L15-1: Formula: (< |v_ULTIMATE.start_main_~i~0#1_9| 10) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} AuxVars[] AssignedVars[] 356067#L15-1 [59] L15-1-->L18-1: Formula: (and (< |v_ULTIMATE.start_main_~up~0#1_7| 1) (= |v_ULTIMATE.start_main_~i~0#1_12| (+ |v_ULTIMATE.start_main_~i~0#1_13| (- 1)))) InVars {ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_7|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_13|} OutVars{ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_7|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] 356066#L18-1 [42] L18-1-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~i~0#1_5|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} AuxVars[] AssignedVars[] 356065#L12 [56] L12-->L12-2: Formula: (> |v_ULTIMATE.start_main_~i~0#1_7| 1) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} AuxVars[] AssignedVars[] 356064#L12-2 [58] L12-2-->L15-1: Formula: (< |v_ULTIMATE.start_main_~i~0#1_9| 10) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} AuxVars[] AssignedVars[] 356034#L15-1 [59] L15-1-->L18-1: Formula: (and (< |v_ULTIMATE.start_main_~up~0#1_7| 1) (= |v_ULTIMATE.start_main_~i~0#1_12| (+ |v_ULTIMATE.start_main_~i~0#1_13| (- 1)))) InVars {ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_7|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_13|} OutVars{ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_7|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] 356033#L18-1 [42] L18-1-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~i~0#1_5|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} AuxVars[] AssignedVars[] 356032#L12 [56] L12-->L12-2: Formula: (> |v_ULTIMATE.start_main_~i~0#1_7| 1) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} AuxVars[] AssignedVars[] 356031#L12-2 [58] L12-2-->L15-1: Formula: (< |v_ULTIMATE.start_main_~i~0#1_9| 10) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} AuxVars[] AssignedVars[] 356030#L15-1 [59] L15-1-->L18-1: Formula: (and (< |v_ULTIMATE.start_main_~up~0#1_7| 1) (= |v_ULTIMATE.start_main_~i~0#1_12| (+ |v_ULTIMATE.start_main_~i~0#1_13| (- 1)))) InVars {ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_7|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_13|} OutVars{ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_7|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] 356029#L18-1 [42] L18-1-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~i~0#1_5|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} AuxVars[] AssignedVars[] 356027#L12 [48] L12-->L12-2: Formula: (and (= |v_ULTIMATE.start_main_~up~0#1_4| 1) (= |v_ULTIMATE.start_main_~i~0#1_6| 1)) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_6|} OutVars{ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_4|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0#1] 356025#L12-2 [58] L12-2-->L15-1: Formula: (< |v_ULTIMATE.start_main_~i~0#1_9| 10) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} AuxVars[] AssignedVars[] 355972#L15-1 [44] L15-1-->L18-1: Formula: (and (= |v_ULTIMATE.start_main_~up~0#1_6| 1) (= |v_ULTIMATE.start_main_~i~0#1_10| (+ |v_ULTIMATE.start_main_~i~0#1_11| 1))) InVars {ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_6|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_11|} OutVars{ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_6|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] 355961#L18-1 [42] L18-1-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~i~0#1_5|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} AuxVars[] AssignedVars[] 355962#L12 [56] L12-->L12-2: Formula: (> |v_ULTIMATE.start_main_~i~0#1_7| 1) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} AuxVars[] AssignedVars[] 355957#L12-2 [58] L12-2-->L15-1: Formula: (< |v_ULTIMATE.start_main_~i~0#1_9| 10) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} AuxVars[] AssignedVars[] 355958#L15-1 [44] L15-1-->L18-1: Formula: (and (= |v_ULTIMATE.start_main_~up~0#1_6| 1) (= |v_ULTIMATE.start_main_~i~0#1_10| (+ |v_ULTIMATE.start_main_~i~0#1_11| 1))) InVars {ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_6|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_11|} OutVars{ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_6|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] 356020#L18-1 [42] L18-1-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~i~0#1_5|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} AuxVars[] AssignedVars[] 356019#L12 [56] L12-->L12-2: Formula: (> |v_ULTIMATE.start_main_~i~0#1_7| 1) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} AuxVars[] AssignedVars[] 356018#L12-2 [58] L12-2-->L15-1: Formula: (< |v_ULTIMATE.start_main_~i~0#1_9| 10) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} AuxVars[] AssignedVars[] 356017#L15-1 [44] L15-1-->L18-1: Formula: (and (= |v_ULTIMATE.start_main_~up~0#1_6| 1) (= |v_ULTIMATE.start_main_~i~0#1_10| (+ |v_ULTIMATE.start_main_~i~0#1_11| 1))) InVars {ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_6|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_11|} OutVars{ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_6|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] 356016#L18-1 [42] L18-1-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~i~0#1_5|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} AuxVars[] AssignedVars[] 356015#L12 [56] L12-->L12-2: Formula: (> |v_ULTIMATE.start_main_~i~0#1_7| 1) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} AuxVars[] AssignedVars[] 356013#L12-2 [58] L12-2-->L15-1: Formula: (< |v_ULTIMATE.start_main_~i~0#1_9| 10) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} AuxVars[] AssignedVars[] 356012#L15-1 [44] L15-1-->L18-1: Formula: (and (= |v_ULTIMATE.start_main_~up~0#1_6| 1) (= |v_ULTIMATE.start_main_~i~0#1_10| (+ |v_ULTIMATE.start_main_~i~0#1_11| 1))) InVars {ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_6|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_11|} OutVars{ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_6|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] 356011#L18-1 [42] L18-1-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~i~0#1_5|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} AuxVars[] AssignedVars[] 356010#L12 [56] L12-->L12-2: Formula: (> |v_ULTIMATE.start_main_~i~0#1_7| 1) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} AuxVars[] AssignedVars[] 356009#L12-2 [58] L12-2-->L15-1: Formula: (< |v_ULTIMATE.start_main_~i~0#1_9| 10) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} AuxVars[] AssignedVars[] 356008#L15-1 [44] L15-1-->L18-1: Formula: (and (= |v_ULTIMATE.start_main_~up~0#1_6| 1) (= |v_ULTIMATE.start_main_~i~0#1_10| (+ |v_ULTIMATE.start_main_~i~0#1_11| 1))) InVars {ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_6|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_11|} OutVars{ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_6|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] 356007#L18-1 [42] L18-1-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~i~0#1_5|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} AuxVars[] AssignedVars[] 356006#L12 [56] L12-->L12-2: Formula: (> |v_ULTIMATE.start_main_~i~0#1_7| 1) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} AuxVars[] AssignedVars[] 356005#L12-2 [58] L12-2-->L15-1: Formula: (< |v_ULTIMATE.start_main_~i~0#1_9| 10) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} AuxVars[] AssignedVars[] 356004#L15-1 [44] L15-1-->L18-1: Formula: (and (= |v_ULTIMATE.start_main_~up~0#1_6| 1) (= |v_ULTIMATE.start_main_~i~0#1_10| (+ |v_ULTIMATE.start_main_~i~0#1_11| 1))) InVars {ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_6|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_11|} OutVars{ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_6|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] 356003#L18-1 [42] L18-1-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~i~0#1_5|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} AuxVars[] AssignedVars[] 356002#L12 [56] L12-->L12-2: Formula: (> |v_ULTIMATE.start_main_~i~0#1_7| 1) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} AuxVars[] AssignedVars[] 356001#L12-2 [58] L12-2-->L15-1: Formula: (< |v_ULTIMATE.start_main_~i~0#1_9| 10) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} AuxVars[] AssignedVars[] 356000#L15-1 [44] L15-1-->L18-1: Formula: (and (= |v_ULTIMATE.start_main_~up~0#1_6| 1) (= |v_ULTIMATE.start_main_~i~0#1_10| (+ |v_ULTIMATE.start_main_~i~0#1_11| 1))) InVars {ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_6|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_11|} OutVars{ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_6|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] 355999#L18-1 [42] L18-1-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~i~0#1_5|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} AuxVars[] AssignedVars[] 355998#L12 [56] L12-->L12-2: Formula: (> |v_ULTIMATE.start_main_~i~0#1_7| 1) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} AuxVars[] AssignedVars[] 355997#L12-2 [58] L12-2-->L15-1: Formula: (< |v_ULTIMATE.start_main_~i~0#1_9| 10) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} AuxVars[] AssignedVars[] 355996#L15-1 [44] L15-1-->L18-1: Formula: (and (= |v_ULTIMATE.start_main_~up~0#1_6| 1) (= |v_ULTIMATE.start_main_~i~0#1_10| (+ |v_ULTIMATE.start_main_~i~0#1_11| 1))) InVars {ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_6|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_11|} OutVars{ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_6|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] 355995#L18-1 [42] L18-1-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~i~0#1_5|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} AuxVars[] AssignedVars[] 355994#L12 [56] L12-->L12-2: Formula: (> |v_ULTIMATE.start_main_~i~0#1_7| 1) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} AuxVars[] AssignedVars[] 355993#L12-2 [58] L12-2-->L15-1: Formula: (< |v_ULTIMATE.start_main_~i~0#1_9| 10) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} AuxVars[] AssignedVars[] 355991#L15-1 [44] L15-1-->L18-1: Formula: (and (= |v_ULTIMATE.start_main_~up~0#1_6| 1) (= |v_ULTIMATE.start_main_~i~0#1_10| (+ |v_ULTIMATE.start_main_~i~0#1_11| 1))) InVars {ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_6|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_11|} OutVars{ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_6|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] 355990#L18-1 [42] L18-1-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~i~0#1_5|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} AuxVars[] AssignedVars[] 355987#L12 [56] L12-->L12-2: Formula: (> |v_ULTIMATE.start_main_~i~0#1_7| 1) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} AuxVars[] AssignedVars[] 355988#L12-2 [37] L12-2-->L15-1: Formula: (and (= |v_ULTIMATE.start_main_~up~0#1_5| 0) (= |v_ULTIMATE.start_main_~i~0#1_8| 10)) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_8|} OutVars{ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_5|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0#1] 355983#L15-1 [59] L15-1-->L18-1: Formula: (and (< |v_ULTIMATE.start_main_~up~0#1_7| 1) (= |v_ULTIMATE.start_main_~i~0#1_12| (+ |v_ULTIMATE.start_main_~i~0#1_13| (- 1)))) InVars {ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_7|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_13|} OutVars{ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_7|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] 355982#L18-1 [42] L18-1-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~i~0#1_5|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} AuxVars[] AssignedVars[] 355980#L12 [56] L12-->L12-2: Formula: (> |v_ULTIMATE.start_main_~i~0#1_7| 1) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} AuxVars[] AssignedVars[] 355981#L12-2 [58] L12-2-->L15-1: Formula: (< |v_ULTIMATE.start_main_~i~0#1_9| 10) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} AuxVars[] AssignedVars[] 355970#L15-1 [2023-02-13 03:41:01,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 03:41:01,429 INFO L85 PathProgramCache]: Analyzing trace with hash 2782928, now seen corresponding path program 2 times [2023-02-13 03:41:01,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 03:41:01,429 INFO L335 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605891684] [2023-02-13 03:41:01,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 03:41:01,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 03:41:01,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-13 03:41:01,431 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-13 03:41:01,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-13 03:41:01,432 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-13 03:41:01,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 03:41:01,432 INFO L85 PathProgramCache]: Analyzing trace with hash 1900363004, now seen corresponding path program 6 times [2023-02-13 03:41:01,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 03:41:01,433 INFO L335 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676209172] [2023-02-13 03:41:01,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 03:41:01,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 03:41:01,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-13 03:41:01,437 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-13 03:41:01,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-13 03:41:01,442 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-13 03:41:01,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 03:41:01,442 INFO L85 PathProgramCache]: Analyzing trace with hash -1249395637, now seen corresponding path program 4 times [2023-02-13 03:41:01,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 03:41:01,442 INFO L335 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105544314] [2023-02-13 03:41:01,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 03:41:01,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 03:41:01,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-13 03:41:01,447 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-13 03:41:01,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-13 03:41:01,452 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-13 03:41:01,763 INFO L210 LassoAnalysis]: Preferences: [2023-02-13 03:41:01,763 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-13 03:41:01,763 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-13 03:41:01,763 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-13 03:41:01,763 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-02-13 03:41:01,763 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2023-02-13 03:41:01,763 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-13 03:41:01,763 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-13 03:41:01,763 INFO L133 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration13_Loop [2023-02-13 03:41:01,763 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-13 03:41:01,763 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-13 03:41:01,764 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-13 03:41:01,765 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-13 03:41:01,766 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-13 03:41:01,767 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-13 03:41:01,782 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-13 03:41:01,782 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-02-13 03:41:01,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2023-02-13 03:41:01,783 INFO L189 MonitoredProcess]: No working directory specified, using /export/starexec/sandbox/solver/Ultimate/z3 [2023-02-13 03:41:01,783 INFO L229 MonitoredProcess]: Starting monitored process 46 with /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-13 03:41:01,784 INFO L327 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2023-02-13 03:41:01,785 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-13 03:41:01,785 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-13 03:41:01,795 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-13 03:41:01,795 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_11=1} Honda state: {v_rep~unnamed0~0~true_11=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-13 03:41:01,824 INFO L552 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (46)] Ended with exit code 0 [2023-02-13 03:41:01,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2023-02-13 03:41:01,825 INFO L189 MonitoredProcess]: No working directory specified, using /export/starexec/sandbox/solver/Ultimate/z3 [2023-02-13 03:41:01,826 INFO L229 MonitoredProcess]: Starting monitored process 47 with /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-13 03:41:01,828 INFO L327 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2023-02-13 03:41:01,828 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-13 03:41:01,828 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-13 03:41:01,837 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-13 03:41:01,837 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_11=0} Honda state: {v_rep~unnamed0~0~false_11=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-13 03:41:01,874 INFO L552 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (47)] Ended with exit code 0 [2023-02-13 03:41:01,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2023-02-13 03:41:01,875 INFO L189 MonitoredProcess]: No working directory specified, using /export/starexec/sandbox/solver/Ultimate/z3 [2023-02-13 03:41:01,876 INFO L229 MonitoredProcess]: Starting monitored process 48 with /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-13 03:41:01,877 INFO L327 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2023-02-13 03:41:01,877 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-13 03:41:01,877 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-13 03:41:01,901 INFO L552 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (48)] Ended with exit code 0 [2023-02-13 03:41:01,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2023-02-13 03:41:01,902 INFO L189 MonitoredProcess]: No working directory specified, using /export/starexec/sandbox/solver/Ultimate/z3 [2023-02-13 03:41:01,903 INFO L229 MonitoredProcess]: Starting monitored process 49 with /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-13 03:41:01,905 INFO L327 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2023-02-13 03:41:01,905 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-02-13 03:41:01,906 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-13 03:41:01,916 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-02-13 03:41:01,942 INFO L552 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (49)] Ended with exit code 0 [2023-02-13 03:41:01,942 INFO L210 LassoAnalysis]: Preferences: [2023-02-13 03:41:01,943 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-13 03:41:01,943 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-13 03:41:01,943 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-13 03:41:01,943 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-02-13 03:41:01,944 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-13 03:41:01,944 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-13 03:41:01,944 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-13 03:41:01,944 INFO L133 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration13_Loop [2023-02-13 03:41:01,944 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-13 03:41:01,945 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-13 03:41:01,946 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-13 03:41:01,949 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-13 03:41:01,951 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-13 03:41:01,956 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-13 03:41:01,992 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-13 03:41:01,992 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-02-13 03:41:01,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-13 03:41:01,993 INFO L189 MonitoredProcess]: No working directory specified, using /export/starexec/sandbox/solver/Ultimate/z3 [2023-02-13 03:41:01,994 INFO L229 MonitoredProcess]: Starting monitored process 50 with /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-13 03:41:01,995 INFO L327 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2023-02-13 03:41:01,996 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-13 03:41:02,006 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-13 03:41:02,006 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-13 03:41:02,006 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-13 03:41:02,007 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-13 03:41:02,009 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-13 03:41:02,009 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-13 03:41:02,015 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-13 03:41:02,049 INFO L540 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Forceful destruction successful, exit code 0 [2023-02-13 03:41:02,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-13 03:41:02,050 INFO L189 MonitoredProcess]: No working directory specified, using /export/starexec/sandbox/solver/Ultimate/z3 [2023-02-13 03:41:02,051 INFO L229 MonitoredProcess]: Starting monitored process 51 with /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-13 03:41:02,053 INFO L327 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2023-02-13 03:41:02,053 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-13 03:41:02,063 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-13 03:41:02,063 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-13 03:41:02,063 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-13 03:41:02,064 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-13 03:41:02,066 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-13 03:41:02,066 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-13 03:41:02,072 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-13 03:41:02,109 INFO L540 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Forceful destruction successful, exit code 0 [2023-02-13 03:41:02,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-13 03:41:02,110 INFO L189 MonitoredProcess]: No working directory specified, using /export/starexec/sandbox/solver/Ultimate/z3 [2023-02-13 03:41:02,111 INFO L229 MonitoredProcess]: Starting monitored process 52 with /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-13 03:41:02,113 INFO L327 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2023-02-13 03:41:02,113 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-13 03:41:02,117 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-13 03:41:02,118 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-13 03:41:02,118 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-13 03:41:02,118 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-13 03:41:02,119 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-13 03:41:02,120 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-13 03:41:02,120 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-13 03:41:02,122 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-02-13 03:41:02,125 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-02-13 03:41:02,125 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2023-02-13 03:41:02,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-13 03:41:02,125 INFO L189 MonitoredProcess]: No working directory specified, using /export/starexec/sandbox/solver/Ultimate/z3 [2023-02-13 03:41:02,126 INFO L229 MonitoredProcess]: Starting monitored process 53 with /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-13 03:41:02,128 INFO L327 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2023-02-13 03:41:02,130 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-02-13 03:41:02,130 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-02-13 03:41:02,131 INFO L513 LassoAnalysis]: Proved termination. [2023-02-13 03:41:02,131 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = -2*ULTIMATE.start_main_~i~0#1 + 17 Supporting invariants [] [2023-02-13 03:41:02,165 INFO L540 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Forceful destruction successful, exit code 0 [2023-02-13 03:41:02,166 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-02-13 03:41:02,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 03:41:02,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:41:02,182 INFO L263 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-13 03:41:02,183 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:41:02,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:41:02,204 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 12 conjunts are in the unsatisfiable core [2023-02-13 03:41:02,205 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:41:02,399 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 64 proven. 327 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2023-02-13 03:41:02,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:41:02,447 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 12 conjunts are in the unsatisfiable core [2023-02-13 03:41:02,448 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:41:02,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:41:02,641 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 12 conjunts are in the unsatisfiable core [2023-02-13 03:41:02,642 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:41:02,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:41:02,774 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 12 conjunts are in the unsatisfiable core [2023-02-13 03:41:02,775 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:41:02,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:41:02,913 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 12 conjunts are in the unsatisfiable core [2023-02-13 03:41:02,914 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:41:03,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:41:03,115 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 12 conjunts are in the unsatisfiable core [2023-02-13 03:41:03,117 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:41:03,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:41:03,292 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 12 conjunts are in the unsatisfiable core [2023-02-13 03:41:03,294 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:41:03,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:41:03,439 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 12 conjunts are in the unsatisfiable core [2023-02-13 03:41:03,441 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:41:03,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:41:03,595 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 12 conjunts are in the unsatisfiable core [2023-02-13 03:41:03,597 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:41:03,811 INFO L540 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Forceful destruction successful, exit code 0 [2023-02-13 03:41:03,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:41:03,827 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 12 conjunts are in the unsatisfiable core [2023-02-13 03:41:03,828 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:41:03,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:41:03,988 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 12 conjunts are in the unsatisfiable core [2023-02-13 03:41:03,989 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:41:04,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:41:04,134 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 12 conjunts are in the unsatisfiable core [2023-02-13 03:41:04,135 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:41:04,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:41:04,281 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 12 conjunts are in the unsatisfiable core [2023-02-13 03:41:04,282 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:41:04,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:41:04,541 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 12 conjunts are in the unsatisfiable core [2023-02-13 03:41:04,543 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:41:04,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:41:04,735 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 12 conjunts are in the unsatisfiable core [2023-02-13 03:41:04,736 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:41:04,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:41:04,889 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 12 conjunts are in the unsatisfiable core [2023-02-13 03:41:04,891 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:41:05,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:41:05,050 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 12 conjunts are in the unsatisfiable core [2023-02-13 03:41:05,051 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:41:05,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:41:05,361 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 12 conjunts are in the unsatisfiable core [2023-02-13 03:41:05,363 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:41:05,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:41:05,569 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 12 conjunts are in the unsatisfiable core [2023-02-13 03:41:05,570 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:41:05,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:41:05,735 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 12 conjunts are in the unsatisfiable core [2023-02-13 03:41:05,737 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:41:05,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:41:05,897 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 12 conjunts are in the unsatisfiable core [2023-02-13 03:41:05,898 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:41:06,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:41:06,255 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 12 conjunts are in the unsatisfiable core [2023-02-13 03:41:06,256 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:41:06,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:41:06,481 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 12 conjunts are in the unsatisfiable core [2023-02-13 03:41:06,482 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:41:06,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:41:06,664 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 12 conjunts are in the unsatisfiable core [2023-02-13 03:41:06,666 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:41:06,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:41:06,844 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 12 conjunts are in the unsatisfiable core [2023-02-13 03:41:06,846 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:41:07,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:41:07,281 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 12 conjunts are in the unsatisfiable core [2023-02-13 03:41:07,283 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:41:07,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:41:07,499 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-13 03:41:07,500 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:41:07,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:41:07,571 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-13 03:41:07,572 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:41:07,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:41:07,638 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-13 03:41:07,640 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:41:07,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:41:07,705 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-13 03:41:07,707 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:41:07,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:41:07,780 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-13 03:41:07,781 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:41:07,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:41:07,843 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-13 03:41:07,845 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:41:07,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:41:07,916 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-13 03:41:07,918 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:41:07,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:41:07,984 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-13 03:41:07,985 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:41:08,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:41:08,051 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-13 03:41:08,052 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:41:08,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:41:08,119 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-13 03:41:08,120 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:41:08,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:41:08,188 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-13 03:41:08,190 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:41:08,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:41:08,259 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-13 03:41:08,260 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:41:08,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:41:08,323 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-13 03:41:08,325 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:41:08,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:41:08,387 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-13 03:41:08,389 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:41:08,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:41:08,454 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-13 03:41:08,455 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:41:08,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:41:08,527 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-13 03:41:08,528 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:41:08,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:41:08,597 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-13 03:41:08,598 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:41:08,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:41:08,665 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-13 03:41:08,667 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:41:08,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:41:08,735 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-13 03:41:08,736 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:41:08,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:41:08,804 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-13 03:41:08,805 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:41:08,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:41:08,873 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-13 03:41:08,875 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:41:08,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:41:08,945 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-13 03:41:08,946 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:41:09,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:41:09,014 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-13 03:41:09,015 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:41:09,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:41:09,082 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-13 03:41:09,084 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:41:09,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:41:09,154 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-13 03:41:09,155 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:41:09,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:41:09,223 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-13 03:41:09,225 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:41:09,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:41:09,295 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-13 03:41:09,296 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:41:09,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:41:09,366 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-13 03:41:09,367 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:41:09,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:41:09,440 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-13 03:41:09,442 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:41:09,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:41:09,512 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-13 03:41:09,513 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:41:09,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:41:09,589 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-13 03:41:09,590 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:41:09,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:41:09,662 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-13 03:41:09,663 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:41:09,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:41:09,734 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-13 03:41:09,735 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:41:09,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:41:09,813 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-13 03:41:09,814 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:41:09,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:41:09,887 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-13 03:41:09,888 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:41:10,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:41:10,305 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-13 03:41:10,306 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:41:10,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:41:10,458 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-13 03:41:10,459 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:41:10,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-13 03:41:10,621 INFO L139 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2023-02-13 03:41:10,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:41:10,643 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 12 conjunts are in the unsatisfiable core [2023-02-13 03:41:10,645 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:41:10,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:41:10,768 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 12 conjunts are in the unsatisfiable core [2023-02-13 03:41:10,769 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:41:10,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:41:10,899 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 12 conjunts are in the unsatisfiable core [2023-02-13 03:41:10,903 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:41:11,017 INFO L100 LoopCannibalizer]: 11 predicates before loop cannibalization 28 predicates after loop cannibalization [2023-02-13 03:41:11,018 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 28 loop predicates [2023-02-13 03:41:11,018 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 157 states and 176 transitions. cyclomatic complexity: 21 Second operand has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 12 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 03:41:30,216 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 157 states and 176 transitions. cyclomatic complexity: 21. Second operand has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 12 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 493601 states and 519875 transitions. Complement of second has 199402 states. [2023-02-13 03:41:30,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 138 states 1 stem states 128 non-accepting loop states 8 accepting loop states [2023-02-13 03:41:30,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 12 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 03:41:30,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 550 transitions. [2023-02-13 03:41:30,218 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 138 states and 550 transitions. Stem has 4 letters. Loop has 68 letters. [2023-02-13 03:41:30,220 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-13 03:41:30,220 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 138 states and 550 transitions. Stem has 72 letters. Loop has 68 letters. [2023-02-13 03:41:30,222 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-13 03:41:30,222 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 138 states and 550 transitions. Stem has 4 letters. Loop has 136 letters. [2023-02-13 03:41:30,226 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-13 03:41:30,228 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 493601 states and 519875 transitions. [2023-02-13 03:41:31,129 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 569 [2023-02-13 03:41:31,132 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 493601 states to 1333 states and 1433 transitions. [2023-02-13 03:41:31,132 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 142 [2023-02-13 03:41:31,133 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 730 [2023-02-13 03:41:31,133 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1333 states and 1433 transitions. [2023-02-13 03:41:31,133 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-13 03:41:31,133 INFO L220 hiAutomatonCegarLoop]: Abstraction has 1333 states and 1433 transitions. [2023-02-13 03:41:31,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1333 states and 1433 transitions. [2023-02-13 03:41:31,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1333 to 166. [2023-02-13 03:41:31,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 166 states have (on average 1.1204819277108433) internal successors, (186), 165 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 03:41:31,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 186 transitions. [2023-02-13 03:41:31,138 INFO L242 hiAutomatonCegarLoop]: Abstraction has 166 states and 186 transitions. [2023-02-13 03:41:31,138 INFO L426 stractBuchiCegarLoop]: Abstraction has 166 states and 186 transitions. [2023-02-13 03:41:31,138 INFO L333 stractBuchiCegarLoop]: ======== Iteration 14 ============ [2023-02-13 03:41:31,138 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 166 states and 186 transitions. [2023-02-13 03:41:31,138 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 116 [2023-02-13 03:41:31,138 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-13 03:41:31,138 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-13 03:41:31,139 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2023-02-13 03:41:31,139 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [18, 17, 17, 9, 9, 1, 1] [2023-02-13 03:41:31,139 INFO L733 eck$LassoCheckResult]: Stem: 1062746#ULTIMATE.startENTRY [61] ULTIMATE.startENTRY-->L18-1: Formula: (= |v_ULTIMATE.start_main_~up~0#1_8| 0) InVars {} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_14|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_4|, ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_8|, ULTIMATE.start_main_#t~nondet0#1=|v_ULTIMATE.start_main_#t~nondet0#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_~up~0#1, ULTIMATE.start_main_#t~nondet0#1] 1062747#L18-1 [42] L18-1-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~i~0#1_5|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} AuxVars[] AssignedVars[] 1062753#L12 [56] L12-->L12-2: Formula: (> |v_ULTIMATE.start_main_~i~0#1_7| 1) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} AuxVars[] AssignedVars[] 1062764#L12-2 [58] L12-2-->L15-1: Formula: (< |v_ULTIMATE.start_main_~i~0#1_9| 10) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} AuxVars[] AssignedVars[] 1062829#L15-1 [59] L15-1-->L18-1: Formula: (and (< |v_ULTIMATE.start_main_~up~0#1_7| 1) (= |v_ULTIMATE.start_main_~i~0#1_12| (+ |v_ULTIMATE.start_main_~i~0#1_13| (- 1)))) InVars {ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_7|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_13|} OutVars{ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_7|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] 1062830#L18-1 [2023-02-13 03:41:31,139 INFO L735 eck$LassoCheckResult]: Loop: 1062830#L18-1 [42] L18-1-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~i~0#1_5|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} AuxVars[] AssignedVars[] 1062844#L12 [56] L12-->L12-2: Formula: (> |v_ULTIMATE.start_main_~i~0#1_7| 1) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} AuxVars[] AssignedVars[] 1062843#L12-2 [58] L12-2-->L15-1: Formula: (< |v_ULTIMATE.start_main_~i~0#1_9| 10) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} AuxVars[] AssignedVars[] 1062842#L15-1 [59] L15-1-->L18-1: Formula: (and (< |v_ULTIMATE.start_main_~up~0#1_7| 1) (= |v_ULTIMATE.start_main_~i~0#1_12| (+ |v_ULTIMATE.start_main_~i~0#1_13| (- 1)))) InVars {ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_7|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_13|} OutVars{ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_7|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] 1062841#L18-1 [42] L18-1-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~i~0#1_5|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} AuxVars[] AssignedVars[] 1062840#L12 [56] L12-->L12-2: Formula: (> |v_ULTIMATE.start_main_~i~0#1_7| 1) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} AuxVars[] AssignedVars[] 1062839#L12-2 [58] L12-2-->L15-1: Formula: (< |v_ULTIMATE.start_main_~i~0#1_9| 10) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} AuxVars[] AssignedVars[] 1062838#L15-1 [59] L15-1-->L18-1: Formula: (and (< |v_ULTIMATE.start_main_~up~0#1_7| 1) (= |v_ULTIMATE.start_main_~i~0#1_12| (+ |v_ULTIMATE.start_main_~i~0#1_13| (- 1)))) InVars {ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_7|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_13|} OutVars{ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_7|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] 1062837#L18-1 [42] L18-1-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~i~0#1_5|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} AuxVars[] AssignedVars[] 1062836#L12 [56] L12-->L12-2: Formula: (> |v_ULTIMATE.start_main_~i~0#1_7| 1) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} AuxVars[] AssignedVars[] 1062835#L12-2 [58] L12-2-->L15-1: Formula: (< |v_ULTIMATE.start_main_~i~0#1_9| 10) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} AuxVars[] AssignedVars[] 1062834#L15-1 [59] L15-1-->L18-1: Formula: (and (< |v_ULTIMATE.start_main_~up~0#1_7| 1) (= |v_ULTIMATE.start_main_~i~0#1_12| (+ |v_ULTIMATE.start_main_~i~0#1_13| (- 1)))) InVars {ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_7|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_13|} OutVars{ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_7|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] 1062818#L18-1 [42] L18-1-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~i~0#1_5|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} AuxVars[] AssignedVars[] 1062817#L12 [56] L12-->L12-2: Formula: (> |v_ULTIMATE.start_main_~i~0#1_7| 1) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} AuxVars[] AssignedVars[] 1062816#L12-2 [58] L12-2-->L15-1: Formula: (< |v_ULTIMATE.start_main_~i~0#1_9| 10) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} AuxVars[] AssignedVars[] 1062815#L15-1 [59] L15-1-->L18-1: Formula: (and (< |v_ULTIMATE.start_main_~up~0#1_7| 1) (= |v_ULTIMATE.start_main_~i~0#1_12| (+ |v_ULTIMATE.start_main_~i~0#1_13| (- 1)))) InVars {ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_7|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_13|} OutVars{ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_7|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] 1062814#L18-1 [42] L18-1-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~i~0#1_5|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} AuxVars[] AssignedVars[] 1062813#L12 [56] L12-->L12-2: Formula: (> |v_ULTIMATE.start_main_~i~0#1_7| 1) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} AuxVars[] AssignedVars[] 1062812#L12-2 [58] L12-2-->L15-1: Formula: (< |v_ULTIMATE.start_main_~i~0#1_9| 10) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} AuxVars[] AssignedVars[] 1062811#L15-1 [59] L15-1-->L18-1: Formula: (and (< |v_ULTIMATE.start_main_~up~0#1_7| 1) (= |v_ULTIMATE.start_main_~i~0#1_12| (+ |v_ULTIMATE.start_main_~i~0#1_13| (- 1)))) InVars {ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_7|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_13|} OutVars{ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_7|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] 1062810#L18-1 [42] L18-1-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~i~0#1_5|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} AuxVars[] AssignedVars[] 1062809#L12 [56] L12-->L12-2: Formula: (> |v_ULTIMATE.start_main_~i~0#1_7| 1) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} AuxVars[] AssignedVars[] 1062808#L12-2 [58] L12-2-->L15-1: Formula: (< |v_ULTIMATE.start_main_~i~0#1_9| 10) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} AuxVars[] AssignedVars[] 1062807#L15-1 [59] L15-1-->L18-1: Formula: (and (< |v_ULTIMATE.start_main_~up~0#1_7| 1) (= |v_ULTIMATE.start_main_~i~0#1_12| (+ |v_ULTIMATE.start_main_~i~0#1_13| (- 1)))) InVars {ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_7|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_13|} OutVars{ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_7|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] 1062806#L18-1 [42] L18-1-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~i~0#1_5|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} AuxVars[] AssignedVars[] 1062805#L12 [56] L12-->L12-2: Formula: (> |v_ULTIMATE.start_main_~i~0#1_7| 1) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} AuxVars[] AssignedVars[] 1062804#L12-2 [58] L12-2-->L15-1: Formula: (< |v_ULTIMATE.start_main_~i~0#1_9| 10) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} AuxVars[] AssignedVars[] 1062803#L15-1 [59] L15-1-->L18-1: Formula: (and (< |v_ULTIMATE.start_main_~up~0#1_7| 1) (= |v_ULTIMATE.start_main_~i~0#1_12| (+ |v_ULTIMATE.start_main_~i~0#1_13| (- 1)))) InVars {ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_7|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_13|} OutVars{ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_7|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] 1062802#L18-1 [42] L18-1-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~i~0#1_5|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} AuxVars[] AssignedVars[] 1062801#L12 [48] L12-->L12-2: Formula: (and (= |v_ULTIMATE.start_main_~up~0#1_4| 1) (= |v_ULTIMATE.start_main_~i~0#1_6| 1)) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_6|} OutVars{ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_4|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0#1] 1062800#L12-2 [58] L12-2-->L15-1: Formula: (< |v_ULTIMATE.start_main_~i~0#1_9| 10) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} AuxVars[] AssignedVars[] 1062799#L15-1 [44] L15-1-->L18-1: Formula: (and (= |v_ULTIMATE.start_main_~up~0#1_6| 1) (= |v_ULTIMATE.start_main_~i~0#1_10| (+ |v_ULTIMATE.start_main_~i~0#1_11| 1))) InVars {ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_6|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_11|} OutVars{ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_6|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] 1062797#L18-1 [42] L18-1-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~i~0#1_5|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} AuxVars[] AssignedVars[] 1062796#L12 [56] L12-->L12-2: Formula: (> |v_ULTIMATE.start_main_~i~0#1_7| 1) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} AuxVars[] AssignedVars[] 1062795#L12-2 [58] L12-2-->L15-1: Formula: (< |v_ULTIMATE.start_main_~i~0#1_9| 10) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} AuxVars[] AssignedVars[] 1062794#L15-1 [44] L15-1-->L18-1: Formula: (and (= |v_ULTIMATE.start_main_~up~0#1_6| 1) (= |v_ULTIMATE.start_main_~i~0#1_10| (+ |v_ULTIMATE.start_main_~i~0#1_11| 1))) InVars {ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_6|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_11|} OutVars{ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_6|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] 1062793#L18-1 [42] L18-1-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~i~0#1_5|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} AuxVars[] AssignedVars[] 1062792#L12 [56] L12-->L12-2: Formula: (> |v_ULTIMATE.start_main_~i~0#1_7| 1) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} AuxVars[] AssignedVars[] 1062791#L12-2 [58] L12-2-->L15-1: Formula: (< |v_ULTIMATE.start_main_~i~0#1_9| 10) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} AuxVars[] AssignedVars[] 1062790#L15-1 [44] L15-1-->L18-1: Formula: (and (= |v_ULTIMATE.start_main_~up~0#1_6| 1) (= |v_ULTIMATE.start_main_~i~0#1_10| (+ |v_ULTIMATE.start_main_~i~0#1_11| 1))) InVars {ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_6|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_11|} OutVars{ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_6|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] 1062789#L18-1 [42] L18-1-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~i~0#1_5|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} AuxVars[] AssignedVars[] 1062788#L12 [56] L12-->L12-2: Formula: (> |v_ULTIMATE.start_main_~i~0#1_7| 1) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} AuxVars[] AssignedVars[] 1062787#L12-2 [58] L12-2-->L15-1: Formula: (< |v_ULTIMATE.start_main_~i~0#1_9| 10) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} AuxVars[] AssignedVars[] 1062786#L15-1 [44] L15-1-->L18-1: Formula: (and (= |v_ULTIMATE.start_main_~up~0#1_6| 1) (= |v_ULTIMATE.start_main_~i~0#1_10| (+ |v_ULTIMATE.start_main_~i~0#1_11| 1))) InVars {ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_6|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_11|} OutVars{ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_6|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] 1062785#L18-1 [42] L18-1-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~i~0#1_5|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} AuxVars[] AssignedVars[] 1062784#L12 [56] L12-->L12-2: Formula: (> |v_ULTIMATE.start_main_~i~0#1_7| 1) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} AuxVars[] AssignedVars[] 1062783#L12-2 [58] L12-2-->L15-1: Formula: (< |v_ULTIMATE.start_main_~i~0#1_9| 10) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} AuxVars[] AssignedVars[] 1062782#L15-1 [44] L15-1-->L18-1: Formula: (and (= |v_ULTIMATE.start_main_~up~0#1_6| 1) (= |v_ULTIMATE.start_main_~i~0#1_10| (+ |v_ULTIMATE.start_main_~i~0#1_11| 1))) InVars {ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_6|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_11|} OutVars{ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_6|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] 1062781#L18-1 [42] L18-1-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~i~0#1_5|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} AuxVars[] AssignedVars[] 1062780#L12 [56] L12-->L12-2: Formula: (> |v_ULTIMATE.start_main_~i~0#1_7| 1) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} AuxVars[] AssignedVars[] 1062779#L12-2 [58] L12-2-->L15-1: Formula: (< |v_ULTIMATE.start_main_~i~0#1_9| 10) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} AuxVars[] AssignedVars[] 1062778#L15-1 [44] L15-1-->L18-1: Formula: (and (= |v_ULTIMATE.start_main_~up~0#1_6| 1) (= |v_ULTIMATE.start_main_~i~0#1_10| (+ |v_ULTIMATE.start_main_~i~0#1_11| 1))) InVars {ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_6|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_11|} OutVars{ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_6|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] 1062777#L18-1 [42] L18-1-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~i~0#1_5|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} AuxVars[] AssignedVars[] 1062776#L12 [56] L12-->L12-2: Formula: (> |v_ULTIMATE.start_main_~i~0#1_7| 1) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} AuxVars[] AssignedVars[] 1062775#L12-2 [58] L12-2-->L15-1: Formula: (< |v_ULTIMATE.start_main_~i~0#1_9| 10) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} AuxVars[] AssignedVars[] 1062774#L15-1 [44] L15-1-->L18-1: Formula: (and (= |v_ULTIMATE.start_main_~up~0#1_6| 1) (= |v_ULTIMATE.start_main_~i~0#1_10| (+ |v_ULTIMATE.start_main_~i~0#1_11| 1))) InVars {ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_6|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_11|} OutVars{ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_6|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] 1062773#L18-1 [42] L18-1-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~i~0#1_5|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} AuxVars[] AssignedVars[] 1062772#L12 [56] L12-->L12-2: Formula: (> |v_ULTIMATE.start_main_~i~0#1_7| 1) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} AuxVars[] AssignedVars[] 1062771#L12-2 [58] L12-2-->L15-1: Formula: (< |v_ULTIMATE.start_main_~i~0#1_9| 10) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} AuxVars[] AssignedVars[] 1062770#L15-1 [44] L15-1-->L18-1: Formula: (and (= |v_ULTIMATE.start_main_~up~0#1_6| 1) (= |v_ULTIMATE.start_main_~i~0#1_10| (+ |v_ULTIMATE.start_main_~i~0#1_11| 1))) InVars {ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_6|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_11|} OutVars{ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_6|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] 1062769#L18-1 [42] L18-1-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~i~0#1_5|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} AuxVars[] AssignedVars[] 1062768#L12 [56] L12-->L12-2: Formula: (> |v_ULTIMATE.start_main_~i~0#1_7| 1) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} AuxVars[] AssignedVars[] 1062767#L12-2 [58] L12-2-->L15-1: Formula: (< |v_ULTIMATE.start_main_~i~0#1_9| 10) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} AuxVars[] AssignedVars[] 1062766#L15-1 [44] L15-1-->L18-1: Formula: (and (= |v_ULTIMATE.start_main_~up~0#1_6| 1) (= |v_ULTIMATE.start_main_~i~0#1_10| (+ |v_ULTIMATE.start_main_~i~0#1_11| 1))) InVars {ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_6|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_11|} OutVars{ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_6|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] 1062765#L18-1 [42] L18-1-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~i~0#1_5|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} AuxVars[] AssignedVars[] 1062756#L12 [56] L12-->L12-2: Formula: (> |v_ULTIMATE.start_main_~i~0#1_7| 1) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} AuxVars[] AssignedVars[] 1062757#L12-2 [37] L12-2-->L15-1: Formula: (and (= |v_ULTIMATE.start_main_~up~0#1_5| 0) (= |v_ULTIMATE.start_main_~i~0#1_8| 10)) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_8|} OutVars{ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_5|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0#1] 1062846#L15-1 [59] L15-1-->L18-1: Formula: (and (< |v_ULTIMATE.start_main_~up~0#1_7| 1) (= |v_ULTIMATE.start_main_~i~0#1_12| (+ |v_ULTIMATE.start_main_~i~0#1_13| (- 1)))) InVars {ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_7|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_13|} OutVars{ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_7|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] 1062852#L18-1 [42] L18-1-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~i~0#1_5|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} AuxVars[] AssignedVars[] 1062851#L12 [56] L12-->L12-2: Formula: (> |v_ULTIMATE.start_main_~i~0#1_7| 1) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} AuxVars[] AssignedVars[] 1062850#L12-2 [58] L12-2-->L15-1: Formula: (< |v_ULTIMATE.start_main_~i~0#1_9| 10) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} AuxVars[] AssignedVars[] 1062848#L15-1 [59] L15-1-->L18-1: Formula: (and (< |v_ULTIMATE.start_main_~up~0#1_7| 1) (= |v_ULTIMATE.start_main_~i~0#1_12| (+ |v_ULTIMATE.start_main_~i~0#1_13| (- 1)))) InVars {ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_7|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_13|} OutVars{ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_7|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] 1062830#L18-1 [2023-02-13 03:41:31,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 03:41:31,140 INFO L85 PathProgramCache]: Analyzing trace with hash 86270827, now seen corresponding path program 3 times [2023-02-13 03:41:31,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 03:41:31,140 INFO L335 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038359794] [2023-02-13 03:41:31,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 03:41:31,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 03:41:31,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-13 03:41:31,143 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-13 03:41:31,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-13 03:41:31,144 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-13 03:41:31,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 03:41:31,144 INFO L85 PathProgramCache]: Analyzing trace with hash 976531445, now seen corresponding path program 7 times [2023-02-13 03:41:31,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 03:41:31,144 INFO L335 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508607408] [2023-02-13 03:41:31,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 03:41:31,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 03:41:31,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-13 03:41:31,148 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-13 03:41:31,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-13 03:41:31,152 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-13 03:41:31,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 03:41:31,152 INFO L85 PathProgramCache]: Analyzing trace with hash -1063536289, now seen corresponding path program 5 times [2023-02-13 03:41:31,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 03:41:31,152 INFO L335 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256589926] [2023-02-13 03:41:31,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 03:41:31,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 03:41:31,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-13 03:41:31,157 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-13 03:41:31,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-13 03:41:31,161 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-13 03:41:31,512 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 13.02 03:41:31 BasicIcfg [2023-02-13 03:41:31,512 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-02-13 03:41:31,513 INFO L158 Benchmark]: Toolchain (without parser) took 59268.70ms. Allocated memory was 2.1GB in the beginning and 11.4GB in the end (delta: 9.3GB). Free memory was 2.1GB in the beginning and 6.0GB in the end (delta: -3.9GB). Peak memory consumption was 5.4GB. Max. memory is 42.9GB. [2023-02-13 03:41:31,513 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 2.1GB. Free memory is still 2.1GB. There was no memory consumed. Max. memory is 42.9GB. [2023-02-13 03:41:31,513 INFO L158 Benchmark]: CACSL2BoogieTranslator took 124.77ms. Allocated memory is still 2.1GB. Free memory was 2.1GB in the beginning and 2.1GB in the end (delta: 10.6MB). Peak memory consumption was 8.4MB. Max. memory is 42.9GB. [2023-02-13 03:41:31,513 INFO L158 Benchmark]: Boogie Procedure Inliner took 15.06ms. Allocated memory is still 2.1GB. Free memory was 2.1GB in the beginning and 2.1GB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 42.9GB. [2023-02-13 03:41:31,514 INFO L158 Benchmark]: Boogie Preprocessor took 8.66ms. Allocated memory is still 2.1GB. Free memory was 2.1GB in the beginning and 2.1GB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 42.9GB. [2023-02-13 03:41:31,514 INFO L158 Benchmark]: RCFGBuilder took 243.05ms. Allocated memory is still 2.1GB. Free memory was 2.1GB in the beginning and 2.1GB in the end (delta: 9.6MB). Peak memory consumption was 8.4MB. Max. memory is 42.9GB. [2023-02-13 03:41:31,514 INFO L158 Benchmark]: BlockEncodingV2 took 43.71ms. Allocated memory is still 2.1GB. Free memory was 2.1GB in the beginning and 2.1GB in the end (delta: 4.7MB). There was no memory consumed. Max. memory is 42.9GB. [2023-02-13 03:41:31,514 INFO L158 Benchmark]: TraceAbstraction took 16.26ms. Allocated memory is still 2.1GB. Free memory was 2.1GB in the beginning and 2.1GB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 42.9GB. [2023-02-13 03:41:31,514 INFO L158 Benchmark]: BuchiAutomizer took 58811.42ms. Allocated memory was 2.1GB in the beginning and 11.4GB in the end (delta: 9.3GB). Free memory was 2.1GB in the beginning and 6.0GB in the end (delta: -3.9GB). Peak memory consumption was 5.4GB. Max. memory is 42.9GB. [2023-02-13 03:41:31,516 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 10 locations, 14 edges - StatisticsResult: Encoded RCFG 5 locations, 11 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 2.1GB. Free memory is still 2.1GB. There was no memory consumed. Max. memory is 42.9GB. * CACSL2BoogieTranslator took 124.77ms. Allocated memory is still 2.1GB. Free memory was 2.1GB in the beginning and 2.1GB in the end (delta: 10.6MB). Peak memory consumption was 8.4MB. Max. memory is 42.9GB. * Boogie Procedure Inliner took 15.06ms. Allocated memory is still 2.1GB. Free memory was 2.1GB in the beginning and 2.1GB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 42.9GB. * Boogie Preprocessor took 8.66ms. Allocated memory is still 2.1GB. Free memory was 2.1GB in the beginning and 2.1GB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 42.9GB. * RCFGBuilder took 243.05ms. Allocated memory is still 2.1GB. Free memory was 2.1GB in the beginning and 2.1GB in the end (delta: 9.6MB). Peak memory consumption was 8.4MB. Max. memory is 42.9GB. * BlockEncodingV2 took 43.71ms. Allocated memory is still 2.1GB. Free memory was 2.1GB in the beginning and 2.1GB in the end (delta: 4.7MB). There was no memory consumed. Max. memory is 42.9GB. * TraceAbstraction took 16.26ms. Allocated memory is still 2.1GB. Free memory was 2.1GB in the beginning and 2.1GB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 42.9GB. * BuchiAutomizer took 58811.42ms. Allocated memory was 2.1GB in the beginning and 11.4GB in the end (delta: 9.3GB). Free memory was 2.1GB in the beginning and 6.0GB in the end (delta: -3.9GB). Peak memory consumption was 5.4GB. Max. memory is 42.9GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - AllSpecificationsHoldResult: All specifications hold We were not able to verify any specifiation because the program does not contain any specification. - StatisticsResult: Constructed decomposition of program Your program was decomposed into 13 terminating modules (7 trivial, 0 deterministic, 6 nondeterministic) and one nonterminating remainder module.One nondeterministic module has affine ranking function -2 * i + 3 and consists of 7 locations. One nondeterministic module has affine ranking function i and consists of 8 locations. One nondeterministic module has affine ranking function -2 * i + 11 and consists of 22 locations. One nondeterministic module has affine ranking function -2 * i + 11 and consists of 44 locations. One nondeterministic module has affine ranking function 7 + -1 * i and consists of 84 locations. One nondeterministic module has affine ranking function -2 * i + 17 and consists of 138 locations. 7 modules have a trivial ranking function, the largest among these consists of 11 locations. The remainder module has 166 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 58.7s and 14 iterations. TraceHistogramMax:18. Analysis of lassos took 4.2s. Construction of modules took 1.6s. Büchi inclusion checks took 51.1s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 12. Automata minimization 0.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 3595 StatesRemovedByMinimization, 11 NontrivialMinimizations. Non-live state removal took 1.5s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [6, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 860/1556 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1293 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1256 mSDsluCounter, 52 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 11 mSDsCounter, 740 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2169 IncrementalHoareTripleChecker+Invalid, 2909 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 740 mSolverCounterUnsat, 48 mSDtfsCounter, 2169 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI4 SFLT6 conc0 concLT0 SILN0 SILU0 SILI3 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital16 mio100 ax175 hnf100 lsp39 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq200 hnf91 smp100 dnf100 smp100 tf109 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 25ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 14 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 6 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.5s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 11]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {} State at position 1 is {\result=0, i=8, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2cf4a070=0, up=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 11]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L6] int i; [L7] int up; [L8] i = __VERIFIER_nondet_int() [L9] up = 0 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 Loop: [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND TRUE i == 1 [L13] up = 1 [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND TRUE i == 10 [L16] up = 0 [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2023-02-13 03:41:31,564 INFO L552 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2023-02-13 03:41:31,766 INFO L552 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2023-02-13 03:41:31,965 INFO L552 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (1)] Ended with exit code 0 Received shutdown request...