./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/termination.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/toy2.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/toy2.cil.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a77d6f304c19846fdc8cd5bba9216d69953659ded966cffbf7faa285e2d864a4 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-12 01:03:42,001 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 01:03:42,066 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2024-10-12 01:03:42,069 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 01:03:42,070 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 01:03:42,084 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 01:03:42,085 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 01:03:42,085 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 01:03:42,086 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 01:03:42,086 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 01:03:42,086 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 01:03:42,087 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 01:03:42,087 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 01:03:42,087 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-10-12 01:03:42,088 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-10-12 01:03:42,088 INFO L153 SettingsManager]: * Use old map elimination=false [2024-10-12 01:03:42,088 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-10-12 01:03:42,088 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-10-12 01:03:42,089 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-10-12 01:03:42,089 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 01:03:42,089 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-10-12 01:03:42,093 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 01:03:42,093 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 01:03:42,094 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 01:03:42,094 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 01:03:42,094 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-10-12 01:03:42,094 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-10-12 01:03:42,095 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-10-12 01:03:42,095 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 01:03:42,095 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-12 01:03:42,095 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 01:03:42,095 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 01:03:42,095 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-10-12 01:03:42,096 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 01:03:42,096 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 01:03:42,096 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 01:03:42,096 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 01:03:42,097 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 01:03:42,097 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-10-12 01:03:42,101 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a77d6f304c19846fdc8cd5bba9216d69953659ded966cffbf7faa285e2d864a4 [2024-10-12 01:03:42,328 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 01:03:42,347 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 01:03:42,350 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 01:03:42,351 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 01:03:42,351 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 01:03:42,352 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/toy2.cil.c [2024-10-12 01:03:43,741 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 01:03:43,919 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 01:03:43,921 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/toy2.cil.c [2024-10-12 01:03:43,932 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/5571d8c8a/ae3ca8fa9b9e4ce4b33ce2497e32694f/FLAG5fbc09680 [2024-10-12 01:03:43,948 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/5571d8c8a/ae3ca8fa9b9e4ce4b33ce2497e32694f [2024-10-12 01:03:43,951 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 01:03:43,952 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 01:03:43,953 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 01:03:43,955 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 01:03:43,962 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 01:03:43,963 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 01:03:43" (1/1) ... [2024-10-12 01:03:43,965 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6320b561 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 01:03:43, skipping insertion in model container [2024-10-12 01:03:43,965 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 01:03:43" (1/1) ... [2024-10-12 01:03:44,001 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 01:03:44,173 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 01:03:44,181 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 01:03:44,209 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 01:03:44,223 INFO L204 MainTranslator]: Completed translation [2024-10-12 01:03:44,223 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 01:03:44 WrapperNode [2024-10-12 01:03:44,223 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 01:03:44,224 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 01:03:44,227 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 01:03:44,227 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 01:03:44,232 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 01:03:44" (1/1) ... [2024-10-12 01:03:44,238 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 01:03:44" (1/1) ... [2024-10-12 01:03:44,263 INFO L138 Inliner]: procedures = 20, calls = 16, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 361 [2024-10-12 01:03:44,265 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 01:03:44,266 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 01:03:44,266 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 01:03:44,266 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 01:03:44,274 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 01:03:44" (1/1) ... [2024-10-12 01:03:44,274 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 01:03:44" (1/1) ... [2024-10-12 01:03:44,275 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 01:03:44" (1/1) ... [2024-10-12 01:03:44,284 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-12 01:03:44,284 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 01:03:44" (1/1) ... [2024-10-12 01:03:44,285 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 01:03:44" (1/1) ... [2024-10-12 01:03:44,291 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 01:03:44" (1/1) ... [2024-10-12 01:03:44,300 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 01:03:44" (1/1) ... [2024-10-12 01:03:44,303 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 01:03:44" (1/1) ... [2024-10-12 01:03:44,305 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 01:03:44" (1/1) ... [2024-10-12 01:03:44,307 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 01:03:44,308 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 01:03:44,308 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 01:03:44,309 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 01:03:44,309 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 01:03:44" (1/1) ... [2024-10-12 01:03:44,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:03:44,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:03:44,358 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 01:03:44,366 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-10-12 01:03:44,407 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 01:03:44,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 01:03:44,407 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 01:03:44,407 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 01:03:44,486 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 01:03:44,488 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 01:03:44,982 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-10-12 01:03:44,983 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 01:03:45,004 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 01:03:45,006 INFO L314 CfgBuilder]: Removed 6 assume(true) statements. [2024-10-12 01:03:45,006 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 01:03:45 BoogieIcfgContainer [2024-10-12 01:03:45,007 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 01:03:45,007 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-10-12 01:03:45,008 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-10-12 01:03:45,011 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-10-12 01:03:45,011 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-12 01:03:45,013 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 12.10 01:03:43" (1/3) ... [2024-10-12 01:03:45,014 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@52ed093a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 01:03:45, skipping insertion in model container [2024-10-12 01:03:45,014 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-12 01:03:45,014 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 01:03:44" (2/3) ... [2024-10-12 01:03:45,014 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@52ed093a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 01:03:45, skipping insertion in model container [2024-10-12 01:03:45,014 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-12 01:03:45,014 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 01:03:45" (3/3) ... [2024-10-12 01:03:45,015 INFO L332 chiAutomizerObserver]: Analyzing ICFG toy2.cil.c [2024-10-12 01:03:45,066 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-10-12 01:03:45,066 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-10-12 01:03:45,066 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-10-12 01:03:45,066 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-10-12 01:03:45,067 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-10-12 01:03:45,067 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-10-12 01:03:45,067 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-10-12 01:03:45,067 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-10-12 01:03:45,071 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 131 states, 130 states have (on average 1.823076923076923) internal successors, (237), 130 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 01:03:45,089 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 96 [2024-10-12 01:03:45,091 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 01:03:45,091 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 01:03:45,098 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 01:03:45,098 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 01:03:45,098 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-10-12 01:03:45,100 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 131 states, 130 states have (on average 1.823076923076923) internal successors, (237), 130 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 01:03:45,104 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 96 [2024-10-12 01:03:45,105 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 01:03:45,105 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 01:03:45,106 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 01:03:45,106 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 01:03:45,112 INFO L745 eck$LassoCheckResult]: Stem: 32#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 42#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~0#1;havoc main_~__retres1~0#1;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; 113#L404true assume !(1 == ~c_req_up~0); 61#L404-2true assume !(1 == ~wl_i~0);~wl_st~0 := 2; 22#L415-1true assume !(1 == ~c1_i~0);~c1_st~0 := 2; 50#L420-1true assume 1 == ~c2_i~0;~c2_st~0 := 0; 84#L425-1true assume !(1 == ~wb_i~0);~wb_st~0 := 2; 39#L430-1true assume !(1 == ~r_i~0);~r_st~0 := 2; 125#L435-1true assume !(0 == ~e_f~0); 26#L440-1true assume !(0 == ~e_g~0); 44#L445-1true assume !(0 == ~e_e~0); 47#L450-1true assume !(0 == ~e_c~0); 21#L455-1true assume !(0 == ~e_wl~0); 76#L460-1true assume !(1 == ~wl_pc~0); 96#$Ultimate##44true assume !(2 == ~wl_pc~0); 121#L473true assume !(1 == ~c1_pc~0); 103#L483true assume !(1 == ~c2_pc~0); 115#L492true assume !(1 == ~wb_pc~0); 52#L501true assume !(1 == ~e_c~0); 31#L510-1true assume !(1 == ~e_e~0); 23#L515-1true assume !(1 == ~e_f~0); 14#L520-1true assume !(1 == ~e_g~0); 45#L525-1true assume !(1 == ~e_c~0); 82#L530-1true assume !(1 == ~e_wl~0); 65#L672-1true [2024-10-12 01:03:45,112 INFO L747 eck$LassoCheckResult]: Loop: 65#L672-1true assume !false; 6#L542true start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 128#L377true assume !true; 86#eval_returnLabel#1true havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; 64#L548true assume !(1 == ~c_req_up~0); 9#L548-2true start_simulation_~kernel_st~0#1 := 3; 25#L560true assume 0 == ~e_f~0;~e_f~0 := 1; 97#L560-2true assume 0 == ~e_g~0;~e_g~0 := 1; 18#L565-1true assume 0 == ~e_e~0;~e_e~0 := 1; 129#L570-1true assume 0 == ~e_c~0;~e_c~0 := 1; 35#L575-1true assume !(0 == ~e_wl~0); 122#L580-1true assume !(1 == ~wl_pc~0); 75#$Ultimate##251true assume !(2 == ~wl_pc~0); 80#L593true assume !(1 == ~c1_pc~0); 116#L603true assume !(1 == ~c2_pc~0); 3#L612true assume !(1 == ~wb_pc~0); 60#L621true assume 1 == ~e_c~0;~r_st~0 := 0; 58#L630-1true assume 1 == ~e_e~0;~e_e~0 := 2; 131#L635-1true assume 1 == ~e_f~0;~e_f~0 := 2; 130#L640-1true assume 1 == ~e_g~0;~e_g~0 := 2; 111#L645-1true assume 1 == ~e_c~0;~e_c~0 := 2; 11#L650-1true assume !(1 == ~e_wl~0); 40#L655-1true assume 0 == ~wl_st~0; 65#L672-1true [2024-10-12 01:03:45,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 01:03:45,116 INFO L85 PathProgramCache]: Analyzing trace with hash -2133486251, now seen corresponding path program 1 times [2024-10-12 01:03:45,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 01:03:45,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513139536] [2024-10-12 01:03:45,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 01:03:45,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 01:03:45,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:03:45,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 01:03:45,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 01:03:45,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513139536] [2024-10-12 01:03:45,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513139536] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 01:03:45,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 01:03:45,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 01:03:45,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092047930] [2024-10-12 01:03:45,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 01:03:45,387 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-12 01:03:45,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 01:03:45,389 INFO L85 PathProgramCache]: Analyzing trace with hash 1858065656, now seen corresponding path program 1 times [2024-10-12 01:03:45,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 01:03:45,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669980934] [2024-10-12 01:03:45,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 01:03:45,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 01:03:45,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:03:45,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 01:03:45,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 01:03:45,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669980934] [2024-10-12 01:03:45,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669980934] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 01:03:45,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 01:03:45,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 01:03:45,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318679408] [2024-10-12 01:03:45,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 01:03:45,409 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-12 01:03:45,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 01:03:45,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-12 01:03:45,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-12 01:03:45,440 INFO L87 Difference]: Start difference. First operand has 131 states, 130 states have (on average 1.823076923076923) internal successors, (237), 130 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 01:03:45,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 01:03:45,455 INFO L93 Difference]: Finished difference Result 129 states and 222 transitions. [2024-10-12 01:03:45,456 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 129 states and 222 transitions. [2024-10-12 01:03:45,461 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 93 [2024-10-12 01:03:45,464 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 129 states to 124 states and 217 transitions. [2024-10-12 01:03:45,465 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 124 [2024-10-12 01:03:45,465 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 124 [2024-10-12 01:03:45,466 INFO L73 IsDeterministic]: Start isDeterministic. Operand 124 states and 217 transitions. [2024-10-12 01:03:45,466 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-12 01:03:45,466 INFO L218 hiAutomatonCegarLoop]: Abstraction has 124 states and 217 transitions. [2024-10-12 01:03:45,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states and 217 transitions. [2024-10-12 01:03:45,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2024-10-12 01:03:45,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 124 states have (on average 1.75) internal successors, (217), 123 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 01:03:45,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 217 transitions. [2024-10-12 01:03:45,489 INFO L240 hiAutomatonCegarLoop]: Abstraction has 124 states and 217 transitions. [2024-10-12 01:03:45,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-12 01:03:45,492 INFO L425 stractBuchiCegarLoop]: Abstraction has 124 states and 217 transitions. [2024-10-12 01:03:45,492 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-10-12 01:03:45,493 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 124 states and 217 transitions. [2024-10-12 01:03:45,494 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 93 [2024-10-12 01:03:45,494 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 01:03:45,494 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 01:03:45,495 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 01:03:45,495 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 01:03:45,495 INFO L745 eck$LassoCheckResult]: Stem: 325#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 326#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~0#1;havoc main_~__retres1~0#1;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; 340#L404 assume !(1 == ~c_req_up~0); 363#L404-2 assume !(1 == ~wl_i~0);~wl_st~0 := 2; 309#L415-1 assume !(1 == ~c1_i~0);~c1_st~0 := 2; 310#L420-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 351#L425-1 assume !(1 == ~wb_i~0);~wb_st~0 := 2; 337#L430-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 338#L435-1 assume !(0 == ~e_f~0); 315#L440-1 assume !(0 == ~e_g~0); 316#L445-1 assume !(0 == ~e_e~0); 343#L450-1 assume !(0 == ~e_c~0); 307#L455-1 assume !(0 == ~e_wl~0); 308#L460-1 assume !(1 == ~wl_pc~0); 376#$Ultimate##44 assume !(2 == ~wl_pc~0); 354#L473 assume !(1 == ~c1_pc~0); 386#L483 assume !(1 == ~c2_pc~0); 297#L492 assume !(1 == ~wb_pc~0); 342#L501 assume !(1 == ~e_c~0); 324#L510-1 assume !(1 == ~e_e~0); 311#L515-1 assume !(1 == ~e_f~0); 294#L520-1 assume !(1 == ~e_g~0); 295#L525-1 assume !(1 == ~e_c~0); 344#L530-1 assume !(1 == ~e_wl~0); 292#L672-1 [2024-10-12 01:03:45,495 INFO L747 eck$LassoCheckResult]: Loop: 292#L672-1 assume !false; 278#L542 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 279#L377 assume !false; 275#L295 assume !(0 == ~wl_st~0); 277#L299 assume !(0 == ~c1_st~0); 336#L302 assume !(0 == ~c2_st~0); 366#L305 assume !(0 == ~wb_st~0); 286#L308 assume !(0 == ~r_st~0); 287#eval_returnLabel#1 havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; 365#L548 assume !(1 == ~c_req_up~0); 284#L548-2 start_simulation_~kernel_st~0#1 := 3; 285#L560 assume 0 == ~e_f~0;~e_f~0 := 1; 314#L560-2 assume 0 == ~e_g~0;~e_g~0 := 1; 304#L565-1 assume 0 == ~e_e~0;~e_e~0 := 1; 305#L570-1 assume 0 == ~e_c~0;~e_c~0 := 1; 332#L575-1 assume !(0 == ~e_wl~0); 333#L580-1 assume 1 == ~wl_pc~0; 385#L586 assume 1 == ~e_wl~0;~wl_st~0 := 0; 375#L593 assume !(1 == ~c1_pc~0); 350#L603 assume !(1 == ~c2_pc~0); 269#L612 assume !(1 == ~wb_pc~0); 271#L621 assume 1 == ~e_c~0;~r_st~0 := 0; 359#L630-1 assume 1 == ~e_e~0;~e_e~0 := 2; 360#L635-1 assume 1 == ~e_f~0;~e_f~0 := 2; 392#L640-1 assume 1 == ~e_g~0;~e_g~0 := 2; 390#L645-1 assume 1 == ~e_c~0;~e_c~0 := 2; 288#L650-1 assume !(1 == ~e_wl~0); 289#L655-1 assume 0 == ~wl_st~0; 292#L672-1 [2024-10-12 01:03:45,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 01:03:45,496 INFO L85 PathProgramCache]: Analyzing trace with hash -2133486251, now seen corresponding path program 2 times [2024-10-12 01:03:45,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 01:03:45,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471603927] [2024-10-12 01:03:45,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 01:03:45,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 01:03:45,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:03:45,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 01:03:45,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 01:03:45,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471603927] [2024-10-12 01:03:45,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [471603927] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 01:03:45,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 01:03:45,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 01:03:45,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630517514] [2024-10-12 01:03:45,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 01:03:45,595 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-12 01:03:45,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 01:03:45,596 INFO L85 PathProgramCache]: Analyzing trace with hash -1951233037, now seen corresponding path program 1 times [2024-10-12 01:03:45,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 01:03:45,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770204589] [2024-10-12 01:03:45,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 01:03:45,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 01:03:45,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:03:45,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 01:03:45,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 01:03:45,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770204589] [2024-10-12 01:03:45,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770204589] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 01:03:45,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 01:03:45,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 01:03:45,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465294522] [2024-10-12 01:03:45,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 01:03:45,633 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-12 01:03:45,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 01:03:45,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 01:03:45,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 01:03:45,634 INFO L87 Difference]: Start difference. First operand 124 states and 217 transitions. cyclomatic complexity: 94 Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 01:03:45,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 01:03:45,657 INFO L93 Difference]: Finished difference Result 124 states and 216 transitions. [2024-10-12 01:03:45,658 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 124 states and 216 transitions. [2024-10-12 01:03:45,659 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 93 [2024-10-12 01:03:45,660 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 124 states to 124 states and 216 transitions. [2024-10-12 01:03:45,660 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 124 [2024-10-12 01:03:45,660 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 124 [2024-10-12 01:03:45,660 INFO L73 IsDeterministic]: Start isDeterministic. Operand 124 states and 216 transitions. [2024-10-12 01:03:45,661 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-12 01:03:45,661 INFO L218 hiAutomatonCegarLoop]: Abstraction has 124 states and 216 transitions. [2024-10-12 01:03:45,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states and 216 transitions. [2024-10-12 01:03:45,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2024-10-12 01:03:45,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 124 states have (on average 1.7419354838709677) internal successors, (216), 123 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 01:03:45,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 216 transitions. [2024-10-12 01:03:45,666 INFO L240 hiAutomatonCegarLoop]: Abstraction has 124 states and 216 transitions. [2024-10-12 01:03:45,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 01:03:45,671 INFO L425 stractBuchiCegarLoop]: Abstraction has 124 states and 216 transitions. [2024-10-12 01:03:45,671 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-10-12 01:03:45,671 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 124 states and 216 transitions. [2024-10-12 01:03:45,672 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 93 [2024-10-12 01:03:45,672 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 01:03:45,672 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 01:03:45,673 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 01:03:45,673 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 01:03:45,673 INFO L745 eck$LassoCheckResult]: Stem: 580#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 581#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~0#1;havoc main_~__retres1~0#1;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; 595#L404 assume !(1 == ~c_req_up~0); 618#L404-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 564#L415-1 assume !(1 == ~c1_i~0);~c1_st~0 := 2; 565#L420-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 606#L425-1 assume !(1 == ~wb_i~0);~wb_st~0 := 2; 592#L430-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 593#L435-1 assume !(0 == ~e_f~0); 570#L440-1 assume !(0 == ~e_g~0); 571#L445-1 assume !(0 == ~e_e~0); 598#L450-1 assume !(0 == ~e_c~0); 562#L455-1 assume !(0 == ~e_wl~0); 563#L460-1 assume !(1 == ~wl_pc~0); 631#$Ultimate##44 assume !(2 == ~wl_pc~0); 609#L473 assume !(1 == ~c1_pc~0); 641#L483 assume !(1 == ~c2_pc~0); 552#L492 assume !(1 == ~wb_pc~0); 597#L501 assume !(1 == ~e_c~0); 579#L510-1 assume !(1 == ~e_e~0); 566#L515-1 assume !(1 == ~e_f~0); 549#L520-1 assume !(1 == ~e_g~0); 550#L525-1 assume !(1 == ~e_c~0); 599#L530-1 assume !(1 == ~e_wl~0); 547#L672-1 [2024-10-12 01:03:45,673 INFO L747 eck$LassoCheckResult]: Loop: 547#L672-1 assume !false; 533#L542 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 534#L377 assume !false; 530#L295 assume !(0 == ~wl_st~0); 532#L299 assume !(0 == ~c1_st~0); 591#L302 assume !(0 == ~c2_st~0); 621#L305 assume !(0 == ~wb_st~0); 541#L308 assume !(0 == ~r_st~0); 542#eval_returnLabel#1 havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; 620#L548 assume !(1 == ~c_req_up~0); 539#L548-2 start_simulation_~kernel_st~0#1 := 3; 540#L560 assume 0 == ~e_f~0;~e_f~0 := 1; 569#L560-2 assume 0 == ~e_g~0;~e_g~0 := 1; 559#L565-1 assume 0 == ~e_e~0;~e_e~0 := 1; 560#L570-1 assume 0 == ~e_c~0;~e_c~0 := 1; 587#L575-1 assume !(0 == ~e_wl~0); 588#L580-1 assume 1 == ~wl_pc~0; 640#L586 assume 1 == ~e_wl~0;~wl_st~0 := 0; 630#L593 assume !(1 == ~c1_pc~0); 605#L603 assume !(1 == ~c2_pc~0); 524#L612 assume !(1 == ~wb_pc~0); 526#L621 assume 1 == ~e_c~0;~r_st~0 := 0; 614#L630-1 assume 1 == ~e_e~0;~e_e~0 := 2; 615#L635-1 assume 1 == ~e_f~0;~e_f~0 := 2; 647#L640-1 assume 1 == ~e_g~0;~e_g~0 := 2; 645#L645-1 assume 1 == ~e_c~0;~e_c~0 := 2; 543#L650-1 assume !(1 == ~e_wl~0); 544#L655-1 assume 0 == ~wl_st~0; 547#L672-1 [2024-10-12 01:03:45,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 01:03:45,674 INFO L85 PathProgramCache]: Analyzing trace with hash 1738779219, now seen corresponding path program 1 times [2024-10-12 01:03:45,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 01:03:45,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171016680] [2024-10-12 01:03:45,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 01:03:45,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 01:03:45,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:03:45,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 01:03:45,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 01:03:45,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171016680] [2024-10-12 01:03:45,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171016680] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 01:03:45,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 01:03:45,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 01:03:45,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414582954] [2024-10-12 01:03:45,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 01:03:45,707 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-12 01:03:45,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 01:03:45,708 INFO L85 PathProgramCache]: Analyzing trace with hash -1951233037, now seen corresponding path program 2 times [2024-10-12 01:03:45,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 01:03:45,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148063422] [2024-10-12 01:03:45,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 01:03:45,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 01:03:45,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:03:45,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 01:03:45,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 01:03:45,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148063422] [2024-10-12 01:03:45,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148063422] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 01:03:45,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 01:03:45,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 01:03:45,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159404959] [2024-10-12 01:03:45,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 01:03:45,737 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-12 01:03:45,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 01:03:45,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 01:03:45,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 01:03:45,738 INFO L87 Difference]: Start difference. First operand 124 states and 216 transitions. cyclomatic complexity: 93 Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 01:03:45,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 01:03:45,753 INFO L93 Difference]: Finished difference Result 124 states and 215 transitions. [2024-10-12 01:03:45,753 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 124 states and 215 transitions. [2024-10-12 01:03:45,754 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 93 [2024-10-12 01:03:45,755 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 124 states to 124 states and 215 transitions. [2024-10-12 01:03:45,755 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 124 [2024-10-12 01:03:45,758 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 124 [2024-10-12 01:03:45,758 INFO L73 IsDeterministic]: Start isDeterministic. Operand 124 states and 215 transitions. [2024-10-12 01:03:45,759 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-12 01:03:45,759 INFO L218 hiAutomatonCegarLoop]: Abstraction has 124 states and 215 transitions. [2024-10-12 01:03:45,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states and 215 transitions. [2024-10-12 01:03:45,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2024-10-12 01:03:45,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 124 states have (on average 1.7338709677419355) internal successors, (215), 123 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 01:03:45,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 215 transitions. [2024-10-12 01:03:45,767 INFO L240 hiAutomatonCegarLoop]: Abstraction has 124 states and 215 transitions. [2024-10-12 01:03:45,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 01:03:45,768 INFO L425 stractBuchiCegarLoop]: Abstraction has 124 states and 215 transitions. [2024-10-12 01:03:45,768 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-10-12 01:03:45,768 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 124 states and 215 transitions. [2024-10-12 01:03:45,769 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 93 [2024-10-12 01:03:45,769 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 01:03:45,769 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 01:03:45,770 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 01:03:45,771 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 01:03:45,771 INFO L745 eck$LassoCheckResult]: Stem: 835#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 836#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~0#1;havoc main_~__retres1~0#1;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; 850#L404 assume !(1 == ~c_req_up~0); 873#L404-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 819#L415-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 820#L420-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 861#L425-1 assume !(1 == ~wb_i~0);~wb_st~0 := 2; 847#L430-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 848#L435-1 assume !(0 == ~e_f~0); 825#L440-1 assume !(0 == ~e_g~0); 826#L445-1 assume !(0 == ~e_e~0); 853#L450-1 assume !(0 == ~e_c~0); 817#L455-1 assume !(0 == ~e_wl~0); 818#L460-1 assume !(1 == ~wl_pc~0); 886#$Ultimate##44 assume !(2 == ~wl_pc~0); 864#L473 assume !(1 == ~c1_pc~0); 896#L483 assume !(1 == ~c2_pc~0); 807#L492 assume !(1 == ~wb_pc~0); 852#L501 assume !(1 == ~e_c~0); 834#L510-1 assume !(1 == ~e_e~0); 821#L515-1 assume !(1 == ~e_f~0); 804#L520-1 assume !(1 == ~e_g~0); 805#L525-1 assume !(1 == ~e_c~0); 854#L530-1 assume !(1 == ~e_wl~0); 802#L672-1 [2024-10-12 01:03:45,771 INFO L747 eck$LassoCheckResult]: Loop: 802#L672-1 assume !false; 788#L542 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 789#L377 assume !false; 785#L295 assume !(0 == ~wl_st~0); 787#L299 assume !(0 == ~c1_st~0); 846#L302 assume !(0 == ~c2_st~0); 876#L305 assume !(0 == ~wb_st~0); 796#L308 assume !(0 == ~r_st~0); 797#eval_returnLabel#1 havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; 875#L548 assume !(1 == ~c_req_up~0); 794#L548-2 start_simulation_~kernel_st~0#1 := 3; 795#L560 assume 0 == ~e_f~0;~e_f~0 := 1; 824#L560-2 assume 0 == ~e_g~0;~e_g~0 := 1; 814#L565-1 assume 0 == ~e_e~0;~e_e~0 := 1; 815#L570-1 assume 0 == ~e_c~0;~e_c~0 := 1; 842#L575-1 assume !(0 == ~e_wl~0); 843#L580-1 assume !(1 == ~wl_pc~0); 883#$Ultimate##251 assume !(2 == ~wl_pc~0); 885#L593 assume !(1 == ~c1_pc~0); 860#L603 assume !(1 == ~c2_pc~0); 779#L612 assume !(1 == ~wb_pc~0); 781#L621 assume 1 == ~e_c~0;~r_st~0 := 0; 869#L630-1 assume 1 == ~e_e~0;~e_e~0 := 2; 870#L635-1 assume 1 == ~e_f~0;~e_f~0 := 2; 902#L640-1 assume 1 == ~e_g~0;~e_g~0 := 2; 900#L645-1 assume 1 == ~e_c~0;~e_c~0 := 2; 798#L650-1 assume !(1 == ~e_wl~0); 799#L655-1 assume 0 == ~wl_st~0; 802#L672-1 [2024-10-12 01:03:45,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 01:03:45,771 INFO L85 PathProgramCache]: Analyzing trace with hash -1738539627, now seen corresponding path program 1 times [2024-10-12 01:03:45,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 01:03:45,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295934737] [2024-10-12 01:03:45,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 01:03:45,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 01:03:45,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:03:45,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 01:03:45,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 01:03:45,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295934737] [2024-10-12 01:03:45,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295934737] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 01:03:45,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 01:03:45,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 01:03:45,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322634739] [2024-10-12 01:03:45,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 01:03:45,804 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-12 01:03:45,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 01:03:45,804 INFO L85 PathProgramCache]: Analyzing trace with hash -1401973316, now seen corresponding path program 1 times [2024-10-12 01:03:45,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 01:03:45,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597280204] [2024-10-12 01:03:45,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 01:03:45,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 01:03:45,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:03:45,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 01:03:45,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 01:03:45,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597280204] [2024-10-12 01:03:45,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597280204] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 01:03:45,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 01:03:45,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 01:03:45,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892609120] [2024-10-12 01:03:45,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 01:03:45,829 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-12 01:03:45,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 01:03:45,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 01:03:45,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 01:03:45,830 INFO L87 Difference]: Start difference. First operand 124 states and 215 transitions. cyclomatic complexity: 92 Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 01:03:45,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 01:03:45,842 INFO L93 Difference]: Finished difference Result 124 states and 214 transitions. [2024-10-12 01:03:45,842 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 124 states and 214 transitions. [2024-10-12 01:03:45,843 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 93 [2024-10-12 01:03:45,845 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 124 states to 124 states and 214 transitions. [2024-10-12 01:03:45,846 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 124 [2024-10-12 01:03:45,847 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 124 [2024-10-12 01:03:45,847 INFO L73 IsDeterministic]: Start isDeterministic. Operand 124 states and 214 transitions. [2024-10-12 01:03:45,847 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-12 01:03:45,847 INFO L218 hiAutomatonCegarLoop]: Abstraction has 124 states and 214 transitions. [2024-10-12 01:03:45,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states and 214 transitions. [2024-10-12 01:03:45,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2024-10-12 01:03:45,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 124 states have (on average 1.7258064516129032) internal successors, (214), 123 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 01:03:45,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 214 transitions. [2024-10-12 01:03:45,855 INFO L240 hiAutomatonCegarLoop]: Abstraction has 124 states and 214 transitions. [2024-10-12 01:03:45,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 01:03:45,856 INFO L425 stractBuchiCegarLoop]: Abstraction has 124 states and 214 transitions. [2024-10-12 01:03:45,856 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-10-12 01:03:45,857 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 124 states and 214 transitions. [2024-10-12 01:03:45,858 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 93 [2024-10-12 01:03:45,858 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 01:03:45,858 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 01:03:45,859 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 01:03:45,859 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 01:03:45,859 INFO L745 eck$LassoCheckResult]: Stem: 1090#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 1091#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~0#1;havoc main_~__retres1~0#1;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; 1105#L404 assume !(1 == ~c_req_up~0); 1128#L404-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 1074#L415-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 1075#L420-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 1116#L425-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 1102#L430-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 1103#L435-1 assume !(0 == ~e_f~0); 1080#L440-1 assume !(0 == ~e_g~0); 1081#L445-1 assume !(0 == ~e_e~0); 1108#L450-1 assume !(0 == ~e_c~0); 1072#L455-1 assume !(0 == ~e_wl~0); 1073#L460-1 assume !(1 == ~wl_pc~0); 1141#$Ultimate##44 assume !(2 == ~wl_pc~0); 1119#L473 assume !(1 == ~c1_pc~0); 1151#L483 assume !(1 == ~c2_pc~0); 1062#L492 assume !(1 == ~wb_pc~0); 1107#L501 assume !(1 == ~e_c~0); 1089#L510-1 assume !(1 == ~e_e~0); 1076#L515-1 assume !(1 == ~e_f~0); 1059#L520-1 assume !(1 == ~e_g~0); 1060#L525-1 assume !(1 == ~e_c~0); 1109#L530-1 assume !(1 == ~e_wl~0); 1057#L672-1 [2024-10-12 01:03:45,862 INFO L747 eck$LassoCheckResult]: Loop: 1057#L672-1 assume !false; 1043#L542 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 1044#L377 assume !false; 1040#L295 assume !(0 == ~wl_st~0); 1042#L299 assume !(0 == ~c1_st~0); 1101#L302 assume !(0 == ~c2_st~0); 1131#L305 assume !(0 == ~wb_st~0); 1051#L308 assume !(0 == ~r_st~0); 1052#eval_returnLabel#1 havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; 1130#L548 assume !(1 == ~c_req_up~0); 1049#L548-2 start_simulation_~kernel_st~0#1 := 3; 1050#L560 assume 0 == ~e_f~0;~e_f~0 := 1; 1079#L560-2 assume 0 == ~e_g~0;~e_g~0 := 1; 1069#L565-1 assume 0 == ~e_e~0;~e_e~0 := 1; 1070#L570-1 assume 0 == ~e_c~0;~e_c~0 := 1; 1097#L575-1 assume !(0 == ~e_wl~0); 1098#L580-1 assume !(1 == ~wl_pc~0); 1138#$Ultimate##251 assume !(2 == ~wl_pc~0); 1140#L593 assume !(1 == ~c1_pc~0); 1115#L603 assume !(1 == ~c2_pc~0); 1034#L612 assume !(1 == ~wb_pc~0); 1036#L621 assume 1 == ~e_c~0;~r_st~0 := 0; 1124#L630-1 assume 1 == ~e_e~0;~e_e~0 := 2; 1125#L635-1 assume 1 == ~e_f~0;~e_f~0 := 2; 1157#L640-1 assume 1 == ~e_g~0;~e_g~0 := 2; 1155#L645-1 assume 1 == ~e_c~0;~e_c~0 := 2; 1053#L650-1 assume !(1 == ~e_wl~0); 1054#L655-1 assume 0 == ~wl_st~0; 1057#L672-1 [2024-10-12 01:03:45,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 01:03:45,862 INFO L85 PathProgramCache]: Analyzing trace with hash 255605079, now seen corresponding path program 1 times [2024-10-12 01:03:45,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 01:03:45,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073233402] [2024-10-12 01:03:45,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 01:03:45,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 01:03:45,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 01:03:45,874 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 01:03:45,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 01:03:45,932 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 01:03:45,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 01:03:45,932 INFO L85 PathProgramCache]: Analyzing trace with hash -1401973316, now seen corresponding path program 2 times [2024-10-12 01:03:45,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 01:03:45,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479233115] [2024-10-12 01:03:45,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 01:03:45,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 01:03:45,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:03:45,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 01:03:45,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 01:03:45,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479233115] [2024-10-12 01:03:45,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479233115] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 01:03:45,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 01:03:45,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 01:03:45,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509902125] [2024-10-12 01:03:45,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 01:03:45,959 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-12 01:03:45,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 01:03:45,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 01:03:45,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 01:03:45,960 INFO L87 Difference]: Start difference. First operand 124 states and 214 transitions. cyclomatic complexity: 91 Second operand has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 01:03:45,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 01:03:45,996 INFO L93 Difference]: Finished difference Result 180 states and 306 transitions. [2024-10-12 01:03:45,996 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 180 states and 306 transitions. [2024-10-12 01:03:45,997 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 149 [2024-10-12 01:03:45,998 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 180 states to 180 states and 306 transitions. [2024-10-12 01:03:45,998 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 180 [2024-10-12 01:03:45,998 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 180 [2024-10-12 01:03:45,998 INFO L73 IsDeterministic]: Start isDeterministic. Operand 180 states and 306 transitions. [2024-10-12 01:03:45,999 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-12 01:03:46,001 INFO L218 hiAutomatonCegarLoop]: Abstraction has 180 states and 306 transitions. [2024-10-12 01:03:46,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states and 306 transitions. [2024-10-12 01:03:46,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 180. [2024-10-12 01:03:46,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 180 states have (on average 1.7) internal successors, (306), 179 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 01:03:46,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 306 transitions. [2024-10-12 01:03:46,015 INFO L240 hiAutomatonCegarLoop]: Abstraction has 180 states and 306 transitions. [2024-10-12 01:03:46,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 01:03:46,018 INFO L425 stractBuchiCegarLoop]: Abstraction has 180 states and 306 transitions. [2024-10-12 01:03:46,018 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-10-12 01:03:46,018 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 180 states and 306 transitions. [2024-10-12 01:03:46,020 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 149 [2024-10-12 01:03:46,020 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 01:03:46,020 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 01:03:46,020 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 01:03:46,020 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 01:03:46,021 INFO L745 eck$LassoCheckResult]: Stem: 1400#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 1401#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~0#1;havoc main_~__retres1~0#1;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; 1415#L404 assume !(1 == ~c_req_up~0); 1438#L404-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 1385#L415-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 1386#L420-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 1426#L425-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 1412#L430-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 1413#L435-1 assume !(0 == ~e_f~0); 1391#L440-1 assume !(0 == ~e_g~0); 1392#L445-1 assume !(0 == ~e_e~0); 1418#L450-1 assume !(0 == ~e_c~0); 1383#L455-1 assume !(0 == ~e_wl~0); 1384#L460-1 assume !(1 == ~wl_pc~0); 1453#$Ultimate##44 assume !(2 == ~wl_pc~0); 1429#L473 assume !(1 == ~c1_pc~0); 1465#L483 assume !(1 == ~c2_pc~0); 1373#L492 assume !(1 == ~wb_pc~0); 1417#L501 assume !(1 == ~e_c~0); 1399#L510-1 assume !(1 == ~e_e~0); 1387#L515-1 assume !(1 == ~e_f~0); 1370#L520-1 assume !(1 == ~e_g~0); 1371#L525-1 assume !(1 == ~e_c~0); 1419#L530-1 assume !(1 == ~e_wl~0); 1457#L672-1 [2024-10-12 01:03:46,021 INFO L747 eck$LassoCheckResult]: Loop: 1457#L672-1 assume !false; 1475#L542 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 1474#L377 assume !false; 1473#L295 assume !(0 == ~wl_st~0); 1351#L299 assume !(0 == ~c1_st~0); 1411#L302 assume !(0 == ~c2_st~0); 1441#L305 assume !(0 == ~wb_st~0); 1361#L308 assume !(0 == ~r_st~0); 1363#eval_returnLabel#1 havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; 1440#L548 assume !(1 == ~c_req_up~0); 1359#L548-2 start_simulation_~kernel_st~0#1 := 3; 1360#L560 assume 0 == ~e_f~0;~e_f~0 := 1; 1390#L560-2 assume 0 == ~e_g~0;~e_g~0 := 1; 1374#L565-1 assume 0 == ~e_e~0;~e_e~0 := 1; 1375#L570-1 assume 0 == ~e_c~0;~e_c~0 := 1; 1403#L575-1 assume !(0 == ~e_wl~0); 1404#L580-1 assume 1 == ~wl_pc~0; 1464#L586 assume 1 == ~e_wl~0;~wl_st~0 := 0; 1462#L593 assume !(1 == ~c1_pc~0); 1521#L603 assume !(1 == ~c2_pc~0); 1520#L612 assume !(1 == ~wb_pc~0); 1518#L621 assume 1 == ~e_c~0;~r_st~0 := 0; 1517#L630-1 assume 1 == ~e_e~0;~e_e~0 := 2; 1516#L635-1 assume 1 == ~e_f~0;~e_f~0 := 2; 1515#L640-1 assume 1 == ~e_g~0;~e_g~0 := 2; 1514#L645-1 assume 1 == ~e_c~0;~e_c~0 := 2; 1513#L650-1 assume !(1 == ~e_wl~0); 1511#L655-1 assume 0 == ~wl_st~0; 1457#L672-1 [2024-10-12 01:03:46,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 01:03:46,024 INFO L85 PathProgramCache]: Analyzing trace with hash 255605079, now seen corresponding path program 2 times [2024-10-12 01:03:46,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 01:03:46,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004460918] [2024-10-12 01:03:46,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 01:03:46,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 01:03:46,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 01:03:46,032 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 01:03:46,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 01:03:46,040 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 01:03:46,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 01:03:46,041 INFO L85 PathProgramCache]: Analyzing trace with hash -1951233037, now seen corresponding path program 3 times [2024-10-12 01:03:46,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 01:03:46,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476726681] [2024-10-12 01:03:46,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 01:03:46,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 01:03:46,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:03:46,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 01:03:46,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 01:03:46,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476726681] [2024-10-12 01:03:46,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476726681] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 01:03:46,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 01:03:46,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 01:03:46,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858359538] [2024-10-12 01:03:46,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 01:03:46,061 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-12 01:03:46,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 01:03:46,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 01:03:46,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 01:03:46,062 INFO L87 Difference]: Start difference. First operand 180 states and 306 transitions. cyclomatic complexity: 127 Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 01:03:46,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 01:03:46,104 INFO L93 Difference]: Finished difference Result 335 states and 566 transitions. [2024-10-12 01:03:46,104 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 335 states and 566 transitions. [2024-10-12 01:03:46,107 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 288 [2024-10-12 01:03:46,109 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 335 states to 335 states and 566 transitions. [2024-10-12 01:03:46,110 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 335 [2024-10-12 01:03:46,110 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 335 [2024-10-12 01:03:46,110 INFO L73 IsDeterministic]: Start isDeterministic. Operand 335 states and 566 transitions. [2024-10-12 01:03:46,112 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-12 01:03:46,112 INFO L218 hiAutomatonCegarLoop]: Abstraction has 335 states and 566 transitions. [2024-10-12 01:03:46,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states and 566 transitions. [2024-10-12 01:03:46,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 333. [2024-10-12 01:03:46,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 333 states have (on average 1.6936936936936937) internal successors, (564), 332 states have internal predecessors, (564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 01:03:46,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 564 transitions. [2024-10-12 01:03:46,126 INFO L240 hiAutomatonCegarLoop]: Abstraction has 333 states and 564 transitions. [2024-10-12 01:03:46,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 01:03:46,129 INFO L425 stractBuchiCegarLoop]: Abstraction has 333 states and 564 transitions. [2024-10-12 01:03:46,129 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-10-12 01:03:46,130 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 333 states and 564 transitions. [2024-10-12 01:03:46,131 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 286 [2024-10-12 01:03:46,131 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 01:03:46,131 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 01:03:46,133 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 01:03:46,134 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 01:03:46,134 INFO L745 eck$LassoCheckResult]: Stem: 1925#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 1926#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~0#1;havoc main_~__retres1~0#1;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; 1943#L404 assume !(1 == ~c_req_up~0); 1965#L404-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 1907#L415-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 1908#L420-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 1952#L425-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 1938#L430-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 1939#L435-1 assume !(0 == ~e_f~0); 1913#L440-1 assume !(0 == ~e_g~0); 1914#L445-1 assume !(0 == ~e_e~0); 1944#L450-1 assume !(0 == ~e_c~0); 1904#L455-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 1905#L460-1 assume !(1 == ~wl_pc~0); 2152#$Ultimate##44 assume !(2 == ~wl_pc~0); 2007#L473 assume !(1 == ~c1_pc~0); 2070#L483 assume !(1 == ~c2_pc~0); 2061#L492 assume !(1 == ~wb_pc~0); 1954#L501 assume !(1 == ~e_c~0); 1923#L510-1 assume !(1 == ~e_e~0); 1909#L515-1 assume !(1 == ~e_f~0); 1891#L520-1 assume !(1 == ~e_g~0); 1892#L525-1 assume !(1 == ~e_c~0); 1945#L530-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 1987#L672-1 [2024-10-12 01:03:46,134 INFO L747 eck$LassoCheckResult]: Loop: 1987#L672-1 assume !false; 2014#L542 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 2015#L377 assume !false; 2084#L295 assume !(0 == ~wl_st~0); 1936#L299 assume !(0 == ~c1_st~0); 1937#L302 assume !(0 == ~c2_st~0); 1968#L305 assume !(0 == ~wb_st~0); 1882#L308 assume !(0 == ~r_st~0); 1884#eval_returnLabel#1 havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; 1967#L548 assume !(1 == ~c_req_up~0); 1880#L548-2 start_simulation_~kernel_st~0#1 := 3; 1881#L560 assume 0 == ~e_f~0;~e_f~0 := 1; 1912#L560-2 assume 0 == ~e_g~0;~e_g~0 := 1; 1901#L565-1 assume 0 == ~e_e~0;~e_e~0 := 1; 1902#L570-1 assume 0 == ~e_c~0;~e_c~0 := 1; 1931#L575-1 assume !(0 == ~e_wl~0); 1932#L580-1 assume 1 == ~wl_pc~0; 2004#L586 assume 1 == ~e_wl~0;~wl_st~0 := 0; 1997#L593 assume !(1 == ~c1_pc~0); 2039#L603 assume !(1 == ~c2_pc~0); 2038#L612 assume !(1 == ~wb_pc~0); 2036#L621 assume 1 == ~e_c~0;~r_st~0 := 0; 2034#L630-1 assume 1 == ~e_e~0;~e_e~0 := 2; 2031#L635-1 assume 1 == ~e_f~0;~e_f~0 := 2; 2028#L640-1 assume 1 == ~e_g~0;~e_g~0 := 2; 2025#L645-1 assume 1 == ~e_c~0;~e_c~0 := 2; 2022#L650-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 2019#L655-1 assume 0 == ~wl_st~0; 1987#L672-1 [2024-10-12 01:03:46,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 01:03:46,135 INFO L85 PathProgramCache]: Analyzing trace with hash -2560361, now seen corresponding path program 1 times [2024-10-12 01:03:46,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 01:03:46,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592749535] [2024-10-12 01:03:46,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 01:03:46,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 01:03:46,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:03:46,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 01:03:46,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 01:03:46,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592749535] [2024-10-12 01:03:46,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592749535] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 01:03:46,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 01:03:46,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 01:03:46,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680133788] [2024-10-12 01:03:46,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 01:03:46,206 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-12 01:03:46,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 01:03:46,207 INFO L85 PathProgramCache]: Analyzing trace with hash -1951233099, now seen corresponding path program 1 times [2024-10-12 01:03:46,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 01:03:46,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953808025] [2024-10-12 01:03:46,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 01:03:46,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 01:03:46,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 01:03:46,215 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 01:03:46,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 01:03:46,222 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 01:03:46,584 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 01:03:46,584 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 01:03:46,584 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 01:03:46,584 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 01:03:46,584 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-10-12 01:03:46,584 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:03:46,585 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 01:03:46,585 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 01:03:46,585 INFO L132 ssoRankerPreferences]: Filename of dumped script: toy2.cil.c_Iteration7_Loop [2024-10-12 01:03:46,585 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 01:03:46,585 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 01:03:46,599 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:46,607 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:46,611 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:46,614 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:46,616 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:46,618 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:46,620 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:46,624 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:46,626 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:46,627 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:46,630 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:46,631 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:46,633 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:46,637 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:46,639 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:46,641 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:46,646 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:46,648 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:46,653 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:46,655 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:46,661 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:46,666 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:46,669 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:46,671 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:46,675 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:46,858 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 01:03:46,859 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-10-12 01:03:46,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:03:46,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:03:46,866 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 01:03:46,870 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2024-10-12 01:03:46,872 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 01:03:46,872 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 01:03:46,899 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-12 01:03:46,899 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~c2_st~0=-1} Honda state: {~c2_st~0=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-10-12 01:03:46,914 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2024-10-12 01:03:46,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:03:46,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:03:46,916 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 01:03:46,917 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2024-10-12 01:03:46,918 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 01:03:46,918 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 01:03:46,946 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2024-10-12 01:03:46,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:03:46,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:03:46,948 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 01:03:46,950 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2024-10-12 01:03:46,951 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-10-12 01:03:46,951 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 01:03:46,966 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-10-12 01:03:46,986 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2024-10-12 01:03:46,987 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 01:03:46,987 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 01:03:46,987 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 01:03:46,987 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 01:03:46,987 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-12 01:03:46,987 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:03:46,987 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 01:03:46,987 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 01:03:46,987 INFO L132 ssoRankerPreferences]: Filename of dumped script: toy2.cil.c_Iteration7_Loop [2024-10-12 01:03:46,987 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 01:03:46,987 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 01:03:46,989 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:46,998 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:47,007 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:47,010 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:47,017 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:47,022 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:47,029 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:47,032 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:47,070 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:47,073 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:47,075 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:47,077 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:47,079 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:47,080 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:47,084 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:47,086 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:47,090 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:47,092 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:47,096 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:47,098 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:47,100 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:47,101 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:47,105 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:47,107 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:47,109 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:47,271 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 01:03:47,274 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-12 01:03:47,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:03:47,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:03:47,279 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 01:03:47,280 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2024-10-12 01:03:47,285 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 01:03:47,295 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 01:03:47,295 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 01:03:47,296 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 01:03:47,296 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2024-10-12 01:03:47,296 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 01:03:47,298 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2024-10-12 01:03:47,298 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 01:03:47,303 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 01:03:47,313 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2024-10-12 01:03:47,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:03:47,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:03:47,319 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 01:03:47,322 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2024-10-12 01:03:47,322 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 01:03:47,332 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 01:03:47,332 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 01:03:47,332 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 01:03:47,332 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 01:03:47,332 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 01:03:47,333 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 01:03:47,333 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 01:03:47,336 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-12 01:03:47,338 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-10-12 01:03:47,338 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-10-12 01:03:47,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:03:47,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:03:47,342 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 01:03:47,343 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2024-10-12 01:03:47,348 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-12 01:03:47,348 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-10-12 01:03:47,348 INFO L474 LassoAnalysis]: Proved termination. [2024-10-12 01:03:47,349 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(~e_c~0) = -1*~e_c~0 + 1 Supporting invariants [] [2024-10-12 01:03:47,360 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2024-10-12 01:03:47,363 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-10-12 01:03:47,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 01:03:47,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:03:47,412 INFO L255 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 01:03:47,413 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 01:03:47,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:03:47,463 INFO L255 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-12 01:03:47,463 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 01:03:47,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 01:03:47,527 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2024-10-12 01:03:47,528 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 333 states and 564 transitions. cyclomatic complexity: 232 Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 01:03:47,628 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 333 states and 564 transitions. cyclomatic complexity: 232. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 1203 states and 2018 transitions. Complement of second has 5 states. [2024-10-12 01:03:47,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2024-10-12 01:03:47,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 01:03:47,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 376 transitions. [2024-10-12 01:03:47,631 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 376 transitions. Stem has 24 letters. Loop has 28 letters. [2024-10-12 01:03:47,632 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 01:03:47,632 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 376 transitions. Stem has 52 letters. Loop has 28 letters. [2024-10-12 01:03:47,633 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 01:03:47,633 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 376 transitions. Stem has 24 letters. Loop has 56 letters. [2024-10-12 01:03:47,634 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 01:03:47,634 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1203 states and 2018 transitions. [2024-10-12 01:03:47,643 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 858 [2024-10-12 01:03:47,648 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1203 states to 1203 states and 2018 transitions. [2024-10-12 01:03:47,648 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 906 [2024-10-12 01:03:47,649 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 911 [2024-10-12 01:03:47,649 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1203 states and 2018 transitions. [2024-10-12 01:03:47,649 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 01:03:47,650 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1203 states and 2018 transitions. [2024-10-12 01:03:47,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1203 states and 2018 transitions. [2024-10-12 01:03:47,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1203 to 912. [2024-10-12 01:03:47,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 912 states, 912 states have (on average 1.6798245614035088) internal successors, (1532), 911 states have internal predecessors, (1532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 01:03:47,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 912 states to 912 states and 1532 transitions. [2024-10-12 01:03:47,666 INFO L240 hiAutomatonCegarLoop]: Abstraction has 912 states and 1532 transitions. [2024-10-12 01:03:47,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 01:03:47,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 01:03:47,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 01:03:47,666 INFO L87 Difference]: Start difference. First operand 912 states and 1532 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 01:03:47,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 01:03:47,749 INFO L93 Difference]: Finished difference Result 1522 states and 2526 transitions. [2024-10-12 01:03:47,749 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1522 states and 2526 transitions. [2024-10-12 01:03:47,756 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 1015 [2024-10-12 01:03:47,762 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1522 states to 1522 states and 2526 transitions. [2024-10-12 01:03:47,762 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1118 [2024-10-12 01:03:47,764 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1118 [2024-10-12 01:03:47,764 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1522 states and 2526 transitions. [2024-10-12 01:03:47,764 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 01:03:47,764 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1522 states and 2526 transitions. [2024-10-12 01:03:47,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1522 states and 2526 transitions. [2024-10-12 01:03:47,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1522 to 1469. [2024-10-12 01:03:47,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1469 states, 1469 states have (on average 1.6589516678012253) internal successors, (2437), 1468 states have internal predecessors, (2437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 01:03:47,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1469 states to 1469 states and 2437 transitions. [2024-10-12 01:03:47,783 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1469 states and 2437 transitions. [2024-10-12 01:03:47,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 01:03:47,784 INFO L425 stractBuchiCegarLoop]: Abstraction has 1469 states and 2437 transitions. [2024-10-12 01:03:47,784 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-10-12 01:03:47,784 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1469 states and 2437 transitions. [2024-10-12 01:03:47,789 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 1013 [2024-10-12 01:03:47,789 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 01:03:47,789 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 01:03:47,790 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 01:03:47,790 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 01:03:47,791 INFO L745 eck$LassoCheckResult]: Stem: 6118#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 6119#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~0#1;havoc main_~__retres1~0#1;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; 6148#L404 assume !(1 == ~c_req_up~0); 6191#L404-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 6088#L415-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 6089#L420-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 6165#L425-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 6142#L430-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 6143#L435-1 assume !(0 == ~e_f~0); 6099#L440-1 assume !(0 == ~e_g~0); 6100#L445-1 assume !(0 == ~e_e~0); 6151#L450-1 assume !(0 == ~e_c~0); 6086#L455-1 assume !(0 == ~e_wl~0); 6087#L460-1 assume !(1 == ~wl_pc~0); 6227#$Ultimate##44 assume !(2 == ~wl_pc~0); 6173#L473 assume !(1 == ~c1_pc~0); 6291#L483 assume !(1 == ~c2_pc~0); 6287#L492 assume !(1 == ~wb_pc~0); 6150#L501 assume !(1 == ~e_c~0); 6116#L510-1 assume !(1 == ~e_e~0); 6117#L515-1 assume 1 == ~e_f~0;~e_f~0 := 2; 6064#L520-1 assume !(1 == ~e_g~0); 6065#L525-1 assume !(1 == ~e_c~0); 6152#L530-1 assume !(1 == ~e_wl~0); 6196#L672-1 [2024-10-12 01:03:47,791 INFO L747 eck$LassoCheckResult]: Loop: 6196#L672-1 assume !false; 6030#L542 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 6031#L377 assume !false; 6297#L295 assume !(0 == ~wl_st~0); 7264#L299 assume !(0 == ~c1_st~0); 7263#L302 assume !(0 == ~c2_st~0); 7262#L305 assume !(0 == ~wb_st~0); 7260#L308 assume !(0 == ~r_st~0); 7259#eval_returnLabel#1 havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; 7257#L548 assume !(1 == ~c_req_up~0); 7256#L548-2 start_simulation_~kernel_st~0#1 := 3; 7255#L560 assume 0 == ~e_f~0;~e_f~0 := 1; 7130#L560-2 assume 0 == ~e_g~0;~e_g~0 := 1; 6080#L565-1 assume 0 == ~e_e~0;~e_e~0 := 1; 6081#L570-1 assume 0 == ~e_c~0;~e_c~0 := 1; 6969#L575-1 assume !(0 == ~e_wl~0); 6898#L580-1 assume 1 == ~wl_pc~0; 6964#L586 assume 1 == ~e_wl~0;~wl_st~0 := 0; 6235#L593 assume !(1 == ~c1_pc~0); 6162#L603 assume !(1 == ~c2_pc~0); 6014#L612 assume !(1 == ~wb_pc~0); 6016#L621 assume 1 == ~e_c~0;~r_st~0 := 0; 6970#L630-1 assume 1 == ~e_e~0;~e_e~0 := 2; 6925#L635-1 assume 1 == ~e_f~0;~e_f~0 := 2; 6924#L640-1 assume 1 == ~e_g~0;~e_g~0 := 2; 6922#L645-1 assume 1 == ~e_c~0;~e_c~0 := 2; 6921#L650-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 6899#L655-1 assume 0 == ~wl_st~0; 6196#L672-1 [2024-10-12 01:03:47,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 01:03:47,792 INFO L85 PathProgramCache]: Analyzing trace with hash 255545497, now seen corresponding path program 1 times [2024-10-12 01:03:47,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 01:03:47,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326670790] [2024-10-12 01:03:47,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 01:03:47,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 01:03:47,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:03:47,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 01:03:47,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 01:03:47,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326670790] [2024-10-12 01:03:47,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326670790] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 01:03:47,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 01:03:47,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 01:03:47,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093793271] [2024-10-12 01:03:47,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 01:03:47,843 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-12 01:03:47,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 01:03:47,844 INFO L85 PathProgramCache]: Analyzing trace with hash -1951233099, now seen corresponding path program 2 times [2024-10-12 01:03:47,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 01:03:47,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524288275] [2024-10-12 01:03:47,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 01:03:47,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 01:03:47,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 01:03:47,848 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 01:03:47,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 01:03:47,852 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 01:03:48,042 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2024-10-12 01:03:48,111 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 01:03:48,111 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 01:03:48,111 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 01:03:48,111 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 01:03:48,111 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-10-12 01:03:48,111 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:03:48,112 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 01:03:48,112 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 01:03:48,112 INFO L132 ssoRankerPreferences]: Filename of dumped script: toy2.cil.c_Iteration8_Loop [2024-10-12 01:03:48,112 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 01:03:48,112 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 01:03:48,113 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:48,119 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:48,121 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:48,123 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:48,125 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:48,128 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:48,130 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:48,135 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:48,137 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:48,143 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:48,147 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:48,148 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:48,151 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:48,155 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:48,159 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:48,161 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:48,163 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:48,165 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:48,167 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:48,168 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:48,173 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:48,175 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:48,177 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:48,179 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:48,183 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:48,363 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 01:03:48,363 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-10-12 01:03:48,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:03:48,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:03:48,371 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 01:03:48,374 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2024-10-12 01:03:48,374 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 01:03:48,375 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 01:03:48,402 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-12 01:03:48,403 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~c2_st~0=-1} Honda state: {~c2_st~0=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-10-12 01:03:48,419 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2024-10-12 01:03:48,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:03:48,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:03:48,421 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 01:03:48,423 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2024-10-12 01:03:48,424 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 01:03:48,424 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 01:03:48,446 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-12 01:03:48,446 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_#t~nondet6#1=0} Honda state: {ULTIMATE.start_eval_#t~nondet6#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-10-12 01:03:48,457 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2024-10-12 01:03:48,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:03:48,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:03:48,459 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 01:03:48,460 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2024-10-12 01:03:48,460 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 01:03:48,460 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 01:03:48,472 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-12 01:03:48,472 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_#t~nondet8#1=0} Honda state: {ULTIMATE.start_eval_#t~nondet8#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-10-12 01:03:48,483 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2024-10-12 01:03:48,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:03:48,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:03:48,486 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 01:03:48,487 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2024-10-12 01:03:48,488 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 01:03:48,488 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 01:03:48,506 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-12 01:03:48,507 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~c1_st~0=4} Honda state: {~c1_st~0=4} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-10-12 01:03:48,517 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2024-10-12 01:03:48,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:03:48,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:03:48,519 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 01:03:48,520 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2024-10-12 01:03:48,520 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 01:03:48,520 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 01:03:48,541 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2024-10-12 01:03:48,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:03:48,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:03:48,543 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 01:03:48,544 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2024-10-12 01:03:48,545 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-10-12 01:03:48,545 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 01:03:48,561 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-10-12 01:03:48,572 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2024-10-12 01:03:48,573 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 01:03:48,573 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 01:03:48,573 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 01:03:48,573 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 01:03:48,573 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-12 01:03:48,573 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:03:48,573 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 01:03:48,573 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 01:03:48,573 INFO L132 ssoRankerPreferences]: Filename of dumped script: toy2.cil.c_Iteration8_Loop [2024-10-12 01:03:48,573 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 01:03:48,573 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 01:03:48,575 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:48,580 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:48,582 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:48,584 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:48,585 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:48,589 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:48,591 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:48,594 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:48,596 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:48,599 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:48,601 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:48,604 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:48,606 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:48,607 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:48,611 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:48,612 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:48,614 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:48,615 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:48,617 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:48,621 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:48,623 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:48,624 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:48,628 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:48,630 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:48,636 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:48,786 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 01:03:48,786 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-12 01:03:48,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:03:48,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:03:48,788 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 01:03:48,789 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2024-10-12 01:03:48,790 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 01:03:48,805 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 01:03:48,805 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 01:03:48,805 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 01:03:48,805 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2024-10-12 01:03:48,805 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 01:03:48,809 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2024-10-12 01:03:48,810 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 01:03:48,812 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 01:03:48,823 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2024-10-12 01:03:48,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:03:48,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:03:48,828 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 01:03:48,829 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2024-10-12 01:03:48,830 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 01:03:48,840 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 01:03:48,840 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 01:03:48,840 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 01:03:48,840 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 01:03:48,840 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 01:03:48,841 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 01:03:48,841 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 01:03:48,842 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 01:03:48,852 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2024-10-12 01:03:48,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:03:48,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:03:48,854 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 01:03:48,855 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2024-10-12 01:03:48,855 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 01:03:48,865 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 01:03:48,866 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 01:03:48,866 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 01:03:48,866 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 01:03:48,866 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 01:03:48,867 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 01:03:48,867 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 01:03:48,868 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 01:03:48,879 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2024-10-12 01:03:48,880 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:03:48,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:03:48,881 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 01:03:48,882 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2024-10-12 01:03:48,885 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 01:03:48,896 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 01:03:48,896 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 01:03:48,896 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 01:03:48,896 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2024-10-12 01:03:48,896 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 01:03:48,899 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2024-10-12 01:03:48,899 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 01:03:48,902 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 01:03:48,913 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2024-10-12 01:03:48,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:03:48,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:03:48,916 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 01:03:48,917 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2024-10-12 01:03:48,918 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 01:03:48,928 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 01:03:48,928 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 01:03:48,928 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 01:03:48,928 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 01:03:48,928 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 01:03:48,930 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 01:03:48,930 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 01:03:48,932 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-12 01:03:48,934 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-10-12 01:03:48,934 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-10-12 01:03:48,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:03:48,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:03:48,938 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 01:03:48,944 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2024-10-12 01:03:48,945 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-12 01:03:48,945 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-10-12 01:03:48,945 INFO L474 LassoAnalysis]: Proved termination. [2024-10-12 01:03:48,945 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(~e_c~0) = -1*~e_c~0 + 1 Supporting invariants [] [2024-10-12 01:03:48,972 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2024-10-12 01:03:48,973 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-10-12 01:03:48,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 01:03:49,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:03:49,028 INFO L255 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 01:03:49,029 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 01:03:49,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:03:49,068 INFO L255 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-12 01:03:49,068 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 01:03:49,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 01:03:49,127 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2024-10-12 01:03:49,127 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1469 states and 2437 transitions. cyclomatic complexity: 973 Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 01:03:49,168 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1469 states and 2437 transitions. cyclomatic complexity: 973. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 3132 states and 5186 transitions. Complement of second has 5 states. [2024-10-12 01:03:49,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2024-10-12 01:03:49,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 01:03:49,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 374 transitions. [2024-10-12 01:03:49,170 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 374 transitions. Stem has 24 letters. Loop has 28 letters. [2024-10-12 01:03:49,170 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 01:03:49,170 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 374 transitions. Stem has 52 letters. Loop has 28 letters. [2024-10-12 01:03:49,170 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 01:03:49,171 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 374 transitions. Stem has 24 letters. Loop has 56 letters. [2024-10-12 01:03:49,171 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 01:03:49,171 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3132 states and 5186 transitions. [2024-10-12 01:03:49,185 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 2026 [2024-10-12 01:03:49,196 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3132 states to 3132 states and 5186 transitions. [2024-10-12 01:03:49,196 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2087 [2024-10-12 01:03:49,197 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2096 [2024-10-12 01:03:49,197 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3132 states and 5186 transitions. [2024-10-12 01:03:49,198 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 01:03:49,198 INFO L218 hiAutomatonCegarLoop]: Abstraction has 3132 states and 5186 transitions. [2024-10-12 01:03:49,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3132 states and 5186 transitions. [2024-10-12 01:03:49,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3132 to 1927. [2024-10-12 01:03:49,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1927 states, 1927 states have (on average 1.6564608199273483) internal successors, (3192), 1926 states have internal predecessors, (3192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 01:03:49,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1927 states to 1927 states and 3192 transitions. [2024-10-12 01:03:49,223 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1927 states and 3192 transitions. [2024-10-12 01:03:49,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 01:03:49,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 01:03:49,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 01:03:49,223 INFO L87 Difference]: Start difference. First operand 1927 states and 3192 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 01:03:49,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 01:03:49,301 INFO L93 Difference]: Finished difference Result 3375 states and 5492 transitions. [2024-10-12 01:03:49,301 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3375 states and 5492 transitions. [2024-10-12 01:03:49,314 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 1952 [2024-10-12 01:03:49,324 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3375 states to 3375 states and 5492 transitions. [2024-10-12 01:03:49,325 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2068 [2024-10-12 01:03:49,326 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2068 [2024-10-12 01:03:49,326 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3375 states and 5492 transitions. [2024-10-12 01:03:49,326 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 01:03:49,326 INFO L218 hiAutomatonCegarLoop]: Abstraction has 3375 states and 5492 transitions. [2024-10-12 01:03:49,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3375 states and 5492 transitions. [2024-10-12 01:03:49,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3375 to 3342. [2024-10-12 01:03:49,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3342 states, 3342 states have (on average 1.6334530221424297) internal successors, (5459), 3341 states have internal predecessors, (5459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 01:03:49,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3342 states to 3342 states and 5459 transitions. [2024-10-12 01:03:49,365 INFO L240 hiAutomatonCegarLoop]: Abstraction has 3342 states and 5459 transitions. [2024-10-12 01:03:49,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 01:03:49,366 INFO L425 stractBuchiCegarLoop]: Abstraction has 3342 states and 5459 transitions. [2024-10-12 01:03:49,366 INFO L332 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2024-10-12 01:03:49,366 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3342 states and 5459 transitions. [2024-10-12 01:03:49,375 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 1946 [2024-10-12 01:03:49,375 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 01:03:49,375 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 01:03:49,376 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 01:03:49,376 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 01:03:49,376 INFO L745 eck$LassoCheckResult]: Stem: 16202#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 16203#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~0#1;havoc main_~__retres1~0#1;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; 16235#L404 assume !(1 == ~c_req_up~0); 16284#L404-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 16285#L415-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 16256#L420-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 16257#L425-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 16230#L430-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 16231#L435-1 assume !(0 == ~e_f~0); 16183#L440-1 assume !(0 == ~e_g~0); 16184#L445-1 assume !(0 == ~e_e~0); 16246#L450-1 assume 0 == ~e_c~0;~e_c~0 := 1; 16171#L455-1 assume !(0 == ~e_wl~0); 16172#L460-1 assume !(1 == ~wl_pc~0); 16358#$Ultimate##44 assume !(2 == ~wl_pc~0); 16266#L473 assume !(1 == ~c1_pc~0); 16371#L483 assume !(1 == ~c2_pc~0); 16152#L492 assume !(1 == ~wb_pc~0); 16263#L501 assume !(1 == ~e_c~0); 16264#L510-1 assume !(1 == ~e_e~0); 16422#L515-1 assume !(1 == ~e_f~0); 16423#L520-1 assume !(1 == ~e_g~0); 16418#L525-1 assume !(1 == ~e_c~0); 16419#L530-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 16340#L672-1 assume !false; 16440#L542 [2024-10-12 01:03:49,376 INFO L747 eck$LassoCheckResult]: Loop: 16440#L542 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 18351#L377 assume !false; 18352#L295 assume !(0 == ~wl_st~0); 18748#L299 assume !(0 == ~c1_st~0); 18747#L302 assume !(0 == ~c2_st~0); 18746#L305 assume !(0 == ~wb_st~0); 18094#L308 assume !(0 == ~r_st~0); 16347#eval_returnLabel#1 havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; 16348#L548 assume !(1 == ~c_req_up~0); 18470#L548-2 start_simulation_~kernel_st~0#1 := 3; 18471#L560 assume !(0 == ~e_f~0); 18744#L560-2 assume 0 == ~e_g~0;~e_g~0 := 1; 18737#L565-1 assume 0 == ~e_e~0;~e_e~0 := 1; 18738#L570-1 assume !(0 == ~e_c~0); 18728#L575-1 assume !(0 == ~e_wl~0); 18726#L580-1 assume 1 == ~wl_pc~0; 18724#L586 assume 1 == ~e_wl~0;~wl_st~0 := 0; 18725#L593 assume !(1 == ~c1_pc~0); 18860#L603 assume !(1 == ~c2_pc~0); 18857#L612 assume !(1 == ~wb_pc~0); 18854#L621 assume 1 == ~e_c~0;~r_st~0 := 0; 18852#L630-1 assume 1 == ~e_e~0;~e_e~0 := 2; 18850#L635-1 assume !(1 == ~e_f~0); 18847#L640-1 assume 1 == ~e_g~0;~e_g~0 := 2; 18845#L645-1 assume !(1 == ~e_c~0); 18844#L650-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 17610#L655-1 assume 0 == ~wl_st~0; 18841#L672-1 assume !false; 16440#L542 [2024-10-12 01:03:49,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 01:03:49,377 INFO L85 PathProgramCache]: Analyzing trace with hash 344940224, now seen corresponding path program 1 times [2024-10-12 01:03:49,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 01:03:49,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155230065] [2024-10-12 01:03:49,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 01:03:49,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 01:03:49,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:03:49,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 01:03:49,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 01:03:49,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155230065] [2024-10-12 01:03:49,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155230065] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 01:03:49,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 01:03:49,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 01:03:49,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121594177] [2024-10-12 01:03:49,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 01:03:49,436 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-12 01:03:49,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 01:03:49,436 INFO L85 PathProgramCache]: Analyzing trace with hash 1890226441, now seen corresponding path program 1 times [2024-10-12 01:03:49,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 01:03:49,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952687935] [2024-10-12 01:03:49,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 01:03:49,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 01:03:49,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:03:49,448 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2024-10-12 01:03:49,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 01:03:49,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 01:03:49,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952687935] [2024-10-12 01:03:49,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952687935] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 01:03:49,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 01:03:49,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 01:03:49,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097482044] [2024-10-12 01:03:49,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 01:03:49,450 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-12 01:03:49,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 01:03:49,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 01:03:49,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 01:03:49,450 INFO L87 Difference]: Start difference. First operand 3342 states and 5459 transitions. cyclomatic complexity: 2132 Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 01:03:49,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 01:03:49,507 INFO L93 Difference]: Finished difference Result 3395 states and 5500 transitions. [2024-10-12 01:03:49,507 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3395 states and 5500 transitions. [2024-10-12 01:03:49,521 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 1979 [2024-10-12 01:03:49,539 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3395 states to 3395 states and 5500 transitions. [2024-10-12 01:03:49,540 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2098 [2024-10-12 01:03:49,544 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2098 [2024-10-12 01:03:49,544 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3395 states and 5500 transitions. [2024-10-12 01:03:49,544 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 01:03:49,544 INFO L218 hiAutomatonCegarLoop]: Abstraction has 3395 states and 5500 transitions. [2024-10-12 01:03:49,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3395 states and 5500 transitions. [2024-10-12 01:03:49,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3395 to 3141. [2024-10-12 01:03:49,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3141 states, 3141 states have (on average 1.6275071633237823) internal successors, (5112), 3140 states have internal predecessors, (5112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 01:03:49,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3141 states to 3141 states and 5112 transitions. [2024-10-12 01:03:49,625 INFO L240 hiAutomatonCegarLoop]: Abstraction has 3141 states and 5112 transitions. [2024-10-12 01:03:49,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 01:03:49,626 INFO L425 stractBuchiCegarLoop]: Abstraction has 3141 states and 5112 transitions. [2024-10-12 01:03:49,630 INFO L332 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2024-10-12 01:03:49,630 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3141 states and 5112 transitions. [2024-10-12 01:03:49,636 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 1979 [2024-10-12 01:03:49,640 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 01:03:49,640 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 01:03:49,641 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 01:03:49,641 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 01:03:49,641 INFO L745 eck$LassoCheckResult]: Stem: 22950#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 22951#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~0#1;havoc main_~__retres1~0#1;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; 22980#L404 assume !(1 == ~c_req_up~0); 23044#L404-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 22919#L415-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 22920#L420-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 23077#L425-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 22975#L430-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 22976#L435-1 assume !(0 == ~e_f~0); 22930#L440-1 assume !(0 == ~e_g~0); 22931#L445-1 assume !(0 == ~e_e~0); 22991#L450-1 assume !(0 == ~e_c~0); 22917#L455-1 assume !(0 == ~e_wl~0); 22918#L460-1 assume !(1 == ~wl_pc~0); 23086#$Ultimate##44 assume !(2 == ~wl_pc~0); 23010#L473 assume !(1 == ~c1_pc~0); 23157#L483 assume !(1 == ~c2_pc~0); 23156#L492 assume !(1 == ~wb_pc~0); 23150#L501 assume !(1 == ~e_c~0); 23151#L510-1 assume !(1 == ~e_e~0); 22921#L515-1 assume !(1 == ~e_f~0); 22922#L520-1 assume !(1 == ~e_g~0); 22985#L525-1 assume !(1 == ~e_c~0); 22986#L530-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 23074#L672-1 assume !false; 25327#L542 [2024-10-12 01:03:49,641 INFO L747 eck$LassoCheckResult]: Loop: 25327#L542 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 25326#L377 assume !false; 25325#L295 assume !(0 == ~wl_st~0); 24890#L299 assume !(0 == ~c1_st~0); 24884#L302 assume !(0 == ~c2_st~0); 24885#L305 assume !(0 == ~wb_st~0); 24876#L308 assume !(0 == ~r_st~0); 24878#eval_returnLabel#1 havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; 24546#L548 assume !(1 == ~c_req_up~0); 24547#L548-2 start_simulation_~kernel_st~0#1 := 3; 22927#L560 assume !(0 == ~e_f~0); 22928#L560-2 assume 0 == ~e_g~0;~e_g~0 := 1; 23087#L565-1 assume 0 == ~e_e~0;~e_e~0 := 1; 25820#L570-1 assume !(0 == ~e_c~0); 25415#L575-1 assume !(0 == ~e_wl~0); 25412#L580-1 assume 1 == ~wl_pc~0; 25411#L586 assume 1 == ~e_wl~0;~wl_st~0 := 0; 23093#L593 assume !(1 == ~c1_pc~0); 25398#L603 assume !(1 == ~c2_pc~0); 25393#L612 assume !(1 == ~wb_pc~0); 25387#L621 assume !(1 == ~e_c~0); 25384#L630-1 assume 1 == ~e_e~0;~e_e~0 := 2; 25381#L635-1 assume !(1 == ~e_f~0); 25378#L640-1 assume 1 == ~e_g~0;~e_g~0 := 2; 25374#L645-1 assume !(1 == ~e_c~0); 25369#L650-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 25360#L655-1 assume 0 == ~wl_st~0; 25358#L672-1 assume !false; 25327#L542 [2024-10-12 01:03:49,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 01:03:49,645 INFO L85 PathProgramCache]: Analyzing trace with hash -666177026, now seen corresponding path program 1 times [2024-10-12 01:03:49,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 01:03:49,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950111661] [2024-10-12 01:03:49,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 01:03:49,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 01:03:49,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:03:49,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 01:03:49,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 01:03:49,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950111661] [2024-10-12 01:03:49,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950111661] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 01:03:49,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 01:03:49,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 01:03:49,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990164989] [2024-10-12 01:03:49,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 01:03:49,693 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-12 01:03:49,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 01:03:49,694 INFO L85 PathProgramCache]: Analyzing trace with hash 1080879815, now seen corresponding path program 1 times [2024-10-12 01:03:49,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 01:03:49,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818667490] [2024-10-12 01:03:49,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 01:03:49,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 01:03:49,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 01:03:49,701 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 01:03:49,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 01:03:49,705 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 01:03:49,876 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 01:03:49,876 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 01:03:49,876 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 01:03:49,876 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 01:03:49,876 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-10-12 01:03:49,876 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:03:49,876 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 01:03:49,876 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 01:03:49,876 INFO L132 ssoRankerPreferences]: Filename of dumped script: toy2.cil.c_Iteration10_Loop [2024-10-12 01:03:49,876 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 01:03:49,877 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 01:03:49,878 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:49,884 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:49,886 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:49,887 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:49,891 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:49,893 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:49,895 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:49,896 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:49,898 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:49,901 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:49,904 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:49,906 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:49,909 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:49,911 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:49,912 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:49,916 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:49,917 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:49,918 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:49,920 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:49,922 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:49,924 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:49,927 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:49,928 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:49,929 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:49,931 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:50,086 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 01:03:50,087 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-10-12 01:03:50,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:03:50,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:03:50,088 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 01:03:50,090 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2024-10-12 01:03:50,092 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 01:03:50,092 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 01:03:50,107 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-12 01:03:50,107 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_#t~nondet4#1=0} Honda state: {ULTIMATE.start_eval_#t~nondet4#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-10-12 01:03:50,120 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2024-10-12 01:03:50,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:03:50,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:03:50,125 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 01:03:50,132 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2024-10-12 01:03:50,133 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 01:03:50,133 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 01:03:50,148 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-12 01:03:50,148 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_~tmp~0#1=0} Honda state: {ULTIMATE.start_eval_~tmp~0#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-10-12 01:03:50,163 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2024-10-12 01:03:50,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:03:50,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:03:50,168 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 01:03:50,172 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2024-10-12 01:03:50,173 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 01:03:50,173 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 01:03:50,191 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-12 01:03:50,191 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~r_st~0=-1} Honda state: {~r_st~0=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-10-12 01:03:50,203 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2024-10-12 01:03:50,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:03:50,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:03:50,205 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 01:03:50,207 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2024-10-12 01:03:50,208 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 01:03:50,208 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 01:03:50,234 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2024-10-12 01:03:50,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:03:50,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:03:50,239 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 01:03:50,240 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2024-10-12 01:03:50,240 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-10-12 01:03:50,240 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 01:03:50,254 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-10-12 01:03:50,270 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2024-10-12 01:03:50,270 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 01:03:50,270 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 01:03:50,270 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 01:03:50,271 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 01:03:50,271 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-12 01:03:50,271 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:03:50,271 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 01:03:50,271 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 01:03:50,271 INFO L132 ssoRankerPreferences]: Filename of dumped script: toy2.cil.c_Iteration10_Loop [2024-10-12 01:03:50,271 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 01:03:50,271 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 01:03:50,272 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:50,279 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:50,280 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:50,293 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:50,303 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:50,308 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:50,309 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:50,314 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:50,319 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:50,324 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:50,333 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:50,334 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:50,335 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:50,342 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:50,350 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:50,355 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:50,364 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:50,365 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:50,366 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:50,370 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:50,375 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:50,376 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:50,380 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:50,382 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:50,383 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:03:50,527 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 01:03:50,528 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-12 01:03:50,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:03:50,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:03:50,529 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 01:03:50,538 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2024-10-12 01:03:50,539 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 01:03:50,549 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 01:03:50,549 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 01:03:50,549 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 01:03:50,549 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 01:03:50,549 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 01:03:50,550 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 01:03:50,550 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 01:03:50,553 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 01:03:50,563 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2024-10-12 01:03:50,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:03:50,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:03:50,566 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 01:03:50,567 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2024-10-12 01:03:50,568 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 01:03:50,578 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 01:03:50,578 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 01:03:50,578 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 01:03:50,578 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 01:03:50,578 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 01:03:50,579 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 01:03:50,579 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 01:03:50,580 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 01:03:50,591 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2024-10-12 01:03:50,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:03:50,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:03:50,593 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 01:03:50,593 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2024-10-12 01:03:50,594 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 01:03:50,604 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 01:03:50,604 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 01:03:50,605 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 01:03:50,605 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2024-10-12 01:03:50,605 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 01:03:50,605 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2024-10-12 01:03:50,605 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 01:03:50,607 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 01:03:50,621 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2024-10-12 01:03:50,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:03:50,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:03:50,623 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 01:03:50,624 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2024-10-12 01:03:50,625 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 01:03:50,634 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 01:03:50,634 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 01:03:50,634 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 01:03:50,634 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 01:03:50,634 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 01:03:50,635 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 01:03:50,635 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 01:03:50,637 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-12 01:03:50,639 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-10-12 01:03:50,639 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-10-12 01:03:50,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:03:50,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:03:50,640 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 01:03:50,641 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2024-10-12 01:03:50,641 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-12 01:03:50,641 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-10-12 01:03:50,641 INFO L474 LassoAnalysis]: Proved termination. [2024-10-12 01:03:50,641 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(~e_e~0) = -1*~e_e~0 + 1 Supporting invariants [] [2024-10-12 01:03:50,651 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2024-10-12 01:03:50,652 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-10-12 01:03:50,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 01:03:50,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:03:50,697 INFO L255 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 01:03:50,698 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 01:03:50,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:03:50,734 INFO L255 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-12 01:03:50,735 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 01:03:50,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 01:03:50,795 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2024-10-12 01:03:50,795 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 3141 states and 5112 transitions. cyclomatic complexity: 1984 Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 01:03:50,895 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 3141 states and 5112 transitions. cyclomatic complexity: 1984. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 6730 states and 10970 transitions. Complement of second has 5 states. [2024-10-12 01:03:50,896 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2024-10-12 01:03:50,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2024-10-12 01:03:50,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 01:03:50,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 204 transitions. [2024-10-12 01:03:50,897 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 204 transitions. Stem has 25 letters. Loop has 28 letters. [2024-10-12 01:03:50,898 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 01:03:50,898 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 204 transitions. Stem has 53 letters. Loop has 28 letters. [2024-10-12 01:03:50,898 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 01:03:50,898 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 204 transitions. Stem has 25 letters. Loop has 56 letters. [2024-10-12 01:03:50,898 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 01:03:50,898 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 6730 states and 10970 transitions. [2024-10-12 01:03:50,917 INFO L131 ngComponentsAnalysis]: Automaton has 15 accepting balls. 3115 [2024-10-12 01:03:50,939 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 6730 states to 6730 states and 10970 transitions. [2024-10-12 01:03:50,939 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3227 [2024-10-12 01:03:50,941 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3262 [2024-10-12 01:03:50,941 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6730 states and 10970 transitions. [2024-10-12 01:03:50,941 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 01:03:50,941 INFO L218 hiAutomatonCegarLoop]: Abstraction has 6730 states and 10970 transitions. [2024-10-12 01:03:50,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6730 states and 10970 transitions. [2024-10-12 01:03:50,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6730 to 6695. [2024-10-12 01:03:51,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6695 states, 6695 states have (on average 1.6298730395817775) internal successors, (10912), 6694 states have internal predecessors, (10912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 01:03:51,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6695 states to 6695 states and 10912 transitions. [2024-10-12 01:03:51,014 INFO L240 hiAutomatonCegarLoop]: Abstraction has 6695 states and 10912 transitions. [2024-10-12 01:03:51,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 01:03:51,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 01:03:51,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 01:03:51,014 INFO L87 Difference]: Start difference. First operand 6695 states and 10912 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 01:03:51,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 01:03:51,126 INFO L93 Difference]: Finished difference Result 7180 states and 11526 transitions. [2024-10-12 01:03:51,126 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 7180 states and 11526 transitions. [2024-10-12 01:03:51,151 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 2859 [2024-10-12 01:03:51,191 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 7180 states to 7180 states and 11526 transitions. [2024-10-12 01:03:51,191 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2935 [2024-10-12 01:03:51,193 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2935 [2024-10-12 01:03:51,193 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7180 states and 11526 transitions. [2024-10-12 01:03:51,193 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 01:03:51,193 INFO L218 hiAutomatonCegarLoop]: Abstraction has 7180 states and 11526 transitions. [2024-10-12 01:03:51,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7180 states and 11526 transitions. [2024-10-12 01:03:51,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7180 to 7168. [2024-10-12 01:03:51,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7168 states, 7168 states have (on average 1.6063058035714286) internal successors, (11514), 7167 states have internal predecessors, (11514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 01:03:51,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7168 states to 7168 states and 11514 transitions. [2024-10-12 01:03:51,279 INFO L240 hiAutomatonCegarLoop]: Abstraction has 7168 states and 11514 transitions. [2024-10-12 01:03:51,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 01:03:51,280 INFO L425 stractBuchiCegarLoop]: Abstraction has 7168 states and 11514 transitions. [2024-10-12 01:03:51,280 INFO L332 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2024-10-12 01:03:51,280 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7168 states and 11514 transitions. [2024-10-12 01:03:51,293 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 2859 [2024-10-12 01:03:51,293 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 01:03:51,293 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 01:03:51,294 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 01:03:51,294 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 01:03:51,294 INFO L745 eck$LassoCheckResult]: Stem: 46881#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 46882#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~0#1;havoc main_~__retres1~0#1;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; 46917#L404 assume !(1 == ~c_req_up~0); 46965#L404-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 46849#L415-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 46850#L420-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 47017#L425-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 46909#L430-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 46910#L435-1 assume !(0 == ~e_f~0); 46861#L440-1 assume !(0 == ~e_g~0); 46862#L445-1 assume !(0 == ~e_e~0); 46920#L450-1 assume !(0 == ~e_c~0); 46847#L455-1 assume !(0 == ~e_wl~0); 46848#L460-1 assume !(1 == ~wl_pc~0); 47002#$Ultimate##44 assume !(2 == ~wl_pc~0); 46947#L473 assume !(1 == ~c1_pc~0); 47042#L483 assume !(1 == ~c2_pc~0); 46827#L492 assume !(1 == ~wb_pc~0); 46942#L501 assume !(1 == ~e_c~0); 46943#L510-1 assume !(1 == ~e_e~0); 46851#L515-1 assume !(1 == ~e_f~0); 46852#L520-1 assume !(1 == ~e_g~0); 46921#L525-1 assume !(1 == ~e_c~0); 46922#L530-1 assume !(1 == ~e_wl~0); 47014#L672-1 assume !false; 49051#L542 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 51668#L377 [2024-10-12 01:03:51,294 INFO L747 eck$LassoCheckResult]: Loop: 51668#L377 assume !false; 51666#L295 assume 0 == ~wl_st~0; 51663#L308-1 assume 0 == ~wl_st~0;havoc eval_#t~nondet4#1;eval_~tmp~0#1 := eval_#t~nondet4#1;havoc eval_#t~nondet4#1; 51664#L321 assume !(0 != eval_~tmp~0#1); 51801#L317 assume !(0 == ~c1_st~0); 51794#L332 assume !(0 == ~c2_st~0); 51005#L347 assume !(0 == ~wb_st~0); 51002#L362 assume !(0 == ~r_st~0); 51668#L377 [2024-10-12 01:03:51,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 01:03:51,295 INFO L85 PathProgramCache]: Analyzing trace with hash 823350777, now seen corresponding path program 1 times [2024-10-12 01:03:51,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 01:03:51,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783924004] [2024-10-12 01:03:51,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 01:03:51,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 01:03:51,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 01:03:51,300 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 01:03:51,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 01:03:51,309 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 01:03:51,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 01:03:51,310 INFO L85 PathProgramCache]: Analyzing trace with hash 1279860915, now seen corresponding path program 1 times [2024-10-12 01:03:51,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 01:03:51,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879858210] [2024-10-12 01:03:51,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 01:03:51,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 01:03:51,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 01:03:51,312 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 01:03:51,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 01:03:51,314 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 01:03:51,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 01:03:51,315 INFO L85 PathProgramCache]: Analyzing trace with hash 360906411, now seen corresponding path program 1 times [2024-10-12 01:03:51,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 01:03:51,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302222878] [2024-10-12 01:03:51,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 01:03:51,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 01:03:51,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:03:51,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 01:03:51,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 01:03:51,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302222878] [2024-10-12 01:03:51,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302222878] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 01:03:51,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 01:03:51,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 01:03:51,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886891982] [2024-10-12 01:03:51,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 01:03:51,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 01:03:51,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 01:03:51,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 01:03:51,377 INFO L87 Difference]: Start difference. First operand 7168 states and 11514 transitions. cyclomatic complexity: 4382 Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 01:03:51,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 01:03:51,443 INFO L93 Difference]: Finished difference Result 11016 states and 17576 transitions. [2024-10-12 01:03:51,443 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11016 states and 17576 transitions. [2024-10-12 01:03:51,471 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 4438 [2024-10-12 01:03:51,497 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11016 states to 11016 states and 17576 transitions. [2024-10-12 01:03:51,498 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4518 [2024-10-12 01:03:51,501 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4518 [2024-10-12 01:03:51,501 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11016 states and 17576 transitions. [2024-10-12 01:03:51,501 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 01:03:51,501 INFO L218 hiAutomatonCegarLoop]: Abstraction has 11016 states and 17576 transitions. [2024-10-12 01:03:51,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11016 states and 17576 transitions. [2024-10-12 01:03:51,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11016 to 11016. [2024-10-12 01:03:51,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11016 states, 11016 states have (on average 1.5954974582425563) internal successors, (17576), 11015 states have internal predecessors, (17576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 01:03:51,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11016 states to 11016 states and 17576 transitions. [2024-10-12 01:03:51,623 INFO L240 hiAutomatonCegarLoop]: Abstraction has 11016 states and 17576 transitions. [2024-10-12 01:03:51,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 01:03:51,624 INFO L425 stractBuchiCegarLoop]: Abstraction has 11016 states and 17576 transitions. [2024-10-12 01:03:51,624 INFO L332 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2024-10-12 01:03:51,624 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11016 states and 17576 transitions. [2024-10-12 01:03:51,645 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 4438 [2024-10-12 01:03:51,645 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 01:03:51,645 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 01:03:51,646 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 01:03:51,646 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 01:03:51,646 INFO L745 eck$LassoCheckResult]: Stem: 65075#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 65076#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~0#1;havoc main_~__retres1~0#1;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; 65105#L404 assume !(1 == ~c_req_up~0); 65158#L404-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 65044#L415-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 65045#L420-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 65213#L425-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 65097#L430-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 65098#L435-1 assume !(0 == ~e_f~0); 65054#L440-1 assume !(0 == ~e_g~0); 65055#L445-1 assume !(0 == ~e_e~0); 65108#L450-1 assume !(0 == ~e_c~0); 65042#L455-1 assume !(0 == ~e_wl~0); 65043#L460-1 assume !(1 == ~wl_pc~0); 65198#$Ultimate##44 assume !(2 == ~wl_pc~0); 65137#L473 assume !(1 == ~c1_pc~0); 65240#L483 assume !(1 == ~c2_pc~0); 65020#L492 assume !(1 == ~wb_pc~0); 65130#L501 assume !(1 == ~e_c~0); 65131#L510-1 assume !(1 == ~e_e~0); 65046#L515-1 assume !(1 == ~e_f~0); 65047#L520-1 assume !(1 == ~e_g~0); 65109#L525-1 assume !(1 == ~e_c~0); 65110#L530-1 assume !(1 == ~e_wl~0); 65210#L672-1 assume !false; 66474#L542 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 70648#L377 [2024-10-12 01:03:51,646 INFO L747 eck$LassoCheckResult]: Loop: 70648#L377 assume !false; 72306#L295 assume 0 == ~wl_st~0; 72304#L308-1 assume 0 == ~wl_st~0;havoc eval_#t~nondet4#1;eval_~tmp~0#1 := eval_#t~nondet4#1;havoc eval_#t~nondet4#1; 72300#L321 assume !(0 != eval_~tmp~0#1); 72301#L317 assume 0 == ~c1_st~0;havoc eval_#t~nondet5#1;eval_~tmp___0~0#1 := eval_#t~nondet5#1;havoc eval_#t~nondet5#1; 72321#L336 assume !(0 != eval_~tmp___0~0#1); 72316#L332 assume !(0 == ~c2_st~0); 72315#L347 assume !(0 == ~wb_st~0); 72311#L362 assume !(0 == ~r_st~0); 70648#L377 [2024-10-12 01:03:51,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 01:03:51,646 INFO L85 PathProgramCache]: Analyzing trace with hash 823350777, now seen corresponding path program 2 times [2024-10-12 01:03:51,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 01:03:51,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015001478] [2024-10-12 01:03:51,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 01:03:51,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 01:03:51,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 01:03:51,651 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 01:03:51,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 01:03:51,659 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 01:03:51,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 01:03:51,660 INFO L85 PathProgramCache]: Analyzing trace with hash 969256162, now seen corresponding path program 1 times [2024-10-12 01:03:51,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 01:03:51,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532849069] [2024-10-12 01:03:51,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 01:03:51,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 01:03:51,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 01:03:51,663 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 01:03:51,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 01:03:51,665 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 01:03:51,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 01:03:51,666 INFO L85 PathProgramCache]: Analyzing trace with hash -1748529686, now seen corresponding path program 1 times [2024-10-12 01:03:51,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 01:03:51,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774973447] [2024-10-12 01:03:51,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 01:03:51,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 01:03:51,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:03:51,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 01:03:51,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 01:03:51,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774973447] [2024-10-12 01:03:51,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774973447] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 01:03:51,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 01:03:51,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 01:03:51,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221131510] [2024-10-12 01:03:51,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 01:03:51,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 01:03:51,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 01:03:51,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 01:03:51,726 INFO L87 Difference]: Start difference. First operand 11016 states and 17576 transitions. cyclomatic complexity: 6596 Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 01:03:51,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 01:03:51,789 INFO L93 Difference]: Finished difference Result 17164 states and 27055 transitions. [2024-10-12 01:03:51,789 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17164 states and 27055 transitions. [2024-10-12 01:03:51,906 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 6956 [2024-10-12 01:03:51,947 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17164 states to 17164 states and 27055 transitions. [2024-10-12 01:03:51,948 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7102 [2024-10-12 01:03:51,952 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7102 [2024-10-12 01:03:51,952 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17164 states and 27055 transitions. [2024-10-12 01:03:51,952 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 01:03:51,953 INFO L218 hiAutomatonCegarLoop]: Abstraction has 17164 states and 27055 transitions. [2024-10-12 01:03:51,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17164 states and 27055 transitions. [2024-10-12 01:03:52,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17164 to 17164. [2024-10-12 01:03:52,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17164 states, 17164 states have (on average 1.5762642740619903) internal successors, (27055), 17163 states have internal predecessors, (27055), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 01:03:52,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17164 states to 17164 states and 27055 transitions. [2024-10-12 01:03:52,164 INFO L240 hiAutomatonCegarLoop]: Abstraction has 17164 states and 27055 transitions. [2024-10-12 01:03:52,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 01:03:52,165 INFO L425 stractBuchiCegarLoop]: Abstraction has 17164 states and 27055 transitions. [2024-10-12 01:03:52,165 INFO L332 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2024-10-12 01:03:52,165 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17164 states and 27055 transitions. [2024-10-12 01:03:52,188 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 6956 [2024-10-12 01:03:52,189 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 01:03:52,189 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 01:03:52,189 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 01:03:52,189 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 01:03:52,189 INFO L745 eck$LassoCheckResult]: Stem: 93260#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 93261#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~0#1;havoc main_~__retres1~0#1;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; 93291#L404 assume !(1 == ~c_req_up~0); 93361#L404-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 93230#L415-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 93231#L420-1 assume !(1 == ~c2_i~0);~c2_st~0 := 2; 93470#L425-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 95171#L430-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 95170#L435-1 assume !(0 == ~e_f~0); 95169#L440-1 assume !(0 == ~e_g~0); 95168#L445-1 assume !(0 == ~e_e~0); 95167#L450-1 assume !(0 == ~e_c~0); 95166#L455-1 assume !(0 == ~e_wl~0); 95165#L460-1 assume !(1 == ~wl_pc~0); 95162#$Ultimate##44 assume !(2 == ~wl_pc~0); 95161#L473 assume !(1 == ~c1_pc~0); 95159#L483 assume !(1 == ~c2_pc~0); 93478#L492 assume !(1 == ~wb_pc~0); 93318#L501 assume !(1 == ~e_c~0); 93319#L510-1 assume !(1 == ~e_e~0); 93232#L515-1 assume !(1 == ~e_f~0); 93233#L520-1 assume !(1 == ~e_g~0); 93295#L525-1 assume !(1 == ~e_c~0); 93296#L530-1 assume !(1 == ~e_wl~0); 93398#L672-1 assume !false; 95172#L542 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 104314#L377 [2024-10-12 01:03:52,189 INFO L747 eck$LassoCheckResult]: Loop: 104314#L377 assume !false; 107940#L295 assume 0 == ~wl_st~0; 107941#L308-1 assume 0 == ~wl_st~0;havoc eval_#t~nondet4#1;eval_~tmp~0#1 := eval_#t~nondet4#1;havoc eval_#t~nondet4#1; 105989#L321 assume !(0 != eval_~tmp~0#1); 105990#L317 assume 0 == ~c1_st~0;havoc eval_#t~nondet5#1;eval_~tmp___0~0#1 := eval_#t~nondet5#1;havoc eval_#t~nondet5#1; 107010#L336 assume !(0 != eval_~tmp___0~0#1); 107388#L332 assume !(0 == ~c2_st~0); 107419#L347 assume !(0 == ~wb_st~0); 107414#L362 assume !(0 == ~r_st~0); 104314#L377 [2024-10-12 01:03:52,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 01:03:52,190 INFO L85 PathProgramCache]: Analyzing trace with hash 1246052603, now seen corresponding path program 1 times [2024-10-12 01:03:52,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 01:03:52,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370305109] [2024-10-12 01:03:52,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 01:03:52,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 01:03:52,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:03:52,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 01:03:52,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 01:03:52,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370305109] [2024-10-12 01:03:52,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370305109] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 01:03:52,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 01:03:52,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 01:03:52,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454748826] [2024-10-12 01:03:52,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 01:03:52,206 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-12 01:03:52,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 01:03:52,206 INFO L85 PathProgramCache]: Analyzing trace with hash 969256162, now seen corresponding path program 2 times [2024-10-12 01:03:52,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 01:03:52,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457550764] [2024-10-12 01:03:52,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 01:03:52,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 01:03:52,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 01:03:52,208 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 01:03:52,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 01:03:52,209 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 01:03:52,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 01:03:52,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 01:03:52,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 01:03:52,228 INFO L87 Difference]: Start difference. First operand 17164 states and 27055 transitions. cyclomatic complexity: 9927 Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 01:03:52,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 01:03:52,327 INFO L93 Difference]: Finished difference Result 17112 states and 26968 transitions. [2024-10-12 01:03:52,334 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17112 states and 26968 transitions. [2024-10-12 01:03:52,376 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 6956 [2024-10-12 01:03:52,402 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17112 states to 17112 states and 26968 transitions. [2024-10-12 01:03:52,402 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7052 [2024-10-12 01:03:52,406 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7052 [2024-10-12 01:03:52,406 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17112 states and 26968 transitions. [2024-10-12 01:03:52,406 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 01:03:52,406 INFO L218 hiAutomatonCegarLoop]: Abstraction has 17112 states and 26968 transitions. [2024-10-12 01:03:52,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17112 states and 26968 transitions. [2024-10-12 01:03:52,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17112 to 17112. [2024-10-12 01:03:52,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17112 states, 17112 states have (on average 1.575970079476391) internal successors, (26968), 17111 states have internal predecessors, (26968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 01:03:52,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17112 states to 17112 states and 26968 transitions. [2024-10-12 01:03:52,615 INFO L240 hiAutomatonCegarLoop]: Abstraction has 17112 states and 26968 transitions. [2024-10-12 01:03:52,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 01:03:52,616 INFO L425 stractBuchiCegarLoop]: Abstraction has 17112 states and 26968 transitions. [2024-10-12 01:03:52,616 INFO L332 stractBuchiCegarLoop]: ======== Iteration 14 ============ [2024-10-12 01:03:52,616 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17112 states and 26968 transitions. [2024-10-12 01:03:52,639 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 6956 [2024-10-12 01:03:52,640 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 01:03:52,640 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 01:03:52,640 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 01:03:52,640 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 01:03:52,641 INFO L745 eck$LassoCheckResult]: Stem: 127544#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 127545#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~0#1;havoc main_~__retres1~0#1;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; 127576#L404 assume !(1 == ~c_req_up~0); 127626#L404-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 127511#L415-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 127512#L420-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 127686#L425-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 127571#L430-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 127572#L435-1 assume !(0 == ~e_f~0); 127524#L440-1 assume !(0 == ~e_g~0); 127525#L445-1 assume !(0 == ~e_e~0); 127579#L450-1 assume !(0 == ~e_c~0); 127509#L455-1 assume !(0 == ~e_wl~0); 127510#L460-1 assume !(1 == ~wl_pc~0); 127671#$Ultimate##44 assume !(2 == ~wl_pc~0); 127607#L473 assume !(1 == ~c1_pc~0); 127713#L483 assume !(1 == ~c2_pc~0); 127487#L492 assume !(1 == ~wb_pc~0); 127602#L501 assume !(1 == ~e_c~0); 127603#L510-1 assume !(1 == ~e_e~0); 127513#L515-1 assume !(1 == ~e_f~0); 127514#L520-1 assume !(1 == ~e_g~0); 127580#L525-1 assume !(1 == ~e_c~0); 127581#L530-1 assume !(1 == ~e_wl~0); 127683#L672-1 assume !false; 129632#L542 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 137103#L377 [2024-10-12 01:03:52,641 INFO L747 eck$LassoCheckResult]: Loop: 137103#L377 assume !false; 141877#L295 assume 0 == ~wl_st~0; 141378#L308-1 assume 0 == ~wl_st~0;havoc eval_#t~nondet4#1;eval_~tmp~0#1 := eval_#t~nondet4#1;havoc eval_#t~nondet4#1; 141377#L321 assume !(0 != eval_~tmp~0#1); 141376#L317 assume 0 == ~c1_st~0;havoc eval_#t~nondet5#1;eval_~tmp___0~0#1 := eval_#t~nondet5#1;havoc eval_#t~nondet5#1; 141336#L336 assume !(0 != eval_~tmp___0~0#1); 141024#L332 assume 0 == ~c2_st~0;havoc eval_#t~nondet6#1;eval_~tmp___1~0#1 := eval_#t~nondet6#1;havoc eval_#t~nondet6#1; 141020#L351 assume !(0 != eval_~tmp___1~0#1); 140965#L347 assume !(0 == ~wb_st~0); 140960#L362 assume !(0 == ~r_st~0); 137103#L377 [2024-10-12 01:03:52,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 01:03:52,641 INFO L85 PathProgramCache]: Analyzing trace with hash 823350777, now seen corresponding path program 3 times [2024-10-12 01:03:52,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 01:03:52,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465056583] [2024-10-12 01:03:52,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 01:03:52,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 01:03:52,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 01:03:52,646 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 01:03:52,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 01:03:52,650 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 01:03:52,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 01:03:52,650 INFO L85 PathProgramCache]: Analyzing trace with hash -19480801, now seen corresponding path program 1 times [2024-10-12 01:03:52,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 01:03:52,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771259938] [2024-10-12 01:03:52,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 01:03:52,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 01:03:52,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 01:03:52,652 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 01:03:52,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 01:03:52,654 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 01:03:52,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 01:03:52,654 INFO L85 PathProgramCache]: Analyzing trace with hash 1628503831, now seen corresponding path program 1 times [2024-10-12 01:03:52,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 01:03:52,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905913469] [2024-10-12 01:03:52,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 01:03:52,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 01:03:52,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:03:52,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 01:03:52,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 01:03:52,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905913469] [2024-10-12 01:03:52,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905913469] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 01:03:52,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 01:03:52,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 01:03:52,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790569196] [2024-10-12 01:03:52,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 01:03:52,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 01:03:52,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 01:03:52,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 01:03:52,695 INFO L87 Difference]: Start difference. First operand 17112 states and 26968 transitions. cyclomatic complexity: 9892 Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 01:03:52,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 01:03:52,863 INFO L93 Difference]: Finished difference Result 29109 states and 45435 transitions. [2024-10-12 01:03:52,863 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29109 states and 45435 transitions. [2024-10-12 01:03:52,952 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 11874 [2024-10-12 01:03:53,023 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29109 states to 29109 states and 45435 transitions. [2024-10-12 01:03:53,023 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12004 [2024-10-12 01:03:53,030 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12004 [2024-10-12 01:03:53,030 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29109 states and 45435 transitions. [2024-10-12 01:03:53,030 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 01:03:53,030 INFO L218 hiAutomatonCegarLoop]: Abstraction has 29109 states and 45435 transitions. [2024-10-12 01:03:53,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29109 states and 45435 transitions. [2024-10-12 01:03:53,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29109 to 29109. [2024-10-12 01:03:53,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29109 states, 29109 states have (on average 1.5608574667628567) internal successors, (45435), 29108 states have internal predecessors, (45435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 01:03:53,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29109 states to 29109 states and 45435 transitions. [2024-10-12 01:03:53,550 INFO L240 hiAutomatonCegarLoop]: Abstraction has 29109 states and 45435 transitions. [2024-10-12 01:03:53,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 01:03:53,551 INFO L425 stractBuchiCegarLoop]: Abstraction has 29109 states and 45435 transitions. [2024-10-12 01:03:53,551 INFO L332 stractBuchiCegarLoop]: ======== Iteration 15 ============ [2024-10-12 01:03:53,551 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29109 states and 45435 transitions. [2024-10-12 01:03:53,614 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 11874 [2024-10-12 01:03:53,614 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 01:03:53,614 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 01:03:53,615 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 01:03:53,615 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 01:03:53,615 INFO L745 eck$LassoCheckResult]: Stem: 173774#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 173775#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~0#1;havoc main_~__retres1~0#1;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; 173805#L404 assume !(1 == ~c_req_up~0); 173858#L404-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 173741#L415-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 173742#L420-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 173919#L425-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 173799#L430-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 173800#L435-1 assume !(0 == ~e_f~0); 173754#L440-1 assume !(0 == ~e_g~0); 173755#L445-1 assume !(0 == ~e_e~0); 173808#L450-1 assume !(0 == ~e_c~0); 173739#L455-1 assume !(0 == ~e_wl~0); 173740#L460-1 assume !(1 == ~wl_pc~0); 173902#$Ultimate##44 assume !(2 == ~wl_pc~0); 173836#L473 assume !(1 == ~c1_pc~0); 173953#L483 assume !(1 == ~c2_pc~0); 173717#L492 assume !(1 == ~wb_pc~0); 173831#L501 assume !(1 == ~e_c~0); 173832#L510-1 assume !(1 == ~e_e~0); 173743#L515-1 assume !(1 == ~e_f~0); 173744#L520-1 assume !(1 == ~e_g~0); 173809#L525-1 assume !(1 == ~e_c~0); 173810#L530-1 assume !(1 == ~e_wl~0); 176228#L672-1 assume !false; 176229#L542 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 188613#L377 [2024-10-12 01:03:53,615 INFO L747 eck$LassoCheckResult]: Loop: 188613#L377 assume !false; 197188#L295 assume 0 == ~wl_st~0; 197186#L308-1 assume 0 == ~wl_st~0;havoc eval_#t~nondet4#1;eval_~tmp~0#1 := eval_#t~nondet4#1;havoc eval_#t~nondet4#1; 197184#L321 assume !(0 != eval_~tmp~0#1); 195819#L317 assume 0 == ~c1_st~0;havoc eval_#t~nondet5#1;eval_~tmp___0~0#1 := eval_#t~nondet5#1;havoc eval_#t~nondet5#1; 195816#L336 assume !(0 != eval_~tmp___0~0#1); 195814#L332 assume 0 == ~c2_st~0;havoc eval_#t~nondet6#1;eval_~tmp___1~0#1 := eval_#t~nondet6#1;havoc eval_#t~nondet6#1; 195765#L351 assume !(0 != eval_~tmp___1~0#1); 195811#L347 assume 0 == ~wb_st~0;havoc eval_#t~nondet7#1;eval_~tmp___2~0#1 := eval_#t~nondet7#1;havoc eval_#t~nondet7#1; 196125#L366 assume !(0 != eval_~tmp___2~0#1); 196135#L362 assume !(0 == ~r_st~0); 188613#L377 [2024-10-12 01:03:53,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 01:03:53,616 INFO L85 PathProgramCache]: Analyzing trace with hash 823350777, now seen corresponding path program 4 times [2024-10-12 01:03:53,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 01:03:53,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272165310] [2024-10-12 01:03:53,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 01:03:53,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 01:03:53,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 01:03:53,621 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 01:03:53,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 01:03:53,627 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 01:03:53,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 01:03:53,627 INFO L85 PathProgramCache]: Analyzing trace with hash -603940234, now seen corresponding path program 1 times [2024-10-12 01:03:53,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 01:03:53,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656730306] [2024-10-12 01:03:53,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 01:03:53,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 01:03:53,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 01:03:53,630 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 01:03:53,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 01:03:53,632 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 01:03:53,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 01:03:53,632 INFO L85 PathProgramCache]: Analyzing trace with hash -1056024194, now seen corresponding path program 1 times [2024-10-12 01:03:53,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 01:03:53,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146893665] [2024-10-12 01:03:53,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 01:03:53,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 01:03:53,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 01:03:53,637 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 01:03:53,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 01:03:53,642 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 01:03:54,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 01:03:54,391 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 01:03:54,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 01:03:54,491 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 12.10 01:03:54 BoogieIcfgContainer [2024-10-12 01:03:54,491 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-10-12 01:03:54,492 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-12 01:03:54,492 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-12 01:03:54,492 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-12 01:03:54,492 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 01:03:45" (3/4) ... [2024-10-12 01:03:54,493 INFO L136 WitnessPrinter]: Generating witness for non-termination counterexample [2024-10-12 01:03:54,595 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-12 01:03:54,595 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-12 01:03:54,595 INFO L158 Benchmark]: Toolchain (without parser) took 10643.54ms. Allocated memory was 203.4MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 132.9MB in the beginning and 1.0GB in the end (delta: -897.8MB). Peak memory consumption was 372.7MB. Max. memory is 16.1GB. [2024-10-12 01:03:54,595 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 121.6MB. Free memory is still 83.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 01:03:54,596 INFO L158 Benchmark]: CACSL2BoogieTranslator took 270.21ms. Allocated memory is still 203.4MB. Free memory was 132.6MB in the beginning and 116.1MB in the end (delta: 16.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-12 01:03:54,596 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.03ms. Allocated memory is still 203.4MB. Free memory was 116.1MB in the beginning and 114.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-12 01:03:54,596 INFO L158 Benchmark]: Boogie Preprocessor took 42.13ms. Allocated memory is still 203.4MB. Free memory was 113.7MB in the beginning and 111.0MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-12 01:03:54,596 INFO L158 Benchmark]: RCFGBuilder took 698.33ms. Allocated memory is still 203.4MB. Free memory was 111.0MB in the beginning and 163.7MB in the end (delta: -52.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-10-12 01:03:54,597 INFO L158 Benchmark]: BuchiAutomizer took 9483.75ms. Allocated memory was 203.4MB in the beginning and 637.5MB in the end (delta: 434.1MB). Free memory was 163.7MB in the beginning and 217.1MB in the end (delta: -53.4MB). Peak memory consumption was 382.7MB. Max. memory is 16.1GB. [2024-10-12 01:03:54,597 INFO L158 Benchmark]: Witness Printer took 103.35ms. Allocated memory was 637.5MB in the beginning and 1.3GB in the end (delta: 694.2MB). Free memory was 217.1MB in the beginning and 1.0GB in the end (delta: -813.7MB). Peak memory consumption was 19.9MB. Max. memory is 16.1GB. [2024-10-12 01:03:54,598 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 121.6MB. Free memory is still 83.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 270.21ms. Allocated memory is still 203.4MB. Free memory was 132.6MB in the beginning and 116.1MB in the end (delta: 16.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.03ms. Allocated memory is still 203.4MB. Free memory was 116.1MB in the beginning and 114.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 42.13ms. Allocated memory is still 203.4MB. Free memory was 113.7MB in the beginning and 111.0MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 698.33ms. Allocated memory is still 203.4MB. Free memory was 111.0MB in the beginning and 163.7MB in the end (delta: -52.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * BuchiAutomizer took 9483.75ms. Allocated memory was 203.4MB in the beginning and 637.5MB in the end (delta: 434.1MB). Free memory was 163.7MB in the beginning and 217.1MB in the end (delta: -53.4MB). Peak memory consumption was 382.7MB. Max. memory is 16.1GB. * Witness Printer took 103.35ms. Allocated memory was 637.5MB in the beginning and 1.3GB in the end (delta: 694.2MB). Free memory was 217.1MB in the beginning and 1.0GB in the end (delta: -813.7MB). Peak memory consumption was 19.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 17 terminating modules (14 trivial, 3 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function (((long long) -1 * e_c) + 1) and consists of 3 locations. One deterministic module has affine ranking function (((long long) -1 * e_c) + 1) and consists of 3 locations. One deterministic module has affine ranking function (((long long) -1 * e_e) + 1) and consists of 3 locations. 14 modules have a trivial ranking function, the largest among these consists of 4 locations. The remainder module has 29109 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 9.3s and 15 iterations. TraceHistogramMax:1. Analysis of lassos took 5.2s. Construction of modules took 0.3s. Büchi inclusion checks took 3.2s. Highest rank in rank-based complementation 3. Minimization of det autom 6. Minimization of nondet autom 11. Automata minimization 1.5s AutomataMinimizationTime, 17 MinimizatonAttempts, 1885 StatesRemovedByMinimization, 8 NontrivialMinimizations. Non-live state removal took 0.6s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4258 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4255 mSDsluCounter, 7039 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2579 mSDsCounter, 108 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 357 IncrementalHoareTripleChecker+Invalid, 465 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 108 mSolverCounterUnsat, 4460 mSDtfsCounter, 357 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI2 SFLT0 conc3 concLT0 SILN1 SILU0 SILI5 SILT3 lasso0 LassoPreprocessingBenchmarks: Lassos: inital77 mio100 ax100 hnf100 lsp12 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq185 hnf96 smp100 dnf147 smp91 tf109 neg100 sie116 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 27ms VariablesStem: 0 VariablesLoop: 1 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 0 MotzkinApplications: 4 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 8 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 3 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.3s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - LassoShapedNonTerminationArgument [Line: 294]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L28] int c ; [L29] int c_t ; [L30] int c_req_up ; [L31] int p_in ; [L32] int p_out ; [L33] int wl_st ; [L34] int c1_st ; [L35] int c2_st ; [L36] int wb_st ; [L37] int r_st ; [L38] int wl_i ; [L39] int c1_i ; [L40] int c2_i ; [L41] int wb_i ; [L42] int r_i ; [L43] int wl_pc ; [L44] int c1_pc ; [L45] int c2_pc ; [L46] int wb_pc ; [L47] int e_e ; [L48] int e_f ; [L49] int e_g ; [L50] int e_c ; [L51] int e_p_in ; [L52] int e_wl ; [L58] int d ; [L59] int data ; [L60] int processed ; [L61] static int t_b ; VAL [c1_i=0, c1_pc=0, c1_st=0, c2_i=0, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=0, e_e=0, e_f=0, e_g=0, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=0, t_b=0, wb_i=0, wb_pc=0, wb_st=0, wl_i=0, wl_pc=0, wl_st=0] [L689] int __retres1 ; [L693] e_wl = 2 [L694] e_c = e_wl [L695] e_g = e_c [L696] e_f = e_g [L697] e_e = e_f [L698] wl_pc = 0 [L699] c1_pc = 0 [L700] c2_pc = 0 [L701] wb_pc = 0 [L702] wb_i = 1 [L703] c2_i = wb_i [L704] c1_i = c2_i [L705] wl_i = c1_i [L706] r_i = 0 [L707] c_req_up = 0 [L708] d = 0 [L709] c = 0 [L710] CALL start_simulation() [L400] int kernel_st ; [L403] kernel_st = 0 VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L404] COND FALSE !((int )c_req_up == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L415] COND TRUE (int )wl_i == 1 [L416] wl_st = 0 VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L420] COND TRUE (int )c1_i == 1 [L421] c1_st = 0 VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L425] COND TRUE (int )c2_i == 1 [L426] c2_st = 0 VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L430] COND TRUE (int )wb_i == 1 [L431] wb_st = 0 VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L435] COND FALSE !((int )r_i == 1) [L438] r_st = 2 VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L440] COND FALSE !((int )e_f == 0) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L445] COND FALSE !((int )e_g == 0) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L450] COND FALSE !((int )e_e == 0) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L455] COND FALSE !((int )e_c == 0) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L460] COND FALSE !((int )e_wl == 0) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L465] COND FALSE !((int )wl_pc == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L473] COND FALSE !((int )wl_pc == 2) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L483] COND FALSE !((int )c1_pc == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L492] COND FALSE !((int )c2_pc == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L501] COND FALSE !((int )wb_pc == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L510] COND FALSE !((int )e_c == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L515] COND FALSE !((int )e_e == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L520] COND FALSE !((int )e_f == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L525] COND FALSE !((int )e_g == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L530] COND FALSE !((int )e_c == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L535] COND FALSE !((int )e_wl == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L541] COND TRUE 1 VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L544] kernel_st = 1 [L545] CALL eval() [L286] int tmp ; [L287] int tmp___0 ; [L288] int tmp___1 ; [L289] int tmp___2 ; [L290] int tmp___3 ; VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] Loop: [L294] COND TRUE 1 [L296] COND TRUE (int )wl_st == 0 [L317] COND TRUE (int )wl_st == 0 [L319] tmp = __VERIFIER_nondet_int() [L321] COND FALSE !(\read(tmp)) [L332] COND TRUE (int )c1_st == 0 [L334] tmp___0 = __VERIFIER_nondet_int() [L336] COND FALSE !(\read(tmp___0)) [L347] COND TRUE (int )c2_st == 0 [L349] tmp___1 = __VERIFIER_nondet_int() [L351] COND FALSE !(\read(tmp___1)) [L362] COND TRUE (int )wb_st == 0 [L364] tmp___2 = __VERIFIER_nondet_int() [L366] COND FALSE !(\read(tmp___2)) [L377] COND FALSE !((int )r_st == 0) End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 294]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L28] int c ; [L29] int c_t ; [L30] int c_req_up ; [L31] int p_in ; [L32] int p_out ; [L33] int wl_st ; [L34] int c1_st ; [L35] int c2_st ; [L36] int wb_st ; [L37] int r_st ; [L38] int wl_i ; [L39] int c1_i ; [L40] int c2_i ; [L41] int wb_i ; [L42] int r_i ; [L43] int wl_pc ; [L44] int c1_pc ; [L45] int c2_pc ; [L46] int wb_pc ; [L47] int e_e ; [L48] int e_f ; [L49] int e_g ; [L50] int e_c ; [L51] int e_p_in ; [L52] int e_wl ; [L58] int d ; [L59] int data ; [L60] int processed ; [L61] static int t_b ; VAL [c1_i=0, c1_pc=0, c1_st=0, c2_i=0, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=0, e_e=0, e_f=0, e_g=0, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=0, t_b=0, wb_i=0, wb_pc=0, wb_st=0, wl_i=0, wl_pc=0, wl_st=0] [L689] int __retres1 ; [L693] e_wl = 2 [L694] e_c = e_wl [L695] e_g = e_c [L696] e_f = e_g [L697] e_e = e_f [L698] wl_pc = 0 [L699] c1_pc = 0 [L700] c2_pc = 0 [L701] wb_pc = 0 [L702] wb_i = 1 [L703] c2_i = wb_i [L704] c1_i = c2_i [L705] wl_i = c1_i [L706] r_i = 0 [L707] c_req_up = 0 [L708] d = 0 [L709] c = 0 [L710] CALL start_simulation() [L400] int kernel_st ; [L403] kernel_st = 0 VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L404] COND FALSE !((int )c_req_up == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L415] COND TRUE (int )wl_i == 1 [L416] wl_st = 0 VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L420] COND TRUE (int )c1_i == 1 [L421] c1_st = 0 VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L425] COND TRUE (int )c2_i == 1 [L426] c2_st = 0 VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L430] COND TRUE (int )wb_i == 1 [L431] wb_st = 0 VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L435] COND FALSE !((int )r_i == 1) [L438] r_st = 2 VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L440] COND FALSE !((int )e_f == 0) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L445] COND FALSE !((int )e_g == 0) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L450] COND FALSE !((int )e_e == 0) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L455] COND FALSE !((int )e_c == 0) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L460] COND FALSE !((int )e_wl == 0) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L465] COND FALSE !((int )wl_pc == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L473] COND FALSE !((int )wl_pc == 2) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L483] COND FALSE !((int )c1_pc == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L492] COND FALSE !((int )c2_pc == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L501] COND FALSE !((int )wb_pc == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L510] COND FALSE !((int )e_c == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L515] COND FALSE !((int )e_e == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L520] COND FALSE !((int )e_f == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L525] COND FALSE !((int )e_g == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L530] COND FALSE !((int )e_c == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L535] COND FALSE !((int )e_wl == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L541] COND TRUE 1 VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L544] kernel_st = 1 [L545] CALL eval() [L286] int tmp ; [L287] int tmp___0 ; [L288] int tmp___1 ; [L289] int tmp___2 ; [L290] int tmp___3 ; VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] Loop: [L294] COND TRUE 1 [L296] COND TRUE (int )wl_st == 0 [L317] COND TRUE (int )wl_st == 0 [L319] tmp = __VERIFIER_nondet_int() [L321] COND FALSE !(\read(tmp)) [L332] COND TRUE (int )c1_st == 0 [L334] tmp___0 = __VERIFIER_nondet_int() [L336] COND FALSE !(\read(tmp___0)) [L347] COND TRUE (int )c2_st == 0 [L349] tmp___1 = __VERIFIER_nondet_int() [L351] COND FALSE !(\read(tmp___1)) [L362] COND TRUE (int )wb_st == 0 [L364] tmp___2 = __VERIFIER_nondet_int() [L366] COND FALSE !(\read(tmp___2)) [L377] COND FALSE !((int )r_st == 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2024-10-12 01:03:54,634 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM)