./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/termination.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/toy2.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/toy2.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a77d6f304c19846fdc8cd5bba9216d69953659ded966cffbf7faa285e2d864a4 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 17:45:40,132 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 17:45:40,194 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2024-10-13 17:45:40,197 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 17:45:40,197 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 17:45:40,221 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 17:45:40,222 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 17:45:40,222 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 17:45:40,223 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 17:45:40,223 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 17:45:40,224 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 17:45:40,224 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 17:45:40,224 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 17:45:40,224 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-10-13 17:45:40,225 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-10-13 17:45:40,225 INFO L153 SettingsManager]: * Use old map elimination=false [2024-10-13 17:45:40,225 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-10-13 17:45:40,225 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-10-13 17:45:40,225 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-10-13 17:45:40,226 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 17:45:40,226 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-10-13 17:45:40,228 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 17:45:40,228 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 17:45:40,228 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 17:45:40,229 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 17:45:40,229 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-10-13 17:45:40,229 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-10-13 17:45:40,229 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-10-13 17:45:40,229 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 17:45:40,229 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 17:45:40,230 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 17:45:40,230 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 17:45:40,230 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-10-13 17:45:40,230 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 17:45:40,230 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 17:45:40,230 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 17:45:40,231 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 17:45:40,231 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 17:45:40,231 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-10-13 17:45:40,231 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a77d6f304c19846fdc8cd5bba9216d69953659ded966cffbf7faa285e2d864a4 [2024-10-13 17:45:40,429 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 17:45:40,451 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 17:45:40,454 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 17:45:40,455 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 17:45:40,455 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 17:45:40,456 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/toy2.cil.c [2024-10-13 17:45:41,719 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 17:45:41,882 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 17:45:41,883 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/toy2.cil.c [2024-10-13 17:45:41,897 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f94c104bb/0d76f39df6f24b428911759125a3ab69/FLAG50d3e3b1f [2024-10-13 17:45:42,280 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f94c104bb/0d76f39df6f24b428911759125a3ab69 [2024-10-13 17:45:42,282 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 17:45:42,283 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 17:45:42,285 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 17:45:42,285 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 17:45:42,293 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 17:45:42,294 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 05:45:42" (1/1) ... [2024-10-13 17:45:42,294 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f13ed25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:45:42, skipping insertion in model container [2024-10-13 17:45:42,295 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 05:45:42" (1/1) ... [2024-10-13 17:45:42,323 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 17:45:42,479 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 17:45:42,491 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 17:45:42,521 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 17:45:42,534 INFO L204 MainTranslator]: Completed translation [2024-10-13 17:45:42,534 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:45:42 WrapperNode [2024-10-13 17:45:42,535 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 17:45:42,535 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 17:45:42,535 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 17:45:42,535 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 17:45:42,540 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:45:42" (1/1) ... [2024-10-13 17:45:42,551 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:45:42" (1/1) ... [2024-10-13 17:45:42,571 INFO L138 Inliner]: procedures = 20, calls = 16, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 361 [2024-10-13 17:45:42,572 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 17:45:42,573 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 17:45:42,573 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 17:45:42,573 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 17:45:42,581 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:45:42" (1/1) ... [2024-10-13 17:45:42,581 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:45:42" (1/1) ... [2024-10-13 17:45:42,583 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:45:42" (1/1) ... [2024-10-13 17:45:42,597 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-13 17:45:42,597 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:45:42" (1/1) ... [2024-10-13 17:45:42,597 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:45:42" (1/1) ... [2024-10-13 17:45:42,603 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:45:42" (1/1) ... [2024-10-13 17:45:42,609 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:45:42" (1/1) ... [2024-10-13 17:45:42,611 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:45:42" (1/1) ... [2024-10-13 17:45:42,612 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:45:42" (1/1) ... [2024-10-13 17:45:42,614 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 17:45:42,615 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 17:45:42,615 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 17:45:42,615 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 17:45:42,620 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:45:42" (1/1) ... [2024-10-13 17:45:42,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:45:42,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:45:42,646 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:45:42,668 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-10-13 17:45:42,717 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 17:45:42,718 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 17:45:42,718 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 17:45:42,718 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 17:45:42,777 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 17:45:42,778 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 17:45:43,075 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-10-13 17:45:43,075 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 17:45:43,091 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 17:45:43,091 INFO L314 CfgBuilder]: Removed 6 assume(true) statements. [2024-10-13 17:45:43,092 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 05:45:43 BoogieIcfgContainer [2024-10-13 17:45:43,092 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 17:45:43,093 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-10-13 17:45:43,093 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-10-13 17:45:43,096 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-10-13 17:45:43,097 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-13 17:45:43,098 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 13.10 05:45:42" (1/3) ... [2024-10-13 17:45:43,098 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@30023bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.10 05:45:43, skipping insertion in model container [2024-10-13 17:45:43,099 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-13 17:45:43,099 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:45:42" (2/3) ... [2024-10-13 17:45:43,099 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@30023bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.10 05:45:43, skipping insertion in model container [2024-10-13 17:45:43,099 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-13 17:45:43,099 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 05:45:43" (3/3) ... [2024-10-13 17:45:43,100 INFO L332 chiAutomizerObserver]: Analyzing ICFG toy2.cil.c [2024-10-13 17:45:43,145 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-10-13 17:45:43,145 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-10-13 17:45:43,145 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-10-13 17:45:43,145 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-10-13 17:45:43,145 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-10-13 17:45:43,145 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-10-13 17:45:43,145 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-10-13 17:45:43,145 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-10-13 17:45:43,148 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 131 states, 130 states have (on average 1.823076923076923) internal successors, (237), 130 states have internal predecessors, (237), 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) [2024-10-13 17:45:43,166 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 96 [2024-10-13 17:45:43,166 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 17:45:43,166 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 17:45:43,171 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 17:45:43,171 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 17:45:43,172 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-10-13 17:45:43,172 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 131 states, 130 states have (on average 1.823076923076923) internal successors, (237), 130 states have internal predecessors, (237), 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) [2024-10-13 17:45:43,176 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 96 [2024-10-13 17:45:43,177 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 17:45:43,177 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 17:45:43,177 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 17:45:43,178 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 17:45:43,183 INFO L745 eck$LassoCheckResult]: Stem: 32#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 42#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~0#1;havoc main_~__retres1~0#1;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; 113#L404true assume !(1 == ~c_req_up~0); 61#L404-2true assume !(1 == ~wl_i~0);~wl_st~0 := 2; 22#L415-1true assume !(1 == ~c1_i~0);~c1_st~0 := 2; 50#L420-1true assume 1 == ~c2_i~0;~c2_st~0 := 0; 84#L425-1true assume !(1 == ~wb_i~0);~wb_st~0 := 2; 39#L430-1true assume !(1 == ~r_i~0);~r_st~0 := 2; 125#L435-1true assume !(0 == ~e_f~0); 26#L440-1true assume !(0 == ~e_g~0); 44#L445-1true assume !(0 == ~e_e~0); 47#L450-1true assume !(0 == ~e_c~0); 21#L455-1true assume !(0 == ~e_wl~0); 76#L460-1true assume !(1 == ~wl_pc~0); 96#$Ultimate##44true assume !(2 == ~wl_pc~0); 121#L473true assume !(1 == ~c1_pc~0); 103#L483true assume !(1 == ~c2_pc~0); 115#L492true assume !(1 == ~wb_pc~0); 52#L501true assume !(1 == ~e_c~0); 31#L510-1true assume !(1 == ~e_e~0); 23#L515-1true assume !(1 == ~e_f~0); 14#L520-1true assume !(1 == ~e_g~0); 45#L525-1true assume !(1 == ~e_c~0); 82#L530-1true assume !(1 == ~e_wl~0); 65#L672-1true [2024-10-13 17:45:43,183 INFO L747 eck$LassoCheckResult]: Loop: 65#L672-1true assume !false; 6#L542true start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 128#L377true assume !true; 86#eval_returnLabel#1true havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; 64#L548true assume !(1 == ~c_req_up~0); 9#L548-2true start_simulation_~kernel_st~0#1 := 3; 25#L560true assume 0 == ~e_f~0;~e_f~0 := 1; 97#L560-2true assume 0 == ~e_g~0;~e_g~0 := 1; 18#L565-1true assume 0 == ~e_e~0;~e_e~0 := 1; 129#L570-1true assume 0 == ~e_c~0;~e_c~0 := 1; 35#L575-1true assume !(0 == ~e_wl~0); 122#L580-1true assume !(1 == ~wl_pc~0); 75#$Ultimate##251true assume !(2 == ~wl_pc~0); 80#L593true assume !(1 == ~c1_pc~0); 116#L603true assume !(1 == ~c2_pc~0); 3#L612true assume !(1 == ~wb_pc~0); 60#L621true assume 1 == ~e_c~0;~r_st~0 := 0; 58#L630-1true assume 1 == ~e_e~0;~e_e~0 := 2; 131#L635-1true assume 1 == ~e_f~0;~e_f~0 := 2; 130#L640-1true assume 1 == ~e_g~0;~e_g~0 := 2; 111#L645-1true assume 1 == ~e_c~0;~e_c~0 := 2; 11#L650-1true assume !(1 == ~e_wl~0); 40#L655-1true assume 0 == ~wl_st~0; 65#L672-1true [2024-10-13 17:45:43,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:45:43,190 INFO L85 PathProgramCache]: Analyzing trace with hash -2133486251, now seen corresponding path program 1 times [2024-10-13 17:45:43,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:45:43,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139761353] [2024-10-13 17:45:43,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:45:43,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:45:43,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:45:43,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 17:45:43,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 17:45:43,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139761353] [2024-10-13 17:45:43,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139761353] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 17:45:43,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 17:45:43,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 17:45:43,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255296141] [2024-10-13 17:45:43,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 17:45:43,427 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-13 17:45:43,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:45:43,428 INFO L85 PathProgramCache]: Analyzing trace with hash 1858065656, now seen corresponding path program 1 times [2024-10-13 17:45:43,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:45:43,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449697501] [2024-10-13 17:45:43,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:45:43,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:45:43,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:45:43,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 17:45:43,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 17:45:43,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449697501] [2024-10-13 17:45:43,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449697501] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 17:45:43,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 17:45:43,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 17:45:43,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043871115] [2024-10-13 17:45:43,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 17:45:43,441 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-13 17:45:43,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 17:45:43,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 17:45:43,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 17:45:43,470 INFO L87 Difference]: Start difference. First operand has 131 states, 130 states have (on average 1.823076923076923) internal successors, (237), 130 states have internal predecessors, (237), 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 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 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) [2024-10-13 17:45:43,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 17:45:43,486 INFO L93 Difference]: Finished difference Result 129 states and 222 transitions. [2024-10-13 17:45:43,487 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 129 states and 222 transitions. [2024-10-13 17:45:43,490 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 93 [2024-10-13 17:45:43,493 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 129 states to 124 states and 217 transitions. [2024-10-13 17:45:43,493 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 124 [2024-10-13 17:45:43,494 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 124 [2024-10-13 17:45:43,494 INFO L73 IsDeterministic]: Start isDeterministic. Operand 124 states and 217 transitions. [2024-10-13 17:45:43,495 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-13 17:45:43,495 INFO L218 hiAutomatonCegarLoop]: Abstraction has 124 states and 217 transitions. [2024-10-13 17:45:43,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states and 217 transitions. [2024-10-13 17:45:43,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2024-10-13 17:45:43,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 124 states have (on average 1.75) internal successors, (217), 123 states have internal predecessors, (217), 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) [2024-10-13 17:45:43,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 217 transitions. [2024-10-13 17:45:43,521 INFO L240 hiAutomatonCegarLoop]: Abstraction has 124 states and 217 transitions. [2024-10-13 17:45:43,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 17:45:43,526 INFO L425 stractBuchiCegarLoop]: Abstraction has 124 states and 217 transitions. [2024-10-13 17:45:43,527 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-10-13 17:45:43,527 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 124 states and 217 transitions. [2024-10-13 17:45:43,529 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 93 [2024-10-13 17:45:43,529 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 17:45:43,529 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 17:45:43,530 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 17:45:43,530 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 17:45:43,530 INFO L745 eck$LassoCheckResult]: Stem: 325#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 326#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~0#1;havoc main_~__retres1~0#1;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; 340#L404 assume !(1 == ~c_req_up~0); 363#L404-2 assume !(1 == ~wl_i~0);~wl_st~0 := 2; 309#L415-1 assume !(1 == ~c1_i~0);~c1_st~0 := 2; 310#L420-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 351#L425-1 assume !(1 == ~wb_i~0);~wb_st~0 := 2; 337#L430-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 338#L435-1 assume !(0 == ~e_f~0); 315#L440-1 assume !(0 == ~e_g~0); 316#L445-1 assume !(0 == ~e_e~0); 343#L450-1 assume !(0 == ~e_c~0); 307#L455-1 assume !(0 == ~e_wl~0); 308#L460-1 assume !(1 == ~wl_pc~0); 376#$Ultimate##44 assume !(2 == ~wl_pc~0); 354#L473 assume !(1 == ~c1_pc~0); 386#L483 assume !(1 == ~c2_pc~0); 297#L492 assume !(1 == ~wb_pc~0); 342#L501 assume !(1 == ~e_c~0); 324#L510-1 assume !(1 == ~e_e~0); 311#L515-1 assume !(1 == ~e_f~0); 294#L520-1 assume !(1 == ~e_g~0); 295#L525-1 assume !(1 == ~e_c~0); 344#L530-1 assume !(1 == ~e_wl~0); 292#L672-1 [2024-10-13 17:45:43,530 INFO L747 eck$LassoCheckResult]: Loop: 292#L672-1 assume !false; 278#L542 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 279#L377 assume !false; 275#L295 assume !(0 == ~wl_st~0); 277#L299 assume !(0 == ~c1_st~0); 336#L302 assume !(0 == ~c2_st~0); 366#L305 assume !(0 == ~wb_st~0); 286#L308 assume !(0 == ~r_st~0); 287#eval_returnLabel#1 havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; 365#L548 assume !(1 == ~c_req_up~0); 284#L548-2 start_simulation_~kernel_st~0#1 := 3; 285#L560 assume 0 == ~e_f~0;~e_f~0 := 1; 314#L560-2 assume 0 == ~e_g~0;~e_g~0 := 1; 304#L565-1 assume 0 == ~e_e~0;~e_e~0 := 1; 305#L570-1 assume 0 == ~e_c~0;~e_c~0 := 1; 332#L575-1 assume !(0 == ~e_wl~0); 333#L580-1 assume 1 == ~wl_pc~0; 385#L586 assume 1 == ~e_wl~0;~wl_st~0 := 0; 375#L593 assume !(1 == ~c1_pc~0); 350#L603 assume !(1 == ~c2_pc~0); 269#L612 assume !(1 == ~wb_pc~0); 271#L621 assume 1 == ~e_c~0;~r_st~0 := 0; 359#L630-1 assume 1 == ~e_e~0;~e_e~0 := 2; 360#L635-1 assume 1 == ~e_f~0;~e_f~0 := 2; 392#L640-1 assume 1 == ~e_g~0;~e_g~0 := 2; 390#L645-1 assume 1 == ~e_c~0;~e_c~0 := 2; 288#L650-1 assume !(1 == ~e_wl~0); 289#L655-1 assume 0 == ~wl_st~0; 292#L672-1 [2024-10-13 17:45:43,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:45:43,531 INFO L85 PathProgramCache]: Analyzing trace with hash -2133486251, now seen corresponding path program 2 times [2024-10-13 17:45:43,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:45:43,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269553251] [2024-10-13 17:45:43,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:45:43,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:45:43,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:45:43,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 17:45:43,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 17:45:43,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269553251] [2024-10-13 17:45:43,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1269553251] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 17:45:43,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 17:45:43,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 17:45:43,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790607828] [2024-10-13 17:45:43,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 17:45:43,580 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-13 17:45:43,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:45:43,580 INFO L85 PathProgramCache]: Analyzing trace with hash -1951233037, now seen corresponding path program 1 times [2024-10-13 17:45:43,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:45:43,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027028639] [2024-10-13 17:45:43,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:45:43,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:45:43,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:45:43,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 17:45:43,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 17:45:43,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027028639] [2024-10-13 17:45:43,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027028639] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 17:45:43,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 17:45:43,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 17:45:43,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52344971] [2024-10-13 17:45:43,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 17:45:43,619 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-13 17:45:43,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 17:45:43,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 17:45:43,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 17:45:43,620 INFO L87 Difference]: Start difference. First operand 124 states and 217 transitions. cyclomatic complexity: 94 Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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) [2024-10-13 17:45:43,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 17:45:43,640 INFO L93 Difference]: Finished difference Result 124 states and 216 transitions. [2024-10-13 17:45:43,640 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 124 states and 216 transitions. [2024-10-13 17:45:43,642 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 93 [2024-10-13 17:45:43,645 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 124 states to 124 states and 216 transitions. [2024-10-13 17:45:43,645 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 124 [2024-10-13 17:45:43,646 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 124 [2024-10-13 17:45:43,646 INFO L73 IsDeterministic]: Start isDeterministic. Operand 124 states and 216 transitions. [2024-10-13 17:45:43,647 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-13 17:45:43,647 INFO L218 hiAutomatonCegarLoop]: Abstraction has 124 states and 216 transitions. [2024-10-13 17:45:43,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states and 216 transitions. [2024-10-13 17:45:43,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2024-10-13 17:45:43,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 124 states have (on average 1.7419354838709677) internal successors, (216), 123 states have internal predecessors, (216), 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) [2024-10-13 17:45:43,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 216 transitions. [2024-10-13 17:45:43,655 INFO L240 hiAutomatonCegarLoop]: Abstraction has 124 states and 216 transitions. [2024-10-13 17:45:43,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 17:45:43,657 INFO L425 stractBuchiCegarLoop]: Abstraction has 124 states and 216 transitions. [2024-10-13 17:45:43,657 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-10-13 17:45:43,657 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 124 states and 216 transitions. [2024-10-13 17:45:43,658 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 93 [2024-10-13 17:45:43,658 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 17:45:43,658 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 17:45:43,659 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 17:45:43,660 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 17:45:43,660 INFO L745 eck$LassoCheckResult]: Stem: 580#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 581#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~0#1;havoc main_~__retres1~0#1;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; 595#L404 assume !(1 == ~c_req_up~0); 618#L404-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 564#L415-1 assume !(1 == ~c1_i~0);~c1_st~0 := 2; 565#L420-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 606#L425-1 assume !(1 == ~wb_i~0);~wb_st~0 := 2; 592#L430-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 593#L435-1 assume !(0 == ~e_f~0); 570#L440-1 assume !(0 == ~e_g~0); 571#L445-1 assume !(0 == ~e_e~0); 598#L450-1 assume !(0 == ~e_c~0); 562#L455-1 assume !(0 == ~e_wl~0); 563#L460-1 assume !(1 == ~wl_pc~0); 631#$Ultimate##44 assume !(2 == ~wl_pc~0); 609#L473 assume !(1 == ~c1_pc~0); 641#L483 assume !(1 == ~c2_pc~0); 552#L492 assume !(1 == ~wb_pc~0); 597#L501 assume !(1 == ~e_c~0); 579#L510-1 assume !(1 == ~e_e~0); 566#L515-1 assume !(1 == ~e_f~0); 549#L520-1 assume !(1 == ~e_g~0); 550#L525-1 assume !(1 == ~e_c~0); 599#L530-1 assume !(1 == ~e_wl~0); 547#L672-1 [2024-10-13 17:45:43,661 INFO L747 eck$LassoCheckResult]: Loop: 547#L672-1 assume !false; 533#L542 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 534#L377 assume !false; 530#L295 assume !(0 == ~wl_st~0); 532#L299 assume !(0 == ~c1_st~0); 591#L302 assume !(0 == ~c2_st~0); 621#L305 assume !(0 == ~wb_st~0); 541#L308 assume !(0 == ~r_st~0); 542#eval_returnLabel#1 havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; 620#L548 assume !(1 == ~c_req_up~0); 539#L548-2 start_simulation_~kernel_st~0#1 := 3; 540#L560 assume 0 == ~e_f~0;~e_f~0 := 1; 569#L560-2 assume 0 == ~e_g~0;~e_g~0 := 1; 559#L565-1 assume 0 == ~e_e~0;~e_e~0 := 1; 560#L570-1 assume 0 == ~e_c~0;~e_c~0 := 1; 587#L575-1 assume !(0 == ~e_wl~0); 588#L580-1 assume 1 == ~wl_pc~0; 640#L586 assume 1 == ~e_wl~0;~wl_st~0 := 0; 630#L593 assume !(1 == ~c1_pc~0); 605#L603 assume !(1 == ~c2_pc~0); 524#L612 assume !(1 == ~wb_pc~0); 526#L621 assume 1 == ~e_c~0;~r_st~0 := 0; 614#L630-1 assume 1 == ~e_e~0;~e_e~0 := 2; 615#L635-1 assume 1 == ~e_f~0;~e_f~0 := 2; 647#L640-1 assume 1 == ~e_g~0;~e_g~0 := 2; 645#L645-1 assume 1 == ~e_c~0;~e_c~0 := 2; 543#L650-1 assume !(1 == ~e_wl~0); 544#L655-1 assume 0 == ~wl_st~0; 547#L672-1 [2024-10-13 17:45:43,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:45:43,662 INFO L85 PathProgramCache]: Analyzing trace with hash 1738779219, now seen corresponding path program 1 times [2024-10-13 17:45:43,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:45:43,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016286877] [2024-10-13 17:45:43,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:45:43,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:45:43,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:45:43,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 17:45:43,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 17:45:43,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016286877] [2024-10-13 17:45:43,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016286877] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 17:45:43,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 17:45:43,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 17:45:43,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398208219] [2024-10-13 17:45:43,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 17:45:43,720 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-13 17:45:43,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:45:43,720 INFO L85 PathProgramCache]: Analyzing trace with hash -1951233037, now seen corresponding path program 2 times [2024-10-13 17:45:43,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:45:43,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019985705] [2024-10-13 17:45:43,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:45:43,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:45:43,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:45:43,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 17:45:43,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 17:45:43,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019985705] [2024-10-13 17:45:43,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019985705] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 17:45:43,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 17:45:43,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 17:45:43,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025952975] [2024-10-13 17:45:43,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 17:45:43,744 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-13 17:45:43,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 17:45:43,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 17:45:43,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 17:45:43,745 INFO L87 Difference]: Start difference. First operand 124 states and 216 transitions. cyclomatic complexity: 93 Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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) [2024-10-13 17:45:43,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 17:45:43,754 INFO L93 Difference]: Finished difference Result 124 states and 215 transitions. [2024-10-13 17:45:43,754 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 124 states and 215 transitions. [2024-10-13 17:45:43,755 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 93 [2024-10-13 17:45:43,756 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 124 states to 124 states and 215 transitions. [2024-10-13 17:45:43,756 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 124 [2024-10-13 17:45:43,756 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 124 [2024-10-13 17:45:43,757 INFO L73 IsDeterministic]: Start isDeterministic. Operand 124 states and 215 transitions. [2024-10-13 17:45:43,757 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-13 17:45:43,757 INFO L218 hiAutomatonCegarLoop]: Abstraction has 124 states and 215 transitions. [2024-10-13 17:45:43,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states and 215 transitions. [2024-10-13 17:45:43,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2024-10-13 17:45:43,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 124 states have (on average 1.7338709677419355) internal successors, (215), 123 states have internal predecessors, (215), 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) [2024-10-13 17:45:43,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 215 transitions. [2024-10-13 17:45:43,762 INFO L240 hiAutomatonCegarLoop]: Abstraction has 124 states and 215 transitions. [2024-10-13 17:45:43,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 17:45:43,762 INFO L425 stractBuchiCegarLoop]: Abstraction has 124 states and 215 transitions. [2024-10-13 17:45:43,762 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-10-13 17:45:43,763 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 124 states and 215 transitions. [2024-10-13 17:45:43,763 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 93 [2024-10-13 17:45:43,763 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 17:45:43,763 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 17:45:43,764 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 17:45:43,764 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 17:45:43,764 INFO L745 eck$LassoCheckResult]: Stem: 835#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 836#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~0#1;havoc main_~__retres1~0#1;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; 850#L404 assume !(1 == ~c_req_up~0); 873#L404-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 819#L415-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 820#L420-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 861#L425-1 assume !(1 == ~wb_i~0);~wb_st~0 := 2; 847#L430-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 848#L435-1 assume !(0 == ~e_f~0); 825#L440-1 assume !(0 == ~e_g~0); 826#L445-1 assume !(0 == ~e_e~0); 853#L450-1 assume !(0 == ~e_c~0); 817#L455-1 assume !(0 == ~e_wl~0); 818#L460-1 assume !(1 == ~wl_pc~0); 886#$Ultimate##44 assume !(2 == ~wl_pc~0); 864#L473 assume !(1 == ~c1_pc~0); 896#L483 assume !(1 == ~c2_pc~0); 807#L492 assume !(1 == ~wb_pc~0); 852#L501 assume !(1 == ~e_c~0); 834#L510-1 assume !(1 == ~e_e~0); 821#L515-1 assume !(1 == ~e_f~0); 804#L520-1 assume !(1 == ~e_g~0); 805#L525-1 assume !(1 == ~e_c~0); 854#L530-1 assume !(1 == ~e_wl~0); 802#L672-1 [2024-10-13 17:45:43,764 INFO L747 eck$LassoCheckResult]: Loop: 802#L672-1 assume !false; 788#L542 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 789#L377 assume !false; 785#L295 assume !(0 == ~wl_st~0); 787#L299 assume !(0 == ~c1_st~0); 846#L302 assume !(0 == ~c2_st~0); 876#L305 assume !(0 == ~wb_st~0); 796#L308 assume !(0 == ~r_st~0); 797#eval_returnLabel#1 havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; 875#L548 assume !(1 == ~c_req_up~0); 794#L548-2 start_simulation_~kernel_st~0#1 := 3; 795#L560 assume 0 == ~e_f~0;~e_f~0 := 1; 824#L560-2 assume 0 == ~e_g~0;~e_g~0 := 1; 814#L565-1 assume 0 == ~e_e~0;~e_e~0 := 1; 815#L570-1 assume 0 == ~e_c~0;~e_c~0 := 1; 842#L575-1 assume !(0 == ~e_wl~0); 843#L580-1 assume !(1 == ~wl_pc~0); 883#$Ultimate##251 assume !(2 == ~wl_pc~0); 885#L593 assume !(1 == ~c1_pc~0); 860#L603 assume !(1 == ~c2_pc~0); 779#L612 assume !(1 == ~wb_pc~0); 781#L621 assume 1 == ~e_c~0;~r_st~0 := 0; 869#L630-1 assume 1 == ~e_e~0;~e_e~0 := 2; 870#L635-1 assume 1 == ~e_f~0;~e_f~0 := 2; 902#L640-1 assume 1 == ~e_g~0;~e_g~0 := 2; 900#L645-1 assume 1 == ~e_c~0;~e_c~0 := 2; 798#L650-1 assume !(1 == ~e_wl~0); 799#L655-1 assume 0 == ~wl_st~0; 802#L672-1 [2024-10-13 17:45:43,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:45:43,765 INFO L85 PathProgramCache]: Analyzing trace with hash -1738539627, now seen corresponding path program 1 times [2024-10-13 17:45:43,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:45:43,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744714902] [2024-10-13 17:45:43,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:45:43,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:45:43,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:45:43,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 17:45:43,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 17:45:43,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744714902] [2024-10-13 17:45:43,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744714902] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 17:45:43,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 17:45:43,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 17:45:43,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78356662] [2024-10-13 17:45:43,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 17:45:43,787 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-13 17:45:43,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:45:43,787 INFO L85 PathProgramCache]: Analyzing trace with hash -1401973316, now seen corresponding path program 1 times [2024-10-13 17:45:43,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:45:43,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734863107] [2024-10-13 17:45:43,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:45:43,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:45:43,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:45:43,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 17:45:43,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 17:45:43,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734863107] [2024-10-13 17:45:43,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734863107] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 17:45:43,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 17:45:43,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 17:45:43,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665470295] [2024-10-13 17:45:43,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 17:45:43,808 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-13 17:45:43,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 17:45:43,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 17:45:43,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 17:45:43,808 INFO L87 Difference]: Start difference. First operand 124 states and 215 transitions. cyclomatic complexity: 92 Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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) [2024-10-13 17:45:43,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 17:45:43,817 INFO L93 Difference]: Finished difference Result 124 states and 214 transitions. [2024-10-13 17:45:43,817 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 124 states and 214 transitions. [2024-10-13 17:45:43,818 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 93 [2024-10-13 17:45:43,819 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 124 states to 124 states and 214 transitions. [2024-10-13 17:45:43,819 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 124 [2024-10-13 17:45:43,819 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 124 [2024-10-13 17:45:43,819 INFO L73 IsDeterministic]: Start isDeterministic. Operand 124 states and 214 transitions. [2024-10-13 17:45:43,820 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-13 17:45:43,820 INFO L218 hiAutomatonCegarLoop]: Abstraction has 124 states and 214 transitions. [2024-10-13 17:45:43,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states and 214 transitions. [2024-10-13 17:45:43,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2024-10-13 17:45:43,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 124 states have (on average 1.7258064516129032) internal successors, (214), 123 states have internal predecessors, (214), 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) [2024-10-13 17:45:43,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 214 transitions. [2024-10-13 17:45:43,824 INFO L240 hiAutomatonCegarLoop]: Abstraction has 124 states and 214 transitions. [2024-10-13 17:45:43,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 17:45:43,824 INFO L425 stractBuchiCegarLoop]: Abstraction has 124 states and 214 transitions. [2024-10-13 17:45:43,825 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-10-13 17:45:43,825 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 124 states and 214 transitions. [2024-10-13 17:45:43,825 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 93 [2024-10-13 17:45:43,825 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 17:45:43,825 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 17:45:43,826 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 17:45:43,826 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 17:45:43,826 INFO L745 eck$LassoCheckResult]: Stem: 1090#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 1091#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~0#1;havoc main_~__retres1~0#1;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; 1105#L404 assume !(1 == ~c_req_up~0); 1128#L404-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 1074#L415-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 1075#L420-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 1116#L425-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 1102#L430-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 1103#L435-1 assume !(0 == ~e_f~0); 1080#L440-1 assume !(0 == ~e_g~0); 1081#L445-1 assume !(0 == ~e_e~0); 1108#L450-1 assume !(0 == ~e_c~0); 1072#L455-1 assume !(0 == ~e_wl~0); 1073#L460-1 assume !(1 == ~wl_pc~0); 1141#$Ultimate##44 assume !(2 == ~wl_pc~0); 1119#L473 assume !(1 == ~c1_pc~0); 1151#L483 assume !(1 == ~c2_pc~0); 1062#L492 assume !(1 == ~wb_pc~0); 1107#L501 assume !(1 == ~e_c~0); 1089#L510-1 assume !(1 == ~e_e~0); 1076#L515-1 assume !(1 == ~e_f~0); 1059#L520-1 assume !(1 == ~e_g~0); 1060#L525-1 assume !(1 == ~e_c~0); 1109#L530-1 assume !(1 == ~e_wl~0); 1057#L672-1 [2024-10-13 17:45:43,826 INFO L747 eck$LassoCheckResult]: Loop: 1057#L672-1 assume !false; 1043#L542 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 1044#L377 assume !false; 1040#L295 assume !(0 == ~wl_st~0); 1042#L299 assume !(0 == ~c1_st~0); 1101#L302 assume !(0 == ~c2_st~0); 1131#L305 assume !(0 == ~wb_st~0); 1051#L308 assume !(0 == ~r_st~0); 1052#eval_returnLabel#1 havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; 1130#L548 assume !(1 == ~c_req_up~0); 1049#L548-2 start_simulation_~kernel_st~0#1 := 3; 1050#L560 assume 0 == ~e_f~0;~e_f~0 := 1; 1079#L560-2 assume 0 == ~e_g~0;~e_g~0 := 1; 1069#L565-1 assume 0 == ~e_e~0;~e_e~0 := 1; 1070#L570-1 assume 0 == ~e_c~0;~e_c~0 := 1; 1097#L575-1 assume !(0 == ~e_wl~0); 1098#L580-1 assume !(1 == ~wl_pc~0); 1138#$Ultimate##251 assume !(2 == ~wl_pc~0); 1140#L593 assume !(1 == ~c1_pc~0); 1115#L603 assume !(1 == ~c2_pc~0); 1034#L612 assume !(1 == ~wb_pc~0); 1036#L621 assume 1 == ~e_c~0;~r_st~0 := 0; 1124#L630-1 assume 1 == ~e_e~0;~e_e~0 := 2; 1125#L635-1 assume 1 == ~e_f~0;~e_f~0 := 2; 1157#L640-1 assume 1 == ~e_g~0;~e_g~0 := 2; 1155#L645-1 assume 1 == ~e_c~0;~e_c~0 := 2; 1053#L650-1 assume !(1 == ~e_wl~0); 1054#L655-1 assume 0 == ~wl_st~0; 1057#L672-1 [2024-10-13 17:45:43,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:45:43,827 INFO L85 PathProgramCache]: Analyzing trace with hash 255605079, now seen corresponding path program 1 times [2024-10-13 17:45:43,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:45:43,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744022451] [2024-10-13 17:45:43,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:45:43,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:45:43,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:45:43,836 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:45:43,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:45:43,862 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:45:43,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:45:43,863 INFO L85 PathProgramCache]: Analyzing trace with hash -1401973316, now seen corresponding path program 2 times [2024-10-13 17:45:43,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:45:43,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115491361] [2024-10-13 17:45:43,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:45:43,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:45:43,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:45:43,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 17:45:43,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 17:45:43,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115491361] [2024-10-13 17:45:43,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [115491361] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 17:45:43,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 17:45:43,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 17:45:43,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796888606] [2024-10-13 17:45:43,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 17:45:43,888 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-13 17:45:43,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 17:45:43,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 17:45:43,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 17:45:43,889 INFO L87 Difference]: Start difference. First operand 124 states and 214 transitions. cyclomatic complexity: 91 Second operand has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 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) [2024-10-13 17:45:43,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 17:45:43,963 INFO L93 Difference]: Finished difference Result 180 states and 306 transitions. [2024-10-13 17:45:43,963 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 180 states and 306 transitions. [2024-10-13 17:45:43,965 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 149 [2024-10-13 17:45:43,966 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 180 states to 180 states and 306 transitions. [2024-10-13 17:45:43,967 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 180 [2024-10-13 17:45:43,967 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 180 [2024-10-13 17:45:43,967 INFO L73 IsDeterministic]: Start isDeterministic. Operand 180 states and 306 transitions. [2024-10-13 17:45:43,969 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-13 17:45:43,969 INFO L218 hiAutomatonCegarLoop]: Abstraction has 180 states and 306 transitions. [2024-10-13 17:45:43,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states and 306 transitions. [2024-10-13 17:45:43,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 180. [2024-10-13 17:45:43,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 180 states have (on average 1.7) internal successors, (306), 179 states have internal predecessors, (306), 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) [2024-10-13 17:45:43,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 306 transitions. [2024-10-13 17:45:43,976 INFO L240 hiAutomatonCegarLoop]: Abstraction has 180 states and 306 transitions. [2024-10-13 17:45:43,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 17:45:43,977 INFO L425 stractBuchiCegarLoop]: Abstraction has 180 states and 306 transitions. [2024-10-13 17:45:43,977 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-10-13 17:45:43,977 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 180 states and 306 transitions. [2024-10-13 17:45:43,978 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 149 [2024-10-13 17:45:43,978 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 17:45:43,978 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 17:45:43,979 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 17:45:43,979 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 17:45:43,979 INFO L745 eck$LassoCheckResult]: Stem: 1400#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 1401#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~0#1;havoc main_~__retres1~0#1;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; 1415#L404 assume !(1 == ~c_req_up~0); 1438#L404-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 1385#L415-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 1386#L420-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 1426#L425-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 1412#L430-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 1413#L435-1 assume !(0 == ~e_f~0); 1391#L440-1 assume !(0 == ~e_g~0); 1392#L445-1 assume !(0 == ~e_e~0); 1418#L450-1 assume !(0 == ~e_c~0); 1383#L455-1 assume !(0 == ~e_wl~0); 1384#L460-1 assume !(1 == ~wl_pc~0); 1453#$Ultimate##44 assume !(2 == ~wl_pc~0); 1429#L473 assume !(1 == ~c1_pc~0); 1465#L483 assume !(1 == ~c2_pc~0); 1373#L492 assume !(1 == ~wb_pc~0); 1417#L501 assume !(1 == ~e_c~0); 1399#L510-1 assume !(1 == ~e_e~0); 1387#L515-1 assume !(1 == ~e_f~0); 1370#L520-1 assume !(1 == ~e_g~0); 1371#L525-1 assume !(1 == ~e_c~0); 1419#L530-1 assume !(1 == ~e_wl~0); 1457#L672-1 [2024-10-13 17:45:43,979 INFO L747 eck$LassoCheckResult]: Loop: 1457#L672-1 assume !false; 1475#L542 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 1474#L377 assume !false; 1473#L295 assume !(0 == ~wl_st~0); 1351#L299 assume !(0 == ~c1_st~0); 1411#L302 assume !(0 == ~c2_st~0); 1441#L305 assume !(0 == ~wb_st~0); 1361#L308 assume !(0 == ~r_st~0); 1363#eval_returnLabel#1 havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; 1440#L548 assume !(1 == ~c_req_up~0); 1359#L548-2 start_simulation_~kernel_st~0#1 := 3; 1360#L560 assume 0 == ~e_f~0;~e_f~0 := 1; 1390#L560-2 assume 0 == ~e_g~0;~e_g~0 := 1; 1374#L565-1 assume 0 == ~e_e~0;~e_e~0 := 1; 1375#L570-1 assume 0 == ~e_c~0;~e_c~0 := 1; 1403#L575-1 assume !(0 == ~e_wl~0); 1404#L580-1 assume 1 == ~wl_pc~0; 1464#L586 assume 1 == ~e_wl~0;~wl_st~0 := 0; 1462#L593 assume !(1 == ~c1_pc~0); 1521#L603 assume !(1 == ~c2_pc~0); 1520#L612 assume !(1 == ~wb_pc~0); 1518#L621 assume 1 == ~e_c~0;~r_st~0 := 0; 1517#L630-1 assume 1 == ~e_e~0;~e_e~0 := 2; 1516#L635-1 assume 1 == ~e_f~0;~e_f~0 := 2; 1515#L640-1 assume 1 == ~e_g~0;~e_g~0 := 2; 1514#L645-1 assume 1 == ~e_c~0;~e_c~0 := 2; 1513#L650-1 assume !(1 == ~e_wl~0); 1511#L655-1 assume 0 == ~wl_st~0; 1457#L672-1 [2024-10-13 17:45:43,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:45:43,980 INFO L85 PathProgramCache]: Analyzing trace with hash 255605079, now seen corresponding path program 2 times [2024-10-13 17:45:43,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:45:43,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818040782] [2024-10-13 17:45:43,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:45:43,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:45:43,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:45:43,991 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:45:43,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:45:44,005 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:45:44,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:45:44,005 INFO L85 PathProgramCache]: Analyzing trace with hash -1951233037, now seen corresponding path program 3 times [2024-10-13 17:45:44,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:45:44,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141297008] [2024-10-13 17:45:44,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:45:44,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:45:44,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:45:44,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 17:45:44,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 17:45:44,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141297008] [2024-10-13 17:45:44,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141297008] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 17:45:44,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 17:45:44,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 17:45:44,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90466411] [2024-10-13 17:45:44,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 17:45:44,025 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-13 17:45:44,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 17:45:44,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 17:45:44,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 17:45:44,026 INFO L87 Difference]: Start difference. First operand 180 states and 306 transitions. cyclomatic complexity: 127 Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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) [2024-10-13 17:45:44,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 17:45:44,059 INFO L93 Difference]: Finished difference Result 335 states and 566 transitions. [2024-10-13 17:45:44,059 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 335 states and 566 transitions. [2024-10-13 17:45:44,061 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 288 [2024-10-13 17:45:44,063 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 335 states to 335 states and 566 transitions. [2024-10-13 17:45:44,063 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 335 [2024-10-13 17:45:44,063 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 335 [2024-10-13 17:45:44,063 INFO L73 IsDeterministic]: Start isDeterministic. Operand 335 states and 566 transitions. [2024-10-13 17:45:44,064 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-13 17:45:44,064 INFO L218 hiAutomatonCegarLoop]: Abstraction has 335 states and 566 transitions. [2024-10-13 17:45:44,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states and 566 transitions. [2024-10-13 17:45:44,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 333. [2024-10-13 17:45:44,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 333 states have (on average 1.6936936936936937) internal successors, (564), 332 states have internal predecessors, (564), 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) [2024-10-13 17:45:44,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 564 transitions. [2024-10-13 17:45:44,079 INFO L240 hiAutomatonCegarLoop]: Abstraction has 333 states and 564 transitions. [2024-10-13 17:45:44,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 17:45:44,081 INFO L425 stractBuchiCegarLoop]: Abstraction has 333 states and 564 transitions. [2024-10-13 17:45:44,082 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-10-13 17:45:44,082 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 333 states and 564 transitions. [2024-10-13 17:45:44,083 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 286 [2024-10-13 17:45:44,083 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 17:45:44,083 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 17:45:44,084 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 17:45:44,084 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 17:45:44,084 INFO L745 eck$LassoCheckResult]: Stem: 1925#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 1926#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~0#1;havoc main_~__retres1~0#1;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; 1943#L404 assume !(1 == ~c_req_up~0); 1965#L404-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 1907#L415-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 1908#L420-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 1952#L425-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 1938#L430-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 1939#L435-1 assume !(0 == ~e_f~0); 1913#L440-1 assume !(0 == ~e_g~0); 1914#L445-1 assume !(0 == ~e_e~0); 1944#L450-1 assume !(0 == ~e_c~0); 1904#L455-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 1905#L460-1 assume !(1 == ~wl_pc~0); 2152#$Ultimate##44 assume !(2 == ~wl_pc~0); 2007#L473 assume !(1 == ~c1_pc~0); 2070#L483 assume !(1 == ~c2_pc~0); 2061#L492 assume !(1 == ~wb_pc~0); 1954#L501 assume !(1 == ~e_c~0); 1923#L510-1 assume !(1 == ~e_e~0); 1909#L515-1 assume !(1 == ~e_f~0); 1891#L520-1 assume !(1 == ~e_g~0); 1892#L525-1 assume !(1 == ~e_c~0); 1945#L530-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 1987#L672-1 [2024-10-13 17:45:44,085 INFO L747 eck$LassoCheckResult]: Loop: 1987#L672-1 assume !false; 2014#L542 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 2015#L377 assume !false; 2084#L295 assume !(0 == ~wl_st~0); 1936#L299 assume !(0 == ~c1_st~0); 1937#L302 assume !(0 == ~c2_st~0); 1968#L305 assume !(0 == ~wb_st~0); 1882#L308 assume !(0 == ~r_st~0); 1884#eval_returnLabel#1 havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; 1967#L548 assume !(1 == ~c_req_up~0); 1880#L548-2 start_simulation_~kernel_st~0#1 := 3; 1881#L560 assume 0 == ~e_f~0;~e_f~0 := 1; 1912#L560-2 assume 0 == ~e_g~0;~e_g~0 := 1; 1901#L565-1 assume 0 == ~e_e~0;~e_e~0 := 1; 1902#L570-1 assume 0 == ~e_c~0;~e_c~0 := 1; 1931#L575-1 assume !(0 == ~e_wl~0); 1932#L580-1 assume 1 == ~wl_pc~0; 2004#L586 assume 1 == ~e_wl~0;~wl_st~0 := 0; 1997#L593 assume !(1 == ~c1_pc~0); 2039#L603 assume !(1 == ~c2_pc~0); 2038#L612 assume !(1 == ~wb_pc~0); 2036#L621 assume 1 == ~e_c~0;~r_st~0 := 0; 2034#L630-1 assume 1 == ~e_e~0;~e_e~0 := 2; 2031#L635-1 assume 1 == ~e_f~0;~e_f~0 := 2; 2028#L640-1 assume 1 == ~e_g~0;~e_g~0 := 2; 2025#L645-1 assume 1 == ~e_c~0;~e_c~0 := 2; 2022#L650-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 2019#L655-1 assume 0 == ~wl_st~0; 1987#L672-1 [2024-10-13 17:45:44,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:45:44,087 INFO L85 PathProgramCache]: Analyzing trace with hash -2560361, now seen corresponding path program 1 times [2024-10-13 17:45:44,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:45:44,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335454446] [2024-10-13 17:45:44,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:45:44,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:45:44,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:45:44,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 17:45:44,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 17:45:44,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335454446] [2024-10-13 17:45:44,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335454446] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 17:45:44,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 17:45:44,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 17:45:44,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138019946] [2024-10-13 17:45:44,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 17:45:44,144 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-13 17:45:44,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:45:44,144 INFO L85 PathProgramCache]: Analyzing trace with hash -1951233099, now seen corresponding path program 1 times [2024-10-13 17:45:44,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:45:44,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833637422] [2024-10-13 17:45:44,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:45:44,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:45:44,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:45:44,153 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:45:44,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:45:44,162 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:45:44,451 INFO L204 LassoAnalysis]: Preferences: [2024-10-13 17:45:44,452 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-13 17:45:44,452 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-13 17:45:44,452 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-13 17:45:44,452 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-10-13 17:45:44,452 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:45:44,453 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-13 17:45:44,453 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-13 17:45:44,453 INFO L132 ssoRankerPreferences]: Filename of dumped script: toy2.cil.c_Iteration7_Loop [2024-10-13 17:45:44,453 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-13 17:45:44,453 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-13 17:45:44,465 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:45:44,472 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:45:44,476 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:45:44,481 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:45:44,483 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:45:44,485 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:45:44,486 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:45:44,490 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:45:44,492 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:45:44,493 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:45:44,495 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:45:44,496 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:45:44,498 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:45:44,504 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:45:44,506 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:45:44,508 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:45:44,512 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:45:44,513 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:45:44,517 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:45:44,520 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:45:44,524 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:45:44,527 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:45:44,530 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:45:44,532 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:45:44,537 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:45:44,705 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-13 17:45:44,705 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-10-13 17:45:44,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:45:44,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:45:44,708 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:45:44,710 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2024-10-13 17:45:44,714 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-13 17:45:44,714 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-13 17:45:44,739 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-13 17:45:44,740 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~c2_st~0=-1} Honda state: {~c2_st~0=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-10-13 17:45:44,750 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2024-10-13 17:45:44,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:45:44,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:45:44,752 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:45:44,753 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2024-10-13 17:45:44,754 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-13 17:45:44,754 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-13 17:45:44,775 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2024-10-13 17:45:44,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:45:44,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:45:44,777 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:45:44,778 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2024-10-13 17:45:44,778 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-10-13 17:45:44,778 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-13 17:45:44,796 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-10-13 17:45:44,807 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2024-10-13 17:45:44,808 INFO L204 LassoAnalysis]: Preferences: [2024-10-13 17:45:44,808 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-13 17:45:44,808 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-13 17:45:44,808 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-13 17:45:44,808 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-13 17:45:44,808 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:45:44,808 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-13 17:45:44,808 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-13 17:45:44,808 INFO L132 ssoRankerPreferences]: Filename of dumped script: toy2.cil.c_Iteration7_Loop [2024-10-13 17:45:44,808 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-13 17:45:44,808 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-13 17:45:44,810 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:45:44,816 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:45:44,824 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:45:44,826 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:45:44,828 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:45:44,830 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:45:44,833 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:45:44,835 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:45:44,839 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:45:44,841 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:45:44,849 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:45:44,850 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:45:44,853 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:45:44,854 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:45:44,859 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:45:44,861 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:45:44,864 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:45:44,866 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:45:44,870 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:45:44,872 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:45:44,874 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:45:44,876 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:45:44,879 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:45:44,881 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:45:44,883 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:45:45,038 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-13 17:45:45,042 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-13 17:45:45,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:45:45,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:45:45,046 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:45:45,047 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2024-10-13 17:45:45,050 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 [2024-10-13 17:45:45,060 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:45:45,060 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:45:45,060 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:45:45,060 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2024-10-13 17:45:45,061 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:45:45,062 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2024-10-13 17:45:45,062 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:45:45,064 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:45:45,074 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2024-10-13 17:45:45,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:45:45,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:45:45,076 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:45:45,094 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2024-10-13 17:45:45,095 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 [2024-10-13 17:45:45,105 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:45:45,106 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:45:45,106 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:45:45,106 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:45:45,106 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:45:45,108 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:45:45,108 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:45:45,109 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-13 17:45:45,116 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-10-13 17:45:45,116 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-10-13 17:45:45,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:45:45,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:45:45,139 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:45:45,140 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2024-10-13 17:45:45,141 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-13 17:45:45,141 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-10-13 17:45:45,142 INFO L474 LassoAnalysis]: Proved termination. [2024-10-13 17:45:45,142 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(~e_c~0) = -1*~e_c~0 + 1 Supporting invariants [] [2024-10-13 17:45:45,153 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2024-10-13 17:45:45,156 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-10-13 17:45:45,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:45:45,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:45:45,208 INFO L255 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 17:45:45,209 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:45:45,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:45:45,261 INFO L255 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 17:45:45,262 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:45:45,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 17:45:45,342 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2024-10-13 17:45:45,343 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 333 states and 564 transitions. cyclomatic complexity: 232 Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 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) [2024-10-13 17:45:45,420 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 333 states and 564 transitions. cyclomatic complexity: 232. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 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 1203 states and 2018 transitions. Complement of second has 5 states. [2024-10-13 17:45:45,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2024-10-13 17:45:45,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 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) [2024-10-13 17:45:45,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 376 transitions. [2024-10-13 17:45:45,423 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 376 transitions. Stem has 24 letters. Loop has 28 letters. [2024-10-13 17:45:45,424 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 17:45:45,424 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 376 transitions. Stem has 52 letters. Loop has 28 letters. [2024-10-13 17:45:45,424 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 17:45:45,425 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 376 transitions. Stem has 24 letters. Loop has 56 letters. [2024-10-13 17:45:45,425 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 17:45:45,425 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1203 states and 2018 transitions. [2024-10-13 17:45:45,432 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 858 [2024-10-13 17:45:45,436 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1203 states to 1203 states and 2018 transitions. [2024-10-13 17:45:45,436 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 906 [2024-10-13 17:45:45,437 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 911 [2024-10-13 17:45:45,437 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1203 states and 2018 transitions. [2024-10-13 17:45:45,437 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 17:45:45,438 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1203 states and 2018 transitions. [2024-10-13 17:45:45,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1203 states and 2018 transitions. [2024-10-13 17:45:45,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1203 to 912. [2024-10-13 17:45:45,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 912 states, 912 states have (on average 1.6798245614035088) internal successors, (1532), 911 states have internal predecessors, (1532), 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) [2024-10-13 17:45:45,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 912 states to 912 states and 1532 transitions. [2024-10-13 17:45:45,455 INFO L240 hiAutomatonCegarLoop]: Abstraction has 912 states and 1532 transitions. [2024-10-13 17:45:45,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 17:45:45,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 17:45:45,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 17:45:45,456 INFO L87 Difference]: Start difference. First operand 912 states and 1532 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 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) [2024-10-13 17:45:45,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 17:45:45,535 INFO L93 Difference]: Finished difference Result 1522 states and 2526 transitions. [2024-10-13 17:45:45,535 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1522 states and 2526 transitions. [2024-10-13 17:45:45,542 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 1015 [2024-10-13 17:45:45,548 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1522 states to 1522 states and 2526 transitions. [2024-10-13 17:45:45,548 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1118 [2024-10-13 17:45:45,549 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1118 [2024-10-13 17:45:45,549 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1522 states and 2526 transitions. [2024-10-13 17:45:45,549 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 17:45:45,549 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1522 states and 2526 transitions. [2024-10-13 17:45:45,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1522 states and 2526 transitions. [2024-10-13 17:45:45,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1522 to 1469. [2024-10-13 17:45:45,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1469 states, 1469 states have (on average 1.6589516678012253) internal successors, (2437), 1468 states have internal predecessors, (2437), 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) [2024-10-13 17:45:45,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1469 states to 1469 states and 2437 transitions. [2024-10-13 17:45:45,567 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1469 states and 2437 transitions. [2024-10-13 17:45:45,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 17:45:45,572 INFO L425 stractBuchiCegarLoop]: Abstraction has 1469 states and 2437 transitions. [2024-10-13 17:45:45,572 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-10-13 17:45:45,572 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1469 states and 2437 transitions. [2024-10-13 17:45:45,577 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 1013 [2024-10-13 17:45:45,577 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 17:45:45,577 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 17:45:45,578 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 17:45:45,578 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 17:45:45,579 INFO L745 eck$LassoCheckResult]: Stem: 6118#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 6119#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~0#1;havoc main_~__retres1~0#1;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; 6148#L404 assume !(1 == ~c_req_up~0); 6191#L404-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 6088#L415-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 6089#L420-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 6165#L425-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 6142#L430-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 6143#L435-1 assume !(0 == ~e_f~0); 6099#L440-1 assume !(0 == ~e_g~0); 6100#L445-1 assume !(0 == ~e_e~0); 6151#L450-1 assume !(0 == ~e_c~0); 6086#L455-1 assume !(0 == ~e_wl~0); 6087#L460-1 assume !(1 == ~wl_pc~0); 6227#$Ultimate##44 assume !(2 == ~wl_pc~0); 6173#L473 assume !(1 == ~c1_pc~0); 6291#L483 assume !(1 == ~c2_pc~0); 6287#L492 assume !(1 == ~wb_pc~0); 6150#L501 assume !(1 == ~e_c~0); 6116#L510-1 assume !(1 == ~e_e~0); 6117#L515-1 assume 1 == ~e_f~0;~e_f~0 := 2; 6064#L520-1 assume !(1 == ~e_g~0); 6065#L525-1 assume !(1 == ~e_c~0); 6152#L530-1 assume !(1 == ~e_wl~0); 6196#L672-1 [2024-10-13 17:45:45,579 INFO L747 eck$LassoCheckResult]: Loop: 6196#L672-1 assume !false; 6030#L542 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 6031#L377 assume !false; 6297#L295 assume !(0 == ~wl_st~0); 7264#L299 assume !(0 == ~c1_st~0); 7263#L302 assume !(0 == ~c2_st~0); 7262#L305 assume !(0 == ~wb_st~0); 7260#L308 assume !(0 == ~r_st~0); 7259#eval_returnLabel#1 havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; 7257#L548 assume !(1 == ~c_req_up~0); 7256#L548-2 start_simulation_~kernel_st~0#1 := 3; 7255#L560 assume 0 == ~e_f~0;~e_f~0 := 1; 7130#L560-2 assume 0 == ~e_g~0;~e_g~0 := 1; 6080#L565-1 assume 0 == ~e_e~0;~e_e~0 := 1; 6081#L570-1 assume 0 == ~e_c~0;~e_c~0 := 1; 6969#L575-1 assume !(0 == ~e_wl~0); 6898#L580-1 assume 1 == ~wl_pc~0; 6964#L586 assume 1 == ~e_wl~0;~wl_st~0 := 0; 6235#L593 assume !(1 == ~c1_pc~0); 6162#L603 assume !(1 == ~c2_pc~0); 6014#L612 assume !(1 == ~wb_pc~0); 6016#L621 assume 1 == ~e_c~0;~r_st~0 := 0; 6970#L630-1 assume 1 == ~e_e~0;~e_e~0 := 2; 6925#L635-1 assume 1 == ~e_f~0;~e_f~0 := 2; 6924#L640-1 assume 1 == ~e_g~0;~e_g~0 := 2; 6922#L645-1 assume 1 == ~e_c~0;~e_c~0 := 2; 6921#L650-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 6899#L655-1 assume 0 == ~wl_st~0; 6196#L672-1 [2024-10-13 17:45:45,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:45:45,579 INFO L85 PathProgramCache]: Analyzing trace with hash 255545497, now seen corresponding path program 1 times [2024-10-13 17:45:45,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:45:45,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515775290] [2024-10-13 17:45:45,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:45:45,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:45:45,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:45:45,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 17:45:45,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 17:45:45,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515775290] [2024-10-13 17:45:45,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515775290] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 17:45:45,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 17:45:45,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 17:45:45,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855811664] [2024-10-13 17:45:45,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 17:45:45,625 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-13 17:45:45,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:45:45,625 INFO L85 PathProgramCache]: Analyzing trace with hash -1951233099, now seen corresponding path program 2 times [2024-10-13 17:45:45,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:45:45,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100008187] [2024-10-13 17:45:45,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:45:45,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:45:45,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:45:45,630 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:45:45,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:45:45,634 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:45:45,821 INFO L204 LassoAnalysis]: Preferences: [2024-10-13 17:45:45,822 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-13 17:45:45,822 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-13 17:45:45,822 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-13 17:45:45,822 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-10-13 17:45:45,822 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:45:45,822 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-13 17:45:45,822 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-13 17:45:45,822 INFO L132 ssoRankerPreferences]: Filename of dumped script: toy2.cil.c_Iteration8_Loop [2024-10-13 17:45:45,822 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-13 17:45:45,822 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-13 17:45:45,824 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:45:45,826 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:45:45,828 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:45:45,829 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:45:45,831 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:45:45,835 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:45:45,837 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:45:45,841 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:45:45,842 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:45:45,846 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:45:45,849 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:45:45,851 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:45:45,852 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:45:45,856 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:45:45,858 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:45:45,859 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:45:45,861 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:45:45,863 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:45:45,864 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:45:45,866 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:45:45,870 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:45:45,872 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:45:45,874 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:45:45,877 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:45:45,880 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:45:45,990 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2024-10-13 17:45:46,064 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-13 17:45:46,064 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-10-13 17:45:46,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:45:46,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:45:46,068 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:45:46,069 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2024-10-13 17:45:46,070 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-13 17:45:46,070 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-13 17:45:46,088 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-13 17:45:46,088 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~c2_st~0=-1} Honda state: {~c2_st~0=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-10-13 17:45:46,099 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2024-10-13 17:45:46,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:45:46,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:45:46,101 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:45:46,101 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2024-10-13 17:45:46,102 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-13 17:45:46,102 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-13 17:45:46,113 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-13 17:45:46,113 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_#t~nondet6#1=0} Honda state: {ULTIMATE.start_eval_#t~nondet6#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-10-13 17:45:46,123 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2024-10-13 17:45:46,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:45:46,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:45:46,124 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:45:46,125 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2024-10-13 17:45:46,126 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-13 17:45:46,126 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-13 17:45:46,136 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-13 17:45:46,136 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_#t~nondet8#1=0} Honda state: {ULTIMATE.start_eval_#t~nondet8#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-10-13 17:45:46,146 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2024-10-13 17:45:46,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:45:46,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:45:46,147 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:45:46,148 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2024-10-13 17:45:46,149 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-13 17:45:46,149 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-13 17:45:46,166 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-13 17:45:46,166 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~c1_st~0=4} Honda state: {~c1_st~0=4} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-10-13 17:45:46,176 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2024-10-13 17:45:46,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:45:46,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:45:46,178 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:45:46,179 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2024-10-13 17:45:46,180 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-13 17:45:46,180 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-13 17:45:46,200 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2024-10-13 17:45:46,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:45:46,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:45:46,202 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:45:46,203 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2024-10-13 17:45:46,204 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-10-13 17:45:46,204 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-13 17:45:46,215 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-10-13 17:45:46,225 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2024-10-13 17:45:46,225 INFO L204 LassoAnalysis]: Preferences: [2024-10-13 17:45:46,226 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-13 17:45:46,226 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-13 17:45:46,226 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-13 17:45:46,226 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-13 17:45:46,226 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:45:46,226 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-13 17:45:46,226 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-13 17:45:46,226 INFO L132 ssoRankerPreferences]: Filename of dumped script: toy2.cil.c_Iteration8_Loop [2024-10-13 17:45:46,226 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-13 17:45:46,226 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-13 17:45:46,228 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:45:46,233 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:45:46,234 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:45:46,235 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:45:46,237 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:45:46,241 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:45:46,243 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:45:46,246 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:45:46,248 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:45:46,251 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:45:46,253 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:45:46,256 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:45:46,257 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:45:46,259 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:45:46,262 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:45:46,264 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:45:46,265 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:45:46,267 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:45:46,269 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:45:46,272 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:45:46,274 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:45:46,275 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:45:46,277 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:45:46,279 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:45:46,282 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:45:46,430 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-13 17:45:46,430 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-13 17:45:46,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:45:46,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:45:46,432 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:45:46,433 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2024-10-13 17:45:46,434 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 [2024-10-13 17:45:46,443 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:45:46,443 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:45:46,444 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:45:46,444 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2024-10-13 17:45:46,444 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:45:46,445 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2024-10-13 17:45:46,445 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:45:46,446 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:45:46,457 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2024-10-13 17:45:46,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:45:46,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:45:46,458 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:45:46,459 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2024-10-13 17:45:46,461 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 [2024-10-13 17:45:46,471 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:45:46,471 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:45:46,471 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:45:46,471 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:45:46,471 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:45:46,472 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:45:46,472 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:45:46,473 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:45:46,483 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2024-10-13 17:45:46,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:45:46,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:45:46,486 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:45:46,488 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2024-10-13 17:45:46,489 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 [2024-10-13 17:45:46,499 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:45:46,500 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:45:46,500 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:45:46,500 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:45:46,500 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:45:46,501 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:45:46,501 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:45:46,502 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:45:46,512 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2024-10-13 17:45:46,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:45:46,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:45:46,516 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:45:46,517 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2024-10-13 17:45:46,518 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 [2024-10-13 17:45:46,527 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:45:46,528 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:45:46,528 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:45:46,528 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2024-10-13 17:45:46,528 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:45:46,529 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2024-10-13 17:45:46,529 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:45:46,531 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:45:46,544 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2024-10-13 17:45:46,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:45:46,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:45:46,545 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:45:46,546 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2024-10-13 17:45:46,547 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 [2024-10-13 17:45:46,556 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:45:46,556 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:45:46,557 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:45:46,557 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:45:46,557 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:45:46,557 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:45:46,558 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:45:46,559 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-13 17:45:46,561 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-10-13 17:45:46,561 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-10-13 17:45:46,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:45:46,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:45:46,563 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:45:46,564 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2024-10-13 17:45:46,564 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-13 17:45:46,564 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-10-13 17:45:46,564 INFO L474 LassoAnalysis]: Proved termination. [2024-10-13 17:45:46,565 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(~e_c~0) = -1*~e_c~0 + 1 Supporting invariants [] [2024-10-13 17:45:46,575 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2024-10-13 17:45:46,580 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-10-13 17:45:46,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:45:46,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:45:46,614 INFO L255 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 17:45:46,615 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:45:46,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:45:46,646 INFO L255 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 17:45:46,646 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:45:46,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 17:45:46,704 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2024-10-13 17:45:46,704 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1469 states and 2437 transitions. cyclomatic complexity: 973 Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 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) [2024-10-13 17:45:46,748 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1469 states and 2437 transitions. cyclomatic complexity: 973. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 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 3132 states and 5186 transitions. Complement of second has 5 states. [2024-10-13 17:45:46,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2024-10-13 17:45:46,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 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) [2024-10-13 17:45:46,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 374 transitions. [2024-10-13 17:45:46,750 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 374 transitions. Stem has 24 letters. Loop has 28 letters. [2024-10-13 17:45:46,751 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 17:45:46,751 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 374 transitions. Stem has 52 letters. Loop has 28 letters. [2024-10-13 17:45:46,751 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 17:45:46,751 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 374 transitions. Stem has 24 letters. Loop has 56 letters. [2024-10-13 17:45:46,752 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 17:45:46,752 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3132 states and 5186 transitions. [2024-10-13 17:45:46,767 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 2026 [2024-10-13 17:45:46,778 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3132 states to 3132 states and 5186 transitions. [2024-10-13 17:45:46,778 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2087 [2024-10-13 17:45:46,779 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2096 [2024-10-13 17:45:46,779 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3132 states and 5186 transitions. [2024-10-13 17:45:46,780 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 17:45:46,780 INFO L218 hiAutomatonCegarLoop]: Abstraction has 3132 states and 5186 transitions. [2024-10-13 17:45:46,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3132 states and 5186 transitions. [2024-10-13 17:45:46,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3132 to 1927. [2024-10-13 17:45:46,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1927 states, 1927 states have (on average 1.6564608199273483) internal successors, (3192), 1926 states have internal predecessors, (3192), 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) [2024-10-13 17:45:46,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1927 states to 1927 states and 3192 transitions. [2024-10-13 17:45:46,807 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1927 states and 3192 transitions. [2024-10-13 17:45:46,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 17:45:46,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 17:45:46,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 17:45:46,807 INFO L87 Difference]: Start difference. First operand 1927 states and 3192 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 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) [2024-10-13 17:45:46,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 17:45:46,890 INFO L93 Difference]: Finished difference Result 3375 states and 5492 transitions. [2024-10-13 17:45:46,890 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3375 states and 5492 transitions. [2024-10-13 17:45:46,903 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 1952 [2024-10-13 17:45:46,913 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3375 states to 3375 states and 5492 transitions. [2024-10-13 17:45:46,913 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2068 [2024-10-13 17:45:46,915 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2068 [2024-10-13 17:45:46,915 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3375 states and 5492 transitions. [2024-10-13 17:45:46,915 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 17:45:46,915 INFO L218 hiAutomatonCegarLoop]: Abstraction has 3375 states and 5492 transitions. [2024-10-13 17:45:46,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3375 states and 5492 transitions. [2024-10-13 17:45:46,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3375 to 3342. [2024-10-13 17:45:46,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3342 states, 3342 states have (on average 1.6334530221424297) internal successors, (5459), 3341 states have internal predecessors, (5459), 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) [2024-10-13 17:45:46,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3342 states to 3342 states and 5459 transitions. [2024-10-13 17:45:46,958 INFO L240 hiAutomatonCegarLoop]: Abstraction has 3342 states and 5459 transitions. [2024-10-13 17:45:46,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 17:45:46,959 INFO L425 stractBuchiCegarLoop]: Abstraction has 3342 states and 5459 transitions. [2024-10-13 17:45:46,959 INFO L332 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2024-10-13 17:45:46,976 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3342 states and 5459 transitions. [2024-10-13 17:45:46,988 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 1946 [2024-10-13 17:45:46,991 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 17:45:46,991 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 17:45:46,992 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 17:45:46,995 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 17:45:46,995 INFO L745 eck$LassoCheckResult]: Stem: 16202#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 16203#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~0#1;havoc main_~__retres1~0#1;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; 16235#L404 assume !(1 == ~c_req_up~0); 16284#L404-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 16285#L415-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 16256#L420-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 16257#L425-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 16230#L430-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 16231#L435-1 assume !(0 == ~e_f~0); 16183#L440-1 assume !(0 == ~e_g~0); 16184#L445-1 assume !(0 == ~e_e~0); 16246#L450-1 assume 0 == ~e_c~0;~e_c~0 := 1; 16171#L455-1 assume !(0 == ~e_wl~0); 16172#L460-1 assume !(1 == ~wl_pc~0); 16358#$Ultimate##44 assume !(2 == ~wl_pc~0); 16266#L473 assume !(1 == ~c1_pc~0); 16371#L483 assume !(1 == ~c2_pc~0); 16152#L492 assume !(1 == ~wb_pc~0); 16263#L501 assume !(1 == ~e_c~0); 16264#L510-1 assume !(1 == ~e_e~0); 16422#L515-1 assume !(1 == ~e_f~0); 16423#L520-1 assume !(1 == ~e_g~0); 16418#L525-1 assume !(1 == ~e_c~0); 16419#L530-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 16340#L672-1 assume !false; 16440#L542 [2024-10-13 17:45:46,995 INFO L747 eck$LassoCheckResult]: Loop: 16440#L542 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 18351#L377 assume !false; 18352#L295 assume !(0 == ~wl_st~0); 18748#L299 assume !(0 == ~c1_st~0); 18747#L302 assume !(0 == ~c2_st~0); 18746#L305 assume !(0 == ~wb_st~0); 18094#L308 assume !(0 == ~r_st~0); 16347#eval_returnLabel#1 havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; 16348#L548 assume !(1 == ~c_req_up~0); 18470#L548-2 start_simulation_~kernel_st~0#1 := 3; 18471#L560 assume !(0 == ~e_f~0); 18744#L560-2 assume 0 == ~e_g~0;~e_g~0 := 1; 18737#L565-1 assume 0 == ~e_e~0;~e_e~0 := 1; 18738#L570-1 assume !(0 == ~e_c~0); 18728#L575-1 assume !(0 == ~e_wl~0); 18726#L580-1 assume 1 == ~wl_pc~0; 18724#L586 assume 1 == ~e_wl~0;~wl_st~0 := 0; 18725#L593 assume !(1 == ~c1_pc~0); 18860#L603 assume !(1 == ~c2_pc~0); 18857#L612 assume !(1 == ~wb_pc~0); 18854#L621 assume 1 == ~e_c~0;~r_st~0 := 0; 18852#L630-1 assume 1 == ~e_e~0;~e_e~0 := 2; 18850#L635-1 assume !(1 == ~e_f~0); 18847#L640-1 assume 1 == ~e_g~0;~e_g~0 := 2; 18845#L645-1 assume !(1 == ~e_c~0); 18844#L650-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 17610#L655-1 assume 0 == ~wl_st~0; 18841#L672-1 assume !false; 16440#L542 [2024-10-13 17:45:46,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:45:46,996 INFO L85 PathProgramCache]: Analyzing trace with hash 344940224, now seen corresponding path program 1 times [2024-10-13 17:45:46,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:45:46,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467318484] [2024-10-13 17:45:46,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:45:46,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:45:46,998 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2024-10-13 17:45:47,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:45:47,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 17:45:47,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 17:45:47,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467318484] [2024-10-13 17:45:47,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467318484] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 17:45:47,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 17:45:47,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 17:45:47,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083139329] [2024-10-13 17:45:47,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 17:45:47,026 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-13 17:45:47,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:45:47,026 INFO L85 PathProgramCache]: Analyzing trace with hash 1890226441, now seen corresponding path program 1 times [2024-10-13 17:45:47,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:45:47,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681425106] [2024-10-13 17:45:47,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:45:47,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:45:47,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:45:47,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 17:45:47,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 17:45:47,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681425106] [2024-10-13 17:45:47,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681425106] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 17:45:47,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 17:45:47,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 17:45:47,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906963481] [2024-10-13 17:45:47,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 17:45:47,040 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-13 17:45:47,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 17:45:47,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 17:45:47,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 17:45:47,041 INFO L87 Difference]: Start difference. First operand 3342 states and 5459 transitions. cyclomatic complexity: 2132 Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 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) [2024-10-13 17:45:47,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 17:45:47,103 INFO L93 Difference]: Finished difference Result 3395 states and 5500 transitions. [2024-10-13 17:45:47,103 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3395 states and 5500 transitions. [2024-10-13 17:45:47,115 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 1979 [2024-10-13 17:45:47,126 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3395 states to 3395 states and 5500 transitions. [2024-10-13 17:45:47,126 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2098 [2024-10-13 17:45:47,127 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2098 [2024-10-13 17:45:47,127 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3395 states and 5500 transitions. [2024-10-13 17:45:47,127 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 17:45:47,127 INFO L218 hiAutomatonCegarLoop]: Abstraction has 3395 states and 5500 transitions. [2024-10-13 17:45:47,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3395 states and 5500 transitions. [2024-10-13 17:45:47,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3395 to 3141. [2024-10-13 17:45:47,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3141 states, 3141 states have (on average 1.6275071633237823) internal successors, (5112), 3140 states have internal predecessors, (5112), 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) [2024-10-13 17:45:47,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3141 states to 3141 states and 5112 transitions. [2024-10-13 17:45:47,166 INFO L240 hiAutomatonCegarLoop]: Abstraction has 3141 states and 5112 transitions. [2024-10-13 17:45:47,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 17:45:47,166 INFO L425 stractBuchiCegarLoop]: Abstraction has 3141 states and 5112 transitions. [2024-10-13 17:45:47,167 INFO L332 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2024-10-13 17:45:47,167 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3141 states and 5112 transitions. [2024-10-13 17:45:47,172 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 1979 [2024-10-13 17:45:47,172 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 17:45:47,172 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 17:45:47,173 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 17:45:47,173 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 17:45:47,173 INFO L745 eck$LassoCheckResult]: Stem: 22950#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 22951#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~0#1;havoc main_~__retres1~0#1;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; 22980#L404 assume !(1 == ~c_req_up~0); 23044#L404-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 22919#L415-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 22920#L420-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 23077#L425-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 22975#L430-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 22976#L435-1 assume !(0 == ~e_f~0); 22930#L440-1 assume !(0 == ~e_g~0); 22931#L445-1 assume !(0 == ~e_e~0); 22991#L450-1 assume !(0 == ~e_c~0); 22917#L455-1 assume !(0 == ~e_wl~0); 22918#L460-1 assume !(1 == ~wl_pc~0); 23086#$Ultimate##44 assume !(2 == ~wl_pc~0); 23010#L473 assume !(1 == ~c1_pc~0); 23157#L483 assume !(1 == ~c2_pc~0); 23156#L492 assume !(1 == ~wb_pc~0); 23150#L501 assume !(1 == ~e_c~0); 23151#L510-1 assume !(1 == ~e_e~0); 22921#L515-1 assume !(1 == ~e_f~0); 22922#L520-1 assume !(1 == ~e_g~0); 22985#L525-1 assume !(1 == ~e_c~0); 22986#L530-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 23074#L672-1 assume !false; 25327#L542 [2024-10-13 17:45:47,173 INFO L747 eck$LassoCheckResult]: Loop: 25327#L542 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 25326#L377 assume !false; 25325#L295 assume !(0 == ~wl_st~0); 24890#L299 assume !(0 == ~c1_st~0); 24884#L302 assume !(0 == ~c2_st~0); 24885#L305 assume !(0 == ~wb_st~0); 24876#L308 assume !(0 == ~r_st~0); 24878#eval_returnLabel#1 havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; 24546#L548 assume !(1 == ~c_req_up~0); 24547#L548-2 start_simulation_~kernel_st~0#1 := 3; 22927#L560 assume !(0 == ~e_f~0); 22928#L560-2 assume 0 == ~e_g~0;~e_g~0 := 1; 23087#L565-1 assume 0 == ~e_e~0;~e_e~0 := 1; 25820#L570-1 assume !(0 == ~e_c~0); 25415#L575-1 assume !(0 == ~e_wl~0); 25412#L580-1 assume 1 == ~wl_pc~0; 25411#L586 assume 1 == ~e_wl~0;~wl_st~0 := 0; 23093#L593 assume !(1 == ~c1_pc~0); 25398#L603 assume !(1 == ~c2_pc~0); 25393#L612 assume !(1 == ~wb_pc~0); 25387#L621 assume !(1 == ~e_c~0); 25384#L630-1 assume 1 == ~e_e~0;~e_e~0 := 2; 25381#L635-1 assume !(1 == ~e_f~0); 25378#L640-1 assume 1 == ~e_g~0;~e_g~0 := 2; 25374#L645-1 assume !(1 == ~e_c~0); 25369#L650-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 25360#L655-1 assume 0 == ~wl_st~0; 25358#L672-1 assume !false; 25327#L542 [2024-10-13 17:45:47,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:45:47,174 INFO L85 PathProgramCache]: Analyzing trace with hash -666177026, now seen corresponding path program 1 times [2024-10-13 17:45:47,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:45:47,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137252168] [2024-10-13 17:45:47,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:45:47,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:45:47,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:45:47,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 17:45:47,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 17:45:47,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137252168] [2024-10-13 17:45:47,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137252168] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 17:45:47,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 17:45:47,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 17:45:47,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511154713] [2024-10-13 17:45:47,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 17:45:47,198 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-13 17:45:47,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:45:47,198 INFO L85 PathProgramCache]: Analyzing trace with hash 1080879815, now seen corresponding path program 1 times [2024-10-13 17:45:47,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:45:47,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022143422] [2024-10-13 17:45:47,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:45:47,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:45:47,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:45:47,202 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:45:47,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:45:47,205 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:45:47,365 INFO L204 LassoAnalysis]: Preferences: [2024-10-13 17:45:47,365 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-13 17:45:47,366 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-13 17:45:47,366 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-13 17:45:47,366 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-10-13 17:45:47,366 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:45:47,366 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-13 17:45:47,366 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-13 17:45:47,366 INFO L132 ssoRankerPreferences]: Filename of dumped script: toy2.cil.c_Iteration10_Loop [2024-10-13 17:45:47,366 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-13 17:45:47,366 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-13 17:45:47,367 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:45:47,369 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:45:47,370 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:45:47,372 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:45:47,376 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:45:47,378 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:45:47,380 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:45:47,381 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:45:47,383 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:45:47,387 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:45:47,390 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:45:47,392 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:45:47,395 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:45:47,397 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:45:47,398 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:45:47,402 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:45:47,403 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:45:47,405 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:45:47,406 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:45:47,408 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:45:47,411 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:45:47,414 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:45:47,415 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:45:47,417 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:45:47,418 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:45:47,569 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-13 17:45:47,569 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-10-13 17:45:47,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:45:47,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:45:47,573 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:45:47,575 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-13 17:45:47,575 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-13 17:45:47,579 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2024-10-13 17:45:47,587 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-13 17:45:47,587 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_#t~nondet4#1=0} Honda state: {ULTIMATE.start_eval_#t~nondet4#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-10-13 17:45:47,600 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2024-10-13 17:45:47,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:45:47,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:45:47,601 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:45:47,602 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2024-10-13 17:45:47,604 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-13 17:45:47,604 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-13 17:45:47,615 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-13 17:45:47,615 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_~tmp~0#1=0} Honda state: {ULTIMATE.start_eval_~tmp~0#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-10-13 17:45:47,625 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2024-10-13 17:45:47,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:45:47,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:45:47,626 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:45:47,627 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2024-10-13 17:45:47,628 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-13 17:45:47,628 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-13 17:45:47,645 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-13 17:45:47,645 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~r_st~0=-1} Honda state: {~r_st~0=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-10-13 17:45:47,655 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2024-10-13 17:45:47,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:45:47,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:45:47,657 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:45:47,657 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2024-10-13 17:45:47,658 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-13 17:45:47,658 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-13 17:45:47,679 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2024-10-13 17:45:47,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:45:47,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:45:47,680 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:45:47,681 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2024-10-13 17:45:47,681 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-10-13 17:45:47,681 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-13 17:45:47,694 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-10-13 17:45:47,704 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2024-10-13 17:45:47,704 INFO L204 LassoAnalysis]: Preferences: [2024-10-13 17:45:47,705 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-13 17:45:47,705 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-13 17:45:47,705 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-13 17:45:47,705 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-13 17:45:47,705 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:45:47,705 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-13 17:45:47,705 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-13 17:45:47,705 INFO L132 ssoRankerPreferences]: Filename of dumped script: toy2.cil.c_Iteration10_Loop [2024-10-13 17:45:47,705 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-13 17:45:47,705 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-13 17:45:47,706 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:45:47,708 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:45:47,710 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:45:47,718 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:45:47,721 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:45:47,723 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:45:47,725 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:45:47,726 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:45:47,727 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:45:47,730 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:45:47,732 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:45:47,734 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:45:47,737 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:45:47,740 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:45:47,745 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:45:47,746 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:45:47,749 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:45:47,750 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:45:47,751 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:45:47,753 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:45:47,755 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:45:47,757 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:45:47,760 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:45:47,762 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:45:47,763 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:45:47,897 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-13 17:45:47,897 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-13 17:45:47,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:45:47,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:45:47,900 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:45:47,901 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2024-10-13 17:45:47,902 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 [2024-10-13 17:45:47,912 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:45:47,913 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:45:47,914 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:45:47,914 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:45:47,914 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:45:47,914 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:45:47,914 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:45:47,918 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:45:47,930 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2024-10-13 17:45:47,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:45:47,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:45:47,932 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:45:47,933 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2024-10-13 17:45:47,934 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 [2024-10-13 17:45:47,943 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:45:47,944 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:45:47,944 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:45:47,944 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:45:47,944 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:45:47,946 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:45:47,946 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:45:47,947 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:45:47,957 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2024-10-13 17:45:47,958 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:45:47,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:45:47,959 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:45:47,959 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2024-10-13 17:45:47,960 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 [2024-10-13 17:45:47,969 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:45:47,969 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:45:47,969 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:45:47,969 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2024-10-13 17:45:47,969 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:45:47,970 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2024-10-13 17:45:47,970 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:45:47,972 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:45:47,981 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2024-10-13 17:45:47,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:45:47,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:45:47,982 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:45:47,983 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2024-10-13 17:45:47,984 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 [2024-10-13 17:45:47,994 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:45:47,994 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:45:47,994 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:45:47,995 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:45:47,995 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:45:47,996 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:45:47,996 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:45:47,998 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-13 17:45:47,999 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-10-13 17:45:47,999 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-10-13 17:45:48,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:45:48,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:45:48,001 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:45:48,025 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2024-10-13 17:45:48,025 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-13 17:45:48,026 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-10-13 17:45:48,026 INFO L474 LassoAnalysis]: Proved termination. [2024-10-13 17:45:48,026 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(~e_e~0) = -1*~e_e~0 + 1 Supporting invariants [] [2024-10-13 17:45:48,037 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2024-10-13 17:45:48,037 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-10-13 17:45:48,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:45:48,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:45:48,080 INFO L255 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 17:45:48,080 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:45:48,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:45:48,119 INFO L255 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 17:45:48,119 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:45:48,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 17:45:48,177 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2024-10-13 17:45:48,178 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 3141 states and 5112 transitions. cyclomatic complexity: 1984 Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 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) [2024-10-13 17:45:48,217 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 3141 states and 5112 transitions. cyclomatic complexity: 1984. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 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 6730 states and 10970 transitions. Complement of second has 5 states. [2024-10-13 17:45:48,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2024-10-13 17:45:48,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 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) [2024-10-13 17:45:48,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 204 transitions. [2024-10-13 17:45:48,218 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 204 transitions. Stem has 25 letters. Loop has 28 letters. [2024-10-13 17:45:48,218 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 17:45:48,218 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 204 transitions. Stem has 53 letters. Loop has 28 letters. [2024-10-13 17:45:48,218 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 17:45:48,218 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 204 transitions. Stem has 25 letters. Loop has 56 letters. [2024-10-13 17:45:48,219 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 17:45:48,219 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 6730 states and 10970 transitions. [2024-10-13 17:45:48,239 INFO L131 ngComponentsAnalysis]: Automaton has 15 accepting balls. 3115 [2024-10-13 17:45:48,264 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 6730 states to 6730 states and 10970 transitions. [2024-10-13 17:45:48,264 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3227 [2024-10-13 17:45:48,266 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3262 [2024-10-13 17:45:48,266 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6730 states and 10970 transitions. [2024-10-13 17:45:48,266 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 17:45:48,266 INFO L218 hiAutomatonCegarLoop]: Abstraction has 6730 states and 10970 transitions. [2024-10-13 17:45:48,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6730 states and 10970 transitions. [2024-10-13 17:45:48,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6730 to 6695. [2024-10-13 17:45:48,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6695 states, 6695 states have (on average 1.6298730395817775) internal successors, (10912), 6694 states have internal predecessors, (10912), 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) [2024-10-13 17:45:48,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6695 states to 6695 states and 10912 transitions. [2024-10-13 17:45:48,349 INFO L240 hiAutomatonCegarLoop]: Abstraction has 6695 states and 10912 transitions. [2024-10-13 17:45:48,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 17:45:48,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 17:45:48,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 17:45:48,351 INFO L87 Difference]: Start difference. First operand 6695 states and 10912 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 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) [2024-10-13 17:45:48,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 17:45:48,421 INFO L93 Difference]: Finished difference Result 7180 states and 11526 transitions. [2024-10-13 17:45:48,421 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 7180 states and 11526 transitions. [2024-10-13 17:45:48,438 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 2859 [2024-10-13 17:45:48,455 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 7180 states to 7180 states and 11526 transitions. [2024-10-13 17:45:48,455 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2935 [2024-10-13 17:45:48,457 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2935 [2024-10-13 17:45:48,457 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7180 states and 11526 transitions. [2024-10-13 17:45:48,457 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 17:45:48,457 INFO L218 hiAutomatonCegarLoop]: Abstraction has 7180 states and 11526 transitions. [2024-10-13 17:45:48,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7180 states and 11526 transitions. [2024-10-13 17:45:48,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7180 to 7168. [2024-10-13 17:45:48,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7168 states, 7168 states have (on average 1.6063058035714286) internal successors, (11514), 7167 states have internal predecessors, (11514), 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) [2024-10-13 17:45:48,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7168 states to 7168 states and 11514 transitions. [2024-10-13 17:45:48,579 INFO L240 hiAutomatonCegarLoop]: Abstraction has 7168 states and 11514 transitions. [2024-10-13 17:45:48,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 17:45:48,581 INFO L425 stractBuchiCegarLoop]: Abstraction has 7168 states and 11514 transitions. [2024-10-13 17:45:48,581 INFO L332 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2024-10-13 17:45:48,581 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7168 states and 11514 transitions. [2024-10-13 17:45:48,583 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2024-10-13 17:45:48,594 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 2859 [2024-10-13 17:45:48,594 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 17:45:48,594 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 17:45:48,595 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 17:45:48,596 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 17:45:48,596 INFO L745 eck$LassoCheckResult]: Stem: 46881#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 46882#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~0#1;havoc main_~__retres1~0#1;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; 46917#L404 assume !(1 == ~c_req_up~0); 46965#L404-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 46849#L415-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 46850#L420-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 47017#L425-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 46909#L430-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 46910#L435-1 assume !(0 == ~e_f~0); 46861#L440-1 assume !(0 == ~e_g~0); 46862#L445-1 assume !(0 == ~e_e~0); 46920#L450-1 assume !(0 == ~e_c~0); 46847#L455-1 assume !(0 == ~e_wl~0); 46848#L460-1 assume !(1 == ~wl_pc~0); 47002#$Ultimate##44 assume !(2 == ~wl_pc~0); 46947#L473 assume !(1 == ~c1_pc~0); 47042#L483 assume !(1 == ~c2_pc~0); 46827#L492 assume !(1 == ~wb_pc~0); 46942#L501 assume !(1 == ~e_c~0); 46943#L510-1 assume !(1 == ~e_e~0); 46851#L515-1 assume !(1 == ~e_f~0); 46852#L520-1 assume !(1 == ~e_g~0); 46921#L525-1 assume !(1 == ~e_c~0); 46922#L530-1 assume !(1 == ~e_wl~0); 47014#L672-1 assume !false; 49051#L542 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 51668#L377 [2024-10-13 17:45:48,597 INFO L747 eck$LassoCheckResult]: Loop: 51668#L377 assume !false; 51666#L295 assume 0 == ~wl_st~0; 51663#L308-1 assume 0 == ~wl_st~0;havoc eval_#t~nondet4#1;eval_~tmp~0#1 := eval_#t~nondet4#1;havoc eval_#t~nondet4#1; 51664#L321 assume !(0 != eval_~tmp~0#1); 51801#L317 assume !(0 == ~c1_st~0); 51794#L332 assume !(0 == ~c2_st~0); 51005#L347 assume !(0 == ~wb_st~0); 51002#L362 assume !(0 == ~r_st~0); 51668#L377 [2024-10-13 17:45:48,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:45:48,597 INFO L85 PathProgramCache]: Analyzing trace with hash 823350777, now seen corresponding path program 1 times [2024-10-13 17:45:48,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:45:48,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245532454] [2024-10-13 17:45:48,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:45:48,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:45:48,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:45:48,603 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:45:48,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:45:48,613 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:45:48,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:45:48,613 INFO L85 PathProgramCache]: Analyzing trace with hash 1279860915, now seen corresponding path program 1 times [2024-10-13 17:45:48,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:45:48,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998456619] [2024-10-13 17:45:48,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:45:48,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:45:48,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:45:48,616 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:45:48,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:45:48,617 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:45:48,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:45:48,617 INFO L85 PathProgramCache]: Analyzing trace with hash 360906411, now seen corresponding path program 1 times [2024-10-13 17:45:48,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:45:48,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597040126] [2024-10-13 17:45:48,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:45:48,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:45:48,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:45:48,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 17:45:48,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 17:45:48,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597040126] [2024-10-13 17:45:48,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597040126] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 17:45:48,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 17:45:48,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 17:45:48,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700216883] [2024-10-13 17:45:48,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 17:45:48,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 17:45:48,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 17:45:48,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 17:45:48,668 INFO L87 Difference]: Start difference. First operand 7168 states and 11514 transitions. cyclomatic complexity: 4382 Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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) [2024-10-13 17:45:48,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 17:45:48,709 INFO L93 Difference]: Finished difference Result 11016 states and 17576 transitions. [2024-10-13 17:45:48,709 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11016 states and 17576 transitions. [2024-10-13 17:45:48,740 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 4438 [2024-10-13 17:45:48,775 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11016 states to 11016 states and 17576 transitions. [2024-10-13 17:45:48,775 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4518 [2024-10-13 17:45:48,778 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4518 [2024-10-13 17:45:48,778 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11016 states and 17576 transitions. [2024-10-13 17:45:48,778 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 17:45:48,778 INFO L218 hiAutomatonCegarLoop]: Abstraction has 11016 states and 17576 transitions. [2024-10-13 17:45:48,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11016 states and 17576 transitions. [2024-10-13 17:45:48,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11016 to 11016. [2024-10-13 17:45:48,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11016 states, 11016 states have (on average 1.5954974582425563) internal successors, (17576), 11015 states have internal predecessors, (17576), 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) [2024-10-13 17:45:49,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11016 states to 11016 states and 17576 transitions. [2024-10-13 17:45:49,008 INFO L240 hiAutomatonCegarLoop]: Abstraction has 11016 states and 17576 transitions. [2024-10-13 17:45:49,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 17:45:49,008 INFO L425 stractBuchiCegarLoop]: Abstraction has 11016 states and 17576 transitions. [2024-10-13 17:45:49,008 INFO L332 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2024-10-13 17:45:49,009 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11016 states and 17576 transitions. [2024-10-13 17:45:49,035 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 4438 [2024-10-13 17:45:49,035 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 17:45:49,035 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 17:45:49,036 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 17:45:49,036 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 17:45:49,036 INFO L745 eck$LassoCheckResult]: Stem: 65075#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 65076#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~0#1;havoc main_~__retres1~0#1;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; 65105#L404 assume !(1 == ~c_req_up~0); 65158#L404-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 65044#L415-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 65045#L420-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 65213#L425-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 65097#L430-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 65098#L435-1 assume !(0 == ~e_f~0); 65054#L440-1 assume !(0 == ~e_g~0); 65055#L445-1 assume !(0 == ~e_e~0); 65108#L450-1 assume !(0 == ~e_c~0); 65042#L455-1 assume !(0 == ~e_wl~0); 65043#L460-1 assume !(1 == ~wl_pc~0); 65198#$Ultimate##44 assume !(2 == ~wl_pc~0); 65137#L473 assume !(1 == ~c1_pc~0); 65240#L483 assume !(1 == ~c2_pc~0); 65020#L492 assume !(1 == ~wb_pc~0); 65130#L501 assume !(1 == ~e_c~0); 65131#L510-1 assume !(1 == ~e_e~0); 65046#L515-1 assume !(1 == ~e_f~0); 65047#L520-1 assume !(1 == ~e_g~0); 65109#L525-1 assume !(1 == ~e_c~0); 65110#L530-1 assume !(1 == ~e_wl~0); 65210#L672-1 assume !false; 66474#L542 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 70648#L377 [2024-10-13 17:45:49,036 INFO L747 eck$LassoCheckResult]: Loop: 70648#L377 assume !false; 72306#L295 assume 0 == ~wl_st~0; 72304#L308-1 assume 0 == ~wl_st~0;havoc eval_#t~nondet4#1;eval_~tmp~0#1 := eval_#t~nondet4#1;havoc eval_#t~nondet4#1; 72300#L321 assume !(0 != eval_~tmp~0#1); 72301#L317 assume 0 == ~c1_st~0;havoc eval_#t~nondet5#1;eval_~tmp___0~0#1 := eval_#t~nondet5#1;havoc eval_#t~nondet5#1; 72321#L336 assume !(0 != eval_~tmp___0~0#1); 72316#L332 assume !(0 == ~c2_st~0); 72315#L347 assume !(0 == ~wb_st~0); 72311#L362 assume !(0 == ~r_st~0); 70648#L377 [2024-10-13 17:45:49,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:45:49,037 INFO L85 PathProgramCache]: Analyzing trace with hash 823350777, now seen corresponding path program 2 times [2024-10-13 17:45:49,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:45:49,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098637200] [2024-10-13 17:45:49,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:45:49,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:45:49,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:45:49,044 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:45:49,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:45:49,050 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:45:49,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:45:49,053 INFO L85 PathProgramCache]: Analyzing trace with hash 969256162, now seen corresponding path program 1 times [2024-10-13 17:45:49,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:45:49,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365356972] [2024-10-13 17:45:49,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:45:49,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:45:49,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:45:49,056 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:45:49,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:45:49,106 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:45:49,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:45:49,106 INFO L85 PathProgramCache]: Analyzing trace with hash -1748529686, now seen corresponding path program 1 times [2024-10-13 17:45:49,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:45:49,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557732519] [2024-10-13 17:45:49,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:45:49,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:45:49,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:45:49,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 17:45:49,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 17:45:49,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557732519] [2024-10-13 17:45:49,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557732519] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 17:45:49,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 17:45:49,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 17:45:49,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239874844] [2024-10-13 17:45:49,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 17:45:49,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 17:45:49,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 17:45:49,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 17:45:49,152 INFO L87 Difference]: Start difference. First operand 11016 states and 17576 transitions. cyclomatic complexity: 6596 Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 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) [2024-10-13 17:45:49,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 17:45:49,200 INFO L93 Difference]: Finished difference Result 17164 states and 27055 transitions. [2024-10-13 17:45:49,200 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17164 states and 27055 transitions. [2024-10-13 17:45:49,259 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 6956 [2024-10-13 17:45:49,303 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17164 states to 17164 states and 27055 transitions. [2024-10-13 17:45:49,303 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7102 [2024-10-13 17:45:49,307 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7102 [2024-10-13 17:45:49,307 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17164 states and 27055 transitions. [2024-10-13 17:45:49,307 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 17:45:49,307 INFO L218 hiAutomatonCegarLoop]: Abstraction has 17164 states and 27055 transitions. [2024-10-13 17:45:49,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17164 states and 27055 transitions. [2024-10-13 17:45:49,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17164 to 17164. [2024-10-13 17:45:49,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17164 states, 17164 states have (on average 1.5762642740619903) internal successors, (27055), 17163 states have internal predecessors, (27055), 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) [2024-10-13 17:45:49,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17164 states to 17164 states and 27055 transitions. [2024-10-13 17:45:49,618 INFO L240 hiAutomatonCegarLoop]: Abstraction has 17164 states and 27055 transitions. [2024-10-13 17:45:49,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 17:45:49,623 INFO L425 stractBuchiCegarLoop]: Abstraction has 17164 states and 27055 transitions. [2024-10-13 17:45:49,623 INFO L332 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2024-10-13 17:45:49,623 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17164 states and 27055 transitions. [2024-10-13 17:45:49,649 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 6956 [2024-10-13 17:45:49,649 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 17:45:49,649 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 17:45:49,650 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 17:45:49,650 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 17:45:49,650 INFO L745 eck$LassoCheckResult]: Stem: 93260#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 93261#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~0#1;havoc main_~__retres1~0#1;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; 93291#L404 assume !(1 == ~c_req_up~0); 93361#L404-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 93230#L415-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 93231#L420-1 assume !(1 == ~c2_i~0);~c2_st~0 := 2; 93470#L425-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 95171#L430-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 95170#L435-1 assume !(0 == ~e_f~0); 95169#L440-1 assume !(0 == ~e_g~0); 95168#L445-1 assume !(0 == ~e_e~0); 95167#L450-1 assume !(0 == ~e_c~0); 95166#L455-1 assume !(0 == ~e_wl~0); 95165#L460-1 assume !(1 == ~wl_pc~0); 95162#$Ultimate##44 assume !(2 == ~wl_pc~0); 95161#L473 assume !(1 == ~c1_pc~0); 95159#L483 assume !(1 == ~c2_pc~0); 93478#L492 assume !(1 == ~wb_pc~0); 93318#L501 assume !(1 == ~e_c~0); 93319#L510-1 assume !(1 == ~e_e~0); 93232#L515-1 assume !(1 == ~e_f~0); 93233#L520-1 assume !(1 == ~e_g~0); 93295#L525-1 assume !(1 == ~e_c~0); 93296#L530-1 assume !(1 == ~e_wl~0); 93398#L672-1 assume !false; 95172#L542 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 104314#L377 [2024-10-13 17:45:49,650 INFO L747 eck$LassoCheckResult]: Loop: 104314#L377 assume !false; 107940#L295 assume 0 == ~wl_st~0; 107941#L308-1 assume 0 == ~wl_st~0;havoc eval_#t~nondet4#1;eval_~tmp~0#1 := eval_#t~nondet4#1;havoc eval_#t~nondet4#1; 105989#L321 assume !(0 != eval_~tmp~0#1); 105990#L317 assume 0 == ~c1_st~0;havoc eval_#t~nondet5#1;eval_~tmp___0~0#1 := eval_#t~nondet5#1;havoc eval_#t~nondet5#1; 107010#L336 assume !(0 != eval_~tmp___0~0#1); 107388#L332 assume !(0 == ~c2_st~0); 107419#L347 assume !(0 == ~wb_st~0); 107414#L362 assume !(0 == ~r_st~0); 104314#L377 [2024-10-13 17:45:49,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:45:49,650 INFO L85 PathProgramCache]: Analyzing trace with hash 1246052603, now seen corresponding path program 1 times [2024-10-13 17:45:49,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:45:49,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194396742] [2024-10-13 17:45:49,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:45:49,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:45:49,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:45:49,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 17:45:49,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 17:45:49,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194396742] [2024-10-13 17:45:49,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194396742] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 17:45:49,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 17:45:49,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 17:45:49,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221927944] [2024-10-13 17:45:49,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 17:45:49,671 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-13 17:45:49,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:45:49,671 INFO L85 PathProgramCache]: Analyzing trace with hash 969256162, now seen corresponding path program 2 times [2024-10-13 17:45:49,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:45:49,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278357109] [2024-10-13 17:45:49,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:45:49,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:45:49,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:45:49,673 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:45:49,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:45:49,676 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:45:49,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 17:45:49,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 17:45:49,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 17:45:49,705 INFO L87 Difference]: Start difference. First operand 17164 states and 27055 transitions. cyclomatic complexity: 9927 Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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) [2024-10-13 17:45:49,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 17:45:49,783 INFO L93 Difference]: Finished difference Result 17112 states and 26968 transitions. [2024-10-13 17:45:49,783 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17112 states and 26968 transitions. [2024-10-13 17:45:49,852 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 6956 [2024-10-13 17:45:49,951 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17112 states to 17112 states and 26968 transitions. [2024-10-13 17:45:49,951 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7052 [2024-10-13 17:45:49,960 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7052 [2024-10-13 17:45:49,960 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17112 states and 26968 transitions. [2024-10-13 17:45:49,964 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 17:45:49,964 INFO L218 hiAutomatonCegarLoop]: Abstraction has 17112 states and 26968 transitions. [2024-10-13 17:45:49,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17112 states and 26968 transitions. [2024-10-13 17:45:50,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17112 to 17112. [2024-10-13 17:45:50,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17112 states, 17112 states have (on average 1.575970079476391) internal successors, (26968), 17111 states have internal predecessors, (26968), 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) [2024-10-13 17:45:50,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17112 states to 17112 states and 26968 transitions. [2024-10-13 17:45:50,192 INFO L240 hiAutomatonCegarLoop]: Abstraction has 17112 states and 26968 transitions. [2024-10-13 17:45:50,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 17:45:50,193 INFO L425 stractBuchiCegarLoop]: Abstraction has 17112 states and 26968 transitions. [2024-10-13 17:45:50,193 INFO L332 stractBuchiCegarLoop]: ======== Iteration 14 ============ [2024-10-13 17:45:50,193 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17112 states and 26968 transitions. [2024-10-13 17:45:50,326 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 6956 [2024-10-13 17:45:50,358 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 17:45:50,358 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 17:45:50,359 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 17:45:50,359 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 17:45:50,359 INFO L745 eck$LassoCheckResult]: Stem: 127544#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 127545#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~0#1;havoc main_~__retres1~0#1;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; 127576#L404 assume !(1 == ~c_req_up~0); 127626#L404-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 127511#L415-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 127512#L420-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 127686#L425-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 127571#L430-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 127572#L435-1 assume !(0 == ~e_f~0); 127524#L440-1 assume !(0 == ~e_g~0); 127525#L445-1 assume !(0 == ~e_e~0); 127579#L450-1 assume !(0 == ~e_c~0); 127509#L455-1 assume !(0 == ~e_wl~0); 127510#L460-1 assume !(1 == ~wl_pc~0); 127671#$Ultimate##44 assume !(2 == ~wl_pc~0); 127607#L473 assume !(1 == ~c1_pc~0); 127713#L483 assume !(1 == ~c2_pc~0); 127487#L492 assume !(1 == ~wb_pc~0); 127602#L501 assume !(1 == ~e_c~0); 127603#L510-1 assume !(1 == ~e_e~0); 127513#L515-1 assume !(1 == ~e_f~0); 127514#L520-1 assume !(1 == ~e_g~0); 127580#L525-1 assume !(1 == ~e_c~0); 127581#L530-1 assume !(1 == ~e_wl~0); 127683#L672-1 assume !false; 129632#L542 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 137103#L377 [2024-10-13 17:45:50,359 INFO L747 eck$LassoCheckResult]: Loop: 137103#L377 assume !false; 141877#L295 assume 0 == ~wl_st~0; 141378#L308-1 assume 0 == ~wl_st~0;havoc eval_#t~nondet4#1;eval_~tmp~0#1 := eval_#t~nondet4#1;havoc eval_#t~nondet4#1; 141377#L321 assume !(0 != eval_~tmp~0#1); 141376#L317 assume 0 == ~c1_st~0;havoc eval_#t~nondet5#1;eval_~tmp___0~0#1 := eval_#t~nondet5#1;havoc eval_#t~nondet5#1; 141336#L336 assume !(0 != eval_~tmp___0~0#1); 141024#L332 assume 0 == ~c2_st~0;havoc eval_#t~nondet6#1;eval_~tmp___1~0#1 := eval_#t~nondet6#1;havoc eval_#t~nondet6#1; 141020#L351 assume !(0 != eval_~tmp___1~0#1); 140965#L347 assume !(0 == ~wb_st~0); 140960#L362 assume !(0 == ~r_st~0); 137103#L377 [2024-10-13 17:45:50,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:45:50,360 INFO L85 PathProgramCache]: Analyzing trace with hash 823350777, now seen corresponding path program 3 times [2024-10-13 17:45:50,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:45:50,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340972370] [2024-10-13 17:45:50,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:45:50,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:45:50,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:45:50,365 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:45:50,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:45:50,369 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:45:50,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:45:50,369 INFO L85 PathProgramCache]: Analyzing trace with hash -19480801, now seen corresponding path program 1 times [2024-10-13 17:45:50,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:45:50,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737501416] [2024-10-13 17:45:50,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:45:50,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:45:50,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:45:50,371 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:45:50,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:45:50,372 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:45:50,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:45:50,373 INFO L85 PathProgramCache]: Analyzing trace with hash 1628503831, now seen corresponding path program 1 times [2024-10-13 17:45:50,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:45:50,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554624697] [2024-10-13 17:45:50,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:45:50,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:45:50,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:45:50,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 17:45:50,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 17:45:50,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554624697] [2024-10-13 17:45:50,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554624697] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 17:45:50,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 17:45:50,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 17:45:50,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502268154] [2024-10-13 17:45:50,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 17:45:50,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 17:45:50,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 17:45:50,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 17:45:50,420 INFO L87 Difference]: Start difference. First operand 17112 states and 26968 transitions. cyclomatic complexity: 9892 Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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) [2024-10-13 17:45:50,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 17:45:50,489 INFO L93 Difference]: Finished difference Result 29109 states and 45435 transitions. [2024-10-13 17:45:50,489 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29109 states and 45435 transitions. [2024-10-13 17:45:50,572 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 11874 [2024-10-13 17:45:50,633 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29109 states to 29109 states and 45435 transitions. [2024-10-13 17:45:50,634 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12004 [2024-10-13 17:45:50,640 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12004 [2024-10-13 17:45:50,640 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29109 states and 45435 transitions. [2024-10-13 17:45:50,640 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 17:45:50,640 INFO L218 hiAutomatonCegarLoop]: Abstraction has 29109 states and 45435 transitions. [2024-10-13 17:45:50,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29109 states and 45435 transitions. [2024-10-13 17:45:51,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29109 to 29109. [2024-10-13 17:45:51,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29109 states, 29109 states have (on average 1.5608574667628567) internal successors, (45435), 29108 states have internal predecessors, (45435), 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) [2024-10-13 17:45:51,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29109 states to 29109 states and 45435 transitions. [2024-10-13 17:45:51,108 INFO L240 hiAutomatonCegarLoop]: Abstraction has 29109 states and 45435 transitions. [2024-10-13 17:45:51,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 17:45:51,109 INFO L425 stractBuchiCegarLoop]: Abstraction has 29109 states and 45435 transitions. [2024-10-13 17:45:51,109 INFO L332 stractBuchiCegarLoop]: ======== Iteration 15 ============ [2024-10-13 17:45:51,109 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29109 states and 45435 transitions. [2024-10-13 17:45:51,183 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 11874 [2024-10-13 17:45:51,183 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 17:45:51,183 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 17:45:51,185 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 17:45:51,185 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 17:45:51,185 INFO L745 eck$LassoCheckResult]: Stem: 173774#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 173775#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~0#1;havoc main_~__retres1~0#1;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; 173805#L404 assume !(1 == ~c_req_up~0); 173858#L404-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 173741#L415-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 173742#L420-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 173919#L425-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 173799#L430-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 173800#L435-1 assume !(0 == ~e_f~0); 173754#L440-1 assume !(0 == ~e_g~0); 173755#L445-1 assume !(0 == ~e_e~0); 173808#L450-1 assume !(0 == ~e_c~0); 173739#L455-1 assume !(0 == ~e_wl~0); 173740#L460-1 assume !(1 == ~wl_pc~0); 173902#$Ultimate##44 assume !(2 == ~wl_pc~0); 173836#L473 assume !(1 == ~c1_pc~0); 173953#L483 assume !(1 == ~c2_pc~0); 173717#L492 assume !(1 == ~wb_pc~0); 173831#L501 assume !(1 == ~e_c~0); 173832#L510-1 assume !(1 == ~e_e~0); 173743#L515-1 assume !(1 == ~e_f~0); 173744#L520-1 assume !(1 == ~e_g~0); 173809#L525-1 assume !(1 == ~e_c~0); 173810#L530-1 assume !(1 == ~e_wl~0); 176228#L672-1 assume !false; 176229#L542 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 188613#L377 [2024-10-13 17:45:51,185 INFO L747 eck$LassoCheckResult]: Loop: 188613#L377 assume !false; 197188#L295 assume 0 == ~wl_st~0; 197186#L308-1 assume 0 == ~wl_st~0;havoc eval_#t~nondet4#1;eval_~tmp~0#1 := eval_#t~nondet4#1;havoc eval_#t~nondet4#1; 197184#L321 assume !(0 != eval_~tmp~0#1); 195819#L317 assume 0 == ~c1_st~0;havoc eval_#t~nondet5#1;eval_~tmp___0~0#1 := eval_#t~nondet5#1;havoc eval_#t~nondet5#1; 195816#L336 assume !(0 != eval_~tmp___0~0#1); 195814#L332 assume 0 == ~c2_st~0;havoc eval_#t~nondet6#1;eval_~tmp___1~0#1 := eval_#t~nondet6#1;havoc eval_#t~nondet6#1; 195765#L351 assume !(0 != eval_~tmp___1~0#1); 195811#L347 assume 0 == ~wb_st~0;havoc eval_#t~nondet7#1;eval_~tmp___2~0#1 := eval_#t~nondet7#1;havoc eval_#t~nondet7#1; 196125#L366 assume !(0 != eval_~tmp___2~0#1); 196135#L362 assume !(0 == ~r_st~0); 188613#L377 [2024-10-13 17:45:51,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:45:51,186 INFO L85 PathProgramCache]: Analyzing trace with hash 823350777, now seen corresponding path program 4 times [2024-10-13 17:45:51,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:45:51,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148499848] [2024-10-13 17:45:51,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:45:51,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:45:51,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:45:51,192 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:45:51,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:45:51,199 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:45:51,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:45:51,201 INFO L85 PathProgramCache]: Analyzing trace with hash -603940234, now seen corresponding path program 1 times [2024-10-13 17:45:51,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:45:51,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113331343] [2024-10-13 17:45:51,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:45:51,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:45:51,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:45:51,204 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:45:51,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:45:51,206 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:45:51,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:45:51,207 INFO L85 PathProgramCache]: Analyzing trace with hash -1056024194, now seen corresponding path program 1 times [2024-10-13 17:45:51,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:45:51,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512411489] [2024-10-13 17:45:51,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:45:51,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:45:51,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:45:51,213 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:45:51,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:45:51,220 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:45:51,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:45:51,985 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:45:51,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:45:52,065 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 13.10 05:45:52 BoogieIcfgContainer [2024-10-13 17:45:52,065 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-10-13 17:45:52,066 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 17:45:52,066 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 17:45:52,066 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 17:45:52,066 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 05:45:43" (3/4) ... [2024-10-13 17:45:52,067 INFO L136 WitnessPrinter]: Generating witness for non-termination counterexample [2024-10-13 17:45:52,119 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-13 17:45:52,120 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 17:45:52,120 INFO L158 Benchmark]: Toolchain (without parser) took 9836.63ms. Allocated memory was 207.6MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 141.9MB in the beginning and 958.4MB in the end (delta: -816.5MB). Peak memory consumption was 299.2MB. Max. memory is 16.1GB. [2024-10-13 17:45:52,120 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 113.2MB. Free memory is still 74.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 17:45:52,120 INFO L158 Benchmark]: CACSL2BoogieTranslator took 249.98ms. Allocated memory is still 207.6MB. Free memory was 141.6MB in the beginning and 125.1MB in the end (delta: 16.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-13 17:45:52,120 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.00ms. Allocated memory is still 207.6MB. Free memory was 125.1MB in the beginning and 122.7MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 17:45:52,121 INFO L158 Benchmark]: Boogie Preprocessor took 41.35ms. Allocated memory is still 207.6MB. Free memory was 122.7MB in the beginning and 120.0MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 17:45:52,121 INFO L158 Benchmark]: RCFGBuilder took 477.41ms. Allocated memory is still 207.6MB. Free memory was 119.9MB in the beginning and 154.8MB in the end (delta: -34.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-10-13 17:45:52,121 INFO L158 Benchmark]: BuchiAutomizer took 8972.56ms. Allocated memory was 207.6MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 154.8MB in the beginning and 964.7MB in the end (delta: -809.9MB). Peak memory consumption was 305.7MB. Max. memory is 16.1GB. [2024-10-13 17:45:52,121 INFO L158 Benchmark]: Witness Printer took 54.04ms. Allocated memory is still 1.3GB. Free memory was 964.7MB in the beginning and 958.4MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-13 17:45:52,122 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 113.2MB. Free memory is still 74.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 249.98ms. Allocated memory is still 207.6MB. Free memory was 141.6MB in the beginning and 125.1MB in the end (delta: 16.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.00ms. Allocated memory is still 207.6MB. Free memory was 125.1MB in the beginning and 122.7MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 41.35ms. Allocated memory is still 207.6MB. Free memory was 122.7MB in the beginning and 120.0MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 477.41ms. Allocated memory is still 207.6MB. Free memory was 119.9MB in the beginning and 154.8MB in the end (delta: -34.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * BuchiAutomizer took 8972.56ms. Allocated memory was 207.6MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 154.8MB in the beginning and 964.7MB in the end (delta: -809.9MB). Peak memory consumption was 305.7MB. Max. memory is 16.1GB. * Witness Printer took 54.04ms. Allocated memory is still 1.3GB. Free memory was 964.7MB in the beginning and 958.4MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 17 terminating modules (14 trivial, 3 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function (((long long) -1 * e_c) + 1) and consists of 3 locations. One deterministic module has affine ranking function (((long long) -1 * e_c) + 1) and consists of 3 locations. One deterministic module has affine ranking function (((long long) -1 * e_e) + 1) and consists of 3 locations. 14 modules have a trivial ranking function, the largest among these consists of 4 locations. The remainder module has 29109 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 8.8s and 15 iterations. TraceHistogramMax:1. Analysis of lassos took 4.6s. Construction of modules took 0.2s. Büchi inclusion checks took 3.2s. Highest rank in rank-based complementation 3. Minimization of det autom 6. Minimization of nondet autom 11. Automata minimization 1.6s AutomataMinimizationTime, 17 MinimizatonAttempts, 1885 StatesRemovedByMinimization, 8 NontrivialMinimizations. Non-live state removal took 0.6s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4258 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4255 mSDsluCounter, 7039 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2579 mSDsCounter, 108 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 357 IncrementalHoareTripleChecker+Invalid, 465 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 108 mSolverCounterUnsat, 4460 mSDtfsCounter, 357 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI2 SFLT0 conc3 concLT0 SILN1 SILU0 SILI5 SILT3 lasso0 LassoPreprocessingBenchmarks: Lassos: inital77 mio100 ax100 hnf100 lsp12 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq185 hnf96 smp100 dnf147 smp91 tf109 neg100 sie116 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 21ms VariablesStem: 0 VariablesLoop: 1 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 0 MotzkinApplications: 4 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 8 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 3 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.2s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - LassoShapedNonTerminationArgument [Line: 294]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L28] int c ; [L29] int c_t ; [L30] int c_req_up ; [L31] int p_in ; [L32] int p_out ; [L33] int wl_st ; [L34] int c1_st ; [L35] int c2_st ; [L36] int wb_st ; [L37] int r_st ; [L38] int wl_i ; [L39] int c1_i ; [L40] int c2_i ; [L41] int wb_i ; [L42] int r_i ; [L43] int wl_pc ; [L44] int c1_pc ; [L45] int c2_pc ; [L46] int wb_pc ; [L47] int e_e ; [L48] int e_f ; [L49] int e_g ; [L50] int e_c ; [L51] int e_p_in ; [L52] int e_wl ; [L58] int d ; [L59] int data ; [L60] int processed ; [L61] static int t_b ; VAL [c1_i=0, c1_pc=0, c1_st=0, c2_i=0, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=0, e_e=0, e_f=0, e_g=0, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=0, t_b=0, wb_i=0, wb_pc=0, wb_st=0, wl_i=0, wl_pc=0, wl_st=0] [L689] int __retres1 ; [L693] e_wl = 2 [L694] e_c = e_wl [L695] e_g = e_c [L696] e_f = e_g [L697] e_e = e_f [L698] wl_pc = 0 [L699] c1_pc = 0 [L700] c2_pc = 0 [L701] wb_pc = 0 [L702] wb_i = 1 [L703] c2_i = wb_i [L704] c1_i = c2_i [L705] wl_i = c1_i [L706] r_i = 0 [L707] c_req_up = 0 [L708] d = 0 [L709] c = 0 [L710] CALL start_simulation() [L400] int kernel_st ; [L403] kernel_st = 0 VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L404] COND FALSE !((int )c_req_up == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L415] COND TRUE (int )wl_i == 1 [L416] wl_st = 0 VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L420] COND TRUE (int )c1_i == 1 [L421] c1_st = 0 VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L425] COND TRUE (int )c2_i == 1 [L426] c2_st = 0 VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L430] COND TRUE (int )wb_i == 1 [L431] wb_st = 0 VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L435] COND FALSE !((int )r_i == 1) [L438] r_st = 2 VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L440] COND FALSE !((int )e_f == 0) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L445] COND FALSE !((int )e_g == 0) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L450] COND FALSE !((int )e_e == 0) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L455] COND FALSE !((int )e_c == 0) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L460] COND FALSE !((int )e_wl == 0) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L465] COND FALSE !((int )wl_pc == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L473] COND FALSE !((int )wl_pc == 2) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L483] COND FALSE !((int )c1_pc == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L492] COND FALSE !((int )c2_pc == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L501] COND FALSE !((int )wb_pc == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L510] COND FALSE !((int )e_c == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L515] COND FALSE !((int )e_e == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L520] COND FALSE !((int )e_f == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L525] COND FALSE !((int )e_g == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L530] COND FALSE !((int )e_c == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L535] COND FALSE !((int )e_wl == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L541] COND TRUE 1 VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L544] kernel_st = 1 [L545] CALL eval() [L286] int tmp ; [L287] int tmp___0 ; [L288] int tmp___1 ; [L289] int tmp___2 ; [L290] int tmp___3 ; VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] Loop: [L294] COND TRUE 1 [L296] COND TRUE (int )wl_st == 0 [L317] COND TRUE (int )wl_st == 0 [L319] tmp = __VERIFIER_nondet_int() [L321] COND FALSE !(\read(tmp)) [L332] COND TRUE (int )c1_st == 0 [L334] tmp___0 = __VERIFIER_nondet_int() [L336] COND FALSE !(\read(tmp___0)) [L347] COND TRUE (int )c2_st == 0 [L349] tmp___1 = __VERIFIER_nondet_int() [L351] COND FALSE !(\read(tmp___1)) [L362] COND TRUE (int )wb_st == 0 [L364] tmp___2 = __VERIFIER_nondet_int() [L366] COND FALSE !(\read(tmp___2)) [L377] COND FALSE !((int )r_st == 0) End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 294]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L28] int c ; [L29] int c_t ; [L30] int c_req_up ; [L31] int p_in ; [L32] int p_out ; [L33] int wl_st ; [L34] int c1_st ; [L35] int c2_st ; [L36] int wb_st ; [L37] int r_st ; [L38] int wl_i ; [L39] int c1_i ; [L40] int c2_i ; [L41] int wb_i ; [L42] int r_i ; [L43] int wl_pc ; [L44] int c1_pc ; [L45] int c2_pc ; [L46] int wb_pc ; [L47] int e_e ; [L48] int e_f ; [L49] int e_g ; [L50] int e_c ; [L51] int e_p_in ; [L52] int e_wl ; [L58] int d ; [L59] int data ; [L60] int processed ; [L61] static int t_b ; VAL [c1_i=0, c1_pc=0, c1_st=0, c2_i=0, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=0, e_e=0, e_f=0, e_g=0, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=0, t_b=0, wb_i=0, wb_pc=0, wb_st=0, wl_i=0, wl_pc=0, wl_st=0] [L689] int __retres1 ; [L693] e_wl = 2 [L694] e_c = e_wl [L695] e_g = e_c [L696] e_f = e_g [L697] e_e = e_f [L698] wl_pc = 0 [L699] c1_pc = 0 [L700] c2_pc = 0 [L701] wb_pc = 0 [L702] wb_i = 1 [L703] c2_i = wb_i [L704] c1_i = c2_i [L705] wl_i = c1_i [L706] r_i = 0 [L707] c_req_up = 0 [L708] d = 0 [L709] c = 0 [L710] CALL start_simulation() [L400] int kernel_st ; [L403] kernel_st = 0 VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L404] COND FALSE !((int )c_req_up == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L415] COND TRUE (int )wl_i == 1 [L416] wl_st = 0 VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L420] COND TRUE (int )c1_i == 1 [L421] c1_st = 0 VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L425] COND TRUE (int )c2_i == 1 [L426] c2_st = 0 VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L430] COND TRUE (int )wb_i == 1 [L431] wb_st = 0 VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L435] COND FALSE !((int )r_i == 1) [L438] r_st = 2 VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L440] COND FALSE !((int )e_f == 0) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L445] COND FALSE !((int )e_g == 0) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L450] COND FALSE !((int )e_e == 0) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L455] COND FALSE !((int )e_c == 0) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L460] COND FALSE !((int )e_wl == 0) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L465] COND FALSE !((int )wl_pc == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L473] COND FALSE !((int )wl_pc == 2) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L483] COND FALSE !((int )c1_pc == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L492] COND FALSE !((int )c2_pc == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L501] COND FALSE !((int )wb_pc == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L510] COND FALSE !((int )e_c == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L515] COND FALSE !((int )e_e == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L520] COND FALSE !((int )e_f == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L525] COND FALSE !((int )e_g == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L530] COND FALSE !((int )e_c == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L535] COND FALSE !((int )e_wl == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L541] COND TRUE 1 VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L544] kernel_st = 1 [L545] CALL eval() [L286] int tmp ; [L287] int tmp___0 ; [L288] int tmp___1 ; [L289] int tmp___2 ; [L290] int tmp___3 ; VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] Loop: [L294] COND TRUE 1 [L296] COND TRUE (int )wl_st == 0 [L317] COND TRUE (int )wl_st == 0 [L319] tmp = __VERIFIER_nondet_int() [L321] COND FALSE !(\read(tmp)) [L332] COND TRUE (int )c1_st == 0 [L334] tmp___0 = __VERIFIER_nondet_int() [L336] COND FALSE !(\read(tmp___0)) [L347] COND TRUE (int )c2_st == 0 [L349] tmp___1 = __VERIFIER_nondet_int() [L351] COND FALSE !(\read(tmp___1)) [L362] COND TRUE (int )wb_st == 0 [L364] tmp___2 = __VERIFIER_nondet_int() [L366] COND FALSE !(\read(tmp___2)) [L377] COND FALSE !((int )r_st == 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2024-10-13 17:45:52,146 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM)