./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/termination.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/toy.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/toy.cil.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 4a8eabec1830ab654b41f6937ec2f9359cd3dd371ede66eafc352bac48edda3b --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-12 01:03:36,131 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 01:03:36,199 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2024-10-12 01:03:36,204 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 01:03:36,206 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 01:03:36,231 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 01:03:36,231 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 01:03:36,232 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 01:03:36,232 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 01:03:36,233 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 01:03:36,233 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 01:03:36,233 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 01:03:36,234 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 01:03:36,234 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-10-12 01:03:36,235 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-10-12 01:03:36,235 INFO L153 SettingsManager]: * Use old map elimination=false [2024-10-12 01:03:36,235 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-10-12 01:03:36,236 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-10-12 01:03:36,236 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-10-12 01:03:36,236 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 01:03:36,239 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-10-12 01:03:36,239 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 01:03:36,240 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 01:03:36,240 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 01:03:36,240 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 01:03:36,241 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-10-12 01:03:36,241 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-10-12 01:03:36,241 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-10-12 01:03:36,241 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 01:03:36,242 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-12 01:03:36,242 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 01:03:36,242 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 01:03:36,243 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-10-12 01:03:36,243 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 01:03:36,246 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 01:03:36,247 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 01:03:36,247 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 01:03:36,247 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 01:03:36,248 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-10-12 01:03:36,248 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-clean/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-clean/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 -> 4a8eabec1830ab654b41f6937ec2f9359cd3dd371ede66eafc352bac48edda3b [2024-10-12 01:03:36,517 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 01:03:36,543 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 01:03:36,547 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 01:03:36,549 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 01:03:36,550 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 01:03:36,551 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/toy.cil.c [2024-10-12 01:03:37,998 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 01:03:38,220 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 01:03:38,222 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/toy.cil.c [2024-10-12 01:03:38,238 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/2b9e873d8/8ae09e244e08410eb4e51a4ecec6e0d5/FLAGb2c7a423f [2024-10-12 01:03:38,255 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/2b9e873d8/8ae09e244e08410eb4e51a4ecec6e0d5 [2024-10-12 01:03:38,258 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 01:03:38,260 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 01:03:38,261 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 01:03:38,261 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 01:03:38,269 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 01:03:38,270 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 01:03:38" (1/1) ... [2024-10-12 01:03:38,273 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4235d002 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 01:03:38, skipping insertion in model container [2024-10-12 01:03:38,273 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 01:03:38" (1/1) ... [2024-10-12 01:03:38,315 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 01:03:38,536 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 01:03:38,549 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 01:03:38,587 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 01:03:38,605 INFO L204 MainTranslator]: Completed translation [2024-10-12 01:03:38,606 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 01:03:38 WrapperNode [2024-10-12 01:03:38,606 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 01:03:38,607 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 01:03:38,607 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 01:03:38,607 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 01:03:38,612 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 01:03:38" (1/1) ... [2024-10-12 01:03:38,620 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 01:03:38" (1/1) ... [2024-10-12 01:03:38,646 INFO L138 Inliner]: procedures = 20, calls = 16, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 362 [2024-10-12 01:03:38,647 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 01:03:38,648 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 01:03:38,648 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 01:03:38,648 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 01:03:38,658 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 01:03:38" (1/1) ... [2024-10-12 01:03:38,658 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 01:03:38" (1/1) ... [2024-10-12 01:03:38,661 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 01:03:38" (1/1) ... [2024-10-12 01:03:38,675 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-12 01:03:38,676 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 01:03:38" (1/1) ... [2024-10-12 01:03:38,676 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 01:03:38" (1/1) ... [2024-10-12 01:03:38,684 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 01:03:38" (1/1) ... [2024-10-12 01:03:38,700 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 01:03:38" (1/1) ... [2024-10-12 01:03:38,706 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 01:03:38" (1/1) ... [2024-10-12 01:03:38,708 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 01:03:38" (1/1) ... [2024-10-12 01:03:38,716 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 01:03:38,717 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 01:03:38,717 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 01:03:38,717 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 01:03:38,722 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 01:03:38" (1/1) ... [2024-10-12 01:03:38,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:03:38,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:03:38,761 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 01:03:38,763 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-10-12 01:03:38,805 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 01:03:38,806 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 01:03:38,806 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 01:03:38,806 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 01:03:38,880 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 01:03:38,882 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 01:03:39,391 INFO L? ?]: Removed 21 outVars from TransFormulas that were not future-live. [2024-10-12 01:03:39,391 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 01:03:39,408 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 01:03:39,409 INFO L314 CfgBuilder]: Removed 6 assume(true) statements. [2024-10-12 01:03:39,409 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 01:03:39 BoogieIcfgContainer [2024-10-12 01:03:39,409 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 01:03:39,410 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-10-12 01:03:39,410 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-10-12 01:03:39,414 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-10-12 01:03:39,415 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-12 01:03:39,415 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 12.10 01:03:38" (1/3) ... [2024-10-12 01:03:39,416 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2cc0fba5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 01:03:39, skipping insertion in model container [2024-10-12 01:03:39,416 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-12 01:03:39,416 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 01:03:38" (2/3) ... [2024-10-12 01:03:39,416 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2cc0fba5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 01:03:39, skipping insertion in model container [2024-10-12 01:03:39,417 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-12 01:03:39,417 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 01:03:39" (3/3) ... [2024-10-12 01:03:39,418 INFO L332 chiAutomizerObserver]: Analyzing ICFG toy.cil.c [2024-10-12 01:03:39,468 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-10-12 01:03:39,468 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-10-12 01:03:39,468 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-10-12 01:03:39,468 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-10-12 01:03:39,468 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-10-12 01:03:39,468 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-10-12 01:03:39,468 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-10-12 01:03:39,469 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-10-12 01:03:39,473 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 132 states, 131 states have (on average 1.8244274809160306) internal successors, (239), 131 states have internal predecessors, (239), 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-12 01:03:39,494 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 97 [2024-10-12 01:03:39,494 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 01:03:39,494 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 01:03:39,502 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-12 01:03:39,503 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-12 01:03:39,503 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-10-12 01:03:39,504 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 132 states, 131 states have (on average 1.8244274809160306) internal successors, (239), 131 states have internal predecessors, (239), 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-12 01:03:39,512 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 97 [2024-10-12 01:03:39,512 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 01:03:39,512 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 01:03:39,513 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-12 01:03:39,514 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-12 01:03:39,520 INFO L745 eck$LassoCheckResult]: Stem: 24#$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(10, 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; 39#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; 106#L408true assume !(1 == ~c_req_up~0); 85#L408-2true assume !(1 == ~wl_i~0);~wl_st~0 := 2; 127#L419-1true assume !(1 == ~c1_i~0);~c1_st~0 := 2; 126#L424-1true assume 1 == ~c2_i~0;~c2_st~0 := 0; 60#L429-1true assume !(1 == ~wb_i~0);~wb_st~0 := 2; 121#L434-1true assume !(1 == ~r_i~0);~r_st~0 := 2; 43#L439-1true assume !(0 == ~e_f~0); 5#L444-1true assume !(0 == ~e_g~0); 98#L449-1true assume !(0 == ~e_e~0); 53#L454-1true assume !(0 == ~e_c~0); 111#L459-1true assume !(0 == ~e_wl~0); 25#L464-1true assume !(1 == ~wl_pc~0); 100#$Ultimate##44true assume !(2 == ~wl_pc~0); 23#L477true assume !(1 == ~c1_pc~0); 18#L487true assume !(1 == ~c2_pc~0); 87#L496true assume !(1 == ~wb_pc~0); 29#L505true assume !(1 == ~e_c~0); 36#L514-1true assume !(1 == ~e_e~0); 133#L519-1true assume !(1 == ~e_f~0); 40#L524-1true assume !(1 == ~e_g~0); 131#L529-1true assume !(1 == ~e_c~0); 2#L534-1true assume !(1 == ~e_wl~0); 4#L676-1true [2024-10-12 01:03:39,521 INFO L747 eck$LassoCheckResult]: Loop: 4#L676-1true assume !false; 35#L546true 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; 70#L381true assume !true; 90#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; 42#L552true assume !(1 == ~c_req_up~0); 59#L552-2true start_simulation_~kernel_st~0#1 := 3; 14#L564true assume 0 == ~e_f~0;~e_f~0 := 1; 17#L564-2true assume 0 == ~e_g~0;~e_g~0 := 1; 6#L569-1true assume 0 == ~e_e~0;~e_e~0 := 1; 130#L574-1true assume 0 == ~e_c~0;~e_c~0 := 1; 10#L579-1true assume 0 == ~e_wl~0;~e_wl~0 := 1; 94#L584-1true assume 1 == ~wl_pc~0; 46#L590true assume 1 == ~e_wl~0;~wl_st~0 := 0; 113#L597true assume !(1 == ~c1_pc~0); 27#L607true assume !(1 == ~c2_pc~0); 103#L616true assume !(1 == ~wb_pc~0); 123#L625true assume 1 == ~e_c~0;~r_st~0 := 0; 58#L634-1true assume 1 == ~e_e~0;~e_e~0 := 2; 52#L639-1true assume 1 == ~e_f~0;~e_f~0 := 2; 117#L644-1true assume 1 == ~e_g~0;~e_g~0 := 2; 77#L649-1true assume 1 == ~e_c~0;~e_c~0 := 2; 41#L654-1true assume 1 == ~e_wl~0;~e_wl~0 := 2; 21#L659-1true assume 0 == ~wl_st~0; 4#L676-1true [2024-10-12 01:03:39,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 01:03:39,526 INFO L85 PathProgramCache]: Analyzing trace with hash -2133486251, now seen corresponding path program 1 times [2024-10-12 01:03:39,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 01:03:39,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635853532] [2024-10-12 01:03:39,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 01:03:39,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 01:03:39,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:03:39,834 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-12 01:03:39,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 01:03:39,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635853532] [2024-10-12 01:03:39,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635853532] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 01:03:39,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 01:03:39,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 01:03:39,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086897202] [2024-10-12 01:03:39,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 01:03:39,844 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-12 01:03:39,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 01:03:39,845 INFO L85 PathProgramCache]: Analyzing trace with hash -1307375692, now seen corresponding path program 1 times [2024-10-12 01:03:39,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 01:03:39,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055086174] [2024-10-12 01:03:39,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 01:03:39,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 01:03:39,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:03:39,872 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-12 01:03:39,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 01:03:39,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055086174] [2024-10-12 01:03:39,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055086174] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 01:03:39,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 01:03:39,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 01:03:39,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631700069] [2024-10-12 01:03:39,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 01:03:39,879 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-12 01:03:39,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 01:03:39,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-12 01:03:39,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-12 01:03:39,919 INFO L87 Difference]: Start difference. First operand has 132 states, 131 states have (on average 1.8244274809160306) internal successors, (239), 131 states have internal predecessors, (239), 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-12 01:03:39,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 01:03:39,935 INFO L93 Difference]: Finished difference Result 130 states and 224 transitions. [2024-10-12 01:03:39,936 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 130 states and 224 transitions. [2024-10-12 01:03:39,940 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 94 [2024-10-12 01:03:39,944 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 130 states to 125 states and 219 transitions. [2024-10-12 01:03:39,945 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 125 [2024-10-12 01:03:39,946 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 125 [2024-10-12 01:03:39,947 INFO L73 IsDeterministic]: Start isDeterministic. Operand 125 states and 219 transitions. [2024-10-12 01:03:39,948 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-12 01:03:39,948 INFO L218 hiAutomatonCegarLoop]: Abstraction has 125 states and 219 transitions. [2024-10-12 01:03:39,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states and 219 transitions. [2024-10-12 01:03:39,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2024-10-12 01:03:39,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 125 states have (on average 1.752) internal successors, (219), 124 states have internal predecessors, (219), 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-12 01:03:39,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 219 transitions. [2024-10-12 01:03:39,981 INFO L240 hiAutomatonCegarLoop]: Abstraction has 125 states and 219 transitions. [2024-10-12 01:03:39,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-12 01:03:39,988 INFO L425 stractBuchiCegarLoop]: Abstraction has 125 states and 219 transitions. [2024-10-12 01:03:39,988 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-10-12 01:03:39,988 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 125 states and 219 transitions. [2024-10-12 01:03:39,990 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 94 [2024-10-12 01:03:39,990 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 01:03:39,990 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 01:03:39,991 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-12 01:03:39,992 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-12 01:03:39,992 INFO L745 eck$LassoCheckResult]: Stem: 314#$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(10, 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; 315#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; 344#L408 assume !(1 == ~c_req_up~0); 307#L408-2 assume !(1 == ~wl_i~0);~wl_st~0 := 2; 384#L419-1 assume !(1 == ~c1_i~0);~c1_st~0 := 2; 395#L424-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 369#L429-1 assume !(1 == ~wb_i~0);~wb_st~0 := 2; 370#L434-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 351#L439-1 assume !(0 == ~e_f~0); 274#L444-1 assume !(0 == ~e_g~0); 275#L449-1 assume !(0 == ~e_e~0); 364#L454-1 assume !(0 == ~e_c~0); 365#L459-1 assume !(0 == ~e_wl~0); 316#L464-1 assume !(1 == ~wl_pc~0); 317#$Ultimate##44 assume !(2 == ~wl_pc~0); 312#L477 assume !(1 == ~c1_pc~0); 300#L487 assume !(1 == ~c2_pc~0); 302#L496 assume !(1 == ~wb_pc~0); 328#L505 assume !(1 == ~e_c~0); 329#L514-1 assume !(1 == ~e_e~0); 340#L519-1 assume !(1 == ~e_f~0); 346#L524-1 assume !(1 == ~e_g~0); 347#L529-1 assume !(1 == ~e_c~0); 271#L534-1 assume !(1 == ~e_wl~0); 272#L676-1 [2024-10-12 01:03:39,992 INFO L747 eck$LassoCheckResult]: Loop: 272#L676-1 assume !false; 273#L546 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; 298#L381 assume !false; 341#L299 assume !(0 == ~wl_st~0); 342#L303 assume !(0 == ~c1_st~0); 394#L306 assume !(0 == ~c2_st~0); 387#L309 assume !(0 == ~wb_st~0); 388#L312 assume !(0 == ~r_st~0); 389#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; 348#L552 assume !(1 == ~c_req_up~0); 349#L552-2 start_simulation_~kernel_st~0#1 := 3; 295#L564 assume 0 == ~e_f~0;~e_f~0 := 1; 296#L564-2 assume 0 == ~e_g~0;~e_g~0 := 1; 276#L569-1 assume 0 == ~e_e~0;~e_e~0 := 1; 277#L574-1 assume 0 == ~e_c~0;~e_c~0 := 1; 286#L579-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 287#L584-1 assume 1 == ~wl_pc~0; 355#L590 assume 1 == ~e_wl~0;~wl_st~0 := 0; 356#L597 assume !(1 == ~c1_pc~0); 322#L607 assume !(1 == ~c2_pc~0); 323#L616 assume !(1 == ~wb_pc~0); 376#L625 assume 1 == ~e_c~0;~r_st~0 := 0; 368#L634-1 assume 1 == ~e_e~0;~e_e~0 := 2; 362#L639-1 assume 1 == ~e_f~0;~e_f~0 := 2; 363#L644-1 assume 1 == ~e_g~0;~e_g~0 := 2; 377#L649-1 assume 1 == ~e_c~0;~e_c~0 := 2; 345#L654-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 308#L659-1 assume 0 == ~wl_st~0; 272#L676-1 [2024-10-12 01:03:39,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 01:03:39,993 INFO L85 PathProgramCache]: Analyzing trace with hash -2133486251, now seen corresponding path program 2 times [2024-10-12 01:03:39,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 01:03:39,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934608224] [2024-10-12 01:03:39,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 01:03:39,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 01:03:40,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:03:40,086 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-12 01:03:40,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 01:03:40,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934608224] [2024-10-12 01:03:40,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934608224] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 01:03:40,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 01:03:40,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 01:03:40,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277828232] [2024-10-12 01:03:40,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 01:03:40,089 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-12 01:03:40,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 01:03:40,090 INFO L85 PathProgramCache]: Analyzing trace with hash -1329201933, now seen corresponding path program 1 times [2024-10-12 01:03:40,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 01:03:40,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219934424] [2024-10-12 01:03:40,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 01:03:40,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 01:03:40,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 01:03:40,108 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 01:03:40,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 01:03:40,172 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 01:03:40,528 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 01:03:40,529 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 01:03:40,529 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 01:03:40,529 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 01:03:40,529 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-10-12 01:03:40,529 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:03:40,530 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 01:03:40,530 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 01:03:40,530 INFO L132 ssoRankerPreferences]: Filename of dumped script: toy.cil.c_Iteration2_Loop [2024-10-12 01:03:40,530 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 01:03:40,530 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 01:03:40,554 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:40,572 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:40,580 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:40,584 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:40,587 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:40,593 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:40,596 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:40,604 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:40,608 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:40,611 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:40,615 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:40,618 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:40,620 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:40,626 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:40,630 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:40,633 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:40,640 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:40,645 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:40,650 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:40,653 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:40,656 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:40,662 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:40,664 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:40,667 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:40,672 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:40,917 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 01:03:40,918 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-10-12 01:03:40,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:03:40,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:03:40,922 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 01:03:40,924 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2024-10-12 01:03:40,925 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 01:03:40,925 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 01:03:40,956 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-12 01:03:40,956 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-12 01:03:40,976 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2024-10-12 01:03:40,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:03:40,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:03:40,980 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 01:03:40,982 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2024-10-12 01:03:40,983 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 01:03:40,983 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 01:03:41,015 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2024-10-12 01:03:41,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:03:41,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:03:41,018 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 01:03:41,019 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2024-10-12 01:03:41,020 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-10-12 01:03:41,021 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 01:03:41,041 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-10-12 01:03:41,054 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2024-10-12 01:03:41,055 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 01:03:41,055 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 01:03:41,055 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 01:03:41,055 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 01:03:41,055 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-12 01:03:41,055 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:03:41,056 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 01:03:41,056 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 01:03:41,056 INFO L132 ssoRankerPreferences]: Filename of dumped script: toy.cil.c_Iteration2_Loop [2024-10-12 01:03:41,056 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 01:03:41,056 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 01:03:41,058 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:41,065 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:41,071 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:41,073 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:41,077 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:41,080 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:41,084 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:41,090 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:41,092 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:41,096 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:41,098 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:41,099 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:41,101 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:41,104 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:41,109 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:41,113 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:41,119 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:41,122 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:41,130 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:41,133 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:41,136 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:41,138 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:41,143 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:41,150 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:41,152 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:41,379 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 01:03:41,384 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-12 01:03:41,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:03:41,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:03:41,387 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 01:03:41,389 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2024-10-12 01:03:41,390 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-12 01:03:41,402 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 01:03:41,402 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 01:03:41,403 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 01:03:41,403 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2024-10-12 01:03:41,403 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 01:03:41,405 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2024-10-12 01:03:41,405 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 01:03:41,408 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 01:03:41,422 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2024-10-12 01:03:41,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:03:41,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:03:41,426 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 01:03:41,428 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2024-10-12 01:03:41,429 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-12 01:03:41,442 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 01:03:41,442 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 01:03:41,442 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 01:03:41,442 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 01:03:41,442 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 01:03:41,443 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 01:03:41,443 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 01:03:41,447 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-12 01:03:41,451 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-10-12 01:03:41,451 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-10-12 01:03:41,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:03:41,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:03:41,476 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 01:03:41,479 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2024-10-12 01:03:41,479 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-12 01:03:41,480 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-10-12 01:03:41,480 INFO L474 LassoAnalysis]: Proved termination. [2024-10-12 01:03:41,481 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(~e_c~0) = -1*~e_c~0 + 1 Supporting invariants [] [2024-10-12 01:03:41,496 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2024-10-12 01:03:41,499 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-10-12 01:03:41,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 01:03:41,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:03:41,582 INFO L255 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 01:03:41,584 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 01:03:41,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:03:41,643 INFO L255 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-12 01:03:41,644 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 01:03:41,706 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2024-10-12 01:03:41,815 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-12 01:03:41,818 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-12 01:03:41,819 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 125 states and 219 transitions. cyclomatic complexity: 95 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-12 01:03:41,945 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 125 states and 219 transitions. cyclomatic complexity: 95. 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 413 states and 711 transitions. Complement of second has 5 states. [2024-10-12 01:03:41,949 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-12 01:03:41,950 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-12 01:03:41,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 383 transitions. [2024-10-12 01:03:41,955 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 383 transitions. Stem has 24 letters. Loop has 28 letters. [2024-10-12 01:03:41,956 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 01:03:41,957 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 383 transitions. Stem has 52 letters. Loop has 28 letters. [2024-10-12 01:03:41,957 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 01:03:41,957 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 383 transitions. Stem has 24 letters. Loop has 56 letters. [2024-10-12 01:03:41,963 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 01:03:41,963 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 413 states and 711 transitions. [2024-10-12 01:03:41,972 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 282 [2024-10-12 01:03:41,977 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 413 states to 413 states and 711 transitions. [2024-10-12 01:03:41,978 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 314 [2024-10-12 01:03:41,979 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 317 [2024-10-12 01:03:41,979 INFO L73 IsDeterministic]: Start isDeterministic. Operand 413 states and 711 transitions. [2024-10-12 01:03:41,979 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 01:03:41,979 INFO L218 hiAutomatonCegarLoop]: Abstraction has 413 states and 711 transitions. [2024-10-12 01:03:41,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states and 711 transitions. [2024-10-12 01:03:41,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 316. [2024-10-12 01:03:41,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 316 states have (on average 1.7278481012658229) internal successors, (546), 315 states have internal predecessors, (546), 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-12 01:03:42,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 546 transitions. [2024-10-12 01:03:42,005 INFO L240 hiAutomatonCegarLoop]: Abstraction has 316 states and 546 transitions. [2024-10-12 01:03:42,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 01:03:42,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 01:03:42,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 01:03:42,006 INFO L87 Difference]: Start difference. First operand 316 states and 546 transitions. 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-12 01:03:42,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 01:03:42,024 INFO L93 Difference]: Finished difference Result 316 states and 545 transitions. [2024-10-12 01:03:42,024 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 316 states and 545 transitions. [2024-10-12 01:03:42,027 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 188 [2024-10-12 01:03:42,030 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 316 states to 316 states and 545 transitions. [2024-10-12 01:03:42,030 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 220 [2024-10-12 01:03:42,031 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 220 [2024-10-12 01:03:42,032 INFO L73 IsDeterministic]: Start isDeterministic. Operand 316 states and 545 transitions. [2024-10-12 01:03:42,032 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 01:03:42,032 INFO L218 hiAutomatonCegarLoop]: Abstraction has 316 states and 545 transitions. [2024-10-12 01:03:42,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states and 545 transitions. [2024-10-12 01:03:42,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 316. [2024-10-12 01:03:42,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 316 states have (on average 1.7246835443037976) internal successors, (545), 315 states have internal predecessors, (545), 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-12 01:03:42,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 545 transitions. [2024-10-12 01:03:42,051 INFO L240 hiAutomatonCegarLoop]: Abstraction has 316 states and 545 transitions. [2024-10-12 01:03:42,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 01:03:42,053 INFO L425 stractBuchiCegarLoop]: Abstraction has 316 states and 545 transitions. [2024-10-12 01:03:42,054 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-10-12 01:03:42,054 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 316 states and 545 transitions. [2024-10-12 01:03:42,056 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 188 [2024-10-12 01:03:42,056 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 01:03:42,056 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 01:03:42,058 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-12 01:03:42,058 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-12 01:03:42,058 INFO L745 eck$LassoCheckResult]: Stem: 1696#$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(10, 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; 1697#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; 1748#L408 assume !(1 == ~c_req_up~0); 1685#L408-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 1830#L419-1 assume !(1 == ~c1_i~0);~c1_st~0 := 2; 1851#L424-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 1795#L429-1 assume !(1 == ~wb_i~0);~wb_st~0 := 2; 1796#L434-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 1760#L439-1 assume !(0 == ~e_f~0); 1624#L444-1 assume !(0 == ~e_g~0); 1625#L449-1 assume !(0 == ~e_e~0); 1785#L454-1 assume !(0 == ~e_c~0); 1786#L459-1 assume !(0 == ~e_wl~0); 1698#L464-1 assume !(1 == ~wl_pc~0); 1699#$Ultimate##44 assume !(2 == ~wl_pc~0); 1694#L477 assume !(1 == ~c1_pc~0); 1675#L487 assume !(1 == ~c2_pc~0); 1677#L496 assume !(1 == ~wb_pc~0); 1719#L505 assume !(1 == ~e_c~0); 1720#L514-1 assume !(1 == ~e_e~0); 1741#L519-1 assume !(1 == ~e_f~0); 1752#L524-1 assume !(1 == ~e_g~0); 1753#L529-1 assume !(1 == ~e_c~0); 1617#L534-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 1618#L676-1 [2024-10-12 01:03:42,058 INFO L747 eck$LassoCheckResult]: Loop: 1618#L676-1 assume !false; 1867#L546 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; 1807#L381 assume !false; 1742#L299 assume !(0 == ~wl_st~0); 1743#L303 assume !(0 == ~c1_st~0); 1852#L306 assume !(0 == ~c2_st~0); 1834#L309 assume !(0 == ~wb_st~0); 1835#L312 assume !(0 == ~r_st~0); 1853#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; 1859#L552 assume !(1 == ~c_req_up~0); 1794#L552-2 start_simulation_~kernel_st~0#1 := 3; 1664#L564 assume 0 == ~e_f~0;~e_f~0 := 1; 1665#L564-2 assume 0 == ~e_g~0;~e_g~0 := 1; 1674#L569-1 assume 0 == ~e_e~0;~e_e~0 := 1; 1855#L574-1 assume 0 == ~e_c~0;~e_c~0 := 1; 1856#L579-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 1902#L584-1 assume 1 == ~wl_pc~0; 1900#L590 assume 1 == ~e_wl~0;~wl_st~0 := 0; 1898#L597 assume !(1 == ~c1_pc~0); 1894#L607 assume !(1 == ~c2_pc~0); 1889#L616 assume !(1 == ~wb_pc~0); 1888#L625 assume 1 == ~e_c~0;~r_st~0 := 0; 1884#L634-1 assume 1 == ~e_e~0;~e_e~0 := 2; 1781#L639-1 assume 1 == ~e_f~0;~e_f~0 := 2; 1782#L644-1 assume 1 == ~e_g~0;~e_g~0 := 2; 1846#L649-1 assume 1 == ~e_c~0;~e_c~0 := 2; 1749#L654-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 1750#L659-1 assume 0 == ~wl_st~0; 1618#L676-1 [2024-10-12 01:03:42,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 01:03:42,059 INFO L85 PathProgramCache]: Analyzing trace with hash 1738779217, now seen corresponding path program 1 times [2024-10-12 01:03:42,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 01:03:42,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850463741] [2024-10-12 01:03:42,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 01:03:42,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 01:03:42,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:03:42,124 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-12 01:03:42,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 01:03:42,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850463741] [2024-10-12 01:03:42,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850463741] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 01:03:42,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 01:03:42,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 01:03:42,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090723280] [2024-10-12 01:03:42,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 01:03:42,126 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-12 01:03:42,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 01:03:42,126 INFO L85 PathProgramCache]: Analyzing trace with hash -1329201933, now seen corresponding path program 2 times [2024-10-12 01:03:42,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 01:03:42,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316957983] [2024-10-12 01:03:42,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 01:03:42,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 01:03:42,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 01:03:42,142 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 01:03:42,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 01:03:42,158 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 01:03:42,363 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 01:03:42,363 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 01:03:42,363 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 01:03:42,363 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 01:03:42,363 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-10-12 01:03:42,363 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:03:42,364 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 01:03:42,364 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 01:03:42,364 INFO L132 ssoRankerPreferences]: Filename of dumped script: toy.cil.c_Iteration3_Loop [2024-10-12 01:03:42,364 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 01:03:42,364 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 01:03:42,367 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:42,371 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:42,374 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:42,377 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:42,381 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:42,386 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:42,389 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:42,394 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:42,399 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:42,401 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:42,406 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:42,408 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:42,409 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:42,415 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:42,419 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:42,421 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:42,423 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:42,426 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:42,428 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:42,430 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:42,435 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:42,438 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:42,440 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:42,443 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:42,447 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:42,643 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 01:03:42,643 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-10-12 01:03:42,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:03:42,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:03:42,651 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 01:03:42,653 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2024-10-12 01:03:42,654 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 01:03:42,655 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 01:03:42,678 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-12 01:03:42,678 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-12 01:03:42,692 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2024-10-12 01:03:42,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:03:42,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:03:42,694 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 01:03:42,694 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2024-10-12 01:03:42,695 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 01:03:42,695 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 01:03:42,706 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-12 01:03:42,706 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-12 01:03:42,718 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2024-10-12 01:03:42,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:03:42,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:03:42,720 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 01:03:42,721 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2024-10-12 01:03:42,722 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 01:03:42,722 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 01:03:42,732 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-12 01:03:42,732 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-12 01:03:42,743 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2024-10-12 01:03:42,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:03:42,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:03:42,744 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 01:03:42,746 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2024-10-12 01:03:42,747 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 01:03:42,747 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 01:03:42,764 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-12 01:03:42,764 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-12 01:03:42,775 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2024-10-12 01:03:42,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:03:42,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:03:42,777 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 01:03:42,777 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2024-10-12 01:03:42,778 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 01:03:42,778 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 01:03:42,807 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2024-10-12 01:03:42,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:03:42,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:03:42,809 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 01:03:42,811 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2024-10-12 01:03:42,813 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-10-12 01:03:42,813 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 01:03:42,825 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-10-12 01:03:42,838 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2024-10-12 01:03:42,838 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 01:03:42,838 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 01:03:42,838 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 01:03:42,838 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 01:03:42,838 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-12 01:03:42,839 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:03:42,839 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 01:03:42,839 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 01:03:42,839 INFO L132 ssoRankerPreferences]: Filename of dumped script: toy.cil.c_Iteration3_Loop [2024-10-12 01:03:42,839 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 01:03:42,839 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 01:03:42,841 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:42,847 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:42,849 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:42,851 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:42,854 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:42,860 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:42,863 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:42,868 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:42,873 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:42,876 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:42,879 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:42,882 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:42,883 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:42,885 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:42,890 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:42,892 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:42,900 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:42,902 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:42,904 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:42,908 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:42,910 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:42,915 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:42,926 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:42,929 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:42,933 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:43,118 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 01:03:43,118 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-12 01:03:43,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:03:43,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:03:43,126 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 01:03:43,127 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2024-10-12 01:03:43,128 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-12 01:03:43,140 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 01:03:43,140 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 01:03:43,140 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 01:03:43,140 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2024-10-12 01:03:43,140 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 01:03:43,141 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2024-10-12 01:03:43,142 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 01:03:43,143 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 01:03:43,157 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2024-10-12 01:03:43,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:03:43,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:03:43,160 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 01:03:43,161 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2024-10-12 01:03:43,162 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-12 01:03:43,174 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 01:03:43,174 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 01:03:43,174 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 01:03:43,174 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 01:03:43,174 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 01:03:43,175 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 01:03:43,175 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 01:03:43,178 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 01:03:43,192 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2024-10-12 01:03:43,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:03:43,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:03:43,195 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 01:03:43,196 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2024-10-12 01:03:43,197 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-12 01:03:43,209 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 01:03:43,209 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 01:03:43,209 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 01:03:43,210 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 01:03:43,210 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 01:03:43,211 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 01:03:43,211 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 01:03:43,212 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 01:03:43,227 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2024-10-12 01:03:43,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:03:43,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:03:43,229 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 01:03:43,230 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2024-10-12 01:03:43,232 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-12 01:03:43,244 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 01:03:43,244 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 01:03:43,244 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 01:03:43,244 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2024-10-12 01:03:43,244 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 01:03:43,246 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2024-10-12 01:03:43,246 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 01:03:43,249 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 01:03:43,263 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2024-10-12 01:03:43,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:03:43,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:03:43,266 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 01:03:43,268 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2024-10-12 01:03:43,269 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-12 01:03:43,281 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 01:03:43,281 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 01:03:43,281 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 01:03:43,282 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 01:03:43,282 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 01:03:43,283 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 01:03:43,283 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 01:03:43,285 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-12 01:03:43,288 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-10-12 01:03:43,288 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-10-12 01:03:43,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:03:43,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:03:43,290 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 01:03:43,291 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2024-10-12 01:03:43,292 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-12 01:03:43,292 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-10-12 01:03:43,292 INFO L474 LassoAnalysis]: Proved termination. [2024-10-12 01:03:43,292 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(~e_c~0) = -1*~e_c~0 + 1 Supporting invariants [] [2024-10-12 01:03:43,307 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2024-10-12 01:03:43,309 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-10-12 01:03:43,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 01:03:43,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:03:43,358 INFO L255 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 01:03:43,359 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 01:03:43,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:03:43,420 INFO L255 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-12 01:03:43,421 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 01:03:43,478 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2024-10-12 01:03:43,519 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-12 01:03:43,519 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-12 01:03:43,519 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 316 states and 545 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-12 01:03:43,568 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 316 states and 545 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 604 states and 1037 transitions. Complement of second has 5 states. [2024-10-12 01:03:43,568 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-12 01:03:43,569 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-12 01:03:43,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 382 transitions. [2024-10-12 01:03:43,570 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 382 transitions. Stem has 24 letters. Loop has 28 letters. [2024-10-12 01:03:43,570 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 01:03:43,570 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 382 transitions. Stem has 52 letters. Loop has 28 letters. [2024-10-12 01:03:43,570 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 01:03:43,570 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 382 transitions. Stem has 24 letters. Loop has 56 letters. [2024-10-12 01:03:43,571 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 01:03:43,571 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 604 states and 1037 transitions. [2024-10-12 01:03:43,578 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 376 [2024-10-12 01:03:43,582 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 604 states to 604 states and 1037 transitions. [2024-10-12 01:03:43,582 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 409 [2024-10-12 01:03:43,583 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 412 [2024-10-12 01:03:43,583 INFO L73 IsDeterministic]: Start isDeterministic. Operand 604 states and 1037 transitions. [2024-10-12 01:03:43,583 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 01:03:43,583 INFO L218 hiAutomatonCegarLoop]: Abstraction has 604 states and 1037 transitions. [2024-10-12 01:03:43,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states and 1037 transitions. [2024-10-12 01:03:43,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 316. [2024-10-12 01:03:43,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 316 states have (on average 1.7246835443037976) internal successors, (545), 315 states have internal predecessors, (545), 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-12 01:03:43,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 545 transitions. [2024-10-12 01:03:43,594 INFO L240 hiAutomatonCegarLoop]: Abstraction has 316 states and 545 transitions. [2024-10-12 01:03:43,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 01:03:43,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 01:03:43,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 01:03:43,595 INFO L87 Difference]: Start difference. First operand 316 states and 545 transitions. 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-12 01:03:43,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 01:03:43,611 INFO L93 Difference]: Finished difference Result 316 states and 544 transitions. [2024-10-12 01:03:43,611 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 316 states and 544 transitions. [2024-10-12 01:03:43,617 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 188 [2024-10-12 01:03:43,619 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 316 states to 316 states and 544 transitions. [2024-10-12 01:03:43,619 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 220 [2024-10-12 01:03:43,620 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 220 [2024-10-12 01:03:43,620 INFO L73 IsDeterministic]: Start isDeterministic. Operand 316 states and 544 transitions. [2024-10-12 01:03:43,620 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 01:03:43,620 INFO L218 hiAutomatonCegarLoop]: Abstraction has 316 states and 544 transitions. [2024-10-12 01:03:43,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states and 544 transitions. [2024-10-12 01:03:43,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 316. [2024-10-12 01:03:43,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 316 states have (on average 1.7215189873417722) internal successors, (544), 315 states have internal predecessors, (544), 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-12 01:03:43,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 544 transitions. [2024-10-12 01:03:43,631 INFO L240 hiAutomatonCegarLoop]: Abstraction has 316 states and 544 transitions. [2024-10-12 01:03:43,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 01:03:43,634 INFO L425 stractBuchiCegarLoop]: Abstraction has 316 states and 544 transitions. [2024-10-12 01:03:43,634 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-10-12 01:03:43,634 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 316 states and 544 transitions. [2024-10-12 01:03:43,635 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 188 [2024-10-12 01:03:43,635 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 01:03:43,636 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 01:03:43,636 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-12 01:03:43,636 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-12 01:03:43,637 INFO L745 eck$LassoCheckResult]: Stem: 3423#$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(10, 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; 3424#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; 3475#L408 assume !(1 == ~c_req_up~0); 3412#L408-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 3554#L419-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 3573#L424-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 3524#L429-1 assume !(1 == ~wb_i~0);~wb_st~0 := 2; 3525#L434-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 3486#L439-1 assume !(0 == ~e_f~0); 3351#L444-1 assume !(0 == ~e_g~0); 3352#L449-1 assume !(0 == ~e_e~0); 3511#L454-1 assume !(0 == ~e_c~0); 3512#L459-1 assume !(0 == ~e_wl~0); 3425#L464-1 assume !(1 == ~wl_pc~0); 3426#$Ultimate##44 assume !(2 == ~wl_pc~0); 3421#L477 assume !(1 == ~c1_pc~0); 3408#L487 assume !(1 == ~c2_pc~0); 3410#L496 assume !(1 == ~wb_pc~0); 3446#L505 assume !(1 == ~e_c~0); 3447#L514-1 assume !(1 == ~e_e~0); 3472#L519-1 assume !(1 == ~e_f~0); 3478#L524-1 assume !(1 == ~e_g~0); 3479#L529-1 assume !(1 == ~e_c~0); 3345#L534-1 assume !(1 == ~e_wl~0); 3346#L676-1 assume !false; 3348#L546 [2024-10-12 01:03:43,637 INFO L747 eck$LassoCheckResult]: Loop: 3348#L546 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; 3396#L381 assume !false; 3468#L299 assume !(0 == ~wl_st~0); 3469#L303 assume !(0 == ~c1_st~0); 3571#L306 assume !(0 == ~c2_st~0); 3558#L309 assume !(0 == ~wb_st~0); 3559#L312 assume !(0 == ~r_st~0); 3574#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; 3580#L552 assume !(1 == ~c_req_up~0); 3520#L552-2 start_simulation_~kernel_st~0#1 := 3; 3521#L564 assume 0 == ~e_f~0;~e_f~0 := 1; 3401#L564-2 assume 0 == ~e_g~0;~e_g~0 := 1; 3353#L569-1 assume 0 == ~e_e~0;~e_e~0 := 1; 3354#L574-1 assume !(0 == ~e_c~0); 3373#L579-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 3374#L584-1 assume 1 == ~wl_pc~0; 3493#L590 assume 1 == ~e_wl~0;~wl_st~0 := 0; 3494#L597 assume !(1 == ~c1_pc~0); 3434#L607 assume !(1 == ~c2_pc~0); 3435#L616 assume !(1 == ~wb_pc~0); 3535#L625 assume 1 == ~e_c~0;~r_st~0 := 0; 3518#L634-1 assume 1 == ~e_e~0;~e_e~0 := 2; 3507#L639-1 assume 1 == ~e_f~0;~e_f~0 := 2; 3508#L644-1 assume 1 == ~e_g~0;~e_g~0 := 2; 3540#L649-1 assume !(1 == ~e_c~0); 3476#L654-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 3413#L659-1 assume 0 == ~wl_st~0; 3347#L676-1 assume !false; 3348#L546 [2024-10-12 01:03:43,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 01:03:43,637 INFO L85 PathProgramCache]: Analyzing trace with hash 1939846590, now seen corresponding path program 1 times [2024-10-12 01:03:43,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 01:03:43,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421351519] [2024-10-12 01:03:43,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 01:03:43,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 01:03:43,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:03:43,667 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-12 01:03:43,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 01:03:43,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421351519] [2024-10-12 01:03:43,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421351519] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 01:03:43,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 01:03:43,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 01:03:43,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21486639] [2024-10-12 01:03:43,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 01:03:43,668 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-12 01:03:43,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 01:03:43,668 INFO L85 PathProgramCache]: Analyzing trace with hash 1635242511, now seen corresponding path program 1 times [2024-10-12 01:03:43,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 01:03:43,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269114576] [2024-10-12 01:03:43,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 01:03:43,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 01:03:43,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:03:43,687 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-12 01:03:43,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 01:03:43,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269114576] [2024-10-12 01:03:43,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1269114576] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 01:03:43,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 01:03:43,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 01:03:43,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517093644] [2024-10-12 01:03:43,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 01:03:43,688 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-12 01:03:43,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 01:03:43,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 01:03:43,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 01:03:43,689 INFO L87 Difference]: Start difference. First operand 316 states and 544 transitions. cyclomatic complexity: 231 Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 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-12 01:03:43,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 01:03:43,696 INFO L93 Difference]: Finished difference Result 316 states and 543 transitions. [2024-10-12 01:03:43,696 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 316 states and 543 transitions. [2024-10-12 01:03:43,698 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 188 [2024-10-12 01:03:43,700 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 316 states to 316 states and 543 transitions. [2024-10-12 01:03:43,700 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 220 [2024-10-12 01:03:43,700 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 220 [2024-10-12 01:03:43,700 INFO L73 IsDeterministic]: Start isDeterministic. Operand 316 states and 543 transitions. [2024-10-12 01:03:43,701 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 01:03:43,701 INFO L218 hiAutomatonCegarLoop]: Abstraction has 316 states and 543 transitions. [2024-10-12 01:03:43,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states and 543 transitions. [2024-10-12 01:03:43,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 316. [2024-10-12 01:03:43,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 316 states have (on average 1.7183544303797469) internal successors, (543), 315 states have internal predecessors, (543), 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-12 01:03:43,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 543 transitions. [2024-10-12 01:03:43,707 INFO L240 hiAutomatonCegarLoop]: Abstraction has 316 states and 543 transitions. [2024-10-12 01:03:43,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 01:03:43,708 INFO L425 stractBuchiCegarLoop]: Abstraction has 316 states and 543 transitions. [2024-10-12 01:03:43,708 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-10-12 01:03:43,709 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 316 states and 543 transitions. [2024-10-12 01:03:43,710 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 188 [2024-10-12 01:03:43,710 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 01:03:43,710 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 01:03:43,711 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-12 01:03:43,711 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-12 01:03:43,712 INFO L745 eck$LassoCheckResult]: Stem: 4062#$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(10, 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; 4063#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; 4115#L408 assume !(1 == ~c_req_up~0); 4051#L408-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 4191#L419-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 4211#L424-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 4161#L429-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 4162#L434-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 4126#L439-1 assume !(0 == ~e_f~0); 3990#L444-1 assume !(0 == ~e_g~0); 3991#L449-1 assume !(0 == ~e_e~0); 4151#L454-1 assume !(0 == ~e_c~0); 4152#L459-1 assume !(0 == ~e_wl~0); 4064#L464-1 assume !(1 == ~wl_pc~0); 4065#$Ultimate##44 assume !(2 == ~wl_pc~0); 4060#L477 assume !(1 == ~c1_pc~0); 4041#L487 assume !(1 == ~c2_pc~0); 4043#L496 assume !(1 == ~wb_pc~0); 4085#L505 assume !(1 == ~e_c~0); 4086#L514-1 assume !(1 == ~e_e~0); 4107#L519-1 assume !(1 == ~e_f~0); 4116#L524-1 assume !(1 == ~e_g~0); 4117#L529-1 assume !(1 == ~e_c~0); 3984#L534-1 assume !(1 == ~e_wl~0); 3985#L676-1 assume !false; 3987#L546 [2024-10-12 01:03:43,712 INFO L747 eck$LassoCheckResult]: Loop: 3987#L546 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; 4035#L381 assume !false; 4108#L299 assume !(0 == ~wl_st~0); 4110#L303 assume !(0 == ~c1_st~0); 4209#L306 assume !(0 == ~c2_st~0); 4196#L309 assume !(0 == ~wb_st~0); 4197#L312 assume !(0 == ~r_st~0); 4212#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; 4218#L552 assume !(1 == ~c_req_up~0); 4159#L552-2 start_simulation_~kernel_st~0#1 := 3; 4160#L564 assume 0 == ~e_f~0;~e_f~0 := 1; 4040#L564-2 assume 0 == ~e_g~0;~e_g~0 := 1; 3992#L569-1 assume 0 == ~e_e~0;~e_e~0 := 1; 3993#L574-1 assume !(0 == ~e_c~0); 4012#L579-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 4013#L584-1 assume 1 == ~wl_pc~0; 4133#L590 assume 1 == ~e_wl~0;~wl_st~0 := 0; 4134#L597 assume !(1 == ~c1_pc~0); 4073#L607 assume !(1 == ~c2_pc~0); 4074#L616 assume !(1 == ~wb_pc~0); 4173#L625 assume 1 == ~e_c~0;~r_st~0 := 0; 4157#L634-1 assume 1 == ~e_e~0;~e_e~0 := 2; 4147#L639-1 assume 1 == ~e_f~0;~e_f~0 := 2; 4148#L644-1 assume 1 == ~e_g~0;~e_g~0 := 2; 4178#L649-1 assume !(1 == ~e_c~0); 4118#L654-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 4052#L659-1 assume 0 == ~wl_st~0; 3986#L676-1 assume !false; 3987#L546 [2024-10-12 01:03:43,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 01:03:43,713 INFO L85 PathProgramCache]: Analyzing trace with hash -666176964, now seen corresponding path program 1 times [2024-10-12 01:03:43,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 01:03:43,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785575363] [2024-10-12 01:03:43,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 01:03:43,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 01:03:43,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 01:03:43,726 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 01:03:43,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 01:03:43,741 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 01:03:43,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 01:03:43,742 INFO L85 PathProgramCache]: Analyzing trace with hash 1635242511, now seen corresponding path program 2 times [2024-10-12 01:03:43,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 01:03:43,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737097481] [2024-10-12 01:03:43,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 01:03:43,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 01:03:43,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:03:43,761 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-12 01:03:43,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 01:03:43,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737097481] [2024-10-12 01:03:43,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737097481] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 01:03:43,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 01:03:43,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 01:03:43,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767135876] [2024-10-12 01:03:43,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 01:03:43,762 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-12 01:03:43,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 01:03:43,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 01:03:43,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 01:03:43,763 INFO L87 Difference]: Start difference. First operand 316 states and 543 transitions. cyclomatic complexity: 230 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-12 01:03:43,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 01:03:43,791 INFO L93 Difference]: Finished difference Result 378 states and 658 transitions. [2024-10-12 01:03:43,791 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 378 states and 658 transitions. [2024-10-12 01:03:43,794 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 204 [2024-10-12 01:03:43,796 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 378 states to 363 states and 628 transitions. [2024-10-12 01:03:43,796 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 252 [2024-10-12 01:03:43,796 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 252 [2024-10-12 01:03:43,796 INFO L73 IsDeterministic]: Start isDeterministic. Operand 363 states and 628 transitions. [2024-10-12 01:03:43,797 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 01:03:43,797 INFO L218 hiAutomatonCegarLoop]: Abstraction has 363 states and 628 transitions. [2024-10-12 01:03:43,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states and 628 transitions. [2024-10-12 01:03:43,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 363. [2024-10-12 01:03:43,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 363 states, 363 states have (on average 1.7300275482093663) internal successors, (628), 362 states have internal predecessors, (628), 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-12 01:03:43,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 628 transitions. [2024-10-12 01:03:43,803 INFO L240 hiAutomatonCegarLoop]: Abstraction has 363 states and 628 transitions. [2024-10-12 01:03:43,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 01:03:43,804 INFO L425 stractBuchiCegarLoop]: Abstraction has 363 states and 628 transitions. [2024-10-12 01:03:43,804 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-10-12 01:03:43,804 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 363 states and 628 transitions. [2024-10-12 01:03:43,806 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 204 [2024-10-12 01:03:43,806 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 01:03:43,806 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 01:03:43,807 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-12 01:03:43,807 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-12 01:03:43,807 INFO L745 eck$LassoCheckResult]: Stem: 4761#$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(10, 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; 4762#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; 4816#L408 assume !(1 == ~c_req_up~0); 4750#L408-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 4899#L419-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 4919#L424-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 4863#L429-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 4864#L434-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 4827#L439-1 assume !(0 == ~e_f~0); 4690#L444-1 assume !(0 == ~e_g~0); 4691#L449-1 assume !(0 == ~e_e~0); 4852#L454-1 assume 0 == ~e_c~0;~e_c~0 := 1; 4853#L459-1 assume !(0 == ~e_wl~0); 4988#L464-1 assume !(1 == ~wl_pc~0); 4986#$Ultimate##44 assume !(2 == ~wl_pc~0); 4984#L477 assume !(1 == ~c1_pc~0); 4982#L487 assume !(1 == ~c2_pc~0); 4900#L496 assume !(1 == ~wb_pc~0); 4784#L505 assume 1 == ~e_c~0;~r_st~0 := 0; 4785#L514-1 assume !(1 == ~e_e~0); 4923#L519-1 assume !(1 == ~e_f~0); 4922#L524-1 assume !(1 == ~e_g~0); 4921#L529-1 assume 1 == ~e_c~0;~e_c~0 := 2; 4684#L534-1 assume !(1 == ~e_wl~0); 4685#L676-1 assume !false; 4924#L546 [2024-10-12 01:03:43,808 INFO L747 eck$LassoCheckResult]: Loop: 4924#L546 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; 4958#L381 assume !false; 4807#L299 assume !(0 == ~wl_st~0); 4809#L303 assume !(0 == ~c1_st~0); 4917#L306 assume !(0 == ~c2_st~0); 4904#L309 assume !(0 == ~wb_st~0); 4905#L312 assume !(0 == ~r_st~0); 4908#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; 4821#L552 assume !(1 == ~c_req_up~0); 4822#L552-2 start_simulation_~kernel_st~0#1 := 3; 4730#L564 assume 0 == ~e_f~0;~e_f~0 := 1; 4731#L564-2 assume 0 == ~e_g~0;~e_g~0 := 1; 4692#L569-1 assume 0 == ~e_e~0;~e_e~0 := 1; 4693#L574-1 assume !(0 == ~e_c~0); 4712#L579-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 4713#L584-1 assume 1 == ~wl_pc~0; 4834#L590 assume 1 == ~e_wl~0;~wl_st~0 := 0; 4835#L597 assume !(1 == ~c1_pc~0); 4772#L607 assume !(1 == ~c2_pc~0); 4773#L616 assume !(1 == ~wb_pc~0); 4877#L625 assume !(1 == ~e_c~0); 4859#L634-1 assume 1 == ~e_e~0;~e_e~0 := 2; 4848#L639-1 assume 1 == ~e_f~0;~e_f~0 := 2; 4849#L644-1 assume 1 == ~e_g~0;~e_g~0 := 2; 4882#L649-1 assume !(1 == ~e_c~0); 4883#L654-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 4968#L659-1 assume 0 == ~wl_st~0; 4963#L676-1 assume !false; 4924#L546 [2024-10-12 01:03:43,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 01:03:43,808 INFO L85 PathProgramCache]: Analyzing trace with hash -1430068998, now seen corresponding path program 1 times [2024-10-12 01:03:43,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 01:03:43,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628541230] [2024-10-12 01:03:43,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 01:03:43,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 01:03:43,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:03:43,853 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-12 01:03:43,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 01:03:43,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628541230] [2024-10-12 01:03:43,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [628541230] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 01:03:43,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 01:03:43,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 01:03:43,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463511887] [2024-10-12 01:03:43,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 01:03:43,854 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-12 01:03:43,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 01:03:43,854 INFO L85 PathProgramCache]: Analyzing trace with hash 825895885, now seen corresponding path program 1 times [2024-10-12 01:03:43,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 01:03:43,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909929948] [2024-10-12 01:03:43,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 01:03:43,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 01:03:43,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 01:03:43,859 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 01:03:43,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 01:03:43,864 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 01:03:44,021 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 01:03:44,021 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 01:03:44,021 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 01:03:44,021 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 01:03:44,021 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-10-12 01:03:44,022 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:03:44,022 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 01:03:44,022 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 01:03:44,022 INFO L132 ssoRankerPreferences]: Filename of dumped script: toy.cil.c_Iteration6_Loop [2024-10-12 01:03:44,022 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 01:03:44,022 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 01:03:44,023 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:44,028 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:44,029 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:44,031 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:44,034 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:44,038 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:44,041 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:44,043 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:44,045 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:44,047 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:44,052 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:44,054 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:44,056 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:44,058 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:44,062 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:44,064 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:44,065 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:44,068 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:44,071 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:44,073 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:44,078 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:44,079 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:44,081 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:44,083 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:44,085 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:44,265 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 01:03:44,265 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-10-12 01:03:44,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:03:44,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:03:44,270 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 01:03:44,271 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2024-10-12 01:03:44,273 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 01:03:44,273 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 01:03:44,301 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2024-10-12 01:03:44,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:03:44,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:03:44,303 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 01:03:44,304 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2024-10-12 01:03:44,306 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-10-12 01:03:44,306 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 01:03:44,321 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-10-12 01:03:44,336 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2024-10-12 01:03:44,337 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 01:03:44,337 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 01:03:44,337 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 01:03:44,337 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 01:03:44,337 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-12 01:03:44,337 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:03:44,337 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 01:03:44,337 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 01:03:44,337 INFO L132 ssoRankerPreferences]: Filename of dumped script: toy.cil.c_Iteration6_Loop [2024-10-12 01:03:44,337 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 01:03:44,337 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 01:03:44,339 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:44,343 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:44,347 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:44,351 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:44,356 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:44,361 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:44,363 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:44,366 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:44,368 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:44,370 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:44,375 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:44,377 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:44,379 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:44,382 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:44,384 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:44,388 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:44,390 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:44,393 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:44,395 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:44,397 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:44,399 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:44,403 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:44,405 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:44,407 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:44,409 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:44,607 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 01:03:44,607 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-12 01:03:44,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:03:44,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:03:44,611 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 01:03:44,612 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2024-10-12 01:03:44,614 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-12 01:03:44,627 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 01:03:44,627 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 01:03:44,627 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 01:03:44,628 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 01:03:44,628 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 01:03:44,628 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 01:03:44,628 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 01:03:44,630 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 01:03:44,643 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2024-10-12 01:03:44,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:03:44,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:03:44,647 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 01:03:44,649 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2024-10-12 01:03:44,650 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-12 01:03:44,662 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 01:03:44,662 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 01:03:44,662 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 01:03:44,662 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 01:03:44,662 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 01:03:44,663 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 01:03:44,663 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 01:03:44,668 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-12 01:03:44,672 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-10-12 01:03:44,672 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-10-12 01:03:44,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:03:44,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:03:44,674 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 01:03:44,675 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2024-10-12 01:03:44,676 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-12 01:03:44,676 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-10-12 01:03:44,676 INFO L474 LassoAnalysis]: Proved termination. [2024-10-12 01:03:44,676 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(~e_f~0) = -1*~e_f~0 + 1 Supporting invariants [] [2024-10-12 01:03:44,691 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2024-10-12 01:03:44,692 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-10-12 01:03:44,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 01:03:44,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:03:44,737 INFO L255 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 01:03:44,738 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 01:03:44,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:03:44,780 INFO L255 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-12 01:03:44,781 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 01:03:44,843 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-12 01:03:44,844 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-12 01:03:44,844 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 363 states and 628 transitions. cyclomatic complexity: 268 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-12 01:03:44,880 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 363 states and 628 transitions. cyclomatic complexity: 268. 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 980 states and 1690 transitions. Complement of second has 5 states. [2024-10-12 01:03:44,880 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-12 01:03:44,881 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-12 01:03:44,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 212 transitions. [2024-10-12 01:03:44,881 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 212 transitions. Stem has 25 letters. Loop has 28 letters. [2024-10-12 01:03:44,882 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 01:03:44,882 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 212 transitions. Stem has 53 letters. Loop has 28 letters. [2024-10-12 01:03:44,882 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 01:03:44,882 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 212 transitions. Stem has 25 letters. Loop has 56 letters. [2024-10-12 01:03:44,882 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 01:03:44,883 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 980 states and 1690 transitions. [2024-10-12 01:03:44,890 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 388 [2024-10-12 01:03:44,895 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 980 states to 965 states and 1669 transitions. [2024-10-12 01:03:44,896 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 448 [2024-10-12 01:03:44,896 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 454 [2024-10-12 01:03:44,896 INFO L73 IsDeterministic]: Start isDeterministic. Operand 965 states and 1669 transitions. [2024-10-12 01:03:44,897 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 01:03:44,897 INFO L218 hiAutomatonCegarLoop]: Abstraction has 965 states and 1669 transitions. [2024-10-12 01:03:44,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 965 states and 1669 transitions. [2024-10-12 01:03:44,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 965 to 944. [2024-10-12 01:03:44,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 944 states, 944 states have (on average 1.7394067796610169) internal successors, (1642), 943 states have internal predecessors, (1642), 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-12 01:03:44,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 944 states to 944 states and 1642 transitions. [2024-10-12 01:03:44,916 INFO L240 hiAutomatonCegarLoop]: Abstraction has 944 states and 1642 transitions. [2024-10-12 01:03:44,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 01:03:44,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 01:03:44,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 01:03:44,917 INFO L87 Difference]: Start difference. First operand 944 states and 1642 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-12 01:03:45,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 01:03:45,008 INFO L93 Difference]: Finished difference Result 1315 states and 2246 transitions. [2024-10-12 01:03:45,008 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1315 states and 2246 transitions. [2024-10-12 01:03:45,017 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 484 [2024-10-12 01:03:45,024 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1315 states to 1315 states and 2246 transitions. [2024-10-12 01:03:45,024 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 572 [2024-10-12 01:03:45,025 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 572 [2024-10-12 01:03:45,025 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1315 states and 2246 transitions. [2024-10-12 01:03:45,026 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 01:03:45,026 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1315 states and 2246 transitions. [2024-10-12 01:03:45,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1315 states and 2246 transitions. [2024-10-12 01:03:45,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1315 to 1125. [2024-10-12 01:03:45,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1125 states, 1125 states have (on average 1.7182222222222223) internal successors, (1933), 1124 states have internal predecessors, (1933), 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-12 01:03:45,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1125 states to 1125 states and 1933 transitions. [2024-10-12 01:03:45,050 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1125 states and 1933 transitions. [2024-10-12 01:03:45,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 01:03:45,051 INFO L425 stractBuchiCegarLoop]: Abstraction has 1125 states and 1933 transitions. [2024-10-12 01:03:45,051 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-10-12 01:03:45,051 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1125 states and 1933 transitions. [2024-10-12 01:03:45,056 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 400 [2024-10-12 01:03:45,056 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 01:03:45,056 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 01:03:45,057 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-12 01:03:45,057 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-12 01:03:45,057 INFO L745 eck$LassoCheckResult]: Stem: 8545#$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(10, 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; 8546#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; 8600#L408 assume !(1 == ~c_req_up~0); 8712#L408-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 8729#L419-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 8730#L424-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 8738#L429-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 8737#L434-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 8611#L439-1 assume !(0 == ~e_f~0); 8474#L444-1 assume !(0 == ~e_g~0); 8475#L449-1 assume !(0 == ~e_e~0); 8636#L454-1 assume !(0 == ~e_c~0); 8637#L459-1 assume !(0 == ~e_wl~0); 8547#L464-1 assume !(1 == ~wl_pc~0); 8548#$Ultimate##44 assume !(2 == ~wl_pc~0); 8542#L477 assume !(1 == ~c1_pc~0); 8544#L487 assume !(1 == ~c2_pc~0); 9087#L496 assume !(1 == ~wb_pc~0); 9085#L505 assume 1 == ~e_c~0;~r_st~0 := 0; 8569#L514-1 assume !(1 == ~e_e~0); 8597#L519-1 assume !(1 == ~e_f~0); 8603#L524-1 assume !(1 == ~e_g~0); 8604#L529-1 assume 1 == ~e_c~0;~e_c~0 := 2; 8468#L534-1 assume !(1 == ~e_wl~0); 8469#L676-1 assume !false; 8808#L546 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; 8519#L381 [2024-10-12 01:03:45,058 INFO L747 eck$LassoCheckResult]: Loop: 8519#L381 assume !false; 8592#L299 assume 0 == ~wl_st~0; 8550#L312-1 assume !(0 == ~wl_st~0); 8551#L321 assume !(0 == ~c1_st~0); 8512#L336 assume !(0 == ~c2_st~0); 8572#L351 assume !(0 == ~wb_st~0); 8481#L366 assume !(0 == ~r_st~0); 8519#L381 [2024-10-12 01:03:45,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 01:03:45,058 INFO L85 PathProgramCache]: Analyzing trace with hash 1632637821, now seen corresponding path program 1 times [2024-10-12 01:03:45,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 01:03:45,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370992496] [2024-10-12 01:03:45,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 01:03:45,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 01:03:45,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:03:45,095 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-12 01:03:45,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 01:03:45,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370992496] [2024-10-12 01:03:45,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370992496] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 01:03:45,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 01:03:45,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 01:03:45,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677427995] [2024-10-12 01:03:45,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 01:03:45,096 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-12 01:03:45,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 01:03:45,096 INFO L85 PathProgramCache]: Analyzing trace with hash 121813293, now seen corresponding path program 1 times [2024-10-12 01:03:45,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 01:03:45,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739146655] [2024-10-12 01:03:45,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 01:03:45,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 01:03:45,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:03:45,122 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-12 01:03:45,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 01:03:45,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739146655] [2024-10-12 01:03:45,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739146655] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 01:03:45,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 01:03:45,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 01:03:45,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063021407] [2024-10-12 01:03:45,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 01:03:45,123 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-12 01:03:45,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 01:03:45,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 01:03:45,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 01:03:45,123 INFO L87 Difference]: Start difference. First operand 1125 states and 1933 transitions. cyclomatic complexity: 819 Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 01:03:45,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 01:03:45,161 INFO L93 Difference]: Finished difference Result 1795 states and 3046 transitions. [2024-10-12 01:03:45,161 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1795 states and 3046 transitions. [2024-10-12 01:03:45,173 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 646 [2024-10-12 01:03:45,183 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1795 states to 1795 states and 3046 transitions. [2024-10-12 01:03:45,183 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 726 [2024-10-12 01:03:45,184 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 726 [2024-10-12 01:03:45,184 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1795 states and 3046 transitions. [2024-10-12 01:03:45,184 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 01:03:45,184 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1795 states and 3046 transitions. [2024-10-12 01:03:45,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1795 states and 3046 transitions. [2024-10-12 01:03:45,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1795 to 1795. [2024-10-12 01:03:45,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1795 states, 1795 states have (on average 1.6969359331476324) internal successors, (3046), 1794 states have internal predecessors, (3046), 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-12 01:03:45,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1795 states to 1795 states and 3046 transitions. [2024-10-12 01:03:45,220 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1795 states and 3046 transitions. [2024-10-12 01:03:45,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 01:03:45,221 INFO L425 stractBuchiCegarLoop]: Abstraction has 1795 states and 3046 transitions. [2024-10-12 01:03:45,221 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-10-12 01:03:45,221 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1795 states and 3046 transitions. [2024-10-12 01:03:45,229 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 646 [2024-10-12 01:03:45,229 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 01:03:45,229 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 01:03:45,230 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-12 01:03:45,230 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 01:03:45,230 INFO L745 eck$LassoCheckResult]: Stem: 11472#$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(10, 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; 11473#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; 11525#L408 assume !(1 == ~c_req_up~0); 11461#L408-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 11691#L419-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 11690#L424-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 11689#L429-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 11688#L434-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 11538#L439-1 assume !(0 == ~e_f~0); 11401#L444-1 assume !(0 == ~e_g~0); 11402#L449-1 assume !(0 == ~e_e~0); 11565#L454-1 assume !(0 == ~e_c~0); 11566#L459-1 assume !(0 == ~e_wl~0); 11474#L464-1 assume !(1 == ~wl_pc~0); 11475#$Ultimate##44 assume !(2 == ~wl_pc~0); 11470#L477 assume !(1 == ~c1_pc~0); 11452#L487 assume !(1 == ~c2_pc~0); 11454#L496 assume !(1 == ~wb_pc~0); 12093#L505 assume 1 == ~e_c~0;~r_st~0 := 0; 11494#L514-1 assume !(1 == ~e_e~0); 11693#L519-1 assume !(1 == ~e_f~0); 11692#L524-1 assume !(1 == ~e_g~0); 11680#L529-1 assume 1 == ~e_c~0;~e_c~0 := 2; 11395#L534-1 assume !(1 == ~e_wl~0); 11396#L676-1 assume !false; 12065#L546 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; 12417#L381 [2024-10-12 01:03:45,230 INFO L747 eck$LassoCheckResult]: Loop: 12417#L381 assume !false; 12907#L299 assume 0 == ~wl_st~0; 12905#L312-1 assume 0 == ~wl_st~0;havoc eval_#t~nondet4#1;eval_~tmp~0#1 := eval_#t~nondet4#1;havoc eval_#t~nondet4#1; 12902#L325 assume !(0 != eval_~tmp~0#1); 11588#L321 assume !(0 == ~c1_st~0); 11439#L336 assume !(0 == ~c2_st~0); 11497#L351 assume !(0 == ~wb_st~0); 11408#L366 assume !(0 == ~r_st~0); 12417#L381 [2024-10-12 01:03:45,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 01:03:45,231 INFO L85 PathProgramCache]: Analyzing trace with hash 1632637821, now seen corresponding path program 2 times [2024-10-12 01:03:45,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 01:03:45,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852111709] [2024-10-12 01:03:45,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 01:03:45,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 01:03:45,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:03:45,273 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-12 01:03:45,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 01:03:45,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852111709] [2024-10-12 01:03:45,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1852111709] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 01:03:45,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 01:03:45,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 01:03:45,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934095670] [2024-10-12 01:03:45,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 01:03:45,274 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-12 01:03:45,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 01:03:45,274 INFO L85 PathProgramCache]: Analyzing trace with hash 1284632440, now seen corresponding path program 1 times [2024-10-12 01:03:45,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 01:03:45,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73342491] [2024-10-12 01:03:45,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 01:03:45,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 01:03:45,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 01:03:45,279 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 01:03:45,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 01:03:45,284 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 01:03:45,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 01:03:45,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 01:03:45,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 01:03:45,314 INFO L87 Difference]: Start difference. First operand 1795 states and 3046 transitions. cyclomatic complexity: 1262 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-12 01:03:45,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 01:03:45,354 INFO L93 Difference]: Finished difference Result 3100 states and 5202 transitions. [2024-10-12 01:03:45,354 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3100 states and 5202 transitions. [2024-10-12 01:03:45,373 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 1226 [2024-10-12 01:03:45,433 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3100 states to 2525 states and 4241 transitions. [2024-10-12 01:03:45,434 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1311 [2024-10-12 01:03:45,435 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1343 [2024-10-12 01:03:45,435 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2525 states and 4241 transitions. [2024-10-12 01:03:45,436 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 01:03:45,436 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2525 states and 4241 transitions. [2024-10-12 01:03:45,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2525 states and 4241 transitions. [2024-10-12 01:03:45,458 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2024-10-12 01:03:45,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2525 to 1638. [2024-10-12 01:03:45,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1638 states, 1638 states have (on average 1.6904761904761905) internal successors, (2769), 1637 states have internal predecessors, (2769), 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-12 01:03:45,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1638 states to 1638 states and 2769 transitions. [2024-10-12 01:03:45,495 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1638 states and 2769 transitions. [2024-10-12 01:03:45,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 01:03:45,496 INFO L425 stractBuchiCegarLoop]: Abstraction has 1638 states and 2769 transitions. [2024-10-12 01:03:45,496 INFO L332 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2024-10-12 01:03:45,496 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1638 states and 2769 transitions. [2024-10-12 01:03:45,503 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 646 [2024-10-12 01:03:45,504 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 01:03:45,504 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 01:03:45,504 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-12 01:03:45,504 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 01:03:45,506 INFO L745 eck$LassoCheckResult]: Stem: 16373#$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(10, 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; 16374#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; 16424#L408 assume !(1 == ~c_req_up~0); 16515#L408-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 16516#L419-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 16557#L424-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 16558#L429-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 16549#L434-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 16436#L439-1 assume !(0 == ~e_f~0); 16302#L444-1 assume !(0 == ~e_g~0); 16303#L449-1 assume !(0 == ~e_e~0); 16463#L454-1 assume !(0 == ~e_c~0); 16464#L459-1 assume !(0 == ~e_wl~0); 16544#L464-1 assume !(1 == ~wl_pc~0); 16596#$Ultimate##44 assume !(2 == ~wl_pc~0); 16592#L477 assume !(1 == ~c1_pc~0); 16590#L487 assume !(1 == ~c2_pc~0); 16587#L496 assume !(1 == ~wb_pc~0); 16394#L505 assume !(1 == ~e_c~0); 16395#L514-1 assume !(1 == ~e_e~0); 16417#L519-1 assume 1 == ~e_f~0;~e_f~0 := 2; 16425#L524-1 assume !(1 == ~e_g~0); 16426#L529-1 assume !(1 == ~e_c~0); 16296#L534-1 assume !(1 == ~e_wl~0); 16297#L676-1 assume !false; 16733#L546 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; 16347#L381 [2024-10-12 01:03:45,506 INFO L747 eck$LassoCheckResult]: Loop: 16347#L381 assume !false; 17800#L299 assume 0 == ~wl_st~0; 17757#L312-1 assume 0 == ~wl_st~0;havoc eval_#t~nondet4#1;eval_~tmp~0#1 := eval_#t~nondet4#1;havoc eval_#t~nondet4#1; 17794#L325 assume !(0 != eval_~tmp~0#1); 16487#L321 assume !(0 == ~c1_st~0); 16340#L336 assume !(0 == ~c2_st~0); 16398#L351 assume !(0 == ~wb_st~0); 16309#L366 assume !(0 == ~r_st~0); 16347#L381 [2024-10-12 01:03:45,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 01:03:45,507 INFO L85 PathProgramCache]: Analyzing trace with hash 766092475, now seen corresponding path program 1 times [2024-10-12 01:03:45,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 01:03:45,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847495768] [2024-10-12 01:03:45,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 01:03:45,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 01:03:45,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:03:45,554 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-12 01:03:45,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 01:03:45,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847495768] [2024-10-12 01:03:45,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847495768] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 01:03:45,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 01:03:45,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 01:03:45,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236610407] [2024-10-12 01:03:45,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 01:03:45,556 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-12 01:03:45,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 01:03:45,556 INFO L85 PathProgramCache]: Analyzing trace with hash 1284632440, now seen corresponding path program 2 times [2024-10-12 01:03:45,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 01:03:45,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808115542] [2024-10-12 01:03:45,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 01:03:45,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 01:03:45,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 01:03:45,563 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 01:03:45,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 01:03:45,566 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 01:03:45,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 01:03:45,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 01:03:45,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 01:03:45,599 INFO L87 Difference]: Start difference. First operand 1638 states and 2769 transitions. cyclomatic complexity: 1138 Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 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-12 01:03:45,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 01:03:45,718 INFO L93 Difference]: Finished difference Result 2129 states and 3576 transitions. [2024-10-12 01:03:45,718 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2129 states and 3576 transitions. [2024-10-12 01:03:45,732 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 870 [2024-10-12 01:03:45,743 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2129 states to 2129 states and 3576 transitions. [2024-10-12 01:03:45,743 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1079 [2024-10-12 01:03:45,744 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1079 [2024-10-12 01:03:45,744 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2129 states and 3576 transitions. [2024-10-12 01:03:45,745 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 01:03:45,745 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2129 states and 3576 transitions. [2024-10-12 01:03:45,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2129 states and 3576 transitions. [2024-10-12 01:03:45,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2129 to 1941. [2024-10-12 01:03:45,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1941 states, 1941 states have (on average 1.6867594023699124) internal successors, (3274), 1940 states have internal predecessors, (3274), 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-12 01:03:45,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1941 states to 1941 states and 3274 transitions. [2024-10-12 01:03:45,784 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1941 states and 3274 transitions. [2024-10-12 01:03:45,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 01:03:45,784 INFO L425 stractBuchiCegarLoop]: Abstraction has 1941 states and 3274 transitions. [2024-10-12 01:03:45,785 INFO L332 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2024-10-12 01:03:45,785 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1941 states and 3274 transitions. [2024-10-12 01:03:45,792 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 728 [2024-10-12 01:03:45,792 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 01:03:45,792 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 01:03:45,793 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-12 01:03:45,793 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 01:03:45,793 INFO L745 eck$LassoCheckResult]: Stem: 20150#$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(10, 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; 20151#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; 20205#L408 assume !(1 == ~c_req_up~0); 20139#L408-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 20366#L419-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 20367#L424-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 20259#L429-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 20260#L434-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 20217#L439-1 assume !(0 == ~e_f~0); 20079#L444-1 assume !(0 == ~e_g~0); 20080#L449-1 assume !(0 == ~e_e~0); 20243#L454-1 assume !(0 == ~e_c~0); 20244#L459-1 assume !(0 == ~e_wl~0); 20152#L464-1 assume !(1 == ~wl_pc~0); 20153#$Ultimate##44 assume !(2 == ~wl_pc~0); 20446#L477 assume !(1 == ~c1_pc~0); 20405#L487 assume !(1 == ~c2_pc~0); 20401#L496 assume !(1 == ~wb_pc~0); 20398#L505 assume !(1 == ~e_c~0); 20396#L514-1 assume !(1 == ~e_e~0); 20393#L519-1 assume !(1 == ~e_f~0); 20391#L524-1 assume !(1 == ~e_g~0); 20373#L529-1 assume !(1 == ~e_c~0); 20374#L534-1 assume !(1 == ~e_wl~0); 21328#L676-1 assume !false; 21011#L546 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; 20124#L381 [2024-10-12 01:03:45,793 INFO L747 eck$LassoCheckResult]: Loop: 20124#L381 assume !false; 20198#L299 assume 0 == ~wl_st~0; 20155#L312-1 assume 0 == ~wl_st~0;havoc eval_#t~nondet4#1;eval_~tmp~0#1 := eval_#t~nondet4#1;havoc eval_#t~nondet4#1; 20156#L325 assume !(0 != eval_~tmp~0#1); 20271#L321 assume !(0 == ~c1_st~0); 20117#L336 assume !(0 == ~c2_st~0); 20175#L351 assume !(0 == ~wb_st~0); 20086#L366 assume !(0 == ~r_st~0); 20124#L381 [2024-10-12 01:03:45,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 01:03:45,794 INFO L85 PathProgramCache]: Analyzing trace with hash 823350777, now seen corresponding path program 1 times [2024-10-12 01:03:45,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 01:03:45,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718719472] [2024-10-12 01:03:45,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 01:03:45,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 01:03:45,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 01:03:45,803 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 01:03:45,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 01:03:45,814 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 01:03:45,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 01:03:45,815 INFO L85 PathProgramCache]: Analyzing trace with hash 1284632440, now seen corresponding path program 3 times [2024-10-12 01:03:45,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 01:03:45,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591547846] [2024-10-12 01:03:45,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 01:03:45,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 01:03:45,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 01:03:45,818 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 01:03:45,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 01:03:45,820 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 01:03:45,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 01:03:45,821 INFO L85 PathProgramCache]: Analyzing trace with hash 365677936, now seen corresponding path program 1 times [2024-10-12 01:03:45,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 01:03:45,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036801671] [2024-10-12 01:03:45,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 01:03:45,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 01:03:45,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:03:45,846 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-12 01:03:45,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 01:03:45,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036801671] [2024-10-12 01:03:45,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036801671] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 01:03:45,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 01:03:45,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 01:03:45,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044119927] [2024-10-12 01:03:45,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 01:03:45,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 01:03:45,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 01:03:45,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 01:03:45,874 INFO L87 Difference]: Start difference. First operand 1941 states and 3274 transitions. cyclomatic complexity: 1340 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-12 01:03:45,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 01:03:45,909 INFO L93 Difference]: Finished difference Result 3072 states and 5123 transitions. [2024-10-12 01:03:45,909 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3072 states and 5123 transitions. [2024-10-12 01:03:45,924 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1134 [2024-10-12 01:03:45,939 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3072 states to 3072 states and 5123 transitions. [2024-10-12 01:03:45,940 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1394 [2024-10-12 01:03:45,941 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1394 [2024-10-12 01:03:45,941 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3072 states and 5123 transitions. [2024-10-12 01:03:45,942 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 01:03:45,942 INFO L218 hiAutomatonCegarLoop]: Abstraction has 3072 states and 5123 transitions. [2024-10-12 01:03:45,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3072 states and 5123 transitions. [2024-10-12 01:03:45,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3072 to 3072. [2024-10-12 01:03:45,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3072 states, 3072 states have (on average 1.6676432291666667) internal successors, (5123), 3071 states have internal predecessors, (5123), 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-12 01:03:45,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3072 states to 3072 states and 5123 transitions. [2024-10-12 01:03:45,999 INFO L240 hiAutomatonCegarLoop]: Abstraction has 3072 states and 5123 transitions. [2024-10-12 01:03:46,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 01:03:46,001 INFO L425 stractBuchiCegarLoop]: Abstraction has 3072 states and 5123 transitions. [2024-10-12 01:03:46,001 INFO L332 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2024-10-12 01:03:46,001 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3072 states and 5123 transitions. [2024-10-12 01:03:46,011 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1134 [2024-10-12 01:03:46,011 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 01:03:46,012 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 01:03:46,012 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-12 01:03:46,012 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 01:03:46,012 INFO L745 eck$LassoCheckResult]: Stem: 25174#$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(10, 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; 25175#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; 25227#L408 assume !(1 == ~c_req_up~0); 25161#L408-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 25376#L419-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 25377#L424-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 25282#L429-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 25283#L434-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 25239#L439-1 assume !(0 == ~e_f~0); 25240#L444-1 assume !(0 == ~e_g~0); 25447#L449-1 assume !(0 == ~e_e~0); 25440#L454-1 assume !(0 == ~e_c~0); 25439#L459-1 assume !(0 == ~e_wl~0); 25438#L464-1 assume !(1 == ~wl_pc~0); 25428#$Ultimate##44 assume !(2 == ~wl_pc~0); 25420#L477 assume !(1 == ~c1_pc~0); 25412#L487 assume !(1 == ~c2_pc~0); 25405#L496 assume !(1 == ~wb_pc~0); 25401#L505 assume !(1 == ~e_c~0); 25398#L514-1 assume !(1 == ~e_e~0); 25394#L519-1 assume !(1 == ~e_f~0); 25392#L524-1 assume !(1 == ~e_g~0); 25382#L529-1 assume !(1 == ~e_c~0); 25383#L534-1 assume !(1 == ~e_wl~0); 27458#L676-1 assume !false; 27459#L546 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; 25696#L381 [2024-10-12 01:03:46,013 INFO L747 eck$LassoCheckResult]: Loop: 25696#L381 assume !false; 27253#L299 assume 0 == ~wl_st~0; 27225#L312-1 assume 0 == ~wl_st~0;havoc eval_#t~nondet4#1;eval_~tmp~0#1 := eval_#t~nondet4#1;havoc eval_#t~nondet4#1; 27222#L325 assume !(0 != eval_~tmp~0#1); 27221#L321 assume 0 == ~c1_st~0;havoc eval_#t~nondet5#1;eval_~tmp___0~0#1 := eval_#t~nondet5#1;havoc eval_#t~nondet5#1; 27204#L340 assume !(0 != eval_~tmp___0~0#1); 27220#L336 assume !(0 == ~c2_st~0); 27320#L351 assume !(0 == ~wb_st~0); 27295#L366 assume !(0 == ~r_st~0); 25696#L381 [2024-10-12 01:03:46,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 01:03:46,013 INFO L85 PathProgramCache]: Analyzing trace with hash 823350777, now seen corresponding path program 2 times [2024-10-12 01:03:46,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 01:03:46,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482153205] [2024-10-12 01:03:46,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 01:03:46,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 01:03:46,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 01:03:46,021 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 01:03:46,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 01:03:46,028 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 01:03:46,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 01:03:46,029 INFO L85 PathProgramCache]: Analyzing trace with hash 1117173442, now seen corresponding path program 1 times [2024-10-12 01:03:46,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 01:03:46,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361053694] [2024-10-12 01:03:46,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 01:03:46,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 01:03:46,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 01:03:46,032 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 01:03:46,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 01:03:46,034 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 01:03:46,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 01:03:46,034 INFO L85 PathProgramCache]: Analyzing trace with hash -1600612406, now seen corresponding path program 1 times [2024-10-12 01:03:46,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 01:03:46,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716462416] [2024-10-12 01:03:46,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 01:03:46,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 01:03:46,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:03:46,059 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-12 01:03:46,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 01:03:46,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716462416] [2024-10-12 01:03:46,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716462416] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 01:03:46,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 01:03:46,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 01:03:46,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950982381] [2024-10-12 01:03:46,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 01:03:46,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 01:03:46,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 01:03:46,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 01:03:46,088 INFO L87 Difference]: Start difference. First operand 3072 states and 5123 transitions. cyclomatic complexity: 2058 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-12 01:03:46,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 01:03:46,128 INFO L93 Difference]: Finished difference Result 4987 states and 8221 transitions. [2024-10-12 01:03:46,128 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4987 states and 8221 transitions. [2024-10-12 01:03:46,181 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1784 [2024-10-12 01:03:46,205 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4987 states to 4987 states and 8221 transitions. [2024-10-12 01:03:46,205 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2289 [2024-10-12 01:03:46,207 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2289 [2024-10-12 01:03:46,207 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4987 states and 8221 transitions. [2024-10-12 01:03:46,207 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 01:03:46,208 INFO L218 hiAutomatonCegarLoop]: Abstraction has 4987 states and 8221 transitions. [2024-10-12 01:03:46,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4987 states and 8221 transitions. [2024-10-12 01:03:46,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4987 to 4987. [2024-10-12 01:03:46,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4987 states, 4987 states have (on average 1.648486063765791) internal successors, (8221), 4986 states have internal predecessors, (8221), 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-12 01:03:46,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4987 states to 4987 states and 8221 transitions. [2024-10-12 01:03:46,297 INFO L240 hiAutomatonCegarLoop]: Abstraction has 4987 states and 8221 transitions. [2024-10-12 01:03:46,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 01:03:46,298 INFO L425 stractBuchiCegarLoop]: Abstraction has 4987 states and 8221 transitions. [2024-10-12 01:03:46,298 INFO L332 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2024-10-12 01:03:46,298 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4987 states and 8221 transitions. [2024-10-12 01:03:46,315 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1784 [2024-10-12 01:03:46,315 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 01:03:46,315 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 01:03:46,316 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-12 01:03:46,316 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 01:03:46,316 INFO L745 eck$LassoCheckResult]: Stem: 33239#$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(10, 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; 33240#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; 33294#L408 assume !(1 == ~c_req_up~0); 33226#L408-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 33436#L419-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 33434#L424-1 assume !(1 == ~c2_i~0);~c2_st~0 := 2; 33435#L429-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 36847#L434-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 36846#L439-1 assume !(0 == ~e_f~0); 36845#L444-1 assume !(0 == ~e_g~0); 36844#L449-1 assume !(0 == ~e_e~0); 36842#L454-1 assume !(0 == ~e_c~0); 36841#L459-1 assume !(0 == ~e_wl~0); 36840#L464-1 assume !(1 == ~wl_pc~0); 36838#$Ultimate##44 assume !(2 == ~wl_pc~0); 36836#L477 assume !(1 == ~c1_pc~0); 36829#L487 assume !(1 == ~c2_pc~0); 36826#L496 assume !(1 == ~wb_pc~0); 36823#L505 assume !(1 == ~e_c~0); 36822#L514-1 assume !(1 == ~e_e~0); 36819#L519-1 assume !(1 == ~e_f~0); 36814#L524-1 assume !(1 == ~e_g~0); 36813#L529-1 assume !(1 == ~e_c~0); 36812#L534-1 assume !(1 == ~e_wl~0); 36811#L676-1 assume !false; 36768#L546 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; 33715#L381 [2024-10-12 01:03:46,316 INFO L747 eck$LassoCheckResult]: Loop: 33715#L381 assume !false; 37859#L299 assume 0 == ~wl_st~0; 35885#L312-1 assume 0 == ~wl_st~0;havoc eval_#t~nondet4#1;eval_~tmp~0#1 := eval_#t~nondet4#1;havoc eval_#t~nondet4#1; 35883#L325 assume !(0 != eval_~tmp~0#1); 35884#L321 assume 0 == ~c1_st~0;havoc eval_#t~nondet5#1;eval_~tmp___0~0#1 := eval_#t~nondet5#1;havoc eval_#t~nondet5#1; 37085#L340 assume !(0 != eval_~tmp___0~0#1); 37164#L336 assume !(0 == ~c2_st~0); 37879#L351 assume !(0 == ~wb_st~0); 37863#L366 assume !(0 == ~r_st~0); 33715#L381 [2024-10-12 01:03:46,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 01:03:46,317 INFO L85 PathProgramCache]: Analyzing trace with hash 1246052603, now seen corresponding path program 1 times [2024-10-12 01:03:46,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 01:03:46,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730907991] [2024-10-12 01:03:46,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 01:03:46,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 01:03:46,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:03:46,340 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-12 01:03:46,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 01:03:46,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730907991] [2024-10-12 01:03:46,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730907991] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 01:03:46,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 01:03:46,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 01:03:46,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293378594] [2024-10-12 01:03:46,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 01:03:46,342 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-12 01:03:46,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 01:03:46,342 INFO L85 PathProgramCache]: Analyzing trace with hash 1117173442, now seen corresponding path program 2 times [2024-10-12 01:03:46,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 01:03:46,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922267001] [2024-10-12 01:03:46,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 01:03:46,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 01:03:46,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 01:03:46,345 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 01:03:46,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 01:03:46,347 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 01:03:46,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 01:03:46,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 01:03:46,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 01:03:46,373 INFO L87 Difference]: Start difference. First operand 4987 states and 8221 transitions. cyclomatic complexity: 3241 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-12 01:03:46,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 01:03:46,392 INFO L93 Difference]: Finished difference Result 4887 states and 8039 transitions. [2024-10-12 01:03:46,392 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4887 states and 8039 transitions. [2024-10-12 01:03:46,412 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1784 [2024-10-12 01:03:46,437 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4887 states to 4887 states and 8039 transitions. [2024-10-12 01:03:46,437 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2190 [2024-10-12 01:03:46,439 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2190 [2024-10-12 01:03:46,439 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4887 states and 8039 transitions. [2024-10-12 01:03:46,439 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 01:03:46,439 INFO L218 hiAutomatonCegarLoop]: Abstraction has 4887 states and 8039 transitions. [2024-10-12 01:03:46,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4887 states and 8039 transitions. [2024-10-12 01:03:46,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4887 to 4887. [2024-10-12 01:03:46,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4887 states, 4887 states have (on average 1.644976468180888) internal successors, (8039), 4886 states have internal predecessors, (8039), 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-12 01:03:46,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4887 states to 4887 states and 8039 transitions. [2024-10-12 01:03:46,521 INFO L240 hiAutomatonCegarLoop]: Abstraction has 4887 states and 8039 transitions. [2024-10-12 01:03:46,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 01:03:46,522 INFO L425 stractBuchiCegarLoop]: Abstraction has 4887 states and 8039 transitions. [2024-10-12 01:03:46,522 INFO L332 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2024-10-12 01:03:46,522 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4887 states and 8039 transitions. [2024-10-12 01:03:46,536 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1784 [2024-10-12 01:03:46,536 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 01:03:46,536 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 01:03:46,537 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-12 01:03:46,537 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 01:03:46,537 INFO L745 eck$LassoCheckResult]: Stem: 43120#$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(10, 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; 43121#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; 43175#L408 assume !(1 == ~c_req_up~0); 43108#L408-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 43332#L419-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 43333#L424-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 43235#L429-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 43236#L434-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 43187#L439-1 assume !(0 == ~e_f~0); 43047#L444-1 assume !(0 == ~e_g~0); 43048#L449-1 assume !(0 == ~e_e~0); 43216#L454-1 assume !(0 == ~e_c~0); 43217#L459-1 assume !(0 == ~e_wl~0); 43122#L464-1 assume !(1 == ~wl_pc~0); 43123#$Ultimate##44 assume !(2 == ~wl_pc~0); 43118#L477 assume !(1 == ~c1_pc~0); 43104#L487 assume !(1 == ~c2_pc~0); 43106#L496 assume !(1 == ~wb_pc~0); 43141#L505 assume !(1 == ~e_c~0); 43142#L514-1 assume !(1 == ~e_e~0); 43385#L519-1 assume !(1 == ~e_f~0); 43384#L524-1 assume !(1 == ~e_g~0); 43343#L529-1 assume !(1 == ~e_c~0); 43344#L534-1 assume !(1 == ~e_wl~0); 44771#L676-1 assume !false; 44038#L546 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; 44039#L381 [2024-10-12 01:03:46,537 INFO L747 eck$LassoCheckResult]: Loop: 44039#L381 assume !false; 43165#L299 assume 0 == ~wl_st~0; 43166#L312-1 assume 0 == ~wl_st~0;havoc eval_#t~nondet4#1;eval_~tmp~0#1 := eval_#t~nondet4#1;havoc eval_#t~nondet4#1; 45980#L325 assume !(0 != eval_~tmp~0#1); 43242#L321 assume 0 == ~c1_st~0;havoc eval_#t~nondet5#1;eval_~tmp___0~0#1 := eval_#t~nondet5#1;havoc eval_#t~nondet5#1; 43243#L340 assume !(0 != eval_~tmp___0~0#1); 43301#L336 assume 0 == ~c2_st~0;havoc eval_#t~nondet6#1;eval_~tmp___1~0#1 := eval_#t~nondet6#1;havoc eval_#t~nondet6#1; 47568#L355 assume !(0 != eval_~tmp___1~0#1); 47628#L351 assume !(0 == ~wb_st~0); 47692#L366 assume !(0 == ~r_st~0); 44039#L381 [2024-10-12 01:03:46,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 01:03:46,538 INFO L85 PathProgramCache]: Analyzing trace with hash 823350777, now seen corresponding path program 3 times [2024-10-12 01:03:46,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 01:03:46,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63149707] [2024-10-12 01:03:46,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 01:03:46,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 01:03:46,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 01:03:46,545 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 01:03:46,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 01:03:46,551 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 01:03:46,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 01:03:46,552 INFO L85 PathProgramCache]: Analyzing trace with hash 270987588, now seen corresponding path program 1 times [2024-10-12 01:03:46,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 01:03:46,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968542945] [2024-10-12 01:03:46,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 01:03:46,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 01:03:46,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 01:03:46,555 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 01:03:46,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 01:03:46,558 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 01:03:46,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 01:03:46,558 INFO L85 PathProgramCache]: Analyzing trace with hash 1918972220, now seen corresponding path program 1 times [2024-10-12 01:03:46,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 01:03:46,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626211519] [2024-10-12 01:03:46,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 01:03:46,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 01:03:46,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:03:46,582 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-12 01:03:46,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 01:03:46,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626211519] [2024-10-12 01:03:46,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626211519] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 01:03:46,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 01:03:46,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 01:03:46,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090213867] [2024-10-12 01:03:46,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 01:03:46,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 01:03:46,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 01:03:46,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 01:03:46,613 INFO L87 Difference]: Start difference. First operand 4887 states and 8039 transitions. cyclomatic complexity: 3159 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-12 01:03:46,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 01:03:46,662 INFO L93 Difference]: Finished difference Result 8309 states and 13515 transitions. [2024-10-12 01:03:46,663 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 8309 states and 13515 transitions. [2024-10-12 01:03:46,733 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3066 [2024-10-12 01:03:46,772 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 8309 states to 8309 states and 13515 transitions. [2024-10-12 01:03:46,772 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3674 [2024-10-12 01:03:46,776 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3674 [2024-10-12 01:03:46,777 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8309 states and 13515 transitions. [2024-10-12 01:03:46,780 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 01:03:46,780 INFO L218 hiAutomatonCegarLoop]: Abstraction has 8309 states and 13515 transitions. [2024-10-12 01:03:46,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8309 states and 13515 transitions. [2024-10-12 01:03:46,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8309 to 8309. [2024-10-12 01:03:46,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8309 states, 8309 states have (on average 1.6265495246118666) internal successors, (13515), 8308 states have internal predecessors, (13515), 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-12 01:03:46,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8309 states to 8309 states and 13515 transitions. [2024-10-12 01:03:46,935 INFO L240 hiAutomatonCegarLoop]: Abstraction has 8309 states and 13515 transitions. [2024-10-12 01:03:46,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 01:03:46,936 INFO L425 stractBuchiCegarLoop]: Abstraction has 8309 states and 13515 transitions. [2024-10-12 01:03:46,936 INFO L332 stractBuchiCegarLoop]: ======== Iteration 14 ============ [2024-10-12 01:03:46,937 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8309 states and 13515 transitions. [2024-10-12 01:03:46,962 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3066 [2024-10-12 01:03:46,962 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 01:03:46,962 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 01:03:46,963 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-12 01:03:46,963 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 01:03:46,963 INFO L745 eck$LassoCheckResult]: Stem: 56322#$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(10, 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; 56323#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; 56379#L408 assume !(1 == ~c_req_up~0); 56313#L408-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 56548#L419-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 56549#L424-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 56440#L429-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 56441#L434-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 56391#L439-1 assume !(0 == ~e_f~0); 56251#L444-1 assume !(0 == ~e_g~0); 56252#L449-1 assume !(0 == ~e_e~0); 56421#L454-1 assume !(0 == ~e_c~0); 56422#L459-1 assume !(0 == ~e_wl~0); 56324#L464-1 assume !(1 == ~wl_pc~0); 56325#$Ultimate##44 assume !(2 == ~wl_pc~0); 56320#L477 assume !(1 == ~c1_pc~0); 56309#L487 assume !(1 == ~c2_pc~0); 56311#L496 assume !(1 == ~wb_pc~0); 56343#L505 assume !(1 == ~e_c~0); 56344#L514-1 assume !(1 == ~e_e~0); 56603#L519-1 assume !(1 == ~e_f~0); 56602#L524-1 assume !(1 == ~e_g~0); 56560#L529-1 assume !(1 == ~e_c~0); 56245#L534-1 assume !(1 == ~e_wl~0); 56246#L676-1 assume !false; 61932#L546 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; 58760#L381 [2024-10-12 01:03:46,963 INFO L747 eck$LassoCheckResult]: Loop: 58760#L381 assume !false; 64390#L299 assume 0 == ~wl_st~0; 63024#L312-1 assume 0 == ~wl_st~0;havoc eval_#t~nondet4#1;eval_~tmp~0#1 := eval_#t~nondet4#1;havoc eval_#t~nondet4#1; 63021#L325 assume !(0 != eval_~tmp~0#1); 63022#L321 assume 0 == ~c1_st~0;havoc eval_#t~nondet5#1;eval_~tmp___0~0#1 := eval_#t~nondet5#1;havoc eval_#t~nondet5#1; 63721#L340 assume !(0 != eval_~tmp___0~0#1); 63717#L336 assume 0 == ~c2_st~0;havoc eval_#t~nondet6#1;eval_~tmp___1~0#1 := eval_#t~nondet6#1;havoc eval_#t~nondet6#1; 63681#L355 assume !(0 != eval_~tmp___1~0#1); 63710#L351 assume 0 == ~wb_st~0;havoc eval_#t~nondet7#1;eval_~tmp___2~0#1 := eval_#t~nondet7#1;havoc eval_#t~nondet7#1; 63807#L370 assume !(0 != eval_~tmp___2~0#1); 63922#L366 assume !(0 == ~r_st~0); 58760#L381 [2024-10-12 01:03:46,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 01:03:46,964 INFO L85 PathProgramCache]: Analyzing trace with hash 823350777, now seen corresponding path program 4 times [2024-10-12 01:03:46,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 01:03:46,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020703340] [2024-10-12 01:03:46,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 01:03:46,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 01:03:46,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 01:03:46,973 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 01:03:46,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 01:03:46,982 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 01:03:46,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 01:03:46,983 INFO L85 PathProgramCache]: Analyzing trace with hash -189354762, now seen corresponding path program 1 times [2024-10-12 01:03:46,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 01:03:46,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616432863] [2024-10-12 01:03:46,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 01:03:46,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 01:03:46,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 01:03:46,987 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 01:03:46,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 01:03:46,989 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 01:03:46,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 01:03:46,990 INFO L85 PathProgramCache]: Analyzing trace with hash -641438722, now seen corresponding path program 1 times [2024-10-12 01:03:46,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 01:03:46,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803536881] [2024-10-12 01:03:46,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 01:03:46,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 01:03:46,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 01:03:46,998 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 01:03:47,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 01:03:47,006 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 01:03:47,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 01:03:47,897 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 01:03:47,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 01:03:48,011 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 12.10 01:03:48 BoogieIcfgContainer [2024-10-12 01:03:48,012 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-10-12 01:03:48,012 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-12 01:03:48,012 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-12 01:03:48,013 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-12 01:03:48,013 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 01:03:39" (3/4) ... [2024-10-12 01:03:48,014 INFO L136 WitnessPrinter]: Generating witness for non-termination counterexample [2024-10-12 01:03:48,089 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-12 01:03:48,089 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-12 01:03:48,090 INFO L158 Benchmark]: Toolchain (without parser) took 9830.07ms. Allocated memory was 176.2MB in the beginning and 260.0MB in the end (delta: 83.9MB). Free memory was 140.1MB in the beginning and 75.2MB in the end (delta: 65.0MB). Peak memory consumption was 149.2MB. Max. memory is 16.1GB. [2024-10-12 01:03:48,090 INFO L158 Benchmark]: CDTParser took 0.54ms. Allocated memory is still 109.1MB. Free memory is still 78.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 01:03:48,090 INFO L158 Benchmark]: CACSL2BoogieTranslator took 344.93ms. Allocated memory is still 176.2MB. Free memory was 140.1MB in the beginning and 123.4MB in the end (delta: 16.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-12 01:03:48,091 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.52ms. Allocated memory is still 176.2MB. Free memory was 123.4MB in the beginning and 121.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-12 01:03:48,091 INFO L158 Benchmark]: Boogie Preprocessor took 68.21ms. Allocated memory is still 176.2MB. Free memory was 121.3MB in the beginning and 118.6MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-12 01:03:48,091 INFO L158 Benchmark]: RCFGBuilder took 692.73ms. Allocated memory is still 176.2MB. Free memory was 118.6MB in the beginning and 125.8MB in the end (delta: -7.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-12 01:03:48,091 INFO L158 Benchmark]: BuchiAutomizer took 8601.37ms. Allocated memory was 176.2MB in the beginning and 260.0MB in the end (delta: 83.9MB). Free memory was 125.8MB in the beginning and 81.5MB in the end (delta: 44.3MB). Peak memory consumption was 131.0MB. Max. memory is 16.1GB. [2024-10-12 01:03:48,092 INFO L158 Benchmark]: Witness Printer took 77.15ms. Allocated memory is still 260.0MB. Free memory was 81.5MB in the beginning and 75.2MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-12 01:03:48,093 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.54ms. Allocated memory is still 109.1MB. Free memory is still 78.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 344.93ms. Allocated memory is still 176.2MB. Free memory was 140.1MB in the beginning and 123.4MB in the end (delta: 16.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.52ms. Allocated memory is still 176.2MB. Free memory was 123.4MB in the beginning and 121.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 68.21ms. Allocated memory is still 176.2MB. Free memory was 121.3MB in the beginning and 118.6MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 692.73ms. Allocated memory is still 176.2MB. Free memory was 118.6MB in the beginning and 125.8MB in the end (delta: -7.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * BuchiAutomizer took 8601.37ms. Allocated memory was 176.2MB in the beginning and 260.0MB in the end (delta: 83.9MB). Free memory was 125.8MB in the beginning and 81.5MB in the end (delta: 44.3MB). Peak memory consumption was 131.0MB. Max. memory is 16.1GB. * Witness Printer took 77.15ms. Allocated memory is still 260.0MB. Free memory was 81.5MB in the beginning and 75.2MB 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 16 terminating modules (13 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_f) + 1) and consists of 3 locations. 13 modules have a trivial ranking function, the largest among these consists of 4 locations. The remainder module has 8309 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 8.4s and 14 iterations. TraceHistogramMax:1. Analysis of lassos took 5.6s. Construction of modules took 0.2s. Büchi inclusion checks took 2.2s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 15. Automata minimization 0.7s AutomataMinimizationTime, 16 MinimizatonAttempts, 1671 StatesRemovedByMinimization, 6 NontrivialMinimizations. Non-live state removal took 0.4s 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, 3538 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3535 mSDsluCounter, 6482 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2390 mSDsCounter, 98 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 280 IncrementalHoareTripleChecker+Invalid, 378 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 98 mSolverCounterUnsat, 4092 mSDtfsCounter, 280 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI1 SFLT0 conc3 concLT0 SILN3 SILU0 SILI3 SILT3 lasso0 LassoPreprocessingBenchmarks: Lassos: inital76 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: 23ms VariablesStem: 0 VariablesLoop: 1 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 0 MotzkinApplications: 4 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 5 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: 298]: 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] [L693] int __retres1 ; [L697] e_wl = 2 [L698] e_c = e_wl [L699] e_g = e_c [L700] e_f = e_g [L701] e_e = e_f [L702] wl_pc = 0 [L703] c1_pc = 0 [L704] c2_pc = 0 [L705] wb_pc = 0 [L706] wb_i = 1 [L707] c2_i = wb_i [L708] c1_i = c2_i [L709] wl_i = c1_i [L710] r_i = 0 [L711] c_req_up = 0 [L712] d = 0 [L713] c = 0 [L714] CALL start_simulation() [L404] int kernel_st ; [L407] 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] [L408] 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] [L419] COND TRUE (int )wl_i == 1 [L420] 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] [L424] COND TRUE (int )c1_i == 1 [L425] 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] [L429] COND TRUE (int )c2_i == 1 [L430] 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] [L434] COND TRUE (int )wb_i == 1 [L435] 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] [L439] COND FALSE !((int )r_i == 1) [L442] 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] [L444] 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] [L449] 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] [L454] 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] [L459] 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] [L464] 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] [L469] 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] [L477] 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] [L487] 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] [L496] 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] [L505] 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] [L514] 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] [L519] 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] [L524] 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] [L529] 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] [L534] 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] [L539] 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] [L545] 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] [L548] kernel_st = 1 [L549] CALL eval() [L290] int tmp ; [L291] int tmp___0 ; [L292] int tmp___1 ; [L293] int tmp___2 ; [L294] 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: [L298] COND TRUE 1 [L300] COND TRUE (int )wl_st == 0 [L321] COND TRUE (int )wl_st == 0 [L323] tmp = __VERIFIER_nondet_int() [L325] COND FALSE !(\read(tmp)) [L336] COND TRUE (int )c1_st == 0 [L338] tmp___0 = __VERIFIER_nondet_int() [L340] COND FALSE !(\read(tmp___0)) [L351] COND TRUE (int )c2_st == 0 [L353] tmp___1 = __VERIFIER_nondet_int() [L355] COND FALSE !(\read(tmp___1)) [L366] COND TRUE (int )wb_st == 0 [L368] tmp___2 = __VERIFIER_nondet_int() [L370] COND FALSE !(\read(tmp___2)) [L381] COND FALSE !((int )r_st == 0) End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 298]: 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] [L693] int __retres1 ; [L697] e_wl = 2 [L698] e_c = e_wl [L699] e_g = e_c [L700] e_f = e_g [L701] e_e = e_f [L702] wl_pc = 0 [L703] c1_pc = 0 [L704] c2_pc = 0 [L705] wb_pc = 0 [L706] wb_i = 1 [L707] c2_i = wb_i [L708] c1_i = c2_i [L709] wl_i = c1_i [L710] r_i = 0 [L711] c_req_up = 0 [L712] d = 0 [L713] c = 0 [L714] CALL start_simulation() [L404] int kernel_st ; [L407] 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] [L408] 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] [L419] COND TRUE (int )wl_i == 1 [L420] 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] [L424] COND TRUE (int )c1_i == 1 [L425] 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] [L429] COND TRUE (int )c2_i == 1 [L430] 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] [L434] COND TRUE (int )wb_i == 1 [L435] 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] [L439] COND FALSE !((int )r_i == 1) [L442] 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] [L444] 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] [L449] 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] [L454] 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] [L459] 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] [L464] 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] [L469] 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] [L477] 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] [L487] 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] [L496] 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] [L505] 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] [L514] 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] [L519] 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] [L524] 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] [L529] 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] [L534] 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] [L539] 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] [L545] 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] [L548] kernel_st = 1 [L549] CALL eval() [L290] int tmp ; [L291] int tmp___0 ; [L292] int tmp___1 ; [L293] int tmp___2 ; [L294] 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: [L298] COND TRUE 1 [L300] COND TRUE (int )wl_st == 0 [L321] COND TRUE (int )wl_st == 0 [L323] tmp = __VERIFIER_nondet_int() [L325] COND FALSE !(\read(tmp)) [L336] COND TRUE (int )c1_st == 0 [L338] tmp___0 = __VERIFIER_nondet_int() [L340] COND FALSE !(\read(tmp___0)) [L351] COND TRUE (int )c2_st == 0 [L353] tmp___1 = __VERIFIER_nondet_int() [L355] COND FALSE !(\read(tmp___1)) [L366] COND TRUE (int )wb_st == 0 [L368] tmp___2 = __VERIFIER_nondet_int() [L370] COND FALSE !(\read(tmp___2)) [L381] COND FALSE !((int )r_st == 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2024-10-12 01:03:48,152 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, 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)