./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/systemc/toy2.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/systemc/toy2.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a77d6f304c19846fdc8cd5bba9216d69953659ded966cffbf7faa285e2d864a4 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-17 08:53:27,778 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-17 08:53:27,834 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2024-11-17 08:53:27,842 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-17 08:53:27,843 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-17 08:53:27,843 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2024-11-17 08:53:27,858 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-17 08:53:27,858 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-17 08:53:27,859 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-17 08:53:27,859 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-17 08:53:27,859 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-17 08:53:27,860 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-17 08:53:27,860 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-17 08:53:27,860 INFO L153 SettingsManager]: * Use SBE=true [2024-11-17 08:53:27,860 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-17 08:53:27,861 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-17 08:53:27,861 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-17 08:53:27,861 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-17 08:53:27,861 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-17 08:53:27,862 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-17 08:53:27,862 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-17 08:53:27,864 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-17 08:53:27,865 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-17 08:53:27,865 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-17 08:53:27,866 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-17 08:53:27,867 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-17 08:53:27,867 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-17 08:53:27,867 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-17 08:53:27,867 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-17 08:53:27,867 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-17 08:53:27,868 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-17 08:53:27,868 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-17 08:53:27,868 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-17 08:53:27,868 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-17 08:53:27,868 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-17 08:53:27,868 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-17 08:53:27,869 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-17 08:53:27,869 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-17 08:53:27,869 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-17 08:53:27,870 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-17 08:53:27,870 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a77d6f304c19846fdc8cd5bba9216d69953659ded966cffbf7faa285e2d864a4 [2024-11-17 08:53:28,047 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-17 08:53:28,070 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-17 08:53:28,073 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-17 08:53:28,074 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-17 08:53:28,074 INFO L274 PluginConnector]: CDTParser initialized [2024-11-17 08:53:28,075 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/toy2.cil.c [2024-11-17 08:53:29,289 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-17 08:53:29,438 INFO L384 CDTParser]: Found 1 translation units. [2024-11-17 08:53:29,441 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/toy2.cil.c [2024-11-17 08:53:29,451 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/674823dba/526268faac0c492784da20a972a8dd3f/FLAGd08e87318 [2024-11-17 08:53:29,464 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/674823dba/526268faac0c492784da20a972a8dd3f [2024-11-17 08:53:29,466 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-17 08:53:29,467 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-17 08:53:29,467 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-17 08:53:29,468 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-17 08:53:29,472 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-17 08:53:29,472 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 08:53:29" (1/1) ... [2024-11-17 08:53:29,473 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f4a474b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:53:29, skipping insertion in model container [2024-11-17 08:53:29,473 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 08:53:29" (1/1) ... [2024-11-17 08:53:29,497 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-17 08:53:29,679 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 08:53:29,689 INFO L200 MainTranslator]: Completed pre-run [2024-11-17 08:53:29,732 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 08:53:29,747 INFO L204 MainTranslator]: Completed translation [2024-11-17 08:53:29,747 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:53:29 WrapperNode [2024-11-17 08:53:29,747 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-17 08:53:29,748 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-17 08:53:29,748 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-17 08:53:29,748 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-17 08:53:29,753 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:53:29" (1/1) ... [2024-11-17 08:53:29,760 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:53:29" (1/1) ... [2024-11-17 08:53:29,786 INFO L138 Inliner]: procedures = 20, calls = 16, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 355 [2024-11-17 08:53:29,786 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-17 08:53:29,789 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-17 08:53:29,789 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-17 08:53:29,790 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-17 08:53:29,797 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:53:29" (1/1) ... [2024-11-17 08:53:29,797 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:53:29" (1/1) ... [2024-11-17 08:53:29,799 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:53:29" (1/1) ... [2024-11-17 08:53:29,807 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-11-17 08:53:29,808 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:53:29" (1/1) ... [2024-11-17 08:53:29,808 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:53:29" (1/1) ... [2024-11-17 08:53:29,814 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:53:29" (1/1) ... [2024-11-17 08:53:29,815 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:53:29" (1/1) ... [2024-11-17 08:53:29,819 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:53:29" (1/1) ... [2024-11-17 08:53:29,820 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:53:29" (1/1) ... [2024-11-17 08:53:29,821 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-17 08:53:29,822 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-17 08:53:29,822 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-17 08:53:29,822 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-17 08:53:29,823 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:53:29" (1/1) ... [2024-11-17 08:53:29,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:53:29,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:53:29,851 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:53:29,853 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-11-17 08:53:29,888 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-17 08:53:29,888 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-17 08:53:29,888 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-17 08:53:29,888 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-17 08:53:29,953 INFO L256 CfgBuilder]: Building ICFG [2024-11-17 08:53:29,954 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-17 08:53:30,309 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-11-17 08:53:30,310 INFO L307 CfgBuilder]: Performing block encoding [2024-11-17 08:53:30,321 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-17 08:53:30,321 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-17 08:53:30,321 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 08:53:30 BoogieIcfgContainer [2024-11-17 08:53:30,321 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-17 08:53:30,322 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-17 08:53:30,326 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-17 08:53:30,329 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-17 08:53:30,330 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-17 08:53:30,331 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 17.11 08:53:29" (1/3) ... [2024-11-17 08:53:30,331 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@302e4bfc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.11 08:53:30, skipping insertion in model container [2024-11-17 08:53:30,331 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-17 08:53:30,331 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:53:29" (2/3) ... [2024-11-17 08:53:30,332 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@302e4bfc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.11 08:53:30, skipping insertion in model container [2024-11-17 08:53:30,332 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-17 08:53:30,332 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 08:53:30" (3/3) ... [2024-11-17 08:53:30,333 INFO L332 chiAutomizerObserver]: Analyzing ICFG toy2.cil.c [2024-11-17 08:53:30,381 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-11-17 08:53:30,382 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-11-17 08:53:30,382 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-17 08:53:30,382 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-17 08:53:30,382 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-17 08:53:30,383 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-11-17 08:53:30,383 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-17 08:53:30,383 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-17 08:53:30,387 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 157 states, 156 states have (on average 1.685897435897436) internal successors, (263), 156 states have internal predecessors, (263), 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-11-17 08:53:30,406 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 120 [2024-11-17 08:53:30,406 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:53:30,406 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:53:30,412 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-11-17 08:53:30,412 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] [2024-11-17 08:53:30,413 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-17 08:53:30,413 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 157 states, 156 states have (on average 1.685897435897436) internal successors, (263), 156 states have internal predecessors, (263), 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-11-17 08:53:30,418 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 120 [2024-11-17 08:53:30,418 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:53:30,419 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:53:30,420 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-11-17 08:53:30,420 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] [2024-11-17 08:53:30,425 INFO L745 eck$LassoCheckResult]: Stem: 148#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 31#ULTIMATE.init_returnLabel#1true assume true;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; 141#L404true assume !(1 == ~c_req_up~0); 137#L415true assume !(1 == ~wl_i~0);~wl_st~0 := 2; 41#L420true assume !(1 == ~c1_i~0);~c1_st~0 := 2; 131#L425true assume !(1 == ~c2_i~0);~c2_st~0 := 2; 23#L430true assume !(1 == ~wb_i~0);~wb_st~0 := 2; 118#L435true assume !(1 == ~r_i~0);~r_st~0 := 2; 122#L440true assume 0 == ~e_f~0;~e_f~0 := 1; 43#L445true assume !(0 == ~e_g~0); 116#L450true assume !(0 == ~e_e~0); 7#L455true assume !(0 == ~e_c~0); 77#L460true assume !(0 == ~e_wl~0); 154#L465true assume 1 == ~wl_pc~0; 155#L466true assume 1 == ~e_wl~0;~wl_st~0 := 0; 129#L483true assume !(1 == ~c1_pc~0); 142#L492true assume !(1 == ~c2_pc~0); 59#L501true assume !(1 == ~wb_pc~0); 106#L510true assume 1 == ~e_c~0;~r_st~0 := 0; 47#L515true assume !(1 == ~e_e~0); 48#L520true assume !(1 == ~e_f~0); 2#L525true assume !(1 == ~e_g~0); 49#L530true assume !(1 == ~e_c~0); 110#L535true assume !(1 == ~e_wl~0); 103#L541true [2024-11-17 08:53:30,426 INFO L747 eck$LassoCheckResult]: Loop: 103#L541true assume true; 93#L541-1true assume !false; 37#start_simulation_while_5_continue#1true assume true;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; 139#L294true assume !true; 62#L311true assume true; 113#L396true assume 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;assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; 78#L548true assume !(1 == ~c_req_up~0); 51#L559true start_simulation_~kernel_st~0#1 := 3; 27#L560true assume 0 == ~e_f~0;~e_f~0 := 1; 25#L565true assume 0 == ~e_g~0;~e_g~0 := 1; 45#L570true assume 0 == ~e_e~0;~e_e~0 := 1; 18#L575true assume 0 == ~e_c~0;~e_c~0 := 1; 4#L580true assume 0 == ~e_wl~0;~e_wl~0 := 1; 98#L585true assume 1 == ~wl_pc~0; 127#L586true assume 1 == ~e_wl~0;~wl_st~0 := 0; 143#L603true assume !(1 == ~c1_pc~0); 6#L612true assume !(1 == ~c2_pc~0); 76#L621true assume !(1 == ~wb_pc~0); 105#L630true assume 1 == ~e_c~0;~r_st~0 := 0; 29#L635true assume 1 == ~e_e~0;~e_e~0 := 2; 36#L640true assume 1 == ~e_f~0;~e_f~0 := 2; 158#L645true assume 1 == ~e_g~0;~e_g~0 := 2; 120#L650true assume 1 == ~e_c~0;~e_c~0 := 2; 38#L655true assume 1 == ~e_wl~0;~e_wl~0 := 2; 115#L660true assume 0 == ~wl_st~0; 103#L541true [2024-11-17 08:53:30,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:53:30,430 INFO L85 PathProgramCache]: Analyzing trace with hash -1011669241, now seen corresponding path program 1 times [2024-11-17 08:53:30,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:53:30,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055924917] [2024-11-17 08:53:30,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:53:30,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:53:30,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:53:30,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:53:30,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:53:30,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055924917] [2024-11-17 08:53:30,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055924917] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 08:53:30,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 08:53:30,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 08:53:30,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372340314] [2024-11-17 08:53:30,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 08:53:30,679 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-17 08:53:30,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:53:30,680 INFO L85 PathProgramCache]: Analyzing trace with hash 2139203303, now seen corresponding path program 1 times [2024-11-17 08:53:30,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:53:30,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050189102] [2024-11-17 08:53:30,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:53:30,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:53:30,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:53:30,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:53:30,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:53:30,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050189102] [2024-11-17 08:53:30,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050189102] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 08:53:30,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 08:53:30,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 08:53:30,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192433476] [2024-11-17 08:53:30,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 08:53:30,696 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-17 08:53:30,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:53:30,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 08:53:30,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 08:53:30,783 INFO L87 Difference]: Start difference. First operand has 157 states, 156 states have (on average 1.685897435897436) internal successors, (263), 156 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 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-11-17 08:53:30,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:53:30,818 INFO L93 Difference]: Finished difference Result 151 states and 243 transitions. [2024-11-17 08:53:30,819 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 151 states and 243 transitions. [2024-11-17 08:53:30,823 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 113 [2024-11-17 08:53:30,827 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 151 states to 145 states and 237 transitions. [2024-11-17 08:53:30,827 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 145 [2024-11-17 08:53:30,828 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 145 [2024-11-17 08:53:30,828 INFO L73 IsDeterministic]: Start isDeterministic. Operand 145 states and 237 transitions. [2024-11-17 08:53:30,829 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-17 08:53:30,829 INFO L218 hiAutomatonCegarLoop]: Abstraction has 145 states and 237 transitions. [2024-11-17 08:53:30,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states and 237 transitions. [2024-11-17 08:53:30,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2024-11-17 08:53:30,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 145 states have (on average 1.6344827586206896) internal successors, (237), 144 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:53:30,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 237 transitions. [2024-11-17 08:53:30,855 INFO L240 hiAutomatonCegarLoop]: Abstraction has 145 states and 237 transitions. [2024-11-17 08:53:30,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 08:53:30,860 INFO L425 stractBuchiCegarLoop]: Abstraction has 145 states and 237 transitions. [2024-11-17 08:53:30,860 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-17 08:53:30,860 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 145 states and 237 transitions. [2024-11-17 08:53:30,861 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 113 [2024-11-17 08:53:30,861 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:53:30,861 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:53:30,862 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-11-17 08:53:30,862 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, 1, 1, 1, 1] [2024-11-17 08:53:30,863 INFO L745 eck$LassoCheckResult]: Stem: 460#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 373#ULTIMATE.init_returnLabel#1 assume true;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; 374#L404 assume !(1 == ~c_req_up~0); 415#L415 assume 1 == ~wl_i~0;~wl_st~0 := 0; 388#L420 assume !(1 == ~c1_i~0);~c1_st~0 := 2; 389#L425 assume !(1 == ~c2_i~0);~c2_st~0 := 2; 359#L430 assume !(1 == ~wb_i~0);~wb_st~0 := 2; 360#L435 assume !(1 == ~r_i~0);~r_st~0 := 2; 452#L440 assume 0 == ~e_f~0;~e_f~0 := 1; 392#L445 assume !(0 == ~e_g~0); 393#L450 assume !(0 == ~e_e~0); 328#L455 assume !(0 == ~e_c~0); 329#L460 assume !(0 == ~e_wl~0); 427#L465 assume 1 == ~wl_pc~0; 461#L466 assume 1 == ~e_wl~0;~wl_st~0 := 0; 417#L483 assume !(1 == ~c1_pc~0); 457#L492 assume !(1 == ~c2_pc~0); 351#L501 assume !(1 == ~wb_pc~0); 395#L510 assume 1 == ~e_c~0;~r_st~0 := 0; 396#L515 assume !(1 == ~e_e~0); 397#L520 assume !(1 == ~e_f~0); 319#L525 assume !(1 == ~e_g~0); 320#L530 assume !(1 == ~e_c~0); 398#L535 assume !(1 == ~e_wl~0); 348#L541 [2024-11-17 08:53:30,863 INFO L747 eck$LassoCheckResult]: Loop: 348#L541 assume true; 442#L541-1 assume !false; 380#start_simulation_while_5_continue#1 assume true;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; 322#L294 assume true; 450#L294-1 assume !false; 451#eval_while_4_continue#1 assume true; 413#L296 assume !(0 == ~wl_st~0); 390#L299 assume !(0 == ~c1_st~0); 391#L302 assume !(0 == ~c2_st~0); 429#L305 assume !(0 == ~wb_st~0); 340#L308 assume !(0 == ~r_st~0); 341#L311 assume true; 407#L396 assume 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;assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; 428#L548 assume !(1 == ~c_req_up~0); 399#L559 start_simulation_~kernel_st~0#1 := 3; 364#L560 assume 0 == ~e_f~0;~e_f~0 := 1; 361#L565 assume 0 == ~e_g~0;~e_g~0 := 1; 362#L570 assume 0 == ~e_e~0;~e_e~0 := 1; 344#L575 assume 0 == ~e_c~0;~e_c~0 := 1; 317#L580 assume 0 == ~e_wl~0;~e_wl~0 := 1; 318#L585 assume 1 == ~wl_pc~0; 446#L586 assume 1 == ~e_wl~0;~wl_st~0 := 0; 448#L603 assume !(1 == ~c1_pc~0); 323#L612 assume !(1 == ~c2_pc~0); 325#L621 assume !(1 == ~wb_pc~0); 425#L630 assume 1 == ~e_c~0;~r_st~0 := 0; 367#L635 assume 1 == ~e_e~0;~e_e~0 := 2; 368#L640 assume 1 == ~e_f~0;~e_f~0 := 2; 379#L645 assume 1 == ~e_g~0;~e_g~0 := 2; 454#L650 assume 1 == ~e_c~0;~e_c~0 := 2; 381#L655 assume 1 == ~e_wl~0;~e_wl~0 := 2; 382#L660 assume 0 == ~wl_st~0; 348#L541 [2024-11-17 08:53:30,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:53:30,863 INFO L85 PathProgramCache]: Analyzing trace with hash -1223020154, now seen corresponding path program 1 times [2024-11-17 08:53:30,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:53:30,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128940380] [2024-11-17 08:53:30,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:53:30,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:53:30,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:53:30,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:53:30,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:53:30,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128940380] [2024-11-17 08:53:30,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128940380] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 08:53:30,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 08:53:30,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 08:53:30,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71228829] [2024-11-17 08:53:30,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 08:53:30,926 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-17 08:53:30,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:53:30,927 INFO L85 PathProgramCache]: Analyzing trace with hash 1354866380, now seen corresponding path program 1 times [2024-11-17 08:53:30,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:53:30,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145110687] [2024-11-17 08:53:30,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:53:30,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:53:30,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:53:30,939 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:53:30,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:53:30,964 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:53:31,205 INFO L204 LassoAnalysis]: Preferences: [2024-11-17 08:53:31,206 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-17 08:53:31,206 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-17 08:53:31,206 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-17 08:53:31,206 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-17 08:53:31,206 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:53:31,206 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-17 08:53:31,206 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-17 08:53:31,206 INFO L132 ssoRankerPreferences]: Filename of dumped script: toy2.cil.c_Iteration2_Loop [2024-11-17 08:53:31,207 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-17 08:53:31,207 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-17 08:53:31,219 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:53:31,226 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:53:31,231 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:53:31,234 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:53:31,237 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:53:31,242 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:53:31,246 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:53:31,249 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:53:31,250 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:53:31,252 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:53:31,255 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:53:31,257 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:53:31,258 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:53:31,263 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:53:31,265 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:53:31,268 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:53:31,273 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:53:31,276 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:53:31,280 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:53:31,281 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:53:31,284 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:53:31,288 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:53:31,290 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:53:31,292 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:53:31,296 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:53:31,479 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-17 08:53:31,480 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-17 08:53:31,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:53:31,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:53:31,483 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:53:31,486 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2024-11-17 08:53:31,486 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-17 08:53:31,486 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-17 08:53:31,510 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-17 08:53:31,510 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-11-17 08:53:31,522 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2024-11-17 08:53:31,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:53:31,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:53:31,523 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:53:31,524 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2024-11-17 08:53:31,526 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-17 08:53:31,526 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-17 08:53:31,549 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2024-11-17 08:53:31,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:53:31,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:53:31,550 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:53:31,552 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2024-11-17 08:53:31,553 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-17 08:53:31,553 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-17 08:53:31,566 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-17 08:53:31,578 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2024-11-17 08:53:31,580 INFO L204 LassoAnalysis]: Preferences: [2024-11-17 08:53:31,580 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-17 08:53:31,580 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-17 08:53:31,580 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-17 08:53:31,580 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-17 08:53:31,580 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:53:31,580 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-17 08:53:31,581 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-17 08:53:31,581 INFO L132 ssoRankerPreferences]: Filename of dumped script: toy2.cil.c_Iteration2_Loop [2024-11-17 08:53:31,581 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-17 08:53:31,581 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-17 08:53:31,582 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:53:31,589 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:53:31,595 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:53:31,599 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:53:31,602 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:53:31,603 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:53:31,611 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:53:31,615 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:53:31,617 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:53:31,619 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:53:31,621 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:53:31,623 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:53:31,624 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:53:31,626 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:53:31,632 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:53:31,634 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:53:31,639 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:53:31,641 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:53:31,646 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:53:31,649 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:53:31,653 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:53:31,658 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:53:31,662 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:53:31,663 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:53:31,665 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:53:31,826 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-17 08:53:31,831 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-17 08:53:31,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:53:31,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:53:31,834 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:53:31,835 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2024-11-17 08:53:31,836 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-11-17 08:53:31,847 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:53:31,847 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:53:31,847 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:53:31,848 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2024-11-17 08:53:31,848 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:53:31,850 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2024-11-17 08:53:31,850 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:53:31,852 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:53:31,862 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2024-11-17 08:53:31,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:53:31,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:53:31,865 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:53:31,881 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2024-11-17 08:53:31,882 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-11-17 08:53:31,893 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:53:31,893 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:53:31,893 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:53:31,893 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:53:31,893 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:53:31,895 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:53:31,895 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:53:31,897 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-17 08:53:31,903 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-17 08:53:31,907 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-11-17 08:53:31,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:53:31,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:53:31,941 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:53:31,942 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2024-11-17 08:53:31,947 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-17 08:53:31,947 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-17 08:53:31,947 INFO L474 LassoAnalysis]: Proved termination. [2024-11-17 08:53:31,947 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(~e_c~0) = -1*~e_c~0 + 1 Supporting invariants [] [2024-11-17 08:53:31,958 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2024-11-17 08:53:31,961 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-17 08:53:31,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:53:32,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:53:32,014 INFO L255 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-17 08:53:32,015 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:53:32,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:53:32,057 INFO L255 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-17 08:53:32,058 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:53:32,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:53:32,159 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-11-17 08:53:32,160 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 145 states and 237 transitions. cyclomatic complexity: 93 Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 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-11-17 08:53:32,260 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 145 states and 237 transitions. cyclomatic complexity: 93. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 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 490 states and 783 transitions. Complement of second has 5 states. [2024-11-17 08:53:32,261 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-11-17 08:53:32,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 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-11-17 08:53:32,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 419 transitions. [2024-11-17 08:53:32,264 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 419 transitions. Stem has 24 letters. Loop has 32 letters. [2024-11-17 08:53:32,265 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:53:32,265 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 419 transitions. Stem has 56 letters. Loop has 32 letters. [2024-11-17 08:53:32,268 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:53:32,268 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 419 transitions. Stem has 24 letters. Loop has 64 letters. [2024-11-17 08:53:32,269 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:53:32,269 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 490 states and 783 transitions. [2024-11-17 08:53:32,275 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 339 [2024-11-17 08:53:32,279 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 490 states to 490 states and 783 transitions. [2024-11-17 08:53:32,279 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 372 [2024-11-17 08:53:32,280 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 375 [2024-11-17 08:53:32,280 INFO L73 IsDeterministic]: Start isDeterministic. Operand 490 states and 783 transitions. [2024-11-17 08:53:32,280 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:53:32,280 INFO L218 hiAutomatonCegarLoop]: Abstraction has 490 states and 783 transitions. [2024-11-17 08:53:32,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states and 783 transitions. [2024-11-17 08:53:32,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 374. [2024-11-17 08:53:32,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 374 states, 374 states have (on average 1.6042780748663101) internal successors, (600), 373 states have internal predecessors, (600), 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-11-17 08:53:32,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 600 transitions. [2024-11-17 08:53:32,304 INFO L240 hiAutomatonCegarLoop]: Abstraction has 374 states and 600 transitions. [2024-11-17 08:53:32,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:53:32,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 08:53:32,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 08:53:32,304 INFO L87 Difference]: Start difference. First operand 374 states and 600 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-11-17 08:53:32,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:53:32,315 INFO L93 Difference]: Finished difference Result 374 states and 599 transitions. [2024-11-17 08:53:32,315 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 374 states and 599 transitions. [2024-11-17 08:53:32,317 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 226 [2024-11-17 08:53:32,319 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 374 states to 374 states and 599 transitions. [2024-11-17 08:53:32,319 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 259 [2024-11-17 08:53:32,319 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 259 [2024-11-17 08:53:32,319 INFO L73 IsDeterministic]: Start isDeterministic. Operand 374 states and 599 transitions. [2024-11-17 08:53:32,319 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:53:32,319 INFO L218 hiAutomatonCegarLoop]: Abstraction has 374 states and 599 transitions. [2024-11-17 08:53:32,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states and 599 transitions. [2024-11-17 08:53:32,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 374. [2024-11-17 08:53:32,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 374 states, 374 states have (on average 1.6016042780748663) internal successors, (599), 373 states have internal predecessors, (599), 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-11-17 08:53:32,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 599 transitions. [2024-11-17 08:53:32,327 INFO L240 hiAutomatonCegarLoop]: Abstraction has 374 states and 599 transitions. [2024-11-17 08:53:32,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 08:53:32,328 INFO L425 stractBuchiCegarLoop]: Abstraction has 374 states and 599 transitions. [2024-11-17 08:53:32,328 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-11-17 08:53:32,328 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 374 states and 599 transitions. [2024-11-17 08:53:32,329 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 226 [2024-11-17 08:53:32,329 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:53:32,329 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:53:32,330 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-11-17 08:53:32,330 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, 1, 1, 1, 1] [2024-11-17 08:53:32,330 INFO L745 eck$LassoCheckResult]: Stem: 2165#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 1994#ULTIMATE.init_returnLabel#1 assume true;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; 1995#L404 assume !(1 == ~c_req_up~0); 2072#L415 assume 1 == ~wl_i~0;~wl_st~0 := 0; 2025#L420 assume 1 == ~c1_i~0;~c1_st~0 := 0; 2026#L425 assume !(1 == ~c2_i~0);~c2_st~0 := 2; 1965#L430 assume !(1 == ~wb_i~0);~wb_st~0 := 2; 1966#L435 assume !(1 == ~r_i~0);~r_st~0 := 2; 2151#L440 assume 0 == ~e_f~0;~e_f~0 := 1; 2027#L445 assume !(0 == ~e_g~0); 2028#L450 assume !(0 == ~e_e~0); 1908#L455 assume !(0 == ~e_c~0); 1909#L460 assume !(0 == ~e_wl~0); 2089#L465 assume 1 == ~wl_pc~0; 2167#L466 assume 1 == ~e_wl~0;~wl_st~0 := 0; 2068#L483 assume !(1 == ~c1_pc~0); 2158#L492 assume !(1 == ~c2_pc~0); 1950#L501 assume !(1 == ~wb_pc~0); 2030#L510 assume 1 == ~e_c~0;~r_st~0 := 0; 2031#L515 assume !(1 == ~e_e~0); 2032#L520 assume !(1 == ~e_f~0); 1888#L525 assume !(1 == ~e_g~0); 1889#L530 assume !(1 == ~e_c~0); 2033#L535 assume 1 == ~e_wl~0;~e_wl~0 := 2; 1944#L541 [2024-11-17 08:53:32,330 INFO L747 eck$LassoCheckResult]: Loop: 1944#L541 assume true; 2118#L541-1 assume !false; 2119#start_simulation_while_5_continue#1 assume true;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; 2198#L294 assume true; 2197#L294-1 assume !false; 2196#eval_while_4_continue#1 assume true; 2064#L296 assume !(0 == ~wl_st~0); 2021#L299 assume !(0 == ~c1_st~0); 2022#L302 assume !(0 == ~c2_st~0); 2092#L305 assume !(0 == ~wb_st~0); 1930#L308 assume !(0 == ~r_st~0); 1931#L311 assume true; 2052#L396 assume 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;assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; 2188#L548 assume !(1 == ~c_req_up~0); 2187#L559 start_simulation_~kernel_st~0#1 := 3; 2177#L560 assume 0 == ~e_f~0;~e_f~0 := 1; 2176#L565 assume 0 == ~e_g~0;~e_g~0 := 1; 2175#L570 assume 0 == ~e_e~0;~e_e~0 := 1; 2173#L575 assume 0 == ~e_c~0;~e_c~0 := 1; 2174#L580 assume 0 == ~e_wl~0;~e_wl~0 := 1; 2186#L585 assume 1 == ~wl_pc~0; 2184#L586 assume 1 == ~e_wl~0;~wl_st~0 := 0; 2183#L603 assume !(1 == ~c1_pc~0); 1898#L612 assume !(1 == ~c2_pc~0); 1900#L621 assume !(1 == ~wb_pc~0); 2086#L630 assume 1 == ~e_c~0;~r_st~0 := 0; 1979#L635 assume 1 == ~e_e~0;~e_e~0 := 2; 1980#L640 assume 1 == ~e_f~0;~e_f~0 := 2; 2170#L645 assume 1 == ~e_g~0;~e_g~0 := 2; 2171#L650 assume 1 == ~e_c~0;~e_c~0 := 2; 2178#L655 assume 1 == ~e_wl~0;~e_wl~0 := 2; 2148#L660 assume 0 == ~wl_st~0; 1944#L541 [2024-11-17 08:53:32,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:53:32,331 INFO L85 PathProgramCache]: Analyzing trace with hash -814195930, now seen corresponding path program 1 times [2024-11-17 08:53:32,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:53:32,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733033176] [2024-11-17 08:53:32,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:53:32,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:53:32,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:53:32,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:53:32,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:53:32,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733033176] [2024-11-17 08:53:32,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733033176] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 08:53:32,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 08:53:32,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 08:53:32,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932616412] [2024-11-17 08:53:32,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 08:53:32,365 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-17 08:53:32,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:53:32,365 INFO L85 PathProgramCache]: Analyzing trace with hash 1354866380, now seen corresponding path program 2 times [2024-11-17 08:53:32,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:53:32,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474790662] [2024-11-17 08:53:32,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:53:32,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:53:32,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:53:32,371 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:53:32,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:53:32,375 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:53:32,520 INFO L204 LassoAnalysis]: Preferences: [2024-11-17 08:53:32,520 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-17 08:53:32,521 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-17 08:53:32,521 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-17 08:53:32,521 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-17 08:53:32,521 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:53:32,521 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-17 08:53:32,521 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-17 08:53:32,521 INFO L132 ssoRankerPreferences]: Filename of dumped script: toy2.cil.c_Iteration3_Loop [2024-11-17 08:53:32,521 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-17 08:53:32,521 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-17 08:53:32,527 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:53:32,529 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:53:32,531 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:53:32,532 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:53:32,534 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:53:32,537 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:53:32,539 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:53:32,544 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:53:32,547 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:53:32,552 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:53:32,555 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:53:32,557 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:53:32,558 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:53:32,562 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:53:32,564 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:53:32,565 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:53:32,567 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:53:32,568 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:53:32,570 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:53:32,571 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:53:32,575 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:53:32,577 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:53:32,579 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:53:32,581 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:53:32,584 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:53:32,727 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-17 08:53:32,727 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-17 08:53:32,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:53:32,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:53:32,729 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:53:32,730 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2024-11-17 08:53:32,730 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-17 08:53:32,731 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-17 08:53:32,749 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-17 08:53:32,749 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-11-17 08:53:32,759 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2024-11-17 08:53:32,759 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:53:32,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:53:32,760 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:53:32,761 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2024-11-17 08:53:32,762 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-17 08:53:32,762 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-17 08:53:32,773 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-17 08:53:32,773 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-11-17 08:53:32,783 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2024-11-17 08:53:32,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:53:32,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:53:32,784 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:53:32,786 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2024-11-17 08:53:32,786 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-17 08:53:32,787 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-17 08:53:32,797 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-17 08:53:32,797 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-11-17 08:53:32,808 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2024-11-17 08:53:32,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:53:32,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:53:32,809 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:53:32,809 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2024-11-17 08:53:32,810 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-17 08:53:32,810 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-17 08:53:32,828 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-17 08:53:32,828 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-11-17 08:53:32,838 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2024-11-17 08:53:32,838 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:53:32,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:53:32,840 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:53:32,840 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2024-11-17 08:53:32,841 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-17 08:53:32,841 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-17 08:53:32,866 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2024-11-17 08:53:32,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:53:32,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:53:32,868 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:53:32,869 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2024-11-17 08:53:32,870 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-17 08:53:32,870 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-17 08:53:32,882 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-17 08:53:32,892 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2024-11-17 08:53:32,892 INFO L204 LassoAnalysis]: Preferences: [2024-11-17 08:53:32,892 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-17 08:53:32,892 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-17 08:53:32,892 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-17 08:53:32,892 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-17 08:53:32,893 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:53:32,893 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-17 08:53:32,893 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-17 08:53:32,893 INFO L132 ssoRankerPreferences]: Filename of dumped script: toy2.cil.c_Iteration3_Loop [2024-11-17 08:53:32,893 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-17 08:53:32,893 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-17 08:53:32,894 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:53:32,897 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:53:32,898 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:53:32,899 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:53:32,901 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:53:32,905 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:53:32,906 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:53:32,910 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:53:32,914 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:53:32,917 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:53:32,919 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:53:32,921 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:53:32,923 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:53:32,924 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:53:32,928 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:53:32,929 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:53:32,934 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:53:32,935 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:53:32,936 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:53:32,939 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:53:32,940 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:53:32,943 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:53:32,945 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:53:32,948 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:53:32,951 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:53:33,134 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-17 08:53:33,134 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-17 08:53:33,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:53:33,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:53:33,140 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:53:33,152 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-11-17 08:53:33,153 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2024-11-17 08:53:33,169 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2024-11-17 08:53:33,171 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:53:33,171 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:53:33,171 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:53:33,171 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2024-11-17 08:53:33,171 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:53:33,172 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2024-11-17 08:53:33,172 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:53:33,173 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:53:33,184 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2024-11-17 08:53:33,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:53:33,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:53:33,185 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:53:33,187 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2024-11-17 08:53:33,188 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-11-17 08:53:33,198 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:53:33,198 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:53:33,198 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:53:33,198 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:53:33,198 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:53:33,199 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:53:33,199 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:53:33,200 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:53:33,210 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2024-11-17 08:53:33,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:53:33,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:53:33,212 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:53:33,213 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2024-11-17 08:53:33,214 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-11-17 08:53:33,224 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:53:33,224 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:53:33,224 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:53:33,225 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:53:33,225 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:53:33,225 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:53:33,225 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:53:33,226 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:53:33,236 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2024-11-17 08:53:33,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:53:33,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:53:33,238 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:53:33,238 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2024-11-17 08:53:33,239 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-11-17 08:53:33,248 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:53:33,248 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:53:33,249 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:53:33,249 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2024-11-17 08:53:33,249 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:53:33,249 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2024-11-17 08:53:33,249 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:53:33,251 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:53:33,261 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2024-11-17 08:53:33,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:53:33,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:53:33,262 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:53:33,263 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2024-11-17 08:53:33,263 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-11-17 08:53:33,273 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:53:33,273 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:53:33,273 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:53:33,273 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:53:33,273 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:53:33,274 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:53:33,274 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:53:33,275 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-17 08:53:33,277 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-17 08:53:33,278 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-11-17 08:53:33,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:53:33,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:53:33,279 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:53:33,281 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2024-11-17 08:53:33,281 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-17 08:53:33,281 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-17 08:53:33,281 INFO L474 LassoAnalysis]: Proved termination. [2024-11-17 08:53:33,281 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(~e_c~0) = -1*~e_c~0 + 1 Supporting invariants [] [2024-11-17 08:53:33,292 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2024-11-17 08:53:33,293 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-17 08:53:33,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:53:33,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:53:33,332 INFO L255 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-17 08:53:33,333 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:53:33,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:53:33,368 INFO L255 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-17 08:53:33,369 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:53:33,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:53:33,425 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-11-17 08:53:33,425 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 374 states and 599 transitions. cyclomatic complexity: 228 Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 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-11-17 08:53:33,462 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 374 states and 599 transitions. cyclomatic complexity: 228. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 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 719 states and 1145 transitions. Complement of second has 5 states. [2024-11-17 08:53:33,462 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-11-17 08:53:33,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 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-11-17 08:53:33,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 418 transitions. [2024-11-17 08:53:33,464 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 418 transitions. Stem has 24 letters. Loop has 32 letters. [2024-11-17 08:53:33,465 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:53:33,467 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 418 transitions. Stem has 56 letters. Loop has 32 letters. [2024-11-17 08:53:33,467 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:53:33,467 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 418 transitions. Stem has 24 letters. Loop has 64 letters. [2024-11-17 08:53:33,467 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:53:33,468 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 719 states and 1145 transitions. [2024-11-17 08:53:33,472 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 452 [2024-11-17 08:53:33,475 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 719 states to 719 states and 1145 transitions. [2024-11-17 08:53:33,475 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 486 [2024-11-17 08:53:33,476 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 489 [2024-11-17 08:53:33,476 INFO L73 IsDeterministic]: Start isDeterministic. Operand 719 states and 1145 transitions. [2024-11-17 08:53:33,476 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:53:33,477 INFO L218 hiAutomatonCegarLoop]: Abstraction has 719 states and 1145 transitions. [2024-11-17 08:53:33,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 719 states and 1145 transitions. [2024-11-17 08:53:33,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 719 to 374. [2024-11-17 08:53:33,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 374 states, 374 states have (on average 1.6016042780748663) internal successors, (599), 373 states have internal predecessors, (599), 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-11-17 08:53:33,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 599 transitions. [2024-11-17 08:53:33,487 INFO L240 hiAutomatonCegarLoop]: Abstraction has 374 states and 599 transitions. [2024-11-17 08:53:33,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:53:33,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 08:53:33,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 08:53:33,488 INFO L87 Difference]: Start difference. First operand 374 states and 599 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-11-17 08:53:33,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:53:33,498 INFO L93 Difference]: Finished difference Result 374 states and 598 transitions. [2024-11-17 08:53:33,498 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 374 states and 598 transitions. [2024-11-17 08:53:33,500 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 226 [2024-11-17 08:53:33,501 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 374 states to 374 states and 598 transitions. [2024-11-17 08:53:33,501 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 259 [2024-11-17 08:53:33,501 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 259 [2024-11-17 08:53:33,502 INFO L73 IsDeterministic]: Start isDeterministic. Operand 374 states and 598 transitions. [2024-11-17 08:53:33,502 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:53:33,504 INFO L218 hiAutomatonCegarLoop]: Abstraction has 374 states and 598 transitions. [2024-11-17 08:53:33,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states and 598 transitions. [2024-11-17 08:53:33,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 374. [2024-11-17 08:53:33,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 374 states, 374 states have (on average 1.5989304812834224) internal successors, (598), 373 states have internal predecessors, (598), 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-11-17 08:53:33,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 598 transitions. [2024-11-17 08:53:33,510 INFO L240 hiAutomatonCegarLoop]: Abstraction has 374 states and 598 transitions. [2024-11-17 08:53:33,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 08:53:33,510 INFO L425 stractBuchiCegarLoop]: Abstraction has 374 states and 598 transitions. [2024-11-17 08:53:33,510 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-11-17 08:53:33,510 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 374 states and 598 transitions. [2024-11-17 08:53:33,512 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 226 [2024-11-17 08:53:33,512 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:53:33,512 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:53:33,512 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-11-17 08:53:33,512 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, 1, 1, 1, 1] [2024-11-17 08:53:33,513 INFO L745 eck$LassoCheckResult]: Stem: 4192#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 4023#ULTIMATE.init_returnLabel#1 assume true;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; 4024#L404 assume !(1 == ~c_req_up~0); 4099#L415 assume 1 == ~wl_i~0;~wl_st~0 := 0; 4053#L420 assume 1 == ~c1_i~0;~c1_st~0 := 0; 4054#L425 assume 1 == ~c2_i~0;~c2_st~0 := 0; 3994#L430 assume !(1 == ~wb_i~0);~wb_st~0 := 2; 3995#L435 assume !(1 == ~r_i~0);~r_st~0 := 2; 4174#L440 assume 0 == ~e_f~0;~e_f~0 := 1; 4055#L445 assume !(0 == ~e_g~0); 4056#L450 assume !(0 == ~e_e~0); 3937#L455 assume !(0 == ~e_c~0); 3938#L460 assume !(0 == ~e_wl~0); 4118#L465 assume 1 == ~wl_pc~0; 4193#L466 assume 1 == ~e_wl~0;~wl_st~0 := 0; 4101#L483 assume !(1 == ~c1_pc~0); 4181#L492 assume !(1 == ~c2_pc~0); 3979#L501 assume !(1 == ~wb_pc~0); 4058#L510 assume 1 == ~e_c~0;~r_st~0 := 0; 4059#L515 assume !(1 == ~e_e~0); 4060#L520 assume !(1 == ~e_f~0); 3921#L525 assume !(1 == ~e_g~0); 3922#L530 assume !(1 == ~e_c~0); 4061#L535 assume !(1 == ~e_wl~0); 4171#L541 assume true; 4151#L541-1 [2024-11-17 08:53:33,513 INFO L747 eck$LassoCheckResult]: Loop: 4151#L541-1 assume !false; 4033#start_simulation_while_5_continue#1 assume true;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; 3924#L294 assume true; 4167#L294-1 assume !false; 4168#eval_while_4_continue#1 assume true; 4093#L296 assume !(0 == ~wl_st~0); 4049#L299 assume !(0 == ~c1_st~0); 4050#L302 assume !(0 == ~c2_st~0); 4203#L305 assume !(0 == ~wb_st~0); 3959#L308 assume !(0 == ~r_st~0); 3960#L311 assume true; 4081#L396 assume 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;assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; 4119#L548 assume !(1 == ~c_req_up~0); 4120#L559 start_simulation_~kernel_st~0#1 := 3; 4002#L560 assume 0 == ~e_f~0;~e_f~0 := 1; 3996#L565 assume 0 == ~e_g~0;~e_g~0 := 1; 3997#L570 assume 0 == ~e_e~0;~e_e~0 := 1; 3967#L575 assume !(0 == ~e_c~0); 3917#L580 assume 0 == ~e_wl~0;~e_wl~0 := 1; 3918#L585 assume 1 == ~wl_pc~0; 4159#L586 assume 1 == ~e_wl~0;~wl_st~0 := 0; 4162#L603 assume !(1 == ~c1_pc~0); 3927#L612 assume !(1 == ~c2_pc~0); 3929#L621 assume !(1 == ~wb_pc~0); 4115#L630 assume 1 == ~e_c~0;~r_st~0 := 0; 4008#L635 assume 1 == ~e_e~0;~e_e~0 := 2; 4009#L640 assume 1 == ~e_f~0;~e_f~0 := 2; 4031#L645 assume 1 == ~e_g~0;~e_g~0 := 2; 4175#L650 assume !(1 == ~e_c~0); 4035#L655 assume 1 == ~e_wl~0;~e_wl~0 := 2; 4036#L660 assume 0 == ~wl_st~0; 3973#L541 assume true; 4151#L541-1 [2024-11-17 08:53:33,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:53:33,513 INFO L85 PathProgramCache]: Analyzing trace with hash 938554429, now seen corresponding path program 1 times [2024-11-17 08:53:33,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:53:33,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344180722] [2024-11-17 08:53:33,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:53:33,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:53:33,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:53:33,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:53:33,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:53:33,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344180722] [2024-11-17 08:53:33,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344180722] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 08:53:33,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 08:53:33,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 08:53:33,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350396319] [2024-11-17 08:53:33,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 08:53:33,549 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-17 08:53:33,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:53:33,549 INFO L85 PathProgramCache]: Analyzing trace with hash -876978890, now seen corresponding path program 1 times [2024-11-17 08:53:33,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:53:33,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681020637] [2024-11-17 08:53:33,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:53:33,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:53:33,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:53:33,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:53:33,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:53:33,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681020637] [2024-11-17 08:53:33,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681020637] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 08:53:33,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 08:53:33,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 08:53:33,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438702721] [2024-11-17 08:53:33,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 08:53:33,568 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-17 08:53:33,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:53:33,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 08:53:33,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 08:53:33,568 INFO L87 Difference]: Start difference. First operand 374 states and 598 transitions. cyclomatic complexity: 227 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-11-17 08:53:33,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:53:33,577 INFO L93 Difference]: Finished difference Result 374 states and 597 transitions. [2024-11-17 08:53:33,577 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 374 states and 597 transitions. [2024-11-17 08:53:33,579 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 226 [2024-11-17 08:53:33,580 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 374 states to 374 states and 597 transitions. [2024-11-17 08:53:33,580 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 259 [2024-11-17 08:53:33,580 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 259 [2024-11-17 08:53:33,580 INFO L73 IsDeterministic]: Start isDeterministic. Operand 374 states and 597 transitions. [2024-11-17 08:53:33,581 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:53:33,581 INFO L218 hiAutomatonCegarLoop]: Abstraction has 374 states and 597 transitions. [2024-11-17 08:53:33,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states and 597 transitions. [2024-11-17 08:53:33,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 374. [2024-11-17 08:53:33,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 374 states, 374 states have (on average 1.5962566844919786) internal successors, (597), 373 states have internal predecessors, (597), 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-11-17 08:53:33,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 597 transitions. [2024-11-17 08:53:33,585 INFO L240 hiAutomatonCegarLoop]: Abstraction has 374 states and 597 transitions. [2024-11-17 08:53:33,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 08:53:33,587 INFO L425 stractBuchiCegarLoop]: Abstraction has 374 states and 597 transitions. [2024-11-17 08:53:33,587 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-11-17 08:53:33,587 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 374 states and 597 transitions. [2024-11-17 08:53:33,589 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 226 [2024-11-17 08:53:33,589 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:53:33,589 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:53:33,589 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-11-17 08:53:33,589 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, 1, 1, 1, 1] [2024-11-17 08:53:33,590 INFO L745 eck$LassoCheckResult]: Stem: 4936#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 4776#ULTIMATE.init_returnLabel#1 assume true;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; 4777#L404 assume !(1 == ~c_req_up~0); 4852#L415 assume 1 == ~wl_i~0;~wl_st~0 := 0; 4805#L420 assume 1 == ~c1_i~0;~c1_st~0 := 0; 4806#L425 assume 1 == ~c2_i~0;~c2_st~0 := 0; 4748#L430 assume 1 == ~wb_i~0;~wb_st~0 := 0; 4749#L435 assume !(1 == ~r_i~0);~r_st~0 := 2; 4924#L440 assume 0 == ~e_f~0;~e_f~0 := 1; 4811#L445 assume !(0 == ~e_g~0); 4812#L450 assume !(0 == ~e_e~0); 4692#L455 assume !(0 == ~e_c~0); 4693#L460 assume !(0 == ~e_wl~0); 4871#L465 assume 1 == ~wl_pc~0; 4937#L466 assume 1 == ~e_wl~0;~wl_st~0 := 0; 4854#L483 assume !(1 == ~c1_pc~0); 4931#L492 assume !(1 == ~c2_pc~0); 4735#L501 assume !(1 == ~wb_pc~0); 4814#L510 assume 1 == ~e_c~0;~r_st~0 := 0; 4815#L515 assume !(1 == ~e_e~0); 4816#L520 assume !(1 == ~e_f~0); 4672#L525 assume !(1 == ~e_g~0); 4673#L530 assume !(1 == ~e_c~0); 4817#L535 assume !(1 == ~e_wl~0); 4917#L541 assume true; 4939#L541-1 [2024-11-17 08:53:33,590 INFO L747 eck$LassoCheckResult]: Loop: 4939#L541-1 assume !false; 4959#start_simulation_while_5_continue#1 assume true;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#L294 assume true; 4957#L294-1 assume !false; 4956#eval_while_4_continue#1 assume true; 4955#L296 assume !(0 == ~wl_st~0); 4954#L299 assume !(0 == ~c1_st~0); 4953#L302 assume !(0 == ~c2_st~0); 4952#L305 assume !(0 == ~wb_st~0); 4950#L308 assume !(0 == ~r_st~0); 4949#L311 assume true; 4948#L396 assume 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;assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; 4945#L548 assume !(1 == ~c_req_up~0); 4818#L559 start_simulation_~kernel_st~0#1 := 3; 4762#L560 assume 0 == ~e_f~0;~e_f~0 := 1; 4752#L565 assume 0 == ~e_g~0;~e_g~0 := 1; 4753#L570 assume 0 == ~e_e~0;~e_e~0 := 1; 4724#L575 assume !(0 == ~e_c~0); 4725#L580 assume 0 == ~e_wl~0;~e_wl~0 := 1; 4940#L585 assume 1 == ~wl_pc~0; 4985#L586 assume 1 == ~e_wl~0;~wl_st~0 := 0; 4984#L603 assume !(1 == ~c1_pc~0); 4982#L612 assume !(1 == ~c2_pc~0); 4980#L621 assume !(1 == ~wb_pc~0); 4978#L630 assume 1 == ~e_c~0;~r_st~0 := 0; 4977#L635 assume 1 == ~e_e~0;~e_e~0 := 2; 4976#L640 assume 1 == ~e_f~0;~e_f~0 := 2; 4975#L645 assume 1 == ~e_g~0;~e_g~0 := 2; 4974#L650 assume !(1 == ~e_c~0); 4973#L655 assume 1 == ~e_wl~0;~e_wl~0 := 2; 4968#L660 assume 0 == ~wl_st~0; 4962#L541 assume true; 4939#L541-1 [2024-11-17 08:53:33,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:53:33,590 INFO L85 PathProgramCache]: Analyzing trace with hash 1783026300, now seen corresponding path program 1 times [2024-11-17 08:53:33,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:53:33,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871688532] [2024-11-17 08:53:33,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:53:33,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:53:33,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:53:33,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:53:33,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:53:33,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871688532] [2024-11-17 08:53:33,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871688532] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 08:53:33,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 08:53:33,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 08:53:33,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373011195] [2024-11-17 08:53:33,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 08:53:33,639 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-17 08:53:33,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:53:33,639 INFO L85 PathProgramCache]: Analyzing trace with hash -876978890, now seen corresponding path program 2 times [2024-11-17 08:53:33,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:53:33,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939156344] [2024-11-17 08:53:33,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:53:33,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:53:33,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:53:33,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:53:33,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:53:33,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939156344] [2024-11-17 08:53:33,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939156344] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 08:53:33,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 08:53:33,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 08:53:33,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043041558] [2024-11-17 08:53:33,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 08:53:33,664 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-17 08:53:33,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:53:33,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 08:53:33,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 08:53:33,665 INFO L87 Difference]: Start difference. First operand 374 states and 597 transitions. cyclomatic complexity: 226 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-11-17 08:53:33,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:53:33,688 INFO L93 Difference]: Finished difference Result 374 states and 581 transitions. [2024-11-17 08:53:33,688 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 374 states and 581 transitions. [2024-11-17 08:53:33,690 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 226 [2024-11-17 08:53:33,692 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 374 states to 374 states and 581 transitions. [2024-11-17 08:53:33,693 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 259 [2024-11-17 08:53:33,693 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 259 [2024-11-17 08:53:33,693 INFO L73 IsDeterministic]: Start isDeterministic. Operand 374 states and 581 transitions. [2024-11-17 08:53:33,693 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:53:33,693 INFO L218 hiAutomatonCegarLoop]: Abstraction has 374 states and 581 transitions. [2024-11-17 08:53:33,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states and 581 transitions. [2024-11-17 08:53:33,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 374. [2024-11-17 08:53:33,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 374 states, 374 states have (on average 1.553475935828877) internal successors, (581), 373 states have internal predecessors, (581), 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-11-17 08:53:33,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 581 transitions. [2024-11-17 08:53:33,698 INFO L240 hiAutomatonCegarLoop]: Abstraction has 374 states and 581 transitions. [2024-11-17 08:53:33,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 08:53:33,699 INFO L425 stractBuchiCegarLoop]: Abstraction has 374 states and 581 transitions. [2024-11-17 08:53:33,700 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-11-17 08:53:33,700 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 374 states and 581 transitions. [2024-11-17 08:53:33,701 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 226 [2024-11-17 08:53:33,701 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:53:33,701 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:53:33,702 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-11-17 08:53:33,702 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, 1, 1, 1, 1] [2024-11-17 08:53:33,702 INFO L745 eck$LassoCheckResult]: Stem: 5696#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 5533#ULTIMATE.init_returnLabel#1 assume true;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; 5534#L404 assume !(1 == ~c_req_up~0); 5608#L415 assume 1 == ~wl_i~0;~wl_st~0 := 0; 5563#L420 assume 1 == ~c1_i~0;~c1_st~0 := 0; 5564#L425 assume 1 == ~c2_i~0;~c2_st~0 := 0; 5505#L430 assume 1 == ~wb_i~0;~wb_st~0 := 0; 5506#L435 assume !(1 == ~r_i~0);~r_st~0 := 2; 5681#L440 assume !(0 == ~e_f~0); 5565#L445 assume !(0 == ~e_g~0); 5566#L450 assume !(0 == ~e_e~0); 5447#L455 assume !(0 == ~e_c~0); 5448#L460 assume !(0 == ~e_wl~0); 5627#L465 assume 1 == ~wl_pc~0; 5697#L466 assume 1 == ~e_wl~0;~wl_st~0 := 0; 5610#L483 assume !(1 == ~c1_pc~0); 5688#L492 assume !(1 == ~c2_pc~0); 5490#L501 assume !(1 == ~wb_pc~0); 5568#L510 assume 1 == ~e_c~0;~r_st~0 := 0; 5569#L515 assume !(1 == ~e_e~0); 5570#L520 assume !(1 == ~e_f~0); 5431#L525 assume !(1 == ~e_g~0); 5432#L530 assume !(1 == ~e_c~0); 5571#L535 assume !(1 == ~e_wl~0); 5678#L541 assume true; 5658#L541-1 [2024-11-17 08:53:33,702 INFO L747 eck$LassoCheckResult]: Loop: 5658#L541-1 assume !false; 5543#start_simulation_while_5_continue#1 assume true;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; 5434#L294 assume true; 5674#L294-1 assume !false; 5675#eval_while_4_continue#1 assume true; 5602#L296 assume !(0 == ~wl_st~0); 5559#L299 assume !(0 == ~c1_st~0); 5560#L302 assume !(0 == ~c2_st~0); 5707#L305 assume !(0 == ~wb_st~0); 5469#L308 assume !(0 == ~r_st~0); 5471#L311 assume true; 5590#L396 assume 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;assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; 5628#L548 assume !(1 == ~c_req_up~0); 5629#L559 start_simulation_~kernel_st~0#1 := 3; 5513#L560 assume !(0 == ~e_f~0); 5507#L565 assume 0 == ~e_g~0;~e_g~0 := 1; 5508#L570 assume 0 == ~e_e~0;~e_e~0 := 1; 5478#L575 assume !(0 == ~e_c~0); 5427#L580 assume 0 == ~e_wl~0;~e_wl~0 := 1; 5428#L585 assume 1 == ~wl_pc~0; 5666#L586 assume 1 == ~e_wl~0;~wl_st~0 := 0; 5669#L603 assume !(1 == ~c1_pc~0); 5437#L612 assume !(1 == ~c2_pc~0); 5439#L621 assume !(1 == ~wb_pc~0); 5624#L630 assume 1 == ~e_c~0;~r_st~0 := 0; 5519#L635 assume 1 == ~e_e~0;~e_e~0 := 2; 5520#L640 assume !(1 == ~e_f~0); 5541#L645 assume 1 == ~e_g~0;~e_g~0 := 2; 5682#L650 assume !(1 == ~e_c~0); 5545#L655 assume 1 == ~e_wl~0;~e_wl~0 := 2; 5546#L660 assume 0 == ~wl_st~0; 5484#L541 assume true; 5658#L541-1 [2024-11-17 08:53:33,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:53:33,703 INFO L85 PathProgramCache]: Analyzing trace with hash -1158631299, now seen corresponding path program 1 times [2024-11-17 08:53:33,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:53:33,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256791260] [2024-11-17 08:53:33,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:53:33,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:53:33,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:53:33,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:53:33,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:53:33,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256791260] [2024-11-17 08:53:33,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256791260] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 08:53:33,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 08:53:33,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 08:53:33,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613674249] [2024-11-17 08:53:33,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 08:53:33,731 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-17 08:53:33,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:53:33,732 INFO L85 PathProgramCache]: Analyzing trace with hash -1845422092, now seen corresponding path program 1 times [2024-11-17 08:53:33,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:53:33,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392425212] [2024-11-17 08:53:33,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:53:33,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:53:33,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:53:33,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:53:33,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:53:33,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392425212] [2024-11-17 08:53:33,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392425212] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 08:53:33,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 08:53:33,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 08:53:33,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134075411] [2024-11-17 08:53:33,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 08:53:33,749 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-17 08:53:33,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:53:33,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 08:53:33,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 08:53:33,750 INFO L87 Difference]: Start difference. First operand 374 states and 581 transitions. cyclomatic complexity: 210 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-11-17 08:53:33,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:53:33,817 INFO L93 Difference]: Finished difference Result 902 states and 1382 transitions. [2024-11-17 08:53:33,817 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 902 states and 1382 transitions. [2024-11-17 08:53:33,821 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 527 [2024-11-17 08:53:33,824 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 902 states to 902 states and 1382 transitions. [2024-11-17 08:53:33,824 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 572 [2024-11-17 08:53:33,824 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 572 [2024-11-17 08:53:33,824 INFO L73 IsDeterministic]: Start isDeterministic. Operand 902 states and 1382 transitions. [2024-11-17 08:53:33,825 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:53:33,825 INFO L218 hiAutomatonCegarLoop]: Abstraction has 902 states and 1382 transitions. [2024-11-17 08:53:33,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 902 states and 1382 transitions. [2024-11-17 08:53:33,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 902 to 848. [2024-11-17 08:53:33,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 848 states, 848 states have (on average 1.5377358490566038) internal successors, (1304), 847 states have internal predecessors, (1304), 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-11-17 08:53:33,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 848 states to 848 states and 1304 transitions. [2024-11-17 08:53:33,834 INFO L240 hiAutomatonCegarLoop]: Abstraction has 848 states and 1304 transitions. [2024-11-17 08:53:33,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 08:53:33,834 INFO L425 stractBuchiCegarLoop]: Abstraction has 848 states and 1304 transitions. [2024-11-17 08:53:33,835 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-11-17 08:53:33,835 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 848 states and 1304 transitions. [2024-11-17 08:53:33,837 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 511 [2024-11-17 08:53:33,837 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:53:33,837 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:53:33,838 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-11-17 08:53:33,838 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, 1, 1, 1, 1, 1] [2024-11-17 08:53:33,838 INFO L745 eck$LassoCheckResult]: Stem: 7003#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 6823#ULTIMATE.init_returnLabel#1 assume true;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; 6824#L404 assume !(1 == ~c_req_up~0); 7000#L415 assume 1 == ~wl_i~0;~wl_st~0 := 0; 6853#L420 assume 1 == ~c1_i~0;~c1_st~0 := 0; 6854#L425 assume 1 == ~c2_i~0;~c2_st~0 := 0; 6793#L430 assume 1 == ~wb_i~0;~wb_st~0 := 0; 6794#L435 assume !(1 == ~r_i~0);~r_st~0 := 2; 6973#L440 assume !(0 == ~e_f~0); 6855#L445 assume !(0 == ~e_g~0); 6856#L450 assume !(0 == ~e_e~0); 6734#L455 assume !(0 == ~e_c~0); 6735#L460 assume !(0 == ~e_wl~0); 6919#L465 assume !(1 == ~wl_pc~0); 6769#L469 assume true; 6770#L473 assume !(2 == ~wl_pc~0); 6899#L483 assume !(1 == ~c1_pc~0); 6992#L492 assume !(1 == ~c2_pc~0); 6778#L501 assume !(1 == ~wb_pc~0); 6858#L510 assume 1 == ~e_c~0;~r_st~0 := 0; 6859#L515 assume !(1 == ~e_e~0); 6860#L520 assume !(1 == ~e_f~0); 6718#L525 assume !(1 == ~e_g~0); 6719#L530 assume !(1 == ~e_c~0); 6861#L535 assume !(1 == ~e_wl~0); 6970#L541 assume true; 6949#L541-1 [2024-11-17 08:53:33,838 INFO L747 eck$LassoCheckResult]: Loop: 6949#L541-1 assume !false; 6833#start_simulation_while_5_continue#1 assume true;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; 6721#L294 assume true; 6966#L294-1 assume !false; 6967#eval_while_4_continue#1 assume true; 6891#L296 assume !(0 == ~wl_st~0); 6849#L299 assume !(0 == ~c1_st~0); 6850#L302 assume !(0 == ~c2_st~0); 6922#L305 assume !(0 == ~wb_st~0); 6757#L308 assume !(0 == ~r_st~0); 6758#L311 assume true; 6878#L396 assume 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;assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; 6920#L548 assume !(1 == ~c_req_up~0); 6862#L559 start_simulation_~kernel_st~0#1 := 3; 6801#L560 assume !(0 == ~e_f~0); 6795#L565 assume 0 == ~e_g~0;~e_g~0 := 1; 6796#L570 assume 0 == ~e_e~0;~e_e~0 := 1; 6766#L575 assume !(0 == ~e_c~0); 6714#L580 assume 0 == ~e_wl~0;~e_wl~0 := 1; 6715#L585 assume !(1 == ~wl_pc~0); 6762#L589 assume true; 6763#L593 assume !(2 == ~wl_pc~0); 6958#L603 assume !(1 == ~c1_pc~0); 6724#L612 assume !(1 == ~c2_pc~0); 6726#L621 assume !(1 == ~wb_pc~0); 6907#L630 assume 1 == ~e_c~0;~r_st~0 := 0; 7547#L635 assume 1 == ~e_e~0;~e_e~0 := 2; 7546#L640 assume !(1 == ~e_f~0); 7007#L645 assume 1 == ~e_g~0;~e_g~0 := 2; 6974#L650 assume !(1 == ~e_c~0); 6835#L655 assume 1 == ~e_wl~0;~e_wl~0 := 2; 6836#L660 assume 0 == ~wl_st~0; 6772#L541 assume true; 6949#L541-1 [2024-11-17 08:53:33,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:53:33,838 INFO L85 PathProgramCache]: Analyzing trace with hash 1003437152, now seen corresponding path program 1 times [2024-11-17 08:53:33,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:53:33,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323087442] [2024-11-17 08:53:33,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:53:33,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:53:33,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:53:33,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:53:33,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:53:33,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323087442] [2024-11-17 08:53:33,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323087442] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 08:53:33,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 08:53:33,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 08:53:33,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137626322] [2024-11-17 08:53:33,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 08:53:33,889 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-17 08:53:33,889 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2024-11-17 08:53:33,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:53:33,889 INFO L85 PathProgramCache]: Analyzing trace with hash 1599447012, now seen corresponding path program 1 times [2024-11-17 08:53:33,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:53:33,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442484849] [2024-11-17 08:53:33,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:53:33,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:53:33,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:53:33,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:53:33,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:53:33,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442484849] [2024-11-17 08:53:33,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442484849] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 08:53:33,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 08:53:33,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 08:53:33,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973080570] [2024-11-17 08:53:33,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 08:53:33,904 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-17 08:53:33,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:53:33,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 08:53:33,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 08:53:33,905 INFO L87 Difference]: Start difference. First operand 848 states and 1304 transitions. cyclomatic complexity: 461 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-11-17 08:53:33,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:53:33,930 INFO L93 Difference]: Finished difference Result 1052 states and 1580 transitions. [2024-11-17 08:53:33,930 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1052 states and 1580 transitions. [2024-11-17 08:53:33,935 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 721 [2024-11-17 08:53:33,937 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1052 states to 751 states and 1130 transitions. [2024-11-17 08:53:33,937 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 751 [2024-11-17 08:53:33,938 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 751 [2024-11-17 08:53:33,938 INFO L73 IsDeterministic]: Start isDeterministic. Operand 751 states and 1130 transitions. [2024-11-17 08:53:33,939 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-17 08:53:33,939 INFO L218 hiAutomatonCegarLoop]: Abstraction has 751 states and 1130 transitions. [2024-11-17 08:53:33,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 751 states and 1130 transitions. [2024-11-17 08:53:33,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 751 to 540. [2024-11-17 08:53:33,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 540 states, 540 states have (on average 1.5074074074074073) internal successors, (814), 539 states have internal predecessors, (814), 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-11-17 08:53:33,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 814 transitions. [2024-11-17 08:53:33,947 INFO L240 hiAutomatonCegarLoop]: Abstraction has 540 states and 814 transitions. [2024-11-17 08:53:33,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 08:53:33,947 INFO L425 stractBuchiCegarLoop]: Abstraction has 540 states and 814 transitions. [2024-11-17 08:53:33,947 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-11-17 08:53:33,948 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 540 states and 814 transitions. [2024-11-17 08:53:33,949 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 511 [2024-11-17 08:53:33,949 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:53:33,949 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:53:33,950 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-11-17 08:53:33,950 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, 1, 1, 1, 1, 1] [2024-11-17 08:53:33,950 INFO L745 eck$LassoCheckResult]: Stem: 8773#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 8678#ULTIMATE.init_returnLabel#1 assume true;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; 8679#L404 assume !(1 == ~c_req_up~0); 8771#L415 assume 1 == ~wl_i~0;~wl_st~0 := 0; 8695#L420 assume 1 == ~c1_i~0;~c1_st~0 := 0; 8696#L425 assume 1 == ~c2_i~0;~c2_st~0 := 0; 8663#L430 assume 1 == ~wb_i~0;~wb_st~0 := 0; 8664#L435 assume !(1 == ~r_i~0);~r_st~0 := 2; 8760#L440 assume !(0 == ~e_f~0); 8697#L445 assume !(0 == ~e_g~0); 8698#L450 assume !(0 == ~e_e~0); 8632#L455 assume !(0 == ~e_c~0); 8633#L460 assume !(0 == ~e_wl~0); 8733#L465 assume !(1 == ~wl_pc~0); 8649#L469 assume true; 8650#L473 assume !(2 == ~wl_pc~0); 8722#L483 assume !(1 == ~c1_pc~0); 8768#L492 assume !(1 == ~c2_pc~0); 8655#L501 assume !(1 == ~wb_pc~0); 8700#L510 assume !(1 == ~e_c~0); 8701#L515 assume !(1 == ~e_e~0); 8702#L520 assume !(1 == ~e_f~0); 8623#L525 assume !(1 == ~e_g~0); 8624#L530 assume !(1 == ~e_c~0); 8703#L535 assume !(1 == ~e_wl~0); 8758#L541 [2024-11-17 08:53:33,950 INFO L747 eck$LassoCheckResult]: Loop: 8758#L541 assume true; 9091#L541-1 assume !false; 9086#start_simulation_while_5_continue#1 assume true;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; 9085#L294 assume true; 9084#L294-1 assume !false; 9083#eval_while_4_continue#1 assume true; 9082#L296 assume !(0 == ~wl_st~0); 9081#L299 assume !(0 == ~c1_st~0); 8755#L302 assume !(0 == ~c2_st~0); 8736#L305 assume !(0 == ~wb_st~0); 8644#L308 assume !(0 == ~r_st~0); 8645#L311 assume true; 8713#L396 assume 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;assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; 8734#L548 assume !(1 == ~c_req_up~0); 8735#L559 start_simulation_~kernel_st~0#1 := 3; 9160#L560 assume !(0 == ~e_f~0); 9159#L565 assume 0 == ~e_g~0;~e_g~0 := 1; 9158#L570 assume 0 == ~e_e~0;~e_e~0 := 1; 9157#L575 assume !(0 == ~e_c~0); 9156#L580 assume 0 == ~e_wl~0;~e_wl~0 := 1; 9155#L585 assume !(1 == ~wl_pc~0); 9154#L589 assume true; 9153#L593 assume !(2 == ~wl_pc~0); 9151#L603 assume !(1 == ~c1_pc~0); 9149#L612 assume !(1 == ~c2_pc~0); 9147#L621 assume !(1 == ~wb_pc~0); 9145#L630 assume !(1 == ~e_c~0); 9144#L635 assume 1 == ~e_e~0;~e_e~0 := 2; 9143#L640 assume !(1 == ~e_f~0); 9142#L645 assume 1 == ~e_g~0;~e_g~0 := 2; 9140#L650 assume !(1 == ~e_c~0); 9137#L655 assume 1 == ~e_wl~0;~e_wl~0 := 2; 9106#L660 assume 0 == ~wl_st~0; 8758#L541 [2024-11-17 08:53:33,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:53:33,951 INFO L85 PathProgramCache]: Analyzing trace with hash 2139208066, now seen corresponding path program 1 times [2024-11-17 08:53:33,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:53:33,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353808409] [2024-11-17 08:53:33,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:53:33,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:53:33,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:53:33,958 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:53:33,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:53:33,965 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:53:33,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:53:33,965 INFO L85 PathProgramCache]: Analyzing trace with hash -396102367, now seen corresponding path program 1 times [2024-11-17 08:53:33,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:53:33,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041631921] [2024-11-17 08:53:33,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:53:33,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:53:33,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:53:33,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:53:33,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:53:33,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041631921] [2024-11-17 08:53:33,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041631921] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 08:53:33,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 08:53:33,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 08:53:33,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075755536] [2024-11-17 08:53:33,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 08:53:33,981 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-17 08:53:33,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:53:33,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 08:53:33,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 08:53:33,981 INFO L87 Difference]: Start difference. First operand 540 states and 814 transitions. cyclomatic complexity: 276 Second operand has 3 states, 2 states have (on average 16.5) internal successors, (33), 3 states have internal predecessors, (33), 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-11-17 08:53:34,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:53:34,004 INFO L93 Difference]: Finished difference Result 889 states and 1314 transitions. [2024-11-17 08:53:34,004 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 889 states and 1314 transitions. [2024-11-17 08:53:34,008 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 860 [2024-11-17 08:53:34,011 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 889 states to 889 states and 1314 transitions. [2024-11-17 08:53:34,012 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 889 [2024-11-17 08:53:34,012 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 889 [2024-11-17 08:53:34,012 INFO L73 IsDeterministic]: Start isDeterministic. Operand 889 states and 1314 transitions. [2024-11-17 08:53:34,013 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-17 08:53:34,013 INFO L218 hiAutomatonCegarLoop]: Abstraction has 889 states and 1314 transitions. [2024-11-17 08:53:34,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 889 states and 1314 transitions. [2024-11-17 08:53:34,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 889 to 889. [2024-11-17 08:53:34,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 889 states, 889 states have (on average 1.4780652418447695) internal successors, (1314), 888 states have internal predecessors, (1314), 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-11-17 08:53:34,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 889 states to 889 states and 1314 transitions. [2024-11-17 08:53:34,024 INFO L240 hiAutomatonCegarLoop]: Abstraction has 889 states and 1314 transitions. [2024-11-17 08:53:34,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 08:53:34,025 INFO L425 stractBuchiCegarLoop]: Abstraction has 889 states and 1314 transitions. [2024-11-17 08:53:34,025 INFO L332 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2024-11-17 08:53:34,025 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 889 states and 1314 transitions. [2024-11-17 08:53:34,028 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 860 [2024-11-17 08:53:34,028 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:53:34,028 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:53:34,029 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-11-17 08:53:34,029 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, 1, 1, 1, 1, 1, 1] [2024-11-17 08:53:34,029 INFO L745 eck$LassoCheckResult]: Stem: 10236#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 10113#ULTIMATE.init_returnLabel#1 assume true;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; 10114#L404 assume !(1 == ~c_req_up~0); 10230#L415 assume 1 == ~wl_i~0;~wl_st~0 := 0; 10131#L420 assume 1 == ~c1_i~0;~c1_st~0 := 0; 10132#L425 assume 1 == ~c2_i~0;~c2_st~0 := 0; 10099#L430 assume 1 == ~wb_i~0;~wb_st~0 := 0; 10100#L435 assume !(1 == ~r_i~0);~r_st~0 := 2; 10213#L440 assume !(0 == ~e_f~0); 10135#L445 assume !(0 == ~e_g~0); 10136#L450 assume !(0 == ~e_e~0); 10065#L455 assume !(0 == ~e_c~0); 10066#L460 assume !(0 == ~e_wl~0); 10180#L465 assume !(1 == ~wl_pc~0); 10084#L469 assume true; 10085#L473 assume !(2 == ~wl_pc~0); 10167#L483 assume !(1 == ~c1_pc~0); 10226#L492 assume !(1 == ~c2_pc~0); 10092#L501 assume !(1 == ~wb_pc~0); 10139#L510 assume !(1 == ~e_c~0); 10140#L515 assume !(1 == ~e_e~0); 10141#L520 assume !(1 == ~e_f~0); 10056#L525 assume !(1 == ~e_g~0); 10057#L530 assume !(1 == ~e_c~0); 10142#L535 assume !(1 == ~e_wl~0); 10208#L541 [2024-11-17 08:53:34,030 INFO L747 eck$LassoCheckResult]: Loop: 10208#L541 assume true; 10937#L541-1 assume !false; 10895#start_simulation_while_5_continue#1 assume true;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; 10894#L294 assume true; 10893#L294-1 assume !false; 10892#eval_while_4_continue#1 assume true; 10891#L296 assume !(0 == ~wl_st~0); 10335#L299 assume !(0 == ~c1_st~0); 10333#L302 assume !(0 == ~c2_st~0); 10307#L305 assume !(0 == ~wb_st~0); 10302#L308 assume !(0 == ~r_st~0); 10155#L311 assume true; 10156#L396 assume 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;assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; 10181#L548 assume !(1 == ~c_req_up~0); 10182#L559 start_simulation_~kernel_st~0#1 := 3; 10106#L560 assume !(0 == ~e_f~0); 10107#L565 assume 0 == ~e_g~0;~e_g~0 := 1; 10137#L570 assume 0 == ~e_e~0;~e_e~0 := 1; 10086#L575 assume !(0 == ~e_c~0); 10087#L580 assume 0 == ~e_wl~0;~e_wl~0 := 1; 10203#L585 assume !(1 == ~wl_pc~0); 10204#L589 assume true; 10205#L593 assume 2 == ~wl_pc~0; 10206#L594 assume 1 == ~e_e~0;~wl_st~0 := 0; 10789#L603 assume !(1 == ~c1_pc~0); 10787#L612 assume !(1 == ~c2_pc~0); 10785#L621 assume !(1 == ~wb_pc~0); 10783#L630 assume !(1 == ~e_c~0); 10782#L635 assume 1 == ~e_e~0;~e_e~0 := 2; 10781#L640 assume !(1 == ~e_f~0); 10780#L645 assume 1 == ~e_g~0;~e_g~0 := 2; 10779#L650 assume !(1 == ~e_c~0); 10778#L655 assume 1 == ~e_wl~0;~e_wl~0 := 2; 10777#L660 assume 0 == ~wl_st~0; 10208#L541 [2024-11-17 08:53:34,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:53:34,030 INFO L85 PathProgramCache]: Analyzing trace with hash 2139208066, now seen corresponding path program 2 times [2024-11-17 08:53:34,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:53:34,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004615077] [2024-11-17 08:53:34,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:53:34,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:53:34,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:53:34,038 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:53:34,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:53:34,046 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:53:34,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:53:34,047 INFO L85 PathProgramCache]: Analyzing trace with hash -766879373, now seen corresponding path program 1 times [2024-11-17 08:53:34,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:53:34,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853355608] [2024-11-17 08:53:34,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:53:34,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:53:34,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:53:34,051 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:53:34,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:53:34,055 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:53:34,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:53:34,057 INFO L85 PathProgramCache]: Analyzing trace with hash -1487506764, now seen corresponding path program 1 times [2024-11-17 08:53:34,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:53:34,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555522552] [2024-11-17 08:53:34,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:53:34,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:53:34,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:53:34,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:53:34,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:53:34,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555522552] [2024-11-17 08:53:34,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555522552] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 08:53:34,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 08:53:34,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 08:53:34,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344642008] [2024-11-17 08:53:34,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 08:53:34,243 INFO L204 LassoAnalysis]: Preferences: [2024-11-17 08:53:34,243 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-17 08:53:34,244 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-17 08:53:34,244 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-17 08:53:34,244 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-17 08:53:34,244 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:53:34,244 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-17 08:53:34,244 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-17 08:53:34,244 INFO L132 ssoRankerPreferences]: Filename of dumped script: toy2.cil.c_Iteration9_Loop [2024-11-17 08:53:34,244 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-17 08:53:34,244 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-17 08:53:34,245 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:53:34,247 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:53:34,248 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:53:34,250 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:53:34,255 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:53:34,257 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:53:34,259 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:53:34,260 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:53:34,262 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:53:34,265 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:53:34,267 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:53:34,270 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:53:34,272 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:53:34,274 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:53:34,277 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:53:34,279 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:53:34,280 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:53:34,282 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:53:34,284 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:53:34,285 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:53:34,290 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:53:34,291 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:53:34,292 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:53:34,293 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:53:34,296 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:53:34,432 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-17 08:53:34,432 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-17 08:53:34,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:53:34,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:53:34,434 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:53:34,435 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2024-11-17 08:53:34,436 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-17 08:53:34,436 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-17 08:53:34,447 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-17 08:53:34,447 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_#t~nondet4#1=0} Honda state: {ULTIMATE.start_eval_#t~nondet4#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-17 08:53:34,457 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2024-11-17 08:53:34,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:53:34,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:53:34,461 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:53:34,461 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2024-11-17 08:53:34,462 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-17 08:53:34,462 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-17 08:53:34,472 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-17 08:53:34,473 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_~tmp~0#1=0} Honda state: {ULTIMATE.start_eval_~tmp~0#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-17 08:53:34,483 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2024-11-17 08:53:34,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:53:34,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:53:34,484 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:53:34,484 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2024-11-17 08:53:34,485 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-17 08:53:34,485 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-17 08:53:34,504 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-17 08:53:34,504 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~r_st~0=-1} Honda state: {~r_st~0=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-17 08:53:34,514 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2024-11-17 08:53:34,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:53:34,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:53:34,515 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:53:34,516 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2024-11-17 08:53:34,517 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-17 08:53:34,517 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-17 08:53:34,537 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2024-11-17 08:53:34,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:53:34,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:53:34,538 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:53:34,539 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2024-11-17 08:53:34,540 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-17 08:53:34,540 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-17 08:53:34,552 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-17 08:53:34,564 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2024-11-17 08:53:34,565 INFO L204 LassoAnalysis]: Preferences: [2024-11-17 08:53:34,565 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-17 08:53:34,565 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-17 08:53:34,565 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-17 08:53:34,565 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-17 08:53:34,565 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:53:34,565 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-17 08:53:34,565 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-17 08:53:34,565 INFO L132 ssoRankerPreferences]: Filename of dumped script: toy2.cil.c_Iteration9_Loop [2024-11-17 08:53:34,565 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-17 08:53:34,565 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-17 08:53:34,566 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:53:34,569 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:53:34,570 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:53:34,576 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:53:34,583 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:53:34,584 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:53:34,586 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:53:34,587 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:53:34,588 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:53:34,592 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:53:34,594 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:53:34,595 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:53:34,597 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:53:34,599 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:53:34,600 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:53:34,603 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:53:34,605 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:53:34,607 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:53:34,608 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:53:34,610 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:53:34,611 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:53:34,614 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:53:34,618 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:53:34,619 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:53:34,620 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:53:34,767 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-17 08:53:34,767 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-17 08:53:34,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:53:34,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:53:34,770 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:53:34,771 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2024-11-17 08:53:34,772 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-11-17 08:53:34,782 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:53:34,782 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:53:34,782 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:53:34,782 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:53:34,782 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:53:34,783 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:53:34,783 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:53:34,784 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:53:34,794 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2024-11-17 08:53:34,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:53:34,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:53:34,795 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:53:34,797 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2024-11-17 08:53:34,800 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-11-17 08:53:34,810 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:53:34,810 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:53:34,810 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:53:34,810 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:53:34,810 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:53:34,811 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:53:34,811 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:53:34,812 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:53:34,822 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2024-11-17 08:53:34,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:53:34,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:53:34,823 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:53:34,825 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2024-11-17 08:53:34,826 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-11-17 08:53:34,836 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:53:34,836 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:53:34,836 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:53:34,836 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2024-11-17 08:53:34,836 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:53:34,837 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2024-11-17 08:53:34,837 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:53:34,842 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:53:34,852 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2024-11-17 08:53:34,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:53:34,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:53:34,854 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:53:34,855 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2024-11-17 08:53:34,857 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-11-17 08:53:34,866 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:53:34,867 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:53:34,867 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:53:34,867 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:53:34,867 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:53:34,867 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:53:34,867 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:53:34,870 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-17 08:53:34,871 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-17 08:53:34,872 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-11-17 08:53:34,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:53:34,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:53:34,873 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:53:34,875 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2024-11-17 08:53:34,875 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-17 08:53:34,875 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-17 08:53:34,876 INFO L474 LassoAnalysis]: Proved termination. [2024-11-17 08:53:34,876 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(~e_e~0) = -1*~e_e~0 + 1 Supporting invariants [] [2024-11-17 08:53:34,886 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2024-11-17 08:53:34,887 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-17 08:53:34,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:53:34,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:53:34,913 INFO L255 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-17 08:53:34,914 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:53:34,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:53:34,945 INFO L255 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-17 08:53:34,946 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:53:35,003 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2024-11-17 08:53:35,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:53:35,026 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-11-17 08:53:35,027 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 889 states and 1314 transitions. cyclomatic complexity: 427 Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 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-11-17 08:53:35,055 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 889 states and 1314 transitions. cyclomatic complexity: 427. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 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 3381 states and 5004 transitions. Complement of second has 5 states. [2024-11-17 08:53:35,055 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-11-17 08:53:35,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 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-11-17 08:53:35,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 382 transitions. [2024-11-17 08:53:35,056 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 382 transitions. Stem has 25 letters. Loop has 34 letters. [2024-11-17 08:53:35,056 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:53:35,057 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 382 transitions. Stem has 59 letters. Loop has 34 letters. [2024-11-17 08:53:35,057 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:53:35,057 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 382 transitions. Stem has 25 letters. Loop has 68 letters. [2024-11-17 08:53:35,057 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:53:35,057 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3381 states and 5004 transitions. [2024-11-17 08:53:35,068 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 2520 [2024-11-17 08:53:35,078 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3381 states to 3381 states and 5004 transitions. [2024-11-17 08:53:35,078 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2550 [2024-11-17 08:53:35,079 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2566 [2024-11-17 08:53:35,080 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3381 states and 5004 transitions. [2024-11-17 08:53:35,080 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:53:35,080 INFO L218 hiAutomatonCegarLoop]: Abstraction has 3381 states and 5004 transitions. [2024-11-17 08:53:35,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3381 states and 5004 transitions. [2024-11-17 08:53:35,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3381 to 2505. [2024-11-17 08:53:35,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2505 states, 2505 states have (on average 1.477445109780439) internal successors, (3701), 2504 states have internal predecessors, (3701), 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-11-17 08:53:35,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2505 states to 2505 states and 3701 transitions. [2024-11-17 08:53:35,106 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2505 states and 3701 transitions. [2024-11-17 08:53:35,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:53:35,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 08:53:35,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 08:53:35,107 INFO L87 Difference]: Start difference. First operand 2505 states and 3701 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 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-11-17 08:53:35,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:53:35,129 INFO L93 Difference]: Finished difference Result 2203 states and 3215 transitions. [2024-11-17 08:53:35,129 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2203 states and 3215 transitions. [2024-11-17 08:53:35,136 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 1454 [2024-11-17 08:53:35,142 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2203 states to 2203 states and 3215 transitions. [2024-11-17 08:53:35,142 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1489 [2024-11-17 08:53:35,143 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1489 [2024-11-17 08:53:35,143 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2203 states and 3215 transitions. [2024-11-17 08:53:35,144 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:53:35,144 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2203 states and 3215 transitions. [2024-11-17 08:53:35,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2203 states and 3215 transitions. [2024-11-17 08:53:35,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2203 to 2046. [2024-11-17 08:53:35,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2046 states, 2046 states have (on average 1.4633431085043989) internal successors, (2994), 2045 states have internal predecessors, (2994), 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-11-17 08:53:35,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2046 states to 2046 states and 2994 transitions. [2024-11-17 08:53:35,163 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2046 states and 2994 transitions. [2024-11-17 08:53:35,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 08:53:35,164 INFO L425 stractBuchiCegarLoop]: Abstraction has 2046 states and 2994 transitions. [2024-11-17 08:53:35,164 INFO L332 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2024-11-17 08:53:35,164 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2046 states and 2994 transitions. [2024-11-17 08:53:35,169 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1352 [2024-11-17 08:53:35,169 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:53:35,169 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:53:35,170 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-11-17 08:53:35,170 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:53:35,170 INFO L745 eck$LassoCheckResult]: Stem: 19534#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 19327#ULTIMATE.init_returnLabel#1 assume true;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; 19328#L404 assume !(1 == ~c_req_up~0); 19530#L415 assume 1 == ~wl_i~0;~wl_st~0 := 0; 19367#L420 assume 1 == ~c1_i~0;~c1_st~0 := 0; 19368#L425 assume 1 == ~c2_i~0;~c2_st~0 := 0; 19303#L430 assume 1 == ~wb_i~0;~wb_st~0 := 0; 19304#L435 assume !(1 == ~r_i~0);~r_st~0 := 2; 19501#L440 assume !(0 == ~e_f~0); 19373#L445 assume !(0 == ~e_g~0); 19374#L450 assume !(0 == ~e_e~0); 19247#L455 assume !(0 == ~e_c~0); 19248#L460 assume !(0 == ~e_wl~0); 19447#L465 assume !(1 == ~wl_pc~0); 19279#L469 assume true; 19280#L473 assume !(2 == ~wl_pc~0); 19423#L483 assume !(1 == ~c1_pc~0); 19524#L492 assume !(1 == ~c2_pc~0); 19290#L501 assume !(1 == ~wb_pc~0); 19378#L510 assume !(1 == ~e_c~0); 19379#L515 assume !(1 == ~e_e~0); 19380#L520 assume !(1 == ~e_f~0); 19233#L525 assume !(1 == ~e_g~0); 19234#L530 assume !(1 == ~e_c~0); 19381#L535 assume 1 == ~e_wl~0;~e_wl~0 := 2; 19494#L541 [2024-11-17 08:53:35,170 INFO L747 eck$LassoCheckResult]: Loop: 19494#L541 assume true; 21178#L541-1 assume !false; 20860#start_simulation_while_5_continue#1 assume true;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; 20858#L294 assume true; 20856#L294-1 assume !false; 20854#eval_while_4_continue#1 assume true; 20851#L296 assume 0 == ~wl_st~0; 20829#L317 assume 0 == ~wl_st~0;havoc eval_#t~nondet4#1;eval_~tmp~0#1 := eval_#t~nondet4#1;havoc eval_#t~nondet4#1; 20646#L321 assume 0 != eval_~tmp~0#1;~wl_st~0 := 1;assume { :begin_inline_write_loop } true;havoc write_loop_~t~0#1;havoc write_loop_~t~0#1; 20081#L66 assume 0 == ~wl_pc~0; 19363#L67 assume true;~wl_st~0 := 2;~wl_pc~0 := 1;~e_wl~0 := 0; 19532#L84 assume true; 20827#L130 assume true;havoc write_loop_~t~0#1;assume { :end_inline_write_loop } true; 20798#L332 assume !(0 == ~c1_st~0); 20772#L347 assume !(0 == ~c2_st~0); 20766#L362 assume !(0 == ~wb_st~0); 20712#L377 assume !(0 == ~r_st~0); 20708#L294 assume true; 20706#L294-1 assume !false; 20704#eval_while_4_continue#1 assume true; 20702#L296 assume !(0 == ~wl_st~0); 20701#L299 assume !(0 == ~c1_st~0); 20682#L302 assume !(0 == ~c2_st~0); 20679#L305 assume !(0 == ~wb_st~0); 20677#L308 assume !(0 == ~r_st~0); 20676#L311 assume true; 20662#L396 assume 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;assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; 20655#L548 assume !(1 == ~c_req_up~0); 20656#L559 start_simulation_~kernel_st~0#1 := 3; 20740#L560 assume !(0 == ~e_f~0); 20732#L565 assume 0 == ~e_g~0;~e_g~0 := 1; 20724#L570 assume 0 == ~e_e~0;~e_e~0 := 1; 20090#L575 assume !(0 == ~e_c~0); 20086#L580 assume 0 == ~e_wl~0;~e_wl~0 := 1; 20083#L585 assume !(1 == ~wl_pc~0); 19275#L589 assume true; 19276#L593 assume 2 == ~wl_pc~0; 19485#L594 assume 1 == ~e_e~0;~wl_st~0 := 0; 19513#L603 assume !(1 == ~c1_pc~0); 19241#L612 assume !(1 == ~c2_pc~0); 19243#L621 assume !(1 == ~wb_pc~0); 21271#L630 assume !(1 == ~e_c~0); 19319#L635 assume 1 == ~e_e~0;~e_e~0 := 2; 19320#L640 assume !(1 == ~e_f~0); 19346#L645 assume 1 == ~e_g~0;~e_g~0 := 2; 19504#L650 assume !(1 == ~e_c~0); 19505#L655 assume 1 == ~e_wl~0;~e_wl~0 := 2; 21269#L660 assume 0 == ~wl_st~0; 19494#L541 [2024-11-17 08:53:35,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:53:35,171 INFO L85 PathProgramCache]: Analyzing trace with hash 2139208065, now seen corresponding path program 1 times [2024-11-17 08:53:35,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:53:35,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345941950] [2024-11-17 08:53:35,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:53:35,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:53:35,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:53:35,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:53:35,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:53:35,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345941950] [2024-11-17 08:53:35,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345941950] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 08:53:35,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 08:53:35,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 08:53:35,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861411334] [2024-11-17 08:53:35,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 08:53:35,196 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-17 08:53:35,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:53:35,196 INFO L85 PathProgramCache]: Analyzing trace with hash -1098296171, now seen corresponding path program 1 times [2024-11-17 08:53:35,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:53:35,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987285992] [2024-11-17 08:53:35,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:53:35,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:53:35,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:53:35,218 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:53:35,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:53:35,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987285992] [2024-11-17 08:53:35,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987285992] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 08:53:35,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 08:53:35,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 08:53:35,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73079325] [2024-11-17 08:53:35,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 08:53:35,219 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-17 08:53:35,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:53:35,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 08:53:35,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 08:53:35,220 INFO L87 Difference]: Start difference. First operand 2046 states and 2994 transitions. cyclomatic complexity: 951 Second operand has 4 states, 3 states have (on average 8.333333333333334) 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-11-17 08:53:35,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:53:35,276 INFO L93 Difference]: Finished difference Result 2766 states and 4036 transitions. [2024-11-17 08:53:35,276 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2766 states and 4036 transitions. [2024-11-17 08:53:35,284 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 1816 [2024-11-17 08:53:35,291 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2766 states to 2766 states and 4036 transitions. [2024-11-17 08:53:35,292 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1867 [2024-11-17 08:53:35,293 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1867 [2024-11-17 08:53:35,293 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2766 states and 4036 transitions. [2024-11-17 08:53:35,293 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:53:35,293 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2766 states and 4036 transitions. [2024-11-17 08:53:35,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2766 states and 4036 transitions. [2024-11-17 08:53:35,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2766 to 2246. [2024-11-17 08:53:35,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2246 states, 2246 states have (on average 1.466607301869991) internal successors, (3294), 2245 states have internal predecessors, (3294), 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-11-17 08:53:35,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2246 states to 2246 states and 3294 transitions. [2024-11-17 08:53:35,315 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2246 states and 3294 transitions. [2024-11-17 08:53:35,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 08:53:35,316 INFO L425 stractBuchiCegarLoop]: Abstraction has 2246 states and 3294 transitions. [2024-11-17 08:53:35,316 INFO L332 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2024-11-17 08:53:35,316 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2246 states and 3294 transitions. [2024-11-17 08:53:35,320 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1472 [2024-11-17 08:53:35,320 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:53:35,320 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:53:35,320 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-11-17 08:53:35,320 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:53:35,321 INFO L745 eck$LassoCheckResult]: Stem: 24349#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 24153#ULTIMATE.init_returnLabel#1 assume true;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; 24154#L404 assume !(1 == ~c_req_up~0); 24344#L415 assume 1 == ~wl_i~0;~wl_st~0 := 0; 24192#L420 assume 1 == ~c1_i~0;~c1_st~0 := 0; 24193#L425 assume 1 == ~c2_i~0;~c2_st~0 := 0; 24129#L430 assume 1 == ~wb_i~0;~wb_st~0 := 0; 24130#L435 assume !(1 == ~r_i~0);~r_st~0 := 2; 24320#L440 assume !(0 == ~e_f~0); 24198#L445 assume !(0 == ~e_g~0); 24199#L450 assume !(0 == ~e_e~0); 24072#L455 assume !(0 == ~e_c~0); 24073#L460 assume 0 == ~e_wl~0;~e_wl~0 := 1; 24260#L465 assume !(1 == ~wl_pc~0); 24104#L469 assume true; 24105#L473 assume !(2 == ~wl_pc~0); 24336#L483 assume !(1 == ~c1_pc~0); 24338#L492 assume !(1 == ~c2_pc~0); 26153#L501 assume !(1 == ~wb_pc~0); 26151#L510 assume !(1 == ~e_c~0); 26150#L515 assume !(1 == ~e_e~0); 26149#L520 assume !(1 == ~e_f~0); 26148#L525 assume !(1 == ~e_g~0); 26147#L530 assume !(1 == ~e_c~0); 26121#L535 assume 1 == ~e_wl~0;~e_wl~0 := 2; 26119#L541 [2024-11-17 08:53:35,321 INFO L747 eck$LassoCheckResult]: Loop: 26119#L541 assume true; 26116#L541-1 assume !false; 25815#start_simulation_while_5_continue#1 assume true;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; 25814#L294 assume true; 25813#L294-1 assume !false; 25812#eval_while_4_continue#1 assume true; 25811#L296 assume 0 == ~wl_st~0; 25810#L317 assume 0 == ~wl_st~0;havoc eval_#t~nondet4#1;eval_~tmp~0#1 := eval_#t~nondet4#1;havoc eval_#t~nondet4#1; 25808#L321 assume 0 != eval_~tmp~0#1;~wl_st~0 := 1;assume { :begin_inline_write_loop } true;havoc write_loop_~t~0#1;havoc write_loop_~t~0#1; 25684#L66 assume 0 == ~wl_pc~0; 25207#L67 assume true;~wl_st~0 := 2;~wl_pc~0 := 1;~e_wl~0 := 0; 25201#L84 assume true; 25200#L130 assume true;havoc write_loop_~t~0#1;assume { :end_inline_write_loop } true; 25198#L332 assume !(0 == ~c1_st~0); 25152#L347 assume !(0 == ~c2_st~0); 25141#L362 assume !(0 == ~wb_st~0); 25133#L377 assume !(0 == ~r_st~0); 25129#L294 assume true; 25127#L294-1 assume !false; 25125#eval_while_4_continue#1 assume true; 25122#L296 assume !(0 == ~wl_st~0); 25119#L299 assume !(0 == ~c1_st~0); 25116#L302 assume !(0 == ~c2_st~0); 25113#L305 assume !(0 == ~wb_st~0); 25109#L308 assume !(0 == ~r_st~0); 25106#L311 assume true; 25104#L396 assume 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;assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; 25102#L548 assume !(1 == ~c_req_up~0); 25103#L559 start_simulation_~kernel_st~0#1 := 3; 25135#L560 assume !(0 == ~e_f~0); 25130#L565 assume 0 == ~e_g~0;~e_g~0 := 1; 25128#L570 assume 0 == ~e_e~0;~e_e~0 := 1; 25126#L575 assume !(0 == ~e_c~0); 25123#L580 assume 0 == ~e_wl~0;~e_wl~0 := 1; 25120#L585 assume !(1 == ~wl_pc~0); 25121#L589 assume true; 26146#L593 assume 2 == ~wl_pc~0; 26144#L594 assume 1 == ~e_e~0;~wl_st~0 := 0; 26143#L603 assume !(1 == ~c1_pc~0); 26141#L612 assume !(1 == ~c2_pc~0); 26139#L621 assume !(1 == ~wb_pc~0); 26137#L630 assume !(1 == ~e_c~0); 26134#L635 assume 1 == ~e_e~0;~e_e~0 := 2; 26131#L640 assume !(1 == ~e_f~0); 26129#L645 assume 1 == ~e_g~0;~e_g~0 := 2; 26127#L650 assume !(1 == ~e_c~0); 25941#L655 assume 1 == ~e_wl~0;~e_wl~0 := 2; 26122#L660 assume 0 == ~wl_st~0; 26119#L541 [2024-11-17 08:53:35,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:53:35,321 INFO L85 PathProgramCache]: Analyzing trace with hash -1862356224, now seen corresponding path program 1 times [2024-11-17 08:53:35,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:53:35,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787527228] [2024-11-17 08:53:35,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:53:35,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:53:35,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:53:35,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:53:35,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:53:35,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787527228] [2024-11-17 08:53:35,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787527228] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 08:53:35,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 08:53:35,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 08:53:35,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580742066] [2024-11-17 08:53:35,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 08:53:35,345 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-17 08:53:35,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:53:35,345 INFO L85 PathProgramCache]: Analyzing trace with hash -1098296171, now seen corresponding path program 2 times [2024-11-17 08:53:35,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:53:35,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219110643] [2024-11-17 08:53:35,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:53:35,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:53:35,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:53:35,358 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:53:35,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:53:35,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219110643] [2024-11-17 08:53:35,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219110643] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 08:53:35,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 08:53:35,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 08:53:35,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620141756] [2024-11-17 08:53:35,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 08:53:35,359 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-17 08:53:35,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:53:35,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 08:53:35,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 08:53:35,360 INFO L87 Difference]: Start difference. First operand 2246 states and 3294 transitions. cyclomatic complexity: 1051 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-11-17 08:53:35,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:53:35,400 INFO L93 Difference]: Finished difference Result 3082 states and 4480 transitions. [2024-11-17 08:53:35,400 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3082 states and 4480 transitions. [2024-11-17 08:53:35,407 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 2118 [2024-11-17 08:53:35,415 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3082 states to 3082 states and 4480 transitions. [2024-11-17 08:53:35,415 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2168 [2024-11-17 08:53:35,416 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2168 [2024-11-17 08:53:35,416 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3082 states and 4480 transitions. [2024-11-17 08:53:35,416 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:53:35,416 INFO L218 hiAutomatonCegarLoop]: Abstraction has 3082 states and 4480 transitions. [2024-11-17 08:53:35,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3082 states and 4480 transitions. [2024-11-17 08:53:35,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3082 to 2894. [2024-11-17 08:53:35,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2894 states, 2894 states have (on average 1.4588804422944022) internal successors, (4222), 2893 states have internal predecessors, (4222), 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-11-17 08:53:35,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2894 states to 2894 states and 4222 transitions. [2024-11-17 08:53:35,463 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2894 states and 4222 transitions. [2024-11-17 08:53:35,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 08:53:35,467 INFO L425 stractBuchiCegarLoop]: Abstraction has 2894 states and 4222 transitions. [2024-11-17 08:53:35,468 INFO L332 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2024-11-17 08:53:35,468 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2894 states and 4222 transitions. [2024-11-17 08:53:35,472 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 2010 [2024-11-17 08:53:35,472 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:53:35,472 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:53:35,473 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-11-17 08:53:35,473 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:53:35,473 INFO L745 eck$LassoCheckResult]: Stem: 29682#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 29489#ULTIMATE.init_returnLabel#1 assume true;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; 29490#L404 assume !(1 == ~c_req_up~0); 29673#L415 assume 1 == ~wl_i~0;~wl_st~0 := 0; 29529#L420 assume 1 == ~c1_i~0;~c1_st~0 := 0; 29530#L425 assume 1 == ~c2_i~0;~c2_st~0 := 0; 29464#L430 assume 1 == ~wb_i~0;~wb_st~0 := 0; 29465#L435 assume !(1 == ~r_i~0);~r_st~0 := 2; 29652#L440 assume !(0 == ~e_f~0); 29535#L445 assume !(0 == ~e_g~0); 29536#L450 assume !(0 == ~e_e~0); 29408#L455 assume !(0 == ~e_c~0); 29409#L460 assume !(0 == ~e_wl~0); 29602#L465 assume !(1 == ~wl_pc~0); 29439#L469 assume true; 29440#L473 assume !(2 == ~wl_pc~0); 29583#L483 assume !(1 == ~c1_pc~0); 29668#L492 assume !(1 == ~c2_pc~0); 29451#L501 assume !(1 == ~wb_pc~0); 29542#L510 assume !(1 == ~e_c~0); 29543#L515 assume !(1 == ~e_e~0); 29544#L520 assume !(1 == ~e_f~0); 29394#L525 assume !(1 == ~e_g~0); 29395#L530 assume !(1 == ~e_c~0); 29545#L535 assume !(1 == ~e_wl~0); 29647#L541 assume true; 29630#L541-1 [2024-11-17 08:53:35,473 INFO L747 eck$LassoCheckResult]: Loop: 29630#L541-1 assume !false; 29511#start_simulation_while_5_continue#1 assume true;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; 29512#L294 assume true; 29674#L294-1 assume !false; 31859#eval_while_4_continue#1 assume true; 31858#L296 assume 0 == ~wl_st~0; 31507#L317 assume 0 == ~wl_st~0;havoc eval_#t~nondet4#1;eval_~tmp~0#1 := eval_#t~nondet4#1;havoc eval_#t~nondet4#1; 31503#L321 assume 0 != eval_~tmp~0#1;~wl_st~0 := 1;assume { :begin_inline_write_loop } true;havoc write_loop_~t~0#1;havoc write_loop_~t~0#1; 31493#L66 assume 0 == ~wl_pc~0; 29679#L67 assume true;~wl_st~0 := 2;~wl_pc~0 := 1;~e_wl~0 := 0; 29680#L84 assume true; 30946#L130 assume true;havoc write_loop_~t~0#1;assume { :end_inline_write_loop } true; 30943#L332 assume !(0 == ~c1_st~0); 30628#L347 assume !(0 == ~c2_st~0); 30625#L362 assume !(0 == ~wb_st~0); 30621#L377 assume !(0 == ~r_st~0); 30612#L294 assume true; 30605#L294-1 assume !false; 30599#eval_while_4_continue#1 assume true; 30595#L296 assume !(0 == ~wl_st~0); 30590#L299 assume !(0 == ~c1_st~0); 30585#L302 assume !(0 == ~c2_st~0); 30579#L305 assume !(0 == ~wb_st~0); 30572#L308 assume !(0 == ~r_st~0); 30566#L311 assume true; 30560#L396 assume 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;assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; 30555#L548 assume !(1 == ~c_req_up~0); 30556#L559 start_simulation_~kernel_st~0#1 := 3; 30607#L560 assume !(0 == ~e_f~0); 30601#L565 assume 0 == ~e_g~0;~e_g~0 := 1; 30597#L570 assume !(0 == ~e_e~0); 30593#L575 assume !(0 == ~e_c~0); 30587#L580 assume 0 == ~e_wl~0;~e_wl~0 := 1; 30582#L585 assume !(1 == ~wl_pc~0); 30583#L589 assume true; 31411#L593 assume 2 == ~wl_pc~0; 31409#L594 assume 1 == ~e_e~0;~wl_st~0 := 0; 31410#L603 assume !(1 == ~c1_pc~0); 32285#L612 assume !(1 == ~c2_pc~0); 32283#L621 assume !(1 == ~wb_pc~0); 32281#L630 assume !(1 == ~e_c~0); 32280#L635 assume !(1 == ~e_e~0); 32279#L640 assume !(1 == ~e_f~0); 32256#L645 assume 1 == ~e_g~0;~e_g~0 := 2; 32278#L650 assume !(1 == ~e_c~0); 30736#L655 assume 1 == ~e_wl~0;~e_wl~0 := 2; 29516#L660 assume 0 == ~wl_st~0; 29644#L541 assume true; 29630#L541-1 [2024-11-17 08:53:35,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:53:35,474 INFO L85 PathProgramCache]: Analyzing trace with hash 1890940833, now seen corresponding path program 1 times [2024-11-17 08:53:35,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:53:35,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901224998] [2024-11-17 08:53:35,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:53:35,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:53:35,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:53:35,478 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:53:35,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:53:35,485 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:53:35,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:53:35,485 INFO L85 PathProgramCache]: Analyzing trace with hash -2097823411, now seen corresponding path program 1 times [2024-11-17 08:53:35,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:53:35,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641626277] [2024-11-17 08:53:35,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:53:35,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:53:35,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:53:35,509 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:53:35,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:53:35,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641626277] [2024-11-17 08:53:35,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [641626277] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 08:53:35,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 08:53:35,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 08:53:35,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645269795] [2024-11-17 08:53:35,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 08:53:35,510 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-17 08:53:35,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:53:35,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 08:53:35,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 08:53:35,511 INFO L87 Difference]: Start difference. First operand 2894 states and 4222 transitions. cyclomatic complexity: 1331 Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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-11-17 08:53:35,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:53:35,542 INFO L93 Difference]: Finished difference Result 2498 states and 3573 transitions. [2024-11-17 08:53:35,542 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2498 states and 3573 transitions. [2024-11-17 08:53:35,547 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 1656 [2024-11-17 08:53:35,552 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2498 states to 2498 states and 3573 transitions. [2024-11-17 08:53:35,553 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1686 [2024-11-17 08:53:35,553 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1686 [2024-11-17 08:53:35,553 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2498 states and 3573 transitions. [2024-11-17 08:53:35,554 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:53:35,554 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2498 states and 3573 transitions. [2024-11-17 08:53:35,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2498 states and 3573 transitions. [2024-11-17 08:53:35,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2498 to 2450. [2024-11-17 08:53:35,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2450 states, 2450 states have (on average 1.4289795918367347) internal successors, (3501), 2449 states have internal predecessors, (3501), 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-11-17 08:53:35,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2450 states to 2450 states and 3501 transitions. [2024-11-17 08:53:35,576 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2450 states and 3501 transitions. [2024-11-17 08:53:35,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 08:53:35,576 INFO L425 stractBuchiCegarLoop]: Abstraction has 2450 states and 3501 transitions. [2024-11-17 08:53:35,576 INFO L332 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2024-11-17 08:53:35,576 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2450 states and 3501 transitions. [2024-11-17 08:53:35,580 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 1624 [2024-11-17 08:53:35,580 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:53:35,580 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:53:35,580 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-11-17 08:53:35,580 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:53:35,581 INFO L745 eck$LassoCheckResult]: Stem: 35095#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 34892#ULTIMATE.init_returnLabel#1 assume true;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; 34893#L404 assume !(1 == ~c_req_up~0); 35085#L415 assume 1 == ~wl_i~0;~wl_st~0 := 0; 34923#L420 assume 1 == ~c1_i~0;~c1_st~0 := 0; 34924#L425 assume 1 == ~c2_i~0;~c2_st~0 := 0; 34861#L430 assume 1 == ~wb_i~0;~wb_st~0 := 0; 34862#L435 assume !(1 == ~r_i~0);~r_st~0 := 2; 35057#L440 assume !(0 == ~e_f~0); 34925#L445 assume !(0 == ~e_g~0); 34926#L450 assume !(0 == ~e_e~0); 34810#L455 assume !(0 == ~e_c~0); 34811#L460 assume !(0 == ~e_wl~0); 34996#L465 assume !(1 == ~wl_pc~0); 34839#L469 assume true; 34840#L473 assume !(2 == ~wl_pc~0); 34977#L483 assume !(1 == ~c1_pc~0); 35076#L492 assume !(1 == ~c2_pc~0); 34848#L501 assume !(1 == ~wb_pc~0); 34930#L510 assume !(1 == ~e_c~0); 34931#L515 assume !(1 == ~e_e~0); 34932#L520 assume !(1 == ~e_f~0); 34796#L525 assume !(1 == ~e_g~0); 34797#L530 assume !(1 == ~e_c~0); 34933#L535 assume !(1 == ~e_wl~0); 35052#L541 assume true; 35347#L541-1 [2024-11-17 08:53:35,581 INFO L747 eck$LassoCheckResult]: Loop: 35347#L541-1 assume !false; 36217#start_simulation_while_5_continue#1 assume true;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; 36209#L294 assume true; 36205#L294-1 assume !false; 36201#eval_while_4_continue#1 assume true; 36197#L296 assume 0 == ~wl_st~0; 36193#L317 assume 0 == ~wl_st~0;havoc eval_#t~nondet4#1;eval_~tmp~0#1 := eval_#t~nondet4#1;havoc eval_#t~nondet4#1; 36186#L321 assume 0 != eval_~tmp~0#1;~wl_st~0 := 1;assume { :begin_inline_write_loop } true;havoc write_loop_~t~0#1;havoc write_loop_~t~0#1; 36180#L66 assume !(0 == ~wl_pc~0); 36174#L69 assume 2 == ~wl_pc~0; 35022#L70 assume true;write_loop_~t~0#1 := ~t_b~0; 35023#L119 assume ~d~0 == 1 + write_loop_~t~0#1; 36165#L87 assume true; 36163#L87-1 assume !false; 36154#write_loop_while_0_continue#1 assume true;write_loop_~t~0#1 := ~d~0;~data~0 := ~d~0;~processed~0 := 0;~e_f~0 := 1; 36153#L93 assume !(1 == ~c1_pc~0); 36151#L102 assume !(1 == ~c2_pc~0); 35968#L111 ~e_f~0 := 2;~wl_st~0 := 2;~wl_pc~0 := 2;~t_b~0 := write_loop_~t~0#1; 35966#L84 assume true; 35912#L130 assume true;havoc write_loop_~t~0#1;assume { :end_inline_write_loop } true; 35888#L332 assume !(0 == ~c1_st~0); 35880#L347 assume !(0 == ~c2_st~0); 35876#L362 assume !(0 == ~wb_st~0); 35871#L377 assume !(0 == ~r_st~0); 35866#L294 assume true; 35861#L294-1 assume !false; 35851#eval_while_4_continue#1 assume true; 35847#L296 assume !(0 == ~wl_st~0); 35843#L299 assume !(0 == ~c1_st~0); 35839#L302 assume !(0 == ~c2_st~0); 35834#L305 assume !(0 == ~wb_st~0); 35827#L308 assume !(0 == ~r_st~0); 35821#L311 assume true; 35813#L396 assume 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;assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; 35807#L548 assume !(1 == ~c_req_up~0); 35808#L559 start_simulation_~kernel_st~0#1 := 3; 35830#L560 assume !(0 == ~e_f~0); 35823#L565 assume 0 == ~e_g~0;~e_g~0 := 1; 35816#L570 assume !(0 == ~e_e~0); 35782#L575 assume !(0 == ~e_c~0); 35783#L580 assume !(0 == ~e_wl~0); 36127#L585 assume !(1 == ~wl_pc~0); 36117#L589 assume true; 35772#L593 assume 2 == ~wl_pc~0; 35066#L594 assume 1 == ~e_e~0;~wl_st~0 := 0; 35067#L603 assume !(1 == ~c1_pc~0); 36607#L612 assume !(1 == ~c2_pc~0); 36602#L621 assume !(1 == ~wb_pc~0); 36599#L630 assume !(1 == ~e_c~0); 36598#L635 assume !(1 == ~e_e~0); 36527#L640 assume !(1 == ~e_f~0); 36526#L645 assume 1 == ~e_g~0;~e_g~0 := 2; 36509#L650 assume !(1 == ~e_c~0); 36500#L655 assume !(1 == ~e_wl~0); 36496#L660 assume 0 == ~wl_st~0; 36494#L541 assume true; 35347#L541-1 [2024-11-17 08:53:35,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:53:35,581 INFO L85 PathProgramCache]: Analyzing trace with hash 1890940833, now seen corresponding path program 2 times [2024-11-17 08:53:35,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:53:35,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074948097] [2024-11-17 08:53:35,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:53:35,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:53:35,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:53:35,586 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:53:35,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:53:35,591 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:53:35,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:53:35,591 INFO L85 PathProgramCache]: Analyzing trace with hash -1609254165, now seen corresponding path program 1 times [2024-11-17 08:53:35,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:53:35,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701875190] [2024-11-17 08:53:35,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:53:35,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:53:35,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:53:35,606 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-17 08:53:35,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:53:35,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701875190] [2024-11-17 08:53:35,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701875190] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 08:53:35,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 08:53:35,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 08:53:35,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750059070] [2024-11-17 08:53:35,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 08:53:35,608 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-17 08:53:35,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:53:35,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 08:53:35,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 08:53:35,609 INFO L87 Difference]: Start difference. First operand 2450 states and 3501 transitions. cyclomatic complexity: 1057 Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 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-11-17 08:53:35,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:53:35,633 INFO L93 Difference]: Finished difference Result 2688 states and 3830 transitions. [2024-11-17 08:53:35,634 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2688 states and 3830 transitions. [2024-11-17 08:53:35,640 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 1570 [2024-11-17 08:53:35,653 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2688 states to 2598 states and 3695 transitions. [2024-11-17 08:53:35,654 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1730 [2024-11-17 08:53:35,655 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1730 [2024-11-17 08:53:35,655 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2598 states and 3695 transitions. [2024-11-17 08:53:35,655 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:53:35,656 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2598 states and 3695 transitions. [2024-11-17 08:53:35,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2598 states and 3695 transitions. [2024-11-17 08:53:35,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2598 to 2596. [2024-11-17 08:53:35,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2596 states, 2596 states have (on average 1.4225731895223421) internal successors, (3693), 2595 states have internal predecessors, (3693), 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-11-17 08:53:35,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2596 states to 2596 states and 3693 transitions. [2024-11-17 08:53:35,680 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2596 states and 3693 transitions. [2024-11-17 08:53:35,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 08:53:35,682 INFO L425 stractBuchiCegarLoop]: Abstraction has 2596 states and 3693 transitions. [2024-11-17 08:53:35,682 INFO L332 stractBuchiCegarLoop]: ======== Iteration 14 ============ [2024-11-17 08:53:35,682 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2596 states and 3693 transitions. [2024-11-17 08:53:35,686 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 1568 [2024-11-17 08:53:35,686 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:53:35,686 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:53:35,686 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, 1, 1] [2024-11-17 08:53:35,686 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:53:35,687 INFO L745 eck$LassoCheckResult]: Stem: 40228#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 40024#ULTIMATE.init_returnLabel#1 assume true;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; 40025#L404 assume !(1 == ~c_req_up~0); 40221#L415 assume 1 == ~wl_i~0;~wl_st~0 := 0; 40060#L420 assume 1 == ~c1_i~0;~c1_st~0 := 0; 40061#L425 assume 1 == ~c2_i~0;~c2_st~0 := 0; 40002#L430 assume 1 == ~wb_i~0;~wb_st~0 := 0; 40003#L435 assume !(1 == ~r_i~0);~r_st~0 := 2; 40193#L440 assume !(0 == ~e_f~0); 40066#L445 assume !(0 == ~e_g~0); 40067#L450 assume 0 == ~e_e~0;~e_e~0 := 1; 40192#L455 assume !(0 == ~e_c~0); 40132#L460 assume !(0 == ~e_wl~0); 40133#L465 assume !(1 == ~wl_pc~0); 40233#L469 assume true; 40258#L473 assume !(2 == ~wl_pc~0); 40112#L483 assume !(1 == ~c1_pc~0); 40213#L492 assume !(1 == ~c2_pc~0); 39991#L501 assume !(1 == ~wb_pc~0); 40070#L510 assume !(1 == ~e_c~0); 40071#L515 assume 1 == ~e_e~0;~e_e~0 := 2; 40072#L520 assume !(1 == ~e_f~0); 39936#L525 assume !(1 == ~e_g~0); 39937#L530 assume !(1 == ~e_c~0); 40073#L535 assume !(1 == ~e_wl~0); 40186#L541 assume true; 40276#L541-1 assume !false; 41493#start_simulation_while_5_continue#1 assume true;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; 41491#L294 [2024-11-17 08:53:35,687 INFO L747 eck$LassoCheckResult]: Loop: 41491#L294 assume true; 41486#L294-1 assume !false; 41479#eval_while_4_continue#1 assume true; 41472#L296 assume 0 == ~wl_st~0; 41470#L317 assume 0 == ~wl_st~0;havoc eval_#t~nondet4#1;eval_~tmp~0#1 := eval_#t~nondet4#1;havoc eval_#t~nondet4#1; 41467#L321 assume !(0 != eval_~tmp~0#1); 41468#L332 assume !(0 == ~c1_st~0); 41042#L347 assume !(0 == ~c2_st~0); 41033#L362 assume !(0 == ~wb_st~0); 41030#L377 assume !(0 == ~r_st~0); 41491#L294 [2024-11-17 08:53:35,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:53:35,687 INFO L85 PathProgramCache]: Analyzing trace with hash -322756447, now seen corresponding path program 1 times [2024-11-17 08:53:35,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:53:35,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641812897] [2024-11-17 08:53:35,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:53:35,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:53:35,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:53:35,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:53:35,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:53:35,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641812897] [2024-11-17 08:53:35,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641812897] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 08:53:35,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 08:53:35,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 08:53:35,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386888490] [2024-11-17 08:53:35,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 08:53:35,712 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-17 08:53:35,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:53:35,712 INFO L85 PathProgramCache]: Analyzing trace with hash -1953600598, now seen corresponding path program 1 times [2024-11-17 08:53:35,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:53:35,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082954074] [2024-11-17 08:53:35,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:53:35,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:53:35,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:53:35,715 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:53:35,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:53:35,717 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:53:35,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:53:35,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 08:53:35,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 08:53:35,737 INFO L87 Difference]: Start difference. First operand 2596 states and 3693 transitions. cyclomatic complexity: 1109 Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 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-11-17 08:53:35,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:53:35,783 INFO L93 Difference]: Finished difference Result 3337 states and 4718 transitions. [2024-11-17 08:53:35,783 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3337 states and 4718 transitions. [2024-11-17 08:53:35,790 INFO L131 ngComponentsAnalysis]: Automaton has 15 accepting balls. 1861 [2024-11-17 08:53:35,799 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3337 states to 3337 states and 4718 transitions. [2024-11-17 08:53:35,799 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2098 [2024-11-17 08:53:35,800 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2098 [2024-11-17 08:53:35,800 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3337 states and 4718 transitions. [2024-11-17 08:53:35,800 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:53:35,800 INFO L218 hiAutomatonCegarLoop]: Abstraction has 3337 states and 4718 transitions. [2024-11-17 08:53:35,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3337 states and 4718 transitions. [2024-11-17 08:53:35,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3337 to 2430. [2024-11-17 08:53:35,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2430 states, 2430 states have (on average 1.4160493827160494) internal successors, (3441), 2429 states have internal predecessors, (3441), 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-11-17 08:53:35,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2430 states to 2430 states and 3441 transitions. [2024-11-17 08:53:35,860 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2430 states and 3441 transitions. [2024-11-17 08:53:35,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 08:53:35,860 INFO L425 stractBuchiCegarLoop]: Abstraction has 2430 states and 3441 transitions. [2024-11-17 08:53:35,861 INFO L332 stractBuchiCegarLoop]: ======== Iteration 15 ============ [2024-11-17 08:53:35,861 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2430 states and 3441 transitions. [2024-11-17 08:53:35,864 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 1488 [2024-11-17 08:53:35,864 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:53:35,864 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:53:35,866 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, 1, 1] [2024-11-17 08:53:35,866 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:53:35,866 INFO L745 eck$LassoCheckResult]: Stem: 46191#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 45971#ULTIMATE.init_returnLabel#1 assume true;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; 45972#L404 assume !(1 == ~c_req_up~0); 46185#L415 assume 1 == ~wl_i~0;~wl_st~0 := 0; 46005#L420 assume 1 == ~c1_i~0;~c1_st~0 := 0; 46006#L425 assume 1 == ~c2_i~0;~c2_st~0 := 0; 45947#L430 assume 1 == ~wb_i~0;~wb_st~0 := 0; 45948#L435 assume !(1 == ~r_i~0);~r_st~0 := 2; 46155#L440 assume !(0 == ~e_f~0); 46011#L445 assume !(0 == ~e_g~0); 46012#L450 assume !(0 == ~e_e~0); 45892#L455 assume !(0 == ~e_c~0); 45893#L460 assume !(0 == ~e_wl~0); 46083#L465 assume !(1 == ~wl_pc~0); 45924#L469 assume true; 45925#L473 assume !(2 == ~wl_pc~0); 46061#L483 assume !(1 == ~c1_pc~0); 46176#L492 assume !(1 == ~c2_pc~0); 45936#L501 assume !(1 == ~wb_pc~0); 46015#L510 assume !(1 == ~e_c~0); 46146#L515 assume !(1 == ~e_e~0); 46017#L520 assume !(1 == ~e_f~0); 45878#L525 assume !(1 == ~e_g~0); 45879#L530 assume !(1 == ~e_c~0); 46018#L535 assume !(1 == ~e_wl~0); 46147#L541 assume true; 46493#L541-1 assume !false; 47751#start_simulation_while_5_continue#1 assume true;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; 47168#L294 [2024-11-17 08:53:35,866 INFO L747 eck$LassoCheckResult]: Loop: 47168#L294 assume true; 47749#L294-1 assume !false; 47748#eval_while_4_continue#1 assume true; 47745#L296 assume 0 == ~wl_st~0; 47734#L317 assume 0 == ~wl_st~0;havoc eval_#t~nondet4#1;eval_~tmp~0#1 := eval_#t~nondet4#1;havoc eval_#t~nondet4#1; 47726#L321 assume !(0 != eval_~tmp~0#1); 47727#L332 assume !(0 == ~c1_st~0); 47738#L347 assume !(0 == ~c2_st~0); 47731#L362 assume !(0 == ~wb_st~0); 47725#L377 assume !(0 == ~r_st~0); 47168#L294 [2024-11-17 08:53:35,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:53:35,866 INFO L85 PathProgramCache]: Analyzing trace with hash 422981535, now seen corresponding path program 1 times [2024-11-17 08:53:35,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:53:35,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584733084] [2024-11-17 08:53:35,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:53:35,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:53:35,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:53:35,872 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:53:35,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:53:35,883 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:53:35,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:53:35,883 INFO L85 PathProgramCache]: Analyzing trace with hash -1953600598, now seen corresponding path program 2 times [2024-11-17 08:53:35,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:53:35,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092339495] [2024-11-17 08:53:35,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:53:35,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:53:35,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:53:35,885 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:53:35,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:53:35,887 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:53:35,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:53:35,887 INFO L85 PathProgramCache]: Analyzing trace with hash -79942200, now seen corresponding path program 1 times [2024-11-17 08:53:35,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:53:35,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420714859] [2024-11-17 08:53:35,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:53:35,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:53:35,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:53:35,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:53:35,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:53:35,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420714859] [2024-11-17 08:53:35,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420714859] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 08:53:35,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 08:53:35,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 08:53:35,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701616638] [2024-11-17 08:53:35,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 08:53:35,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:53:35,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 08:53:35,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 08:53:35,920 INFO L87 Difference]: Start difference. First operand 2430 states and 3441 transitions. cyclomatic complexity: 1023 Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:53:35,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:53:35,938 INFO L93 Difference]: Finished difference Result 3710 states and 5153 transitions. [2024-11-17 08:53:35,938 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3710 states and 5153 transitions. [2024-11-17 08:53:35,946 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 2314 [2024-11-17 08:53:35,951 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3710 states to 3710 states and 5153 transitions. [2024-11-17 08:53:35,951 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2514 [2024-11-17 08:53:35,952 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2514 [2024-11-17 08:53:35,952 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3710 states and 5153 transitions. [2024-11-17 08:53:35,953 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:53:35,953 INFO L218 hiAutomatonCegarLoop]: Abstraction has 3710 states and 5153 transitions. [2024-11-17 08:53:35,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3710 states and 5153 transitions. [2024-11-17 08:53:35,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3710 to 3710. [2024-11-17 08:53:35,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3710 states, 3710 states have (on average 1.3889487870619945) internal successors, (5153), 3709 states have internal predecessors, (5153), 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-11-17 08:53:35,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3710 states to 3710 states and 5153 transitions. [2024-11-17 08:53:35,984 INFO L240 hiAutomatonCegarLoop]: Abstraction has 3710 states and 5153 transitions. [2024-11-17 08:53:35,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 08:53:35,985 INFO L425 stractBuchiCegarLoop]: Abstraction has 3710 states and 5153 transitions. [2024-11-17 08:53:35,985 INFO L332 stractBuchiCegarLoop]: ======== Iteration 16 ============ [2024-11-17 08:53:35,985 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3710 states and 5153 transitions. [2024-11-17 08:53:35,990 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 2314 [2024-11-17 08:53:35,990 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:53:35,990 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:53:35,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, 1, 1, 1, 1] [2024-11-17 08:53:35,991 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:53:35,991 INFO L745 eck$LassoCheckResult]: Stem: 52348#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 52134#ULTIMATE.init_returnLabel#1 assume true;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; 52135#L404 assume !(1 == ~c_req_up~0); 52343#L415 assume 1 == ~wl_i~0;~wl_st~0 := 0; 52162#L420 assume 1 == ~c1_i~0;~c1_st~0 := 0; 52163#L425 assume 1 == ~c2_i~0;~c2_st~0 := 0; 52102#L430 assume 1 == ~wb_i~0;~wb_st~0 := 0; 52103#L435 assume !(1 == ~r_i~0);~r_st~0 := 2; 52312#L440 assume !(0 == ~e_f~0); 52164#L445 assume !(0 == ~e_g~0); 52165#L450 assume !(0 == ~e_e~0); 52044#L455 assume !(0 == ~e_c~0); 52045#L460 assume !(0 == ~e_wl~0); 52234#L465 assume !(1 == ~wl_pc~0); 52076#L469 assume true; 52077#L473 assume !(2 == ~wl_pc~0); 52217#L483 assume !(1 == ~c1_pc~0); 52332#L492 assume !(1 == ~c2_pc~0); 52192#L501 assume !(1 == ~wb_pc~0); 52170#L510 assume !(1 == ~e_c~0); 52299#L515 assume !(1 == ~e_e~0); 52172#L520 assume !(1 == ~e_f~0); 52030#L525 assume !(1 == ~e_g~0); 52031#L530 assume !(1 == ~e_c~0); 52173#L535 assume !(1 == ~e_wl~0); 52304#L541 assume true; 52844#L541-1 assume !false; 54175#start_simulation_while_5_continue#1 assume true;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; 54173#L294 [2024-11-17 08:53:35,991 INFO L747 eck$LassoCheckResult]: Loop: 54173#L294 assume true; 54171#L294-1 assume !false; 54168#eval_while_4_continue#1 assume true; 54166#L296 assume 0 == ~wl_st~0; 54164#L317 assume 0 == ~wl_st~0;havoc eval_#t~nondet4#1;eval_~tmp~0#1 := eval_#t~nondet4#1;havoc eval_#t~nondet4#1; 54162#L321 assume !(0 != eval_~tmp~0#1); 54161#L332 assume 0 == ~c1_st~0;havoc eval_#t~nondet5#1;eval_~tmp___0~0#1 := eval_#t~nondet5#1;havoc eval_#t~nondet5#1; 54138#L336 assume !(0 != eval_~tmp___0~0#1); 54160#L347 assume !(0 == ~c2_st~0); 54183#L362 assume !(0 == ~wb_st~0); 54178#L377 assume !(0 == ~r_st~0); 54173#L294 [2024-11-17 08:53:35,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:53:35,991 INFO L85 PathProgramCache]: Analyzing trace with hash 422981535, now seen corresponding path program 2 times [2024-11-17 08:53:35,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:53:35,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132639338] [2024-11-17 08:53:35,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:53:35,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:53:35,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:53:35,996 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:53:35,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:53:36,001 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:53:36,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:53:36,001 INFO L85 PathProgramCache]: Analyzing trace with hash -432166922, now seen corresponding path program 1 times [2024-11-17 08:53:36,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:53:36,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835712727] [2024-11-17 08:53:36,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:53:36,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:53:36,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:53:36,004 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:53:36,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:53:36,005 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:53:36,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:53:36,006 INFO L85 PathProgramCache]: Analyzing trace with hash 1816668568, now seen corresponding path program 1 times [2024-11-17 08:53:36,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:53:36,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184531846] [2024-11-17 08:53:36,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:53:36,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:53:36,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:53:36,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:53:36,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:53:36,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184531846] [2024-11-17 08:53:36,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184531846] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 08:53:36,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 08:53:36,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 08:53:36,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314932290] [2024-11-17 08:53:36,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 08:53:36,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:53:36,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 08:53:36,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 08:53:36,042 INFO L87 Difference]: Start difference. First operand 3710 states and 5153 transitions. cyclomatic complexity: 1455 Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 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-11-17 08:53:36,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:53:36,063 INFO L93 Difference]: Finished difference Result 5824 states and 7939 transitions. [2024-11-17 08:53:36,063 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 5824 states and 7939 transitions. [2024-11-17 08:53:36,075 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 3674 [2024-11-17 08:53:36,083 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 5824 states to 5824 states and 7939 transitions. [2024-11-17 08:53:36,083 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3962 [2024-11-17 08:53:36,085 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3962 [2024-11-17 08:53:36,085 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5824 states and 7939 transitions. [2024-11-17 08:53:36,085 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:53:36,086 INFO L218 hiAutomatonCegarLoop]: Abstraction has 5824 states and 7939 transitions. [2024-11-17 08:53:36,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5824 states and 7939 transitions. [2024-11-17 08:53:36,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5824 to 5824. [2024-11-17 08:53:36,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5824 states, 5824 states have (on average 1.3631524725274726) internal successors, (7939), 5823 states have internal predecessors, (7939), 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-11-17 08:53:36,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5824 states to 5824 states and 7939 transitions. [2024-11-17 08:53:36,136 INFO L240 hiAutomatonCegarLoop]: Abstraction has 5824 states and 7939 transitions. [2024-11-17 08:53:36,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 08:53:36,136 INFO L425 stractBuchiCegarLoop]: Abstraction has 5824 states and 7939 transitions. [2024-11-17 08:53:36,136 INFO L332 stractBuchiCegarLoop]: ======== Iteration 17 ============ [2024-11-17 08:53:36,136 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5824 states and 7939 transitions. [2024-11-17 08:53:36,145 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 3674 [2024-11-17 08:53:36,145 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:53:36,145 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:53:36,159 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, 1, 1] [2024-11-17 08:53:36,160 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:53:36,160 INFO L745 eck$LassoCheckResult]: Stem: 61890#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 61671#ULTIMATE.init_returnLabel#1 assume true;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; 61672#L404 assume !(1 == ~c_req_up~0); 61880#L415 assume 1 == ~wl_i~0;~wl_st~0 := 0; 61701#L420 assume 1 == ~c1_i~0;~c1_st~0 := 0; 61702#L425 assume 1 == ~c2_i~0;~c2_st~0 := 0; 61641#L430 assume 1 == ~wb_i~0;~wb_st~0 := 0; 61642#L435 assume !(1 == ~r_i~0);~r_st~0 := 2; 61851#L440 assume !(0 == ~e_f~0); 61703#L445 assume !(0 == ~e_g~0); 61704#L450 assume !(0 == ~e_e~0); 61586#L455 assume !(0 == ~e_c~0); 61587#L460 assume !(0 == ~e_wl~0); 61769#L465 assume !(1 == ~wl_pc~0); 61616#L469 assume true; 61617#L473 assume !(2 == ~wl_pc~0); 61752#L483 assume !(1 == ~c1_pc~0); 61870#L492 assume !(1 == ~c2_pc~0); 61729#L501 assume !(1 == ~wb_pc~0); 61707#L510 assume !(1 == ~e_c~0); 61839#L515 assume !(1 == ~e_e~0); 61709#L520 assume !(1 == ~e_f~0); 61572#L525 assume !(1 == ~e_g~0); 61573#L530 assume !(1 == ~e_c~0); 61710#L535 assume !(1 == ~e_wl~0); 61844#L541 assume true; 62586#L541-1 assume !false; 63988#start_simulation_while_5_continue#1 assume true;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; 63989#L294 [2024-11-17 08:53:36,160 INFO L747 eck$LassoCheckResult]: Loop: 63989#L294 assume true; 64296#L294-1 assume !false; 64295#eval_while_4_continue#1 assume true; 64294#L296 assume 0 == ~wl_st~0; 64293#L317 assume 0 == ~wl_st~0;havoc eval_#t~nondet4#1;eval_~tmp~0#1 := eval_#t~nondet4#1;havoc eval_#t~nondet4#1; 64291#L321 assume !(0 != eval_~tmp~0#1); 64292#L332 assume 0 == ~c1_st~0;havoc eval_#t~nondet5#1;eval_~tmp___0~0#1 := eval_#t~nondet5#1;havoc eval_#t~nondet5#1; 64405#L336 assume !(0 != eval_~tmp___0~0#1); 64305#L347 assume 0 == ~c2_st~0;havoc eval_#t~nondet6#1;eval_~tmp___1~0#1 := eval_#t~nondet6#1;havoc eval_#t~nondet6#1; 64303#L351 assume !(0 != eval_~tmp___1~0#1); 64302#L362 assume !(0 == ~wb_st~0); 64298#L377 assume !(0 == ~r_st~0); 63989#L294 [2024-11-17 08:53:36,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:53:36,161 INFO L85 PathProgramCache]: Analyzing trace with hash 422981535, now seen corresponding path program 3 times [2024-11-17 08:53:36,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:53:36,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983708753] [2024-11-17 08:53:36,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:53:36,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:53:36,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:53:36,167 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:53:36,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:53:36,172 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:53:36,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:53:36,172 INFO L85 PathProgramCache]: Analyzing trace with hash -512275771, now seen corresponding path program 1 times [2024-11-17 08:53:36,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:53:36,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608607548] [2024-11-17 08:53:36,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:53:36,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:53:36,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:53:36,175 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:53:36,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:53:36,177 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:53:36,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:53:36,177 INFO L85 PathProgramCache]: Analyzing trace with hash 482147683, now seen corresponding path program 1 times [2024-11-17 08:53:36,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:53:36,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867524735] [2024-11-17 08:53:36,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:53:36,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:53:36,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:53:36,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:53:36,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:53:36,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867524735] [2024-11-17 08:53:36,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867524735] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 08:53:36,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 08:53:36,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 08:53:36,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930664144] [2024-11-17 08:53:36,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 08:53:36,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:53:36,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 08:53:36,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 08:53:36,226 INFO L87 Difference]: Start difference. First operand 5824 states and 7939 transitions. cyclomatic complexity: 2127 Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:53:36,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:53:36,262 INFO L93 Difference]: Finished difference Result 9986 states and 13500 transitions. [2024-11-17 08:53:36,262 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9986 states and 13500 transitions. [2024-11-17 08:53:36,294 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 6310 [2024-11-17 08:53:36,314 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9986 states to 9986 states and 13500 transitions. [2024-11-17 08:53:36,315 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6808 [2024-11-17 08:53:36,318 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6808 [2024-11-17 08:53:36,318 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9986 states and 13500 transitions. [2024-11-17 08:53:36,318 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:53:36,318 INFO L218 hiAutomatonCegarLoop]: Abstraction has 9986 states and 13500 transitions. [2024-11-17 08:53:36,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9986 states and 13500 transitions. [2024-11-17 08:53:36,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9986 to 9986. [2024-11-17 08:53:36,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9986 states, 9986 states have (on average 1.3518926497095933) internal successors, (13500), 9985 states have internal predecessors, (13500), 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-11-17 08:53:36,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9986 states to 9986 states and 13500 transitions. [2024-11-17 08:53:36,400 INFO L240 hiAutomatonCegarLoop]: Abstraction has 9986 states and 13500 transitions. [2024-11-17 08:53:36,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 08:53:36,401 INFO L425 stractBuchiCegarLoop]: Abstraction has 9986 states and 13500 transitions. [2024-11-17 08:53:36,401 INFO L332 stractBuchiCegarLoop]: ======== Iteration 18 ============ [2024-11-17 08:53:36,401 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9986 states and 13500 transitions. [2024-11-17 08:53:36,416 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 6310 [2024-11-17 08:53:36,416 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:53:36,416 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:53:36,416 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, 1, 1] [2024-11-17 08:53:36,416 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:53:36,417 INFO L745 eck$LassoCheckResult]: Stem: 77706#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 77482#ULTIMATE.init_returnLabel#1 assume true;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; 77483#L404 assume !(1 == ~c_req_up~0); 77692#L415 assume 1 == ~wl_i~0;~wl_st~0 := 0; 77519#L420 assume 1 == ~c1_i~0;~c1_st~0 := 0; 77520#L425 assume 1 == ~c2_i~0;~c2_st~0 := 0; 77456#L430 assume 1 == ~wb_i~0;~wb_st~0 := 0; 77457#L435 assume !(1 == ~r_i~0);~r_st~0 := 2; 77661#L440 assume !(0 == ~e_f~0); 77525#L445 assume !(0 == ~e_g~0); 77526#L450 assume !(0 == ~e_e~0); 77400#L455 assume !(0 == ~e_c~0); 77401#L460 assume !(0 == ~e_wl~0); 77589#L465 assume !(1 == ~wl_pc~0); 77433#L469 assume true; 77434#L473 assume !(2 == ~wl_pc~0); 77571#L483 assume !(1 == ~c1_pc~0); 77680#L492 assume !(1 == ~c2_pc~0); 77552#L501 assume !(1 == ~wb_pc~0); 77530#L510 assume !(1 == ~e_c~0); 77650#L515 assume !(1 == ~e_e~0); 77532#L520 assume !(1 == ~e_f~0); 77386#L525 assume !(1 == ~e_g~0); 77387#L530 assume !(1 == ~e_c~0); 77533#L535 assume !(1 == ~e_wl~0); 77653#L541 assume true; 79207#L541-1 assume !false; 82958#start_simulation_while_5_continue#1 assume true;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; 82957#L294 [2024-11-17 08:53:36,417 INFO L747 eck$LassoCheckResult]: Loop: 82957#L294 assume true; 82956#L294-1 assume !false; 82955#eval_while_4_continue#1 assume true; 82953#L296 assume 0 == ~wl_st~0; 82950#L317 assume 0 == ~wl_st~0;havoc eval_#t~nondet4#1;eval_~tmp~0#1 := eval_#t~nondet4#1;havoc eval_#t~nondet4#1; 82948#L321 assume !(0 != eval_~tmp~0#1); 81768#L332 assume 0 == ~c1_st~0;havoc eval_#t~nondet5#1;eval_~tmp___0~0#1 := eval_#t~nondet5#1;havoc eval_#t~nondet5#1; 81763#L336 assume !(0 != eval_~tmp___0~0#1); 81762#L347 assume 0 == ~c2_st~0;havoc eval_#t~nondet6#1;eval_~tmp___1~0#1 := eval_#t~nondet6#1;havoc eval_#t~nondet6#1; 81742#L351 assume !(0 != eval_~tmp___1~0#1); 81761#L362 assume 0 == ~wb_st~0;havoc eval_#t~nondet7#1;eval_~tmp___2~0#1 := eval_#t~nondet7#1;havoc eval_#t~nondet7#1; 81891#L366 assume !(0 != eval_~tmp___2~0#1); 82356#L377 assume !(0 == ~r_st~0); 82957#L294 [2024-11-17 08:53:36,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:53:36,417 INFO L85 PathProgramCache]: Analyzing trace with hash 422981535, now seen corresponding path program 4 times [2024-11-17 08:53:36,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:53:36,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837683742] [2024-11-17 08:53:36,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:53:36,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:53:36,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:53:36,422 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:53:36,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:53:36,426 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:53:36,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:53:36,426 INFO L85 PathProgramCache]: Analyzing trace with hash 1299320027, now seen corresponding path program 1 times [2024-11-17 08:53:36,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:53:36,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16692353] [2024-11-17 08:53:36,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:53:36,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:53:36,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:53:36,428 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:53:36,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:53:36,430 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:53:36,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:53:36,430 INFO L85 PathProgramCache]: Analyzing trace with hash 2061676029, now seen corresponding path program 1 times [2024-11-17 08:53:36,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:53:36,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810582771] [2024-11-17 08:53:36,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:53:36,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:53:36,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:53:36,434 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:53:36,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:53:36,439 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:53:37,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:53:37,064 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:53:37,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:53:37,165 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 17.11 08:53:37 BoogieIcfgContainer [2024-11-17 08:53:37,165 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-11-17 08:53:37,166 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-17 08:53:37,166 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-17 08:53:37,166 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-17 08:53:37,166 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 08:53:30" (3/4) ... [2024-11-17 08:53:37,169 INFO L140 WitnessPrinter]: Generating witness for non-termination counterexample [2024-11-17 08:53:37,214 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-17 08:53:37,214 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-17 08:53:37,215 INFO L158 Benchmark]: Toolchain (without parser) took 7748.31ms. Allocated memory was 167.8MB in the beginning and 320.9MB in the end (delta: 153.1MB). Free memory was 94.6MB in the beginning and 130.1MB in the end (delta: -35.5MB). Peak memory consumption was 118.5MB. Max. memory is 16.1GB. [2024-11-17 08:53:37,215 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 167.8MB. Free memory is still 118.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-17 08:53:37,215 INFO L158 Benchmark]: CACSL2BoogieTranslator took 280.06ms. Allocated memory was 167.8MB in the beginning and 220.2MB in the end (delta: 52.4MB). Free memory was 94.3MB in the beginning and 190.6MB in the end (delta: -96.3MB). Peak memory consumption was 18.6MB. Max. memory is 16.1GB. [2024-11-17 08:53:37,215 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.95ms. Allocated memory is still 220.2MB. Free memory was 190.6MB in the beginning and 188.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-17 08:53:37,215 INFO L158 Benchmark]: Boogie Preprocessor took 32.23ms. Allocated memory is still 220.2MB. Free memory was 188.5MB in the beginning and 186.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-17 08:53:37,216 INFO L158 Benchmark]: IcfgBuilder took 499.16ms. Allocated memory is still 220.2MB. Free memory was 186.4MB in the beginning and 159.8MB in the end (delta: 26.6MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-11-17 08:53:37,216 INFO L158 Benchmark]: BuchiAutomizer took 6843.31ms. Allocated memory was 220.2MB in the beginning and 320.9MB in the end (delta: 100.7MB). Free memory was 159.2MB in the beginning and 136.4MB in the end (delta: 22.7MB). Peak memory consumption was 123.4MB. Max. memory is 16.1GB. [2024-11-17 08:53:37,216 INFO L158 Benchmark]: Witness Printer took 48.77ms. Allocated memory is still 320.9MB. Free memory was 136.4MB in the beginning and 130.1MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-17 08:53:37,217 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.17ms. Allocated memory is still 167.8MB. Free memory is still 118.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 280.06ms. Allocated memory was 167.8MB in the beginning and 220.2MB in the end (delta: 52.4MB). Free memory was 94.3MB in the beginning and 190.6MB in the end (delta: -96.3MB). Peak memory consumption was 18.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.95ms. Allocated memory is still 220.2MB. Free memory was 190.6MB in the beginning and 188.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 32.23ms. Allocated memory is still 220.2MB. Free memory was 188.5MB in the beginning and 186.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 499.16ms. Allocated memory is still 220.2MB. Free memory was 186.4MB in the beginning and 159.8MB in the end (delta: 26.6MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * BuchiAutomizer took 6843.31ms. Allocated memory was 220.2MB in the beginning and 320.9MB in the end (delta: 100.7MB). Free memory was 159.2MB in the beginning and 136.4MB in the end (delta: 22.7MB). Peak memory consumption was 123.4MB. Max. memory is 16.1GB. * Witness Printer took 48.77ms. Allocated memory is still 320.9MB. Free memory was 136.4MB in the beginning and 130.1MB 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 20 terminating modules (17 trivial, 3 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function (((long long) -1 * e_c) + 1) and consists of 3 locations. One deterministic module has affine ranking function (((long long) -1 * e_c) + 1) and consists of 3 locations. One deterministic module has affine ranking function (((long long) -1 * e_e) + 1) and consists of 3 locations. 17 modules have a trivial ranking function, the largest among these consists of 4 locations. The remainder module has 9986 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.7s and 18 iterations. TraceHistogramMax:2. Analysis of lassos took 4.5s. Construction of modules took 0.2s. Büchi inclusion checks took 1.6s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 17. Automata minimization 0.5s AutomataMinimizationTime, 20 MinimizatonAttempts, 3424 StatesRemovedByMinimization, 11 NontrivialMinimizations. Non-live state removal took 0.2s 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, 4995 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4992 mSDsluCounter, 8928 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3557 mSDsCounter, 122 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 354 IncrementalHoareTripleChecker+Invalid, 476 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 122 mSolverCounterUnsat, 5371 mSDtfsCounter, 354 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI3 SFLT0 conc3 concLT1 SILN1 SILU0 SILI7 SILT2 lasso0 LassoPreprocessingBenchmarks: Lassos: inital77 mio100 ax100 hnf100 lsp12 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq185 hnf96 smp100 dnf147 smp91 tf109 neg100 sie116 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 20ms VariablesStem: 0 VariablesLoop: 1 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 0 MotzkinApplications: 4 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 8 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 3 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.2s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - LassoShapedNonTerminationArgument [Line: 294]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L28] int c ; [L29] int c_t ; [L30] int c_req_up ; [L31] int p_in ; [L32] int p_out ; [L33] int wl_st ; [L34] int c1_st ; [L35] int c2_st ; [L36] int wb_st ; [L37] int r_st ; [L38] int wl_i ; [L39] int c1_i ; [L40] int c2_i ; [L41] int wb_i ; [L42] int r_i ; [L43] int wl_pc ; [L44] int c1_pc ; [L45] int c2_pc ; [L46] int wb_pc ; [L47] int e_e ; [L48] int e_f ; [L49] int e_g ; [L50] int e_c ; [L51] int e_p_in ; [L52] int e_wl ; [L58] int d ; [L59] int data ; [L60] int processed ; [L61] static int t_b ; VAL [c1_i=0, c1_pc=0, c1_st=0, c2_i=0, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=0, e_e=0, e_f=0, e_g=0, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=0, t_b=0, wb_i=0, wb_pc=0, wb_st=0, wl_i=0, wl_pc=0, wl_st=0] [L689] int __retres1 ; [L693] e_wl = 2 [L694] e_c = e_wl [L695] e_g = e_c [L696] e_f = e_g [L697] e_e = e_f [L698] wl_pc = 0 [L699] c1_pc = 0 [L700] c2_pc = 0 [L701] wb_pc = 0 [L702] wb_i = 1 [L703] c2_i = wb_i [L704] c1_i = c2_i [L705] wl_i = c1_i [L706] r_i = 0 [L707] c_req_up = 0 [L708] d = 0 [L709] c = 0 [L710] CALL start_simulation() [L400] int kernel_st ; [L403] kernel_st = 0 VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L404] COND FALSE !((int )c_req_up == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L415] COND TRUE (int )wl_i == 1 [L416] wl_st = 0 VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L420] COND TRUE (int )c1_i == 1 [L421] c1_st = 0 VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L425] COND TRUE (int )c2_i == 1 [L426] c2_st = 0 VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L430] COND TRUE (int )wb_i == 1 [L431] wb_st = 0 VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L435] COND FALSE !((int )r_i == 1) [L438] r_st = 2 VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L440] COND FALSE !((int )e_f == 0) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L445] COND FALSE !((int )e_g == 0) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L450] COND FALSE !((int )e_e == 0) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L455] COND FALSE !((int )e_c == 0) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L460] COND FALSE !((int )e_wl == 0) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L465] COND FALSE !((int )wl_pc == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L473] COND FALSE !((int )wl_pc == 2) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L483] COND FALSE !((int )c1_pc == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L492] COND FALSE !((int )c2_pc == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L501] COND FALSE !((int )wb_pc == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L510] COND FALSE !((int )e_c == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L515] COND FALSE !((int )e_e == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L520] COND FALSE !((int )e_f == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L525] COND FALSE !((int )e_g == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L530] COND FALSE !((int )e_c == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L535] COND FALSE !((int )e_wl == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L541] COND TRUE 1 VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L544] kernel_st = 1 [L545] CALL eval() [L286] int tmp ; [L287] int tmp___0 ; [L288] int tmp___1 ; [L289] int tmp___2 ; [L290] int tmp___3 ; VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] Loop: [L294] COND TRUE 1 [L296] COND TRUE (int )wl_st == 0 [L317] COND TRUE (int )wl_st == 0 [L319] tmp = __VERIFIER_nondet_int() [L321] COND FALSE !(\read(tmp)) [L332] COND TRUE (int )c1_st == 0 [L334] tmp___0 = __VERIFIER_nondet_int() [L336] COND FALSE !(\read(tmp___0)) [L347] COND TRUE (int )c2_st == 0 [L349] tmp___1 = __VERIFIER_nondet_int() [L351] COND FALSE !(\read(tmp___1)) [L362] COND TRUE (int )wb_st == 0 [L364] tmp___2 = __VERIFIER_nondet_int() [L366] COND FALSE !(\read(tmp___2)) [L377] COND FALSE !((int )r_st == 0) End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 294]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L28] int c ; [L29] int c_t ; [L30] int c_req_up ; [L31] int p_in ; [L32] int p_out ; [L33] int wl_st ; [L34] int c1_st ; [L35] int c2_st ; [L36] int wb_st ; [L37] int r_st ; [L38] int wl_i ; [L39] int c1_i ; [L40] int c2_i ; [L41] int wb_i ; [L42] int r_i ; [L43] int wl_pc ; [L44] int c1_pc ; [L45] int c2_pc ; [L46] int wb_pc ; [L47] int e_e ; [L48] int e_f ; [L49] int e_g ; [L50] int e_c ; [L51] int e_p_in ; [L52] int e_wl ; [L58] int d ; [L59] int data ; [L60] int processed ; [L61] static int t_b ; VAL [c1_i=0, c1_pc=0, c1_st=0, c2_i=0, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=0, e_e=0, e_f=0, e_g=0, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=0, t_b=0, wb_i=0, wb_pc=0, wb_st=0, wl_i=0, wl_pc=0, wl_st=0] [L689] int __retres1 ; [L693] e_wl = 2 [L694] e_c = e_wl [L695] e_g = e_c [L696] e_f = e_g [L697] e_e = e_f [L698] wl_pc = 0 [L699] c1_pc = 0 [L700] c2_pc = 0 [L701] wb_pc = 0 [L702] wb_i = 1 [L703] c2_i = wb_i [L704] c1_i = c2_i [L705] wl_i = c1_i [L706] r_i = 0 [L707] c_req_up = 0 [L708] d = 0 [L709] c = 0 [L710] CALL start_simulation() [L400] int kernel_st ; [L403] kernel_st = 0 VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L404] COND FALSE !((int )c_req_up == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L415] COND TRUE (int )wl_i == 1 [L416] wl_st = 0 VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L420] COND TRUE (int )c1_i == 1 [L421] c1_st = 0 VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L425] COND TRUE (int )c2_i == 1 [L426] c2_st = 0 VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L430] COND TRUE (int )wb_i == 1 [L431] wb_st = 0 VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L435] COND FALSE !((int )r_i == 1) [L438] r_st = 2 VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L440] COND FALSE !((int )e_f == 0) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L445] COND FALSE !((int )e_g == 0) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L450] COND FALSE !((int )e_e == 0) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L455] COND FALSE !((int )e_c == 0) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L460] COND FALSE !((int )e_wl == 0) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L465] COND FALSE !((int )wl_pc == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L473] COND FALSE !((int )wl_pc == 2) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L483] COND FALSE !((int )c1_pc == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L492] COND FALSE !((int )c2_pc == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L501] COND FALSE !((int )wb_pc == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L510] COND FALSE !((int )e_c == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L515] COND FALSE !((int )e_e == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L520] COND FALSE !((int )e_f == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L525] COND FALSE !((int )e_g == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L530] COND FALSE !((int )e_c == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L535] COND FALSE !((int )e_wl == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L541] COND TRUE 1 VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L544] kernel_st = 1 [L545] CALL eval() [L286] int tmp ; [L287] int tmp___0 ; [L288] int tmp___1 ; [L289] int tmp___2 ; [L290] int tmp___3 ; VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] Loop: [L294] COND TRUE 1 [L296] COND TRUE (int )wl_st == 0 [L317] COND TRUE (int )wl_st == 0 [L319] tmp = __VERIFIER_nondet_int() [L321] COND FALSE !(\read(tmp)) [L332] COND TRUE (int )c1_st == 0 [L334] tmp___0 = __VERIFIER_nondet_int() [L336] COND FALSE !(\read(tmp___0)) [L347] COND TRUE (int )c2_st == 0 [L349] tmp___1 = __VERIFIER_nondet_int() [L351] COND FALSE !(\read(tmp___1)) [L362] COND TRUE (int )wb_st == 0 [L364] tmp___2 = __VERIFIER_nondet_int() [L366] COND FALSE !(\read(tmp___2)) [L377] COND FALSE !((int )r_st == 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2024-11-17 08:53:37,238 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/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)