./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/loop-simple/nested_4.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/loop-simple/nested_4.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash fcf77da5263056f8d62c4caf3b92919690d80ef4ff864a75d0d8d1eec10bdccf --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 16:05:45,171 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 16:05:45,245 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2025-03-04 16:05:45,250 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 16:05:45,250 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 16:05:45,250 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2025-03-04 16:05:45,272 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 16:05:45,273 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 16:05:45,273 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 16:05:45,274 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 16:05:45,274 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 16:05:45,275 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 16:05:45,275 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 16:05:45,275 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 16:05:45,275 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-03-04 16:05:45,275 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-03-04 16:05:45,275 INFO L153 SettingsManager]: * Use old map elimination=false [2025-03-04 16:05:45,275 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-03-04 16:05:45,276 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-03-04 16:05:45,276 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-03-04 16:05:45,276 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 16:05:45,276 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-03-04 16:05:45,276 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 16:05:45,276 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 16:05:45,276 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 16:05:45,276 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 16:05:45,276 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-03-04 16:05:45,276 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-03-04 16:05:45,277 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-03-04 16:05:45,277 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 16:05:45,277 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 16:05:45,277 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 16:05:45,277 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-03-04 16:05:45,277 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 16:05:45,277 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 16:05:45,278 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 16:05:45,278 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 16:05:45,278 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 16:05:45,278 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 16:05:45,278 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-03-04 16:05:45,278 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> fcf77da5263056f8d62c4caf3b92919690d80ef4ff864a75d0d8d1eec10bdccf [2025-03-04 16:05:45,485 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 16:05:45,491 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 16:05:45,492 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 16:05:45,493 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 16:05:45,493 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 16:05:45,494 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-simple/nested_4.c [2025-03-04 16:05:46,579 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b27f0ad7c/0870aec4f96c4afe9e550f11000173ee/FLAG11ba15815 [2025-03-04 16:05:46,789 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 16:05:46,789 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-simple/nested_4.c [2025-03-04 16:05:46,794 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b27f0ad7c/0870aec4f96c4afe9e550f11000173ee/FLAG11ba15815 [2025-03-04 16:05:47,156 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b27f0ad7c/0870aec4f96c4afe9e550f11000173ee [2025-03-04 16:05:47,157 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 16:05:47,158 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 16:05:47,159 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 16:05:47,159 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 16:05:47,162 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 16:05:47,162 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 04:05:47" (1/1) ... [2025-03-04 16:05:47,163 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f3466a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:05:47, skipping insertion in model container [2025-03-04 16:05:47,163 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 04:05:47" (1/1) ... [2025-03-04 16:05:47,172 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 16:05:47,262 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 16:05:47,272 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 16:05:47,284 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 16:05:47,297 INFO L204 MainTranslator]: Completed translation [2025-03-04 16:05:47,298 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:05:47 WrapperNode [2025-03-04 16:05:47,298 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 16:05:47,300 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 16:05:47,300 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 16:05:47,300 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 16:05:47,305 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:05:47" (1/1) ... [2025-03-04 16:05:47,310 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:05:47" (1/1) ... [2025-03-04 16:05:47,319 INFO L138 Inliner]: procedures = 10, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 38 [2025-03-04 16:05:47,321 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 16:05:47,321 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 16:05:47,321 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 16:05:47,321 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 16:05:47,326 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:05:47" (1/1) ... [2025-03-04 16:05:47,326 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:05:47" (1/1) ... [2025-03-04 16:05:47,326 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:05:47" (1/1) ... [2025-03-04 16:05:47,333 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]. [2025-03-04 16:05:47,334 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:05:47" (1/1) ... [2025-03-04 16:05:47,334 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:05:47" (1/1) ... [2025-03-04 16:05:47,337 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:05:47" (1/1) ... [2025-03-04 16:05:47,340 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:05:47" (1/1) ... [2025-03-04 16:05:47,340 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:05:47" (1/1) ... [2025-03-04 16:05:47,341 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:05:47" (1/1) ... [2025-03-04 16:05:47,341 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 16:05:47,342 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 16:05:47,342 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 16:05:47,342 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 16:05:47,343 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:05:47" (1/1) ... [2025-03-04 16:05:47,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:05:47,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:05:47,373 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:05:47,378 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2025-03-04 16:05:47,392 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 16:05:47,393 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 16:05:47,393 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 16:05:47,393 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 16:05:47,433 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 16:05:47,434 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 16:05:47,503 INFO L? ?]: Removed 6 outVars from TransFormulas that were not future-live. [2025-03-04 16:05:47,504 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 16:05:47,509 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 16:05:47,509 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 16:05:47,509 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 04:05:47 BoogieIcfgContainer [2025-03-04 16:05:47,509 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 16:05:47,510 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-03-04 16:05:47,510 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-03-04 16:05:47,513 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-03-04 16:05:47,514 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-04 16:05:47,514 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 04.03 04:05:47" (1/3) ... [2025-03-04 16:05:47,514 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2ae5df5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 04.03 04:05:47, skipping insertion in model container [2025-03-04 16:05:47,514 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-04 16:05:47,515 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:05:47" (2/3) ... [2025-03-04 16:05:47,515 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2ae5df5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 04.03 04:05:47, skipping insertion in model container [2025-03-04 16:05:47,515 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-04 16:05:47,515 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 04:05:47" (3/3) ... [2025-03-04 16:05:47,515 INFO L363 chiAutomizerObserver]: Analyzing ICFG nested_4.c [2025-03-04 16:05:47,548 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-03-04 16:05:47,548 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-03-04 16:05:47,548 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-03-04 16:05:47,548 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-03-04 16:05:47,548 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-03-04 16:05:47,548 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-03-04 16:05:47,549 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-03-04 16:05:47,549 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-03-04 16:05:47,552 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 12 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 11 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 16:05:47,564 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2025-03-04 16:05:47,565 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 16:05:47,565 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 16:05:47,567 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-03-04 16:05:47,567 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-04 16:05:47,567 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-03-04 16:05:47,568 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 12 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 11 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 16:05:47,569 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2025-03-04 16:05:47,569 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 16:05:47,569 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 16:05:47,570 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-03-04 16:05:47,570 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-04 16:05:47,574 INFO L752 eck$LassoCheckResult]: Stem: "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);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~pre4#1, main_#t~pre5#1, main_#t~pre6#1, main_#t~pre7#1, main_~a~0#1, main_~b~0#1, main_~c~0#1, main_~d~0#1;main_~a~0#1 := 6;main_~b~0#1 := 6;main_~c~0#1 := 6;main_~d~0#1 := 6;main_~a~0#1 := 0;" [2025-03-04 16:05:47,574 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~a~0#1 < 6;main_~b~0#1 := 0;" "assume !(main_~b~0#1 < 6);main_#t~pre7#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre7#1;" [2025-03-04 16:05:47,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:05:47,578 INFO L85 PathProgramCache]: Analyzing trace with hash 1440, now seen corresponding path program 1 times [2025-03-04 16:05:47,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:05:47,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795563341] [2025-03-04 16:05:47,584 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:05:47,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:05:47,624 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 16:05:47,631 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 16:05:47,631 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:05:47,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:05:47,632 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:05:47,633 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 16:05:47,635 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 16:05:47,636 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:05:47,636 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:05:47,644 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:05:47,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:05:47,646 INFO L85 PathProgramCache]: Analyzing trace with hash 1339, now seen corresponding path program 1 times [2025-03-04 16:05:47,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:05:47,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450813968] [2025-03-04 16:05:47,646 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:05:47,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:05:47,648 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 16:05:47,651 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 16:05:47,651 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:05:47,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:05:47,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 16:05:47,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 16:05:47,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450813968] [2025-03-04 16:05:47,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450813968] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 16:05:47,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 16:05:47,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 16:05:47,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023596755] [2025-03-04 16:05:47,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 16:05:47,700 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-04 16:05:47,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 16:05:47,721 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 16:05:47,722 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 16:05:47,723 INFO L87 Difference]: Start difference. First operand has 12 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 11 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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) [2025-03-04 16:05:47,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 16:05:47,741 INFO L93 Difference]: Finished difference Result 14 states and 19 transitions. [2025-03-04 16:05:47,742 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 19 transitions. [2025-03-04 16:05:47,742 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2025-03-04 16:05:47,745 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 9 states and 14 transitions. [2025-03-04 16:05:47,746 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2025-03-04 16:05:47,746 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2025-03-04 16:05:47,746 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 14 transitions. [2025-03-04 16:05:47,746 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-04 16:05:47,746 INFO L218 hiAutomatonCegarLoop]: Abstraction has 9 states and 14 transitions. [2025-03-04 16:05:47,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 14 transitions. [2025-03-04 16:05:47,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 7. [2025-03-04 16:05:47,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 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) [2025-03-04 16:05:47,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 10 transitions. [2025-03-04 16:05:47,762 INFO L240 hiAutomatonCegarLoop]: Abstraction has 7 states and 10 transitions. [2025-03-04 16:05:47,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 16:05:47,765 INFO L432 stractBuchiCegarLoop]: Abstraction has 7 states and 10 transitions. [2025-03-04 16:05:47,765 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-03-04 16:05:47,765 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 10 transitions. [2025-03-04 16:05:47,766 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-03-04 16:05:47,766 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 16:05:47,766 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 16:05:47,766 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-03-04 16:05:47,766 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-03-04 16:05:47,766 INFO L752 eck$LassoCheckResult]: Stem: "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);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~pre4#1, main_#t~pre5#1, main_#t~pre6#1, main_#t~pre7#1, main_~a~0#1, main_~b~0#1, main_~c~0#1, main_~d~0#1;main_~a~0#1 := 6;main_~b~0#1 := 6;main_~c~0#1 := 6;main_~d~0#1 := 6;main_~a~0#1 := 0;" [2025-03-04 16:05:47,766 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~a~0#1 < 6;main_~b~0#1 := 0;" "assume main_~b~0#1 < 6;main_~c~0#1 := 0;" "assume !(main_~c~0#1 < 6);main_#t~pre6#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre6#1;" "assume !(main_~b~0#1 < 6);main_#t~pre7#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre7#1;" [2025-03-04 16:05:47,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:05:47,767 INFO L85 PathProgramCache]: Analyzing trace with hash 1440, now seen corresponding path program 2 times [2025-03-04 16:05:47,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:05:47,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066693731] [2025-03-04 16:05:47,767 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 16:05:47,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:05:47,771 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-03-04 16:05:47,774 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 16:05:47,774 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 16:05:47,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:05:47,774 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:05:47,776 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 16:05:47,777 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 16:05:47,778 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:05:47,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:05:47,779 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:05:47,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:05:47,779 INFO L85 PathProgramCache]: Analyzing trace with hash 1291807, now seen corresponding path program 1 times [2025-03-04 16:05:47,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:05:47,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083380174] [2025-03-04 16:05:47,780 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:05:47,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:05:47,782 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 16:05:47,784 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 16:05:47,784 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:05:47,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:05:47,795 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 16:05:47,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 16:05:47,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083380174] [2025-03-04 16:05:47,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083380174] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 16:05:47,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 16:05:47,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 16:05:47,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543195815] [2025-03-04 16:05:47,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 16:05:47,797 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-04 16:05:47,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 16:05:47,799 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 16:05:47,799 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 16:05:47,799 INFO L87 Difference]: Start difference. First operand 7 states and 10 transitions. cyclomatic complexity: 4 Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 16:05:47,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 16:05:47,809 INFO L93 Difference]: Finished difference Result 9 states and 13 transitions. [2025-03-04 16:05:47,809 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9 states and 13 transitions. [2025-03-04 16:05:47,809 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2025-03-04 16:05:47,809 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9 states to 9 states and 13 transitions. [2025-03-04 16:05:47,809 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2025-03-04 16:05:47,809 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2025-03-04 16:05:47,809 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 13 transitions. [2025-03-04 16:05:47,809 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-04 16:05:47,809 INFO L218 hiAutomatonCegarLoop]: Abstraction has 9 states and 13 transitions. [2025-03-04 16:05:47,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 13 transitions. [2025-03-04 16:05:47,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2025-03-04 16:05:47,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 16:05:47,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 11 transitions. [2025-03-04 16:05:47,810 INFO L240 hiAutomatonCegarLoop]: Abstraction has 8 states and 11 transitions. [2025-03-04 16:05:47,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 16:05:47,811 INFO L432 stractBuchiCegarLoop]: Abstraction has 8 states and 11 transitions. [2025-03-04 16:05:47,811 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-03-04 16:05:47,811 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 11 transitions. [2025-03-04 16:05:47,812 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2025-03-04 16:05:47,812 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 16:05:47,812 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 16:05:47,812 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-03-04 16:05:47,812 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2025-03-04 16:05:47,812 INFO L752 eck$LassoCheckResult]: Stem: "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);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~pre4#1, main_#t~pre5#1, main_#t~pre6#1, main_#t~pre7#1, main_~a~0#1, main_~b~0#1, main_~c~0#1, main_~d~0#1;main_~a~0#1 := 6;main_~b~0#1 := 6;main_~c~0#1 := 6;main_~d~0#1 := 6;main_~a~0#1 := 0;" [2025-03-04 16:05:47,812 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~a~0#1 < 6;main_~b~0#1 := 0;" "assume main_~b~0#1 < 6;main_~c~0#1 := 0;" "assume main_~c~0#1 < 6;main_~d~0#1 := 0;" "assume !(main_~d~0#1 < 6);main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1;" "assume !(main_~c~0#1 < 6);main_#t~pre6#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre6#1;" "assume !(main_~b~0#1 < 6);main_#t~pre7#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre7#1;" [2025-03-04 16:05:47,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:05:47,812 INFO L85 PathProgramCache]: Analyzing trace with hash 1440, now seen corresponding path program 3 times [2025-03-04 16:05:47,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:05:47,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69885526] [2025-03-04 16:05:47,813 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 16:05:47,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:05:47,816 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 2 statements into 1 equivalence classes. [2025-03-04 16:05:47,818 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 16:05:47,818 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 16:05:47,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:05:47,818 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:05:47,819 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 16:05:47,821 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 16:05:47,822 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:05:47,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:05:47,823 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:05:47,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:05:47,823 INFO L85 PathProgramCache]: Analyzing trace with hash 1241518045, now seen corresponding path program 1 times [2025-03-04 16:05:47,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:05:47,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653829149] [2025-03-04 16:05:47,823 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:05:47,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:05:47,826 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 16:05:47,828 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 16:05:47,828 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:05:47,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:05:47,841 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 16:05:47,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 16:05:47,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653829149] [2025-03-04 16:05:47,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653829149] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 16:05:47,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 16:05:47,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 16:05:47,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104560894] [2025-03-04 16:05:47,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 16:05:47,843 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-04 16:05:47,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 16:05:47,843 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 16:05:47,843 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 16:05:47,843 INFO L87 Difference]: Start difference. First operand 8 states and 11 transitions. cyclomatic complexity: 4 Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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) [2025-03-04 16:05:47,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 16:05:47,856 INFO L93 Difference]: Finished difference Result 9 states and 12 transitions. [2025-03-04 16:05:47,856 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9 states and 12 transitions. [2025-03-04 16:05:47,857 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2025-03-04 16:05:47,857 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9 states to 9 states and 12 transitions. [2025-03-04 16:05:47,857 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2025-03-04 16:05:47,857 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2025-03-04 16:05:47,857 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 12 transitions. [2025-03-04 16:05:47,857 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-04 16:05:47,857 INFO L218 hiAutomatonCegarLoop]: Abstraction has 9 states and 12 transitions. [2025-03-04 16:05:47,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 12 transitions. [2025-03-04 16:05:47,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2025-03-04 16:05:47,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 8 states have internal predecessors, (12), 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) [2025-03-04 16:05:47,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 12 transitions. [2025-03-04 16:05:47,858 INFO L240 hiAutomatonCegarLoop]: Abstraction has 9 states and 12 transitions. [2025-03-04 16:05:47,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 16:05:47,860 INFO L432 stractBuchiCegarLoop]: Abstraction has 9 states and 12 transitions. [2025-03-04 16:05:47,860 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-03-04 16:05:47,860 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 12 transitions. [2025-03-04 16:05:47,861 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2025-03-04 16:05:47,861 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 16:05:47,861 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 16:05:47,861 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-03-04 16:05:47,861 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 16:05:47,861 INFO L752 eck$LassoCheckResult]: Stem: "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);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~pre4#1, main_#t~pre5#1, main_#t~pre6#1, main_#t~pre7#1, main_~a~0#1, main_~b~0#1, main_~c~0#1, main_~d~0#1;main_~a~0#1 := 6;main_~b~0#1 := 6;main_~c~0#1 := 6;main_~d~0#1 := 6;main_~a~0#1 := 0;" [2025-03-04 16:05:47,861 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~a~0#1 < 6;main_~b~0#1 := 0;" "assume main_~b~0#1 < 6;main_~c~0#1 := 0;" "assume main_~c~0#1 < 6;main_~d~0#1 := 0;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume !(main_~d~0#1 < 6);main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1;" "assume !(main_~c~0#1 < 6);main_#t~pre6#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre6#1;" "assume !(main_~b~0#1 < 6);main_#t~pre7#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre7#1;" [2025-03-04 16:05:47,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:05:47,862 INFO L85 PathProgramCache]: Analyzing trace with hash 1440, now seen corresponding path program 4 times [2025-03-04 16:05:47,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:05:47,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067872110] [2025-03-04 16:05:47,862 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 16:05:47,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:05:47,868 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 2 statements into 2 equivalence classes. [2025-03-04 16:05:47,873 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 16:05:47,874 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 16:05:47,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:05:47,874 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:05:47,877 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 16:05:47,879 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 16:05:47,880 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:05:47,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:05:47,883 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:05:47,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:05:47,884 INFO L85 PathProgramCache]: Analyzing trace with hash -167615480, now seen corresponding path program 1 times [2025-03-04 16:05:47,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:05:47,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519541179] [2025-03-04 16:05:47,886 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:05:47,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:05:47,890 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 16:05:47,892 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 16:05:47,892 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:05:47,892 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:05:47,931 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 16:05:47,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 16:05:47,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519541179] [2025-03-04 16:05:47,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519541179] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 16:05:47,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [332922633] [2025-03-04 16:05:47,932 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:05:47,932 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 16:05:47,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:05:47,935 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 16:05:47,936 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 16:05:47,958 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 16:05:47,964 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 16:05:47,965 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:05:47,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:05:47,966 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 16:05:47,967 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 16:05:47,988 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 16:05:47,988 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 16:05:48,010 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 16:05:48,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [332922633] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 16:05:48,012 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 16:05:48,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2025-03-04 16:05:48,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221089067] [2025-03-04 16:05:48,012 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 16:05:48,012 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-04 16:05:48,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 16:05:48,015 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 16:05:48,015 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 16:05:48,016 INFO L87 Difference]: Start difference. First operand 9 states and 12 transitions. cyclomatic complexity: 4 Second operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 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) [2025-03-04 16:05:48,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 16:05:48,031 INFO L93 Difference]: Finished difference Result 12 states and 15 transitions. [2025-03-04 16:05:48,031 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 15 transitions. [2025-03-04 16:05:48,032 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2025-03-04 16:05:48,032 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 12 states and 15 transitions. [2025-03-04 16:05:48,033 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2025-03-04 16:05:48,033 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2025-03-04 16:05:48,033 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 15 transitions. [2025-03-04 16:05:48,033 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-04 16:05:48,033 INFO L218 hiAutomatonCegarLoop]: Abstraction has 12 states and 15 transitions. [2025-03-04 16:05:48,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 15 transitions. [2025-03-04 16:05:48,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2025-03-04 16:05:48,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.25) internal successors, (15), 11 states have internal predecessors, (15), 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) [2025-03-04 16:05:48,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 15 transitions. [2025-03-04 16:05:48,034 INFO L240 hiAutomatonCegarLoop]: Abstraction has 12 states and 15 transitions. [2025-03-04 16:05:48,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 16:05:48,035 INFO L432 stractBuchiCegarLoop]: Abstraction has 12 states and 15 transitions. [2025-03-04 16:05:48,035 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-03-04 16:05:48,035 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 15 transitions. [2025-03-04 16:05:48,035 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2025-03-04 16:05:48,035 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 16:05:48,035 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 16:05:48,035 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-03-04 16:05:48,035 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [4, 1, 1, 1, 1, 1, 1] [2025-03-04 16:05:48,036 INFO L752 eck$LassoCheckResult]: Stem: "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);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~pre4#1, main_#t~pre5#1, main_#t~pre6#1, main_#t~pre7#1, main_~a~0#1, main_~b~0#1, main_~c~0#1, main_~d~0#1;main_~a~0#1 := 6;main_~b~0#1 := 6;main_~c~0#1 := 6;main_~d~0#1 := 6;main_~a~0#1 := 0;" [2025-03-04 16:05:48,036 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~a~0#1 < 6;main_~b~0#1 := 0;" "assume main_~b~0#1 < 6;main_~c~0#1 := 0;" "assume main_~c~0#1 < 6;main_~d~0#1 := 0;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume !(main_~d~0#1 < 6);main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1;" "assume !(main_~c~0#1 < 6);main_#t~pre6#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre6#1;" "assume !(main_~b~0#1 < 6);main_#t~pre7#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre7#1;" [2025-03-04 16:05:48,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:05:48,036 INFO L85 PathProgramCache]: Analyzing trace with hash 1440, now seen corresponding path program 5 times [2025-03-04 16:05:48,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:05:48,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332825044] [2025-03-04 16:05:48,036 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 16:05:48,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:05:48,041 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-03-04 16:05:48,043 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 16:05:48,046 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 16:05:48,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:05:48,046 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:05:48,047 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 16:05:48,049 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 16:05:48,050 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:05:48,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:05:48,052 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:05:48,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:05:48,052 INFO L85 PathProgramCache]: Analyzing trace with hash 1644774045, now seen corresponding path program 2 times [2025-03-04 16:05:48,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:05:48,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595556482] [2025-03-04 16:05:48,052 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 16:05:48,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:05:48,056 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 10 statements into 2 equivalence classes. [2025-03-04 16:05:48,059 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 16:05:48,059 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 16:05:48,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:05:48,097 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-04 16:05:48,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 16:05:48,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595556482] [2025-03-04 16:05:48,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595556482] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 16:05:48,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [219753034] [2025-03-04 16:05:48,098 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 16:05:48,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 16:05:48,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:05:48,100 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 16:05:48,101 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 16:05:48,121 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 10 statements into 2 equivalence classes. [2025-03-04 16:05:48,126 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 16:05:48,126 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 16:05:48,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:05:48,127 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 16:05:48,128 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 16:05:48,172 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 16:05:48,172 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 16:05:48,224 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 16:05:48,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [219753034] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 16:05:48,225 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 16:05:48,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 7, 7] total 10 [2025-03-04 16:05:48,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482098139] [2025-03-04 16:05:48,225 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 16:05:48,225 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-04 16:05:48,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 16:05:48,225 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 16:05:48,225 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-03-04 16:05:48,225 INFO L87 Difference]: Start difference. First operand 12 states and 15 transitions. cyclomatic complexity: 4 Second operand has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 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) [2025-03-04 16:05:48,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 16:05:48,360 INFO L93 Difference]: Finished difference Result 33 states and 40 transitions. [2025-03-04 16:05:48,360 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 40 transitions. [2025-03-04 16:05:48,361 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 31 [2025-03-04 16:05:48,361 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 33 states and 40 transitions. [2025-03-04 16:05:48,361 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2025-03-04 16:05:48,361 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2025-03-04 16:05:48,362 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 40 transitions. [2025-03-04 16:05:48,362 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-04 16:05:48,362 INFO L218 hiAutomatonCegarLoop]: Abstraction has 33 states and 40 transitions. [2025-03-04 16:05:48,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 40 transitions. [2025-03-04 16:05:48,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 24. [2025-03-04 16:05:48,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 23 states have internal predecessors, (29), 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) [2025-03-04 16:05:48,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 29 transitions. [2025-03-04 16:05:48,363 INFO L240 hiAutomatonCegarLoop]: Abstraction has 24 states and 29 transitions. [2025-03-04 16:05:48,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-04 16:05:48,364 INFO L432 stractBuchiCegarLoop]: Abstraction has 24 states and 29 transitions. [2025-03-04 16:05:48,364 INFO L338 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-03-04 16:05:48,364 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 29 transitions. [2025-03-04 16:05:48,365 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 22 [2025-03-04 16:05:48,365 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 16:05:48,365 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 16:05:48,365 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-03-04 16:05:48,365 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [12, 2, 2, 2, 2, 1, 1] [2025-03-04 16:05:48,365 INFO L752 eck$LassoCheckResult]: Stem: "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);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~pre4#1, main_#t~pre5#1, main_#t~pre6#1, main_#t~pre7#1, main_~a~0#1, main_~b~0#1, main_~c~0#1, main_~d~0#1;main_~a~0#1 := 6;main_~b~0#1 := 6;main_~c~0#1 := 6;main_~d~0#1 := 6;main_~a~0#1 := 0;" [2025-03-04 16:05:48,365 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~a~0#1 < 6;main_~b~0#1 := 0;" "assume main_~b~0#1 < 6;main_~c~0#1 := 0;" "assume main_~c~0#1 < 6;main_~d~0#1 := 0;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume !(main_~d~0#1 < 6);main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1;" "assume !(main_~c~0#1 < 6);main_#t~pre6#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre6#1;" "assume main_~b~0#1 < 6;main_~c~0#1 := 0;" "assume main_~c~0#1 < 6;main_~d~0#1 := 0;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume !(main_~d~0#1 < 6);main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1;" "assume !(main_~c~0#1 < 6);main_#t~pre6#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre6#1;" "assume !(main_~b~0#1 < 6);main_#t~pre7#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre7#1;" [2025-03-04 16:05:48,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:05:48,366 INFO L85 PathProgramCache]: Analyzing trace with hash 1440, now seen corresponding path program 6 times [2025-03-04 16:05:48,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:05:48,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144329394] [2025-03-04 16:05:48,366 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 16:05:48,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:05:48,369 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 2 statements into 1 equivalence classes. [2025-03-04 16:05:48,371 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 16:05:48,375 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-04 16:05:48,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:05:48,375 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:05:48,376 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 16:05:48,377 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 16:05:48,377 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:05:48,377 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:05:48,378 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:05:48,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:05:48,378 INFO L85 PathProgramCache]: Analyzing trace with hash -1794826177, now seen corresponding path program 3 times [2025-03-04 16:05:48,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:05:48,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967590116] [2025-03-04 16:05:48,378 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 16:05:48,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:05:48,382 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 22 statements into 11 equivalence classes. [2025-03-04 16:05:48,394 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 16:05:48,394 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-03-04 16:05:48,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:05:48,440 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2025-03-04 16:05:48,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 16:05:48,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967590116] [2025-03-04 16:05:48,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967590116] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 16:05:48,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1905824361] [2025-03-04 16:05:48,441 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 16:05:48,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 16:05:48,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:05:48,443 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 16:05:48,447 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 16:05:48,482 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 22 statements into 11 equivalence classes. [2025-03-04 16:05:48,492 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 16:05:48,493 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-03-04 16:05:48,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:05:48,493 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 16:05:48,494 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 16:05:48,517 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 55 proven. 1 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2025-03-04 16:05:48,517 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 16:05:48,543 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 55 proven. 1 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2025-03-04 16:05:48,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1905824361] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 16:05:48,543 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 16:05:48,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 9 [2025-03-04 16:05:48,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740608757] [2025-03-04 16:05:48,543 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 16:05:48,544 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-04 16:05:48,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 16:05:48,544 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 16:05:48,544 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-04 16:05:48,544 INFO L87 Difference]: Start difference. First operand 24 states and 29 transitions. cyclomatic complexity: 6 Second operand has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 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) [2025-03-04 16:05:48,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 16:05:48,677 INFO L93 Difference]: Finished difference Result 139 states and 160 transitions. [2025-03-04 16:05:48,677 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 139 states and 160 transitions. [2025-03-04 16:05:48,679 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 137 [2025-03-04 16:05:48,680 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 139 states to 139 states and 160 transitions. [2025-03-04 16:05:48,680 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 139 [2025-03-04 16:05:48,680 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 139 [2025-03-04 16:05:48,680 INFO L73 IsDeterministic]: Start isDeterministic. Operand 139 states and 160 transitions. [2025-03-04 16:05:48,681 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-04 16:05:48,681 INFO L218 hiAutomatonCegarLoop]: Abstraction has 139 states and 160 transitions. [2025-03-04 16:05:48,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states and 160 transitions. [2025-03-04 16:05:48,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 106. [2025-03-04 16:05:48,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 106 states have (on average 1.150943396226415) internal successors, (122), 105 states have internal predecessors, (122), 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) [2025-03-04 16:05:48,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 122 transitions. [2025-03-04 16:05:48,685 INFO L240 hiAutomatonCegarLoop]: Abstraction has 106 states and 122 transitions. [2025-03-04 16:05:48,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-04 16:05:48,686 INFO L432 stractBuchiCegarLoop]: Abstraction has 106 states and 122 transitions. [2025-03-04 16:05:48,688 INFO L338 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-03-04 16:05:48,688 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 106 states and 122 transitions. [2025-03-04 16:05:48,689 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 104 [2025-03-04 16:05:48,689 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 16:05:48,689 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 16:05:48,690 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-03-04 16:05:48,690 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [72, 12, 12, 3, 3, 1, 1] [2025-03-04 16:05:48,690 INFO L752 eck$LassoCheckResult]: Stem: "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);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~pre4#1, main_#t~pre5#1, main_#t~pre6#1, main_#t~pre7#1, main_~a~0#1, main_~b~0#1, main_~c~0#1, main_~d~0#1;main_~a~0#1 := 6;main_~b~0#1 := 6;main_~c~0#1 := 6;main_~d~0#1 := 6;main_~a~0#1 := 0;" [2025-03-04 16:05:48,690 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~a~0#1 < 6;main_~b~0#1 := 0;" "assume main_~b~0#1 < 6;main_~c~0#1 := 0;" "assume main_~c~0#1 < 6;main_~d~0#1 := 0;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume !(main_~d~0#1 < 6);main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1;" "assume main_~c~0#1 < 6;main_~d~0#1 := 0;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume !(main_~d~0#1 < 6);main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1;" "assume main_~c~0#1 < 6;main_~d~0#1 := 0;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume !(main_~d~0#1 < 6);main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1;" "assume main_~c~0#1 < 6;main_~d~0#1 := 0;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume !(main_~d~0#1 < 6);main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1;" "assume !(main_~c~0#1 < 6);main_#t~pre6#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre6#1;" "assume main_~b~0#1 < 6;main_~c~0#1 := 0;" "assume main_~c~0#1 < 6;main_~d~0#1 := 0;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume !(main_~d~0#1 < 6);main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1;" "assume main_~c~0#1 < 6;main_~d~0#1 := 0;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume !(main_~d~0#1 < 6);main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1;" "assume main_~c~0#1 < 6;main_~d~0#1 := 0;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume !(main_~d~0#1 < 6);main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1;" "assume main_~c~0#1 < 6;main_~d~0#1 := 0;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume !(main_~d~0#1 < 6);main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1;" "assume !(main_~c~0#1 < 6);main_#t~pre6#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre6#1;" "assume main_~b~0#1 < 6;main_~c~0#1 := 0;" "assume main_~c~0#1 < 6;main_~d~0#1 := 0;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume !(main_~d~0#1 < 6);main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1;" "assume main_~c~0#1 < 6;main_~d~0#1 := 0;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume !(main_~d~0#1 < 6);main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1;" "assume main_~c~0#1 < 6;main_~d~0#1 := 0;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume !(main_~d~0#1 < 6);main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1;" "assume main_~c~0#1 < 6;main_~d~0#1 := 0;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume !(main_~d~0#1 < 6);main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1;" "assume !(main_~c~0#1 < 6);main_#t~pre6#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre6#1;" "assume !(main_~b~0#1 < 6);main_#t~pre7#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre7#1;" [2025-03-04 16:05:48,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:05:48,693 INFO L85 PathProgramCache]: Analyzing trace with hash 1440, now seen corresponding path program 7 times [2025-03-04 16:05:48,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:05:48,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384204721] [2025-03-04 16:05:48,693 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 16:05:48,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:05:48,695 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 16:05:48,699 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 16:05:48,699 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:05:48,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:05:48,699 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:05:48,701 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 16:05:48,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 16:05:48,705 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:05:48,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:05:48,706 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:05:48,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:05:48,707 INFO L85 PathProgramCache]: Analyzing trace with hash 2142489935, now seen corresponding path program 4 times [2025-03-04 16:05:48,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:05:48,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001559933] [2025-03-04 16:05:48,707 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 16:05:48,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:05:48,720 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 104 statements into 2 equivalence classes. [2025-03-04 16:05:48,745 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-04 16:05:48,745 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-04 16:05:48,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:05:48,899 INFO L134 CoverageAnalysis]: Checked inductivity of 3597 backedges. 1621 proven. 304 refuted. 0 times theorem prover too weak. 1672 trivial. 0 not checked. [2025-03-04 16:05:48,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 16:05:48,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001559933] [2025-03-04 16:05:48,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001559933] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 16:05:48,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [927152739] [2025-03-04 16:05:48,899 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 16:05:48,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 16:05:48,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:05:48,901 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 16:05:48,903 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 16:05:48,935 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 104 statements into 2 equivalence classes. [2025-03-04 16:05:48,965 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-04 16:05:48,966 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-04 16:05:48,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:05:48,967 INFO L256 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 16:05:48,971 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 16:05:49,036 INFO L134 CoverageAnalysis]: Checked inductivity of 3597 backedges. 1621 proven. 304 refuted. 0 times theorem prover too weak. 1672 trivial. 0 not checked. [2025-03-04 16:05:49,036 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 16:05:49,125 INFO L134 CoverageAnalysis]: Checked inductivity of 3597 backedges. 1621 proven. 304 refuted. 0 times theorem prover too weak. 1672 trivial. 0 not checked. [2025-03-04 16:05:49,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [927152739] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 16:05:49,125 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 16:05:49,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 8 [2025-03-04 16:05:49,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290331928] [2025-03-04 16:05:49,126 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 16:05:49,126 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-04 16:05:49,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 16:05:49,126 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 16:05:49,126 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2025-03-04 16:05:49,126 INFO L87 Difference]: Start difference. First operand 106 states and 122 transitions. cyclomatic complexity: 17 Second operand has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 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) [2025-03-04 16:05:49,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 16:05:49,166 INFO L93 Difference]: Finished difference Result 154 states and 176 transitions. [2025-03-04 16:05:49,167 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 154 states and 176 transitions. [2025-03-04 16:05:49,168 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 152 [2025-03-04 16:05:49,169 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 154 states to 154 states and 176 transitions. [2025-03-04 16:05:49,169 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 154 [2025-03-04 16:05:49,169 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 154 [2025-03-04 16:05:49,169 INFO L73 IsDeterministic]: Start isDeterministic. Operand 154 states and 176 transitions. [2025-03-04 16:05:49,169 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-04 16:05:49,170 INFO L218 hiAutomatonCegarLoop]: Abstraction has 154 states and 176 transitions. [2025-03-04 16:05:49,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states and 176 transitions. [2025-03-04 16:05:49,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2025-03-04 16:05:49,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 154 states have (on average 1.1428571428571428) internal successors, (176), 153 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 16:05:49,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 176 transitions. [2025-03-04 16:05:49,174 INFO L240 hiAutomatonCegarLoop]: Abstraction has 154 states and 176 transitions. [2025-03-04 16:05:49,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 16:05:49,175 INFO L432 stractBuchiCegarLoop]: Abstraction has 154 states and 176 transitions. [2025-03-04 16:05:49,175 INFO L338 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2025-03-04 16:05:49,175 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 154 states and 176 transitions. [2025-03-04 16:05:49,176 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 152 [2025-03-04 16:05:49,176 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 16:05:49,176 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 16:05:49,177 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-03-04 16:05:49,177 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [108, 18, 18, 3, 3, 1, 1] [2025-03-04 16:05:49,177 INFO L752 eck$LassoCheckResult]: Stem: "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);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~pre4#1, main_#t~pre5#1, main_#t~pre6#1, main_#t~pre7#1, main_~a~0#1, main_~b~0#1, main_~c~0#1, main_~d~0#1;main_~a~0#1 := 6;main_~b~0#1 := 6;main_~c~0#1 := 6;main_~d~0#1 := 6;main_~a~0#1 := 0;" [2025-03-04 16:05:49,178 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~a~0#1 < 6;main_~b~0#1 := 0;" "assume main_~b~0#1 < 6;main_~c~0#1 := 0;" "assume main_~c~0#1 < 6;main_~d~0#1 := 0;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume !(main_~d~0#1 < 6);main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1;" "assume main_~c~0#1 < 6;main_~d~0#1 := 0;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume !(main_~d~0#1 < 6);main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1;" "assume main_~c~0#1 < 6;main_~d~0#1 := 0;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume !(main_~d~0#1 < 6);main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1;" "assume main_~c~0#1 < 6;main_~d~0#1 := 0;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume !(main_~d~0#1 < 6);main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1;" "assume main_~c~0#1 < 6;main_~d~0#1 := 0;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume !(main_~d~0#1 < 6);main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1;" "assume main_~c~0#1 < 6;main_~d~0#1 := 0;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume !(main_~d~0#1 < 6);main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1;" "assume !(main_~c~0#1 < 6);main_#t~pre6#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre6#1;" "assume main_~b~0#1 < 6;main_~c~0#1 := 0;" "assume main_~c~0#1 < 6;main_~d~0#1 := 0;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume !(main_~d~0#1 < 6);main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1;" "assume main_~c~0#1 < 6;main_~d~0#1 := 0;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume !(main_~d~0#1 < 6);main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1;" "assume main_~c~0#1 < 6;main_~d~0#1 := 0;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume !(main_~d~0#1 < 6);main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1;" "assume main_~c~0#1 < 6;main_~d~0#1 := 0;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume !(main_~d~0#1 < 6);main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1;" "assume main_~c~0#1 < 6;main_~d~0#1 := 0;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume !(main_~d~0#1 < 6);main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1;" "assume main_~c~0#1 < 6;main_~d~0#1 := 0;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume !(main_~d~0#1 < 6);main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1;" "assume !(main_~c~0#1 < 6);main_#t~pre6#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre6#1;" "assume main_~b~0#1 < 6;main_~c~0#1 := 0;" "assume main_~c~0#1 < 6;main_~d~0#1 := 0;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume !(main_~d~0#1 < 6);main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1;" "assume main_~c~0#1 < 6;main_~d~0#1 := 0;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume !(main_~d~0#1 < 6);main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1;" "assume main_~c~0#1 < 6;main_~d~0#1 := 0;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume !(main_~d~0#1 < 6);main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1;" "assume main_~c~0#1 < 6;main_~d~0#1 := 0;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume !(main_~d~0#1 < 6);main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1;" "assume main_~c~0#1 < 6;main_~d~0#1 := 0;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume !(main_~d~0#1 < 6);main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1;" "assume main_~c~0#1 < 6;main_~d~0#1 := 0;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume !(main_~d~0#1 < 6);main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1;" "assume !(main_~c~0#1 < 6);main_#t~pre6#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre6#1;" "assume !(main_~b~0#1 < 6);main_#t~pre7#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre7#1;" [2025-03-04 16:05:49,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:05:49,178 INFO L85 PathProgramCache]: Analyzing trace with hash 1440, now seen corresponding path program 8 times [2025-03-04 16:05:49,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:05:49,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649822916] [2025-03-04 16:05:49,178 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 16:05:49,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:05:49,180 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-03-04 16:05:49,181 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 16:05:49,181 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 16:05:49,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:05:49,181 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:05:49,184 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 16:05:49,185 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 16:05:49,185 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:05:49,185 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:05:49,186 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:05:49,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:05:49,186 INFO L85 PathProgramCache]: Analyzing trace with hash 923201923, now seen corresponding path program 5 times [2025-03-04 16:05:49,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:05:49,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52393131] [2025-03-04 16:05:49,186 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 16:05:49,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:05:49,202 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 152 statements into 76 equivalence classes. [2025-03-04 16:05:49,241 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 76 check-sat command(s) and asserted 152 of 152 statements. [2025-03-04 16:05:49,241 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 76 check-sat command(s) [2025-03-04 16:05:49,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:05:49,365 INFO L134 CoverageAnalysis]: Checked inductivity of 8091 backedges. 0 proven. 5445 refuted. 0 times theorem prover too weak. 2646 trivial. 0 not checked. [2025-03-04 16:05:49,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 16:05:49,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52393131] [2025-03-04 16:05:49,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [52393131] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 16:05:49,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1332513454] [2025-03-04 16:05:49,365 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 16:05:49,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 16:05:49,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:05:49,368 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 16:05:49,369 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 16:05:49,407 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 152 statements into 76 equivalence classes. [2025-03-04 16:05:49,490 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 76 check-sat command(s) and asserted 152 of 152 statements. [2025-03-04 16:05:49,490 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 76 check-sat command(s) [2025-03-04 16:05:49,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:05:49,491 INFO L256 TraceCheckSpWp]: Trace formula consists of 458 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 16:05:49,494 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 16:05:49,660 INFO L134 CoverageAnalysis]: Checked inductivity of 8091 backedges. 0 proven. 5445 refuted. 0 times theorem prover too weak. 2646 trivial. 0 not checked. [2025-03-04 16:05:49,660 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 16:05:49,888 INFO L134 CoverageAnalysis]: Checked inductivity of 8091 backedges. 0 proven. 5445 refuted. 0 times theorem prover too weak. 2646 trivial. 0 not checked. [2025-03-04 16:05:49,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1332513454] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 16:05:49,888 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 16:05:49,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2025-03-04 16:05:49,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791268922] [2025-03-04 16:05:49,889 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 16:05:49,889 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-04 16:05:49,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 16:05:49,889 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 16:05:49,889 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2025-03-04 16:05:49,890 INFO L87 Difference]: Start difference. First operand 154 states and 176 transitions. cyclomatic complexity: 23 Second operand has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 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) [2025-03-04 16:05:49,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 16:05:49,907 INFO L93 Difference]: Finished difference Result 304 states and 347 transitions. [2025-03-04 16:05:49,907 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 304 states and 347 transitions. [2025-03-04 16:05:49,909 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 302 [2025-03-04 16:05:49,911 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 304 states to 304 states and 347 transitions. [2025-03-04 16:05:49,913 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 304 [2025-03-04 16:05:49,913 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 304 [2025-03-04 16:05:49,913 INFO L73 IsDeterministic]: Start isDeterministic. Operand 304 states and 347 transitions. [2025-03-04 16:05:49,914 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-04 16:05:49,914 INFO L218 hiAutomatonCegarLoop]: Abstraction has 304 states and 347 transitions. [2025-03-04 16:05:49,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states and 347 transitions. [2025-03-04 16:05:49,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 304. [2025-03-04 16:05:49,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 304 states have (on average 1.1414473684210527) internal successors, (347), 303 states have internal predecessors, (347), 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) [2025-03-04 16:05:49,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 347 transitions. [2025-03-04 16:05:49,923 INFO L240 hiAutomatonCegarLoop]: Abstraction has 304 states and 347 transitions. [2025-03-04 16:05:49,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 16:05:49,923 INFO L432 stractBuchiCegarLoop]: Abstraction has 304 states and 347 transitions. [2025-03-04 16:05:49,923 INFO L338 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2025-03-04 16:05:49,923 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 304 states and 347 transitions. [2025-03-04 16:05:49,925 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 302 [2025-03-04 16:05:49,925 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 16:05:49,925 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 16:05:49,926 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-03-04 16:05:49,926 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [216, 36, 36, 6, 6, 1, 1] [2025-03-04 16:05:49,926 INFO L752 eck$LassoCheckResult]: Stem: "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);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~pre4#1, main_#t~pre5#1, main_#t~pre6#1, main_#t~pre7#1, main_~a~0#1, main_~b~0#1, main_~c~0#1, main_~d~0#1;main_~a~0#1 := 6;main_~b~0#1 := 6;main_~c~0#1 := 6;main_~d~0#1 := 6;main_~a~0#1 := 0;" [2025-03-04 16:05:49,926 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~a~0#1 < 6;main_~b~0#1 := 0;" "assume main_~b~0#1 < 6;main_~c~0#1 := 0;" "assume main_~c~0#1 < 6;main_~d~0#1 := 0;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume !(main_~d~0#1 < 6);main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1;" "assume main_~c~0#1 < 6;main_~d~0#1 := 0;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume !(main_~d~0#1 < 6);main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1;" "assume main_~c~0#1 < 6;main_~d~0#1 := 0;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume !(main_~d~0#1 < 6);main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1;" "assume main_~c~0#1 < 6;main_~d~0#1 := 0;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume !(main_~d~0#1 < 6);main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1;" "assume main_~c~0#1 < 6;main_~d~0#1 := 0;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume !(main_~d~0#1 < 6);main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1;" "assume main_~c~0#1 < 6;main_~d~0#1 := 0;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume !(main_~d~0#1 < 6);main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1;" "assume !(main_~c~0#1 < 6);main_#t~pre6#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre6#1;" "assume main_~b~0#1 < 6;main_~c~0#1 := 0;" "assume main_~c~0#1 < 6;main_~d~0#1 := 0;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume !(main_~d~0#1 < 6);main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1;" "assume main_~c~0#1 < 6;main_~d~0#1 := 0;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume !(main_~d~0#1 < 6);main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1;" "assume main_~c~0#1 < 6;main_~d~0#1 := 0;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume !(main_~d~0#1 < 6);main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1;" "assume main_~c~0#1 < 6;main_~d~0#1 := 0;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume !(main_~d~0#1 < 6);main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1;" "assume main_~c~0#1 < 6;main_~d~0#1 := 0;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume !(main_~d~0#1 < 6);main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1;" "assume main_~c~0#1 < 6;main_~d~0#1 := 0;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume !(main_~d~0#1 < 6);main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1;" "assume !(main_~c~0#1 < 6);main_#t~pre6#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre6#1;" "assume main_~b~0#1 < 6;main_~c~0#1 := 0;" "assume main_~c~0#1 < 6;main_~d~0#1 := 0;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume !(main_~d~0#1 < 6);main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1;" "assume main_~c~0#1 < 6;main_~d~0#1 := 0;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume !(main_~d~0#1 < 6);main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1;" "assume main_~c~0#1 < 6;main_~d~0#1 := 0;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume !(main_~d~0#1 < 6);main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1;" "assume main_~c~0#1 < 6;main_~d~0#1 := 0;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume !(main_~d~0#1 < 6);main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1;" "assume main_~c~0#1 < 6;main_~d~0#1 := 0;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume !(main_~d~0#1 < 6);main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1;" "assume main_~c~0#1 < 6;main_~d~0#1 := 0;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume !(main_~d~0#1 < 6);main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1;" "assume !(main_~c~0#1 < 6);main_#t~pre6#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre6#1;" "assume main_~b~0#1 < 6;main_~c~0#1 := 0;" "assume main_~c~0#1 < 6;main_~d~0#1 := 0;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume !(main_~d~0#1 < 6);main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1;" "assume main_~c~0#1 < 6;main_~d~0#1 := 0;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume !(main_~d~0#1 < 6);main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1;" "assume main_~c~0#1 < 6;main_~d~0#1 := 0;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume !(main_~d~0#1 < 6);main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1;" "assume main_~c~0#1 < 6;main_~d~0#1 := 0;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume !(main_~d~0#1 < 6);main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1;" "assume main_~c~0#1 < 6;main_~d~0#1 := 0;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume !(main_~d~0#1 < 6);main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1;" "assume main_~c~0#1 < 6;main_~d~0#1 := 0;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume !(main_~d~0#1 < 6);main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1;" "assume !(main_~c~0#1 < 6);main_#t~pre6#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre6#1;" "assume main_~b~0#1 < 6;main_~c~0#1 := 0;" "assume main_~c~0#1 < 6;main_~d~0#1 := 0;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume !(main_~d~0#1 < 6);main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1;" "assume main_~c~0#1 < 6;main_~d~0#1 := 0;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume !(main_~d~0#1 < 6);main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1;" "assume main_~c~0#1 < 6;main_~d~0#1 := 0;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume !(main_~d~0#1 < 6);main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1;" "assume main_~c~0#1 < 6;main_~d~0#1 := 0;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume !(main_~d~0#1 < 6);main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1;" "assume main_~c~0#1 < 6;main_~d~0#1 := 0;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume !(main_~d~0#1 < 6);main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1;" "assume main_~c~0#1 < 6;main_~d~0#1 := 0;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume !(main_~d~0#1 < 6);main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1;" "assume !(main_~c~0#1 < 6);main_#t~pre6#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre6#1;" "assume main_~b~0#1 < 6;main_~c~0#1 := 0;" "assume main_~c~0#1 < 6;main_~d~0#1 := 0;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume !(main_~d~0#1 < 6);main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1;" "assume main_~c~0#1 < 6;main_~d~0#1 := 0;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume !(main_~d~0#1 < 6);main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1;" "assume main_~c~0#1 < 6;main_~d~0#1 := 0;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume !(main_~d~0#1 < 6);main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1;" "assume main_~c~0#1 < 6;main_~d~0#1 := 0;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume !(main_~d~0#1 < 6);main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1;" "assume main_~c~0#1 < 6;main_~d~0#1 := 0;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume !(main_~d~0#1 < 6);main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1;" "assume main_~c~0#1 < 6;main_~d~0#1 := 0;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume !(main_~d~0#1 < 6);main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1;" "assume !(main_~c~0#1 < 6);main_#t~pre6#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre6#1;" "assume !(main_~b~0#1 < 6);main_#t~pre7#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre7#1;" [2025-03-04 16:05:49,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:05:49,927 INFO L85 PathProgramCache]: Analyzing trace with hash 1440, now seen corresponding path program 9 times [2025-03-04 16:05:49,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:05:49,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021048278] [2025-03-04 16:05:49,928 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 16:05:49,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:05:49,931 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 2 statements into 1 equivalence classes. [2025-03-04 16:05:49,932 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 16:05:49,932 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 16:05:49,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:05:49,932 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:05:49,933 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 16:05:49,934 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 16:05:49,934 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:05:49,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:05:49,935 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:05:49,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:05:49,936 INFO L85 PathProgramCache]: Analyzing trace with hash -736397365, now seen corresponding path program 6 times [2025-03-04 16:05:49,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:05:49,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163414364] [2025-03-04 16:05:49,936 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 16:05:49,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:05:49,953 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 302 statements into 151 equivalence classes. [2025-03-04 16:05:50,024 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 151 check-sat command(s) and asserted 302 of 302 statements. [2025-03-04 16:05:50,025 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 151 check-sat command(s) [2025-03-04 16:05:50,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:05:50,025 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:05:50,034 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 302 statements into 1 equivalence classes. [2025-03-04 16:05:50,100 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 302 of 302 statements. [2025-03-04 16:05:50,100 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:05:50,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:05:50,126 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:05:50,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:05:50,128 INFO L85 PathProgramCache]: Analyzing trace with hash 1166974762, now seen corresponding path program 1 times [2025-03-04 16:05:50,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:05:50,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188464702] [2025-03-04 16:05:50,128 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:05:50,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:05:50,140 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 304 statements into 1 equivalence classes. [2025-03-04 16:05:50,201 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 304 of 304 statements. [2025-03-04 16:05:50,201 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:05:50,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:05:50,202 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:05:50,210 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 304 statements into 1 equivalence classes. [2025-03-04 16:05:50,278 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 304 of 304 statements. [2025-03-04 16:05:50,278 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:05:50,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:05:50,334 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:06:02,551 WARN L286 SmtUtils]: Spent 12.15s on a formula simplification. DAG size of input: 1170 DAG size of output: 875 (called from [L 276] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2025-03-04 16:06:03,738 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 16:06:03,740 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 16:06:03,740 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 16:06:03,740 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 16:06:03,740 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-04 16:06:03,740 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:06:03,740 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 16:06:03,741 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 16:06:03,741 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested_4.c_Iteration9_Loop [2025-03-04 16:06:03,741 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 16:06:03,741 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 16:06:03,752 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:06:03,757 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:06:03,760 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:06:03,763 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:06:03,765 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:06:03,768 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:06:03,770 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:06:03,772 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:06:03,827 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 16:06:03,828 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-04 16:06:03,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:06:03,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:06:03,831 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:06:03,833 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-03-04 16:06:03,836 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 16:06:03,836 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 16:06:03,849 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 16:06:03,849 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~pre5#1=0} Honda state: {ULTIMATE.start_main_#t~pre5#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-04 16:06:03,856 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2025-03-04 16:06:03,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:06:03,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:06:03,858 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:06:03,860 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-03-04 16:06:03,866 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 16:06:03,866 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 16:06:03,878 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 16:06:03,878 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~d~0#1=6} Honda state: {ULTIMATE.start_main_~d~0#1=6} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-04 16:06:03,884 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2025-03-04 16:06:03,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:06:03,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:06:03,887 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:06:03,888 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-03-04 16:06:03,889 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 16:06:03,889 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 16:06:03,902 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 16:06:03,902 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~b~0#1=6} Honda state: {ULTIMATE.start_main_~b~0#1=6} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-04 16:06:03,908 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2025-03-04 16:06:03,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:06:03,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:06:03,910 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:06:03,912 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-03-04 16:06:03,913 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 16:06:03,913 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 16:06:03,924 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 16:06:03,924 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~pre7#1=0} Honda state: {ULTIMATE.start_main_#t~pre7#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-04 16:06:03,930 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2025-03-04 16:06:03,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:06:03,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:06:03,932 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:06:03,934 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-03-04 16:06:03,935 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 16:06:03,935 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 16:06:03,946 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 16:06:03,946 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~pre6#1=0} Honda state: {ULTIMATE.start_main_#t~pre6#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-04 16:06:03,952 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2025-03-04 16:06:03,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:06:03,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:06:03,954 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:06:03,955 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2025-03-04 16:06:03,957 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 16:06:03,957 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 16:06:03,969 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 16:06:03,969 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~c~0#1=6} Honda state: {ULTIMATE.start_main_~c~0#1=6} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-04 16:06:03,975 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2025-03-04 16:06:03,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:06:03,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:06:03,978 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:06:03,979 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2025-03-04 16:06:03,980 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 16:06:03,980 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 16:06:03,993 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 16:06:03,994 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~pre4#1=0} Honda state: {ULTIMATE.start_main_#t~pre4#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-04 16:06:03,999 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2025-03-04 16:06:03,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:06:03,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:06:04,001 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:06:04,002 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2025-03-04 16:06:04,005 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 16:06:04,005 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 16:06:04,022 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2025-03-04 16:06:04,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:06:04,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:06:04,024 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:06:04,025 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2025-03-04 16:06:04,027 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-04 16:06:04,027 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 16:06:04,050 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-04 16:06:04,053 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2025-03-04 16:06:04,053 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 16:06:04,054 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 16:06:04,054 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 16:06:04,054 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 16:06:04,054 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 16:06:04,054 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:06:04,054 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 16:06:04,054 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 16:06:04,054 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested_4.c_Iteration9_Loop [2025-03-04 16:06:04,054 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 16:06:04,054 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 16:06:04,055 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:06:04,058 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:06:04,060 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:06:04,062 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:06:04,064 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:06:04,066 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:06:04,068 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:06:04,069 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:06:04,120 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 16:06:04,124 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 16:06:04,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:06:04,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:06:04,126 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:06:04,127 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2025-03-04 16:06:04,128 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:06:04,138 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:06:04,139 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:06:04,139 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:06:04,139 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:06:04,139 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:06:04,144 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:06:04,144 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:06:04,145 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:06:04,151 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2025-03-04 16:06:04,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:06:04,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:06:04,153 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:06:04,154 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2025-03-04 16:06:04,156 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 [2025-03-04 16:06:04,165 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:06:04,165 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:06:04,165 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:06:04,165 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:06:04,165 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:06:04,165 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:06:04,165 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:06:04,166 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:06:04,172 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2025-03-04 16:06:04,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:06:04,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:06:04,174 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:06:04,174 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2025-03-04 16:06:04,176 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 [2025-03-04 16:06:04,185 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:06:04,185 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:06:04,185 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:06:04,185 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:06:04,185 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:06:04,185 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:06:04,186 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:06:04,187 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:06:04,192 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2025-03-04 16:06:04,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:06:04,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:06:04,194 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:06:04,194 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2025-03-04 16:06:04,195 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 [2025-03-04 16:06:04,205 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:06:04,205 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:06:04,205 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:06:04,205 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:06:04,205 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:06:04,208 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:06:04,208 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:06:04,210 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:06:04,215 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2025-03-04 16:06:04,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:06:04,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:06:04,217 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:06:04,218 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2025-03-04 16:06:04,218 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 [2025-03-04 16:06:04,228 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:06:04,228 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:06:04,228 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:06:04,228 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:06:04,228 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:06:04,229 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:06:04,229 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:06:04,230 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:06:04,235 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2025-03-04 16:06:04,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:06:04,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:06:04,238 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:06:04,239 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2025-03-04 16:06:04,239 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:06:04,252 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:06:04,253 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:06:04,253 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:06:04,253 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:06:04,253 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:06:04,254 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:06:04,254 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:06:04,256 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:06:04,262 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2025-03-04 16:06:04,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:06:04,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:06:04,264 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:06:04,265 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2025-03-04 16:06:04,267 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 [2025-03-04 16:06:04,277 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:06:04,277 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:06:04,277 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:06:04,277 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:06:04,277 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:06:04,277 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:06:04,277 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:06:04,278 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:06:04,283 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2025-03-04 16:06:04,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:06:04,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:06:04,286 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:06:04,286 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2025-03-04 16:06:04,289 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 [2025-03-04 16:06:04,298 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:06:04,298 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:06:04,298 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:06:04,298 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:06:04,298 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:06:04,299 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:06:04,299 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:06:04,300 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 16:06:04,303 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-04 16:06:04,304 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-03-04 16:06:04,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:06:04,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:06:04,307 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:06:04,308 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2025-03-04 16:06:04,308 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 16:06:04,308 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-04 16:06:04,309 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 16:06:04,309 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~a~0#1) = -2*ULTIMATE.start_main_~a~0#1 + 11 Supporting invariants [] [2025-03-04 16:06:04,315 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2025-03-04 16:06:04,316 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-04 16:06:04,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:06:04,346 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 16:06:04,348 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 16:06:04,348 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:06:04,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:06:04,349 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 16:06:04,349 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 16:06:04,392 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2025-03-04 16:06:04,396 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 302 statements into 1 equivalence classes. [2025-03-04 16:06:04,471 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 302 of 302 statements. [2025-03-04 16:06:04,471 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:06:04,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:06:04,473 INFO L256 TraceCheckSpWp]: Trace formula consists of 908 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 16:06:04,481 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 16:06:05,326 INFO L134 CoverageAnalysis]: Checked inductivity of 32508 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32508 trivial. 0 not checked. [2025-03-04 16:06:05,331 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-03-04 16:06:05,331 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 304 states and 347 transitions. cyclomatic complexity: 44 Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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) [2025-03-04 16:06:05,367 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 304 states and 347 transitions. cyclomatic complexity: 44. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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 606 states and 693 transitions. Complement of second has 4 states. [2025-03-04 16:06:05,371 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 [2025-03-04 16:06:05,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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) [2025-03-04 16:06:05,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2025-03-04 16:06:05,374 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 2 letters. Loop has 302 letters. [2025-03-04 16:06:05,376 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 16:06:05,376 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 304 letters. Loop has 302 letters. [2025-03-04 16:06:05,378 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 16:06:05,378 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 2 letters. Loop has 604 letters. [2025-03-04 16:06:05,380 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 16:06:05,380 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 606 states and 693 transitions. [2025-03-04 16:06:05,383 INFO L131 ngComponentsAnalysis]: Automaton has 31 accepting balls. 115 [2025-03-04 16:06:05,386 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 606 states to 606 states and 693 transitions. [2025-03-04 16:06:05,386 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 303 [2025-03-04 16:06:05,386 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 304 [2025-03-04 16:06:05,386 INFO L73 IsDeterministic]: Start isDeterministic. Operand 606 states and 693 transitions. [2025-03-04 16:06:05,386 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 16:06:05,386 INFO L218 hiAutomatonCegarLoop]: Abstraction has 606 states and 693 transitions. [2025-03-04 16:06:05,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states and 693 transitions. [2025-03-04 16:06:05,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 355. [2025-03-04 16:06:05,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 355 states, 355 states have (on average 1.1464788732394366) internal successors, (407), 354 states have internal predecessors, (407), 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) [2025-03-04 16:06:05,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 407 transitions. [2025-03-04 16:06:05,396 INFO L240 hiAutomatonCegarLoop]: Abstraction has 355 states and 407 transitions. [2025-03-04 16:06:05,396 INFO L432 stractBuchiCegarLoop]: Abstraction has 355 states and 407 transitions. [2025-03-04 16:06:05,396 INFO L338 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2025-03-04 16:06:05,396 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 355 states and 407 transitions. [2025-03-04 16:06:05,397 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 50 [2025-03-04 16:06:05,397 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 16:06:05,397 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 16:06:05,398 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-03-04 16:06:05,398 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [36, 6, 6, 1, 1] [2025-03-04 16:06:05,398 INFO L752 eck$LassoCheckResult]: Stem: "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);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~pre4#1, main_#t~pre5#1, main_#t~pre6#1, main_#t~pre7#1, main_~a~0#1, main_~b~0#1, main_~c~0#1, main_~d~0#1;main_~a~0#1 := 6;main_~b~0#1 := 6;main_~c~0#1 := 6;main_~d~0#1 := 6;main_~a~0#1 := 0;" "assume main_~a~0#1 < 6;main_~b~0#1 := 0;" [2025-03-04 16:06:05,398 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~b~0#1 < 6;main_~c~0#1 := 0;" "assume main_~c~0#1 < 6;main_~d~0#1 := 0;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume !(main_~d~0#1 < 6);main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1;" "assume main_~c~0#1 < 6;main_~d~0#1 := 0;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume !(main_~d~0#1 < 6);main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1;" "assume main_~c~0#1 < 6;main_~d~0#1 := 0;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume !(main_~d~0#1 < 6);main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1;" "assume main_~c~0#1 < 6;main_~d~0#1 := 0;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume !(main_~d~0#1 < 6);main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1;" "assume main_~c~0#1 < 6;main_~d~0#1 := 0;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume !(main_~d~0#1 < 6);main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1;" "assume main_~c~0#1 < 6;main_~d~0#1 := 0;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume !(main_~d~0#1 < 6);main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1;" "assume !(main_~c~0#1 < 6);main_#t~pre6#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre6#1;" [2025-03-04 16:06:05,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:06:05,398 INFO L85 PathProgramCache]: Analyzing trace with hash 44652, now seen corresponding path program 1 times [2025-03-04 16:06:05,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:06:05,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662790227] [2025-03-04 16:06:05,399 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:06:05,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:06:05,400 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 16:06:05,404 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 16:06:05,404 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:06:05,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:06:05,404 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:06:05,405 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 16:06:05,405 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 16:06:05,405 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:06:05,405 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:06:05,407 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:06:05,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:06:05,407 INFO L85 PathProgramCache]: Analyzing trace with hash 359571817, now seen corresponding path program 1 times [2025-03-04 16:06:05,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:06:05,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94918738] [2025-03-04 16:06:05,407 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:06:05,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:06:05,410 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-04 16:06:05,416 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-04 16:06:05,416 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:06:05,416 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:06:05,416 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:06:05,422 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-04 16:06:05,429 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-04 16:06:05,429 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:06:05,429 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:06:05,431 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:06:05,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:06:05,431 INFO L85 PathProgramCache]: Analyzing trace with hash -556974316, now seen corresponding path program 1 times [2025-03-04 16:06:05,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:06:05,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839612250] [2025-03-04 16:06:05,431 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:06:05,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:06:05,434 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-04 16:06:05,439 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-04 16:06:05,439 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:06:05,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:06:05,439 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:06:05,440 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-04 16:06:05,445 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-04 16:06:05,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:06:05,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:06:05,446 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:06:05,964 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 16:06:05,964 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 16:06:05,965 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 16:06:05,965 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 16:06:05,965 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-04 16:06:05,965 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:06:05,965 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 16:06:05,965 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 16:06:05,965 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested_4.c_Iteration10_Loop [2025-03-04 16:06:05,965 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 16:06:05,965 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 16:06:05,965 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:06:05,967 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:06:05,971 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:06:05,972 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:06:05,974 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:06:05,976 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:06:06,004 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 16:06:06,004 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-04 16:06:06,004 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:06:06,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:06:06,006 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:06:06,008 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2025-03-04 16:06:06,008 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 16:06:06,008 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 16:06:06,019 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 16:06:06,019 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~pre4#1=0} Honda state: {ULTIMATE.start_main_#t~pre4#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-04 16:06:06,023 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2025-03-04 16:06:06,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:06:06,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:06:06,025 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:06:06,027 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2025-03-04 16:06:06,028 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 16:06:06,028 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 16:06:06,042 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2025-03-04 16:06:06,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:06:06,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:06:06,044 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:06:06,046 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2025-03-04 16:06:06,046 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-04 16:06:06,046 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 16:06:06,067 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-04 16:06:06,070 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2025-03-04 16:06:06,070 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 16:06:06,070 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 16:06:06,070 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 16:06:06,070 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 16:06:06,070 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 16:06:06,070 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:06:06,070 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 16:06:06,070 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 16:06:06,070 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested_4.c_Iteration10_Loop [2025-03-04 16:06:06,070 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 16:06:06,070 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 16:06:06,071 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:06:06,078 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:06:06,080 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:06:06,081 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:06:06,083 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:06:06,084 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:06:06,113 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 16:06:06,113 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 16:06:06,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:06:06,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:06:06,115 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:06:06,118 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2025-03-04 16:06:06,118 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 [2025-03-04 16:06:06,127 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:06:06,127 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:06:06,127 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:06:06,127 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:06:06,127 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:06:06,128 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:06:06,128 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:06:06,129 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 16:06:06,131 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-04 16:06:06,131 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-03-04 16:06:06,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:06:06,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:06:06,133 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:06:06,134 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2025-03-04 16:06:06,134 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 16:06:06,134 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-04 16:06:06,134 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 16:06:06,134 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~b~0#1) = -2*ULTIMATE.start_main_~b~0#1 + 11 Supporting invariants [] [2025-03-04 16:06:06,140 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2025-03-04 16:06:06,140 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-04 16:06:06,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:06:06,151 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 16:06:06,153 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 16:06:06,153 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:06:06,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:06:06,154 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 16:06:06,154 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 16:06:06,162 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-04 16:06:06,174 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-04 16:06:06,174 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:06:06,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:06:06,175 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 16:06:06,176 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 16:06:06,297 INFO L134 CoverageAnalysis]: Checked inductivity of 882 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 882 trivial. 0 not checked. [2025-03-04 16:06:06,298 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-03-04 16:06:06,298 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 355 states and 407 transitions. cyclomatic complexity: 54 Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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) [2025-03-04 16:06:06,317 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 355 states and 407 transitions. cyclomatic complexity: 54. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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 1052 states and 1206 transitions. Complement of second has 7 states. [2025-03-04 16:06:06,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-03-04 16:06:06,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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) [2025-03-04 16:06:06,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2025-03-04 16:06:06,320 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 3 letters. Loop has 50 letters. [2025-03-04 16:06:06,320 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 16:06:06,321 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 53 letters. Loop has 50 letters. [2025-03-04 16:06:06,321 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 16:06:06,322 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 3 letters. Loop has 100 letters. [2025-03-04 16:06:06,323 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 16:06:06,323 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1052 states and 1206 transitions. [2025-03-04 16:06:06,328 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 63 [2025-03-04 16:06:06,331 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1052 states to 757 states and 868 transitions. [2025-03-04 16:06:06,331 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 102 [2025-03-04 16:06:06,331 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 103 [2025-03-04 16:06:06,331 INFO L73 IsDeterministic]: Start isDeterministic. Operand 757 states and 868 transitions. [2025-03-04 16:06:06,331 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 16:06:06,331 INFO L218 hiAutomatonCegarLoop]: Abstraction has 757 states and 868 transitions. [2025-03-04 16:06:06,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 757 states and 868 transitions. [2025-03-04 16:06:06,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 757 to 414. [2025-03-04 16:06:06,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 414 states, 414 states have (on average 1.1497584541062802) internal successors, (476), 413 states have internal predecessors, (476), 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) [2025-03-04 16:06:06,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 476 transitions. [2025-03-04 16:06:06,346 INFO L240 hiAutomatonCegarLoop]: Abstraction has 414 states and 476 transitions. [2025-03-04 16:06:06,346 INFO L432 stractBuchiCegarLoop]: Abstraction has 414 states and 476 transitions. [2025-03-04 16:06:06,346 INFO L338 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2025-03-04 16:06:06,346 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 414 states and 476 transitions. [2025-03-04 16:06:06,347 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 58 [2025-03-04 16:06:06,347 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 16:06:06,347 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 16:06:06,348 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-03-04 16:06:06,348 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [6, 1, 1] [2025-03-04 16:06:06,348 INFO L752 eck$LassoCheckResult]: Stem: "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);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~pre4#1, main_#t~pre5#1, main_#t~pre6#1, main_#t~pre7#1, main_~a~0#1, main_~b~0#1, main_~c~0#1, main_~d~0#1;main_~a~0#1 := 6;main_~b~0#1 := 6;main_~c~0#1 := 6;main_~d~0#1 := 6;main_~a~0#1 := 0;" "assume main_~a~0#1 < 6;main_~b~0#1 := 0;" "assume main_~b~0#1 < 6;main_~c~0#1 := 0;" [2025-03-04 16:06:06,348 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~c~0#1 < 6;main_~d~0#1 := 0;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume !(main_~d~0#1 < 6);main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1;" [2025-03-04 16:06:06,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:06:06,348 INFO L85 PathProgramCache]: Analyzing trace with hash 1384223, now seen corresponding path program 1 times [2025-03-04 16:06:06,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:06:06,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849027466] [2025-03-04 16:06:06,348 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:06:06,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:06:06,350 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 16:06:06,355 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 16:06:06,355 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:06:06,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:06:06,355 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:06:06,355 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 16:06:06,356 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 16:06:06,356 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:06:06,356 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:06:06,357 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:06:06,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:06:06,357 INFO L85 PathProgramCache]: Analyzing trace with hash -1895370657, now seen corresponding path program 1 times [2025-03-04 16:06:06,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:06:06,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016702138] [2025-03-04 16:06:06,357 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:06:06,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:06:06,359 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 16:06:06,360 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 16:06:06,360 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:06:06,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:06:06,360 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:06:06,361 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 16:06:06,361 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 16:06:06,361 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:06:06,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:06:06,362 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:06:06,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:06:06,363 INFO L85 PathProgramCache]: Analyzing trace with hash 1402081661, now seen corresponding path program 1 times [2025-03-04 16:06:06,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:06:06,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181163186] [2025-03-04 16:06:06,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:06:06,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:06:06,364 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 16:06:06,365 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 16:06:06,366 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:06:06,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:06:06,366 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:06:06,366 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 16:06:06,367 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 16:06:06,367 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:06:06,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:06:06,368 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:06:06,415 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 16:06:06,416 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 16:06:06,416 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 16:06:06,416 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 16:06:06,416 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-04 16:06:06,416 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:06:06,416 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 16:06:06,416 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 16:06:06,416 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested_4.c_Iteration11_Loop [2025-03-04 16:06:06,416 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 16:06:06,416 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 16:06:06,416 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:06:06,419 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:06:06,421 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:06:06,422 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:06:06,441 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 16:06:06,441 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-04 16:06:06,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:06:06,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:06:06,443 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:06:06,443 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2025-03-04 16:06:06,444 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 16:06:06,444 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 16:06:06,454 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 16:06:06,454 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~pre4#1=0} Honda state: {ULTIMATE.start_main_#t~pre4#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-04 16:06:06,459 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2025-03-04 16:06:06,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:06:06,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:06:06,461 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:06:06,461 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2025-03-04 16:06:06,462 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 16:06:06,462 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 16:06:06,472 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 16:06:06,472 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~pre5#1=0} Honda state: {ULTIMATE.start_main_#t~pre5#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-04 16:06:06,477 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2025-03-04 16:06:06,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:06:06,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:06:06,479 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:06:06,480 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2025-03-04 16:06:06,481 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 16:06:06,481 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 16:06:06,491 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 16:06:06,491 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~d~0#1=6} Honda state: {ULTIMATE.start_main_~d~0#1=6} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-04 16:06:06,496 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2025-03-04 16:06:06,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:06:06,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:06:06,498 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:06:06,499 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2025-03-04 16:06:06,500 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 16:06:06,500 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 16:06:06,515 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2025-03-04 16:06:06,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:06:06,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:06:06,517 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:06:06,517 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2025-03-04 16:06:06,518 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-04 16:06:06,519 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 16:06:06,539 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-04 16:06:06,542 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2025-03-04 16:06:06,542 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 16:06:06,542 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 16:06:06,543 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 16:06:06,543 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 16:06:06,543 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 16:06:06,543 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:06:06,543 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 16:06:06,543 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 16:06:06,543 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested_4.c_Iteration11_Loop [2025-03-04 16:06:06,543 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 16:06:06,543 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 16:06:06,543 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:06:06,545 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:06:06,546 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:06:06,548 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:06:06,567 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 16:06:06,567 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 16:06:06,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:06:06,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:06:06,568 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:06:06,569 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2025-03-04 16:06:06,570 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 [2025-03-04 16:06:06,579 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:06:06,579 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:06:06,579 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:06:06,579 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:06:06,579 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:06:06,580 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:06:06,580 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:06:06,582 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:06:06,588 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Ended with exit code 0 [2025-03-04 16:06:06,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:06:06,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:06:06,590 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:06:06,591 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2025-03-04 16:06:06,593 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 [2025-03-04 16:06:06,602 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:06:06,602 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:06:06,602 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:06:06,602 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:06:06,602 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:06:06,603 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:06:06,603 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:06:06,606 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:06:06,612 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Ended with exit code 0 [2025-03-04 16:06:06,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:06:06,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:06:06,614 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:06:06,615 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2025-03-04 16:06:06,616 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 [2025-03-04 16:06:06,626 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:06:06,626 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:06:06,626 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:06:06,626 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:06:06,626 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:06:06,627 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:06:06,627 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:06:06,628 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:06:06,634 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2025-03-04 16:06:06,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:06:06,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:06:06,636 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:06:06,637 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2025-03-04 16:06:06,639 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 [2025-03-04 16:06:06,650 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:06:06,650 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:06:06,650 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:06:06,650 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:06:06,650 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:06:06,651 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:06:06,651 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:06:06,654 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 16:06:06,656 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-04 16:06:06,656 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-03-04 16:06:06,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:06:06,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:06:06,658 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:06:06,659 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2025-03-04 16:06:06,661 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 16:06:06,661 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-04 16:06:06,661 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 16:06:06,661 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~c~0#1) = -2*ULTIMATE.start_main_~c~0#1 + 11 Supporting invariants [] [2025-03-04 16:06:06,666 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Ended with exit code 0 [2025-03-04 16:06:06,667 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-04 16:06:06,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:06:06,678 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 16:06:06,682 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 16:06:06,682 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:06:06,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:06:06,682 INFO L256 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 16:06:06,683 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 16:06:06,689 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 16:06:06,694 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 16:06:06,694 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:06:06,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:06:06,694 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 16:06:06,694 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 16:06:06,718 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-04 16:06:06,718 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-03-04 16:06:06,718 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 414 states and 476 transitions. cyclomatic complexity: 66 Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 16:06:06,735 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 414 states and 476 transitions. cyclomatic complexity: 66. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 617 states and 711 transitions. Complement of second has 7 states. [2025-03-04 16:06:06,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-03-04 16:06:06,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 16:06:06,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 8 transitions. [2025-03-04 16:06:06,740 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 4 letters. Loop has 8 letters. [2025-03-04 16:06:06,740 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 16:06:06,740 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 12 letters. Loop has 8 letters. [2025-03-04 16:06:06,740 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 16:06:06,740 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 4 letters. Loop has 16 letters. [2025-03-04 16:06:06,740 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 16:06:06,740 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 617 states and 711 transitions. [2025-03-04 16:06:06,744 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 59 [2025-03-04 16:06:06,746 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 617 states to 531 states and 611 transitions. [2025-03-04 16:06:06,746 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 69 [2025-03-04 16:06:06,746 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 70 [2025-03-04 16:06:06,746 INFO L73 IsDeterministic]: Start isDeterministic. Operand 531 states and 611 transitions. [2025-03-04 16:06:06,746 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 16:06:06,746 INFO L218 hiAutomatonCegarLoop]: Abstraction has 531 states and 611 transitions. [2025-03-04 16:06:06,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states and 611 transitions. [2025-03-04 16:06:06,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 424. [2025-03-04 16:06:06,763 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2025-03-04 16:06:06,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 424 states, 424 states have (on average 1.153301886792453) internal successors, (489), 423 states have internal predecessors, (489), 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) [2025-03-04 16:06:06,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 489 transitions. [2025-03-04 16:06:06,764 INFO L240 hiAutomatonCegarLoop]: Abstraction has 424 states and 489 transitions. [2025-03-04 16:06:06,764 INFO L432 stractBuchiCegarLoop]: Abstraction has 424 states and 489 transitions. [2025-03-04 16:06:06,764 INFO L338 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2025-03-04 16:06:06,764 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 424 states and 489 transitions. [2025-03-04 16:06:06,765 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 59 [2025-03-04 16:06:06,765 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 16:06:06,765 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 16:06:06,766 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-03-04 16:06:06,766 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-03-04 16:06:06,766 INFO L752 eck$LassoCheckResult]: Stem: "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);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~pre4#1, main_#t~pre5#1, main_#t~pre6#1, main_#t~pre7#1, main_~a~0#1, main_~b~0#1, main_~c~0#1, main_~d~0#1;main_~a~0#1 := 6;main_~b~0#1 := 6;main_~c~0#1 := 6;main_~d~0#1 := 6;main_~a~0#1 := 0;" "assume main_~a~0#1 < 6;main_~b~0#1 := 0;" "assume main_~b~0#1 < 6;main_~c~0#1 := 0;" "assume main_~c~0#1 < 6;main_~d~0#1 := 0;" [2025-03-04 16:06:06,766 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" [2025-03-04 16:06:06,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:06:06,766 INFO L85 PathProgramCache]: Analyzing trace with hash 42910923, now seen corresponding path program 1 times [2025-03-04 16:06:06,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:06:06,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255904970] [2025-03-04 16:06:06,766 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:06:06,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:06:06,766 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Forceful destruction successful, exit code 0 [2025-03-04 16:06:06,770 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 16:06:06,771 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 16:06:06,771 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:06:06,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:06:06,771 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:06:06,772 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 16:06:06,773 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 16:06:06,773 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:06:06,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:06:06,774 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:06:06,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:06:06,774 INFO L85 PathProgramCache]: Analyzing trace with hash 40, now seen corresponding path program 1 times [2025-03-04 16:06:06,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:06:06,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924510177] [2025-03-04 16:06:06,774 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:06:06,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:06:06,775 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-04 16:06:06,775 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-04 16:06:06,775 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:06:06,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:06:06,775 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:06:06,775 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-04 16:06:06,775 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-04 16:06:06,776 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:06:06,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:06:06,776 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:06:06,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:06:06,776 INFO L85 PathProgramCache]: Analyzing trace with hash 1330238622, now seen corresponding path program 1 times [2025-03-04 16:06:06,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:06:06,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959469814] [2025-03-04 16:06:06,776 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:06:06,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:06:06,780 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 16:06:06,781 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 16:06:06,781 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:06:06,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:06:06,781 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:06:06,782 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 16:06:06,782 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 16:06:06,782 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:06:06,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:06:06,783 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:06:06,798 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 16:06:06,798 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 16:06:06,798 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 16:06:06,798 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 16:06:06,798 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-04 16:06:06,798 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:06:06,798 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 16:06:06,798 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 16:06:06,798 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested_4.c_Iteration12_Loop [2025-03-04 16:06:06,798 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 16:06:06,798 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 16:06:06,799 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:06:06,800 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:06:06,814 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 16:06:06,814 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-04 16:06:06,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:06:06,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:06:06,816 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:06:06,818 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2025-03-04 16:06:06,819 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 16:06:06,819 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 16:06:06,833 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 16:06:06,834 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~pre4#1=0} Honda state: {ULTIMATE.start_main_#t~pre4#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-04 16:06:06,839 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Forceful destruction successful, exit code 0 [2025-03-04 16:06:06,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:06:06,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:06:06,842 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:06:06,843 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2025-03-04 16:06:06,844 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 16:06:06,844 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 16:06:06,860 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Ended with exit code 0 [2025-03-04 16:06:06,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:06:06,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:06:06,863 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:06:06,864 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2025-03-04 16:06:06,865 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-04 16:06:06,865 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 16:06:06,886 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-04 16:06:06,890 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Forceful destruction successful, exit code 0 [2025-03-04 16:06:06,890 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 16:06:06,890 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 16:06:06,890 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 16:06:06,890 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 16:06:06,890 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 16:06:06,890 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:06:06,890 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 16:06:06,890 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 16:06:06,891 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested_4.c_Iteration12_Loop [2025-03-04 16:06:06,891 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 16:06:06,891 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 16:06:06,891 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:06:06,893 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:06:06,907 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 16:06:06,907 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 16:06:06,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:06:06,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:06:06,909 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:06:06,911 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2025-03-04 16:06:06,911 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 [2025-03-04 16:06:06,921 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:06:06,922 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:06:06,922 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:06:06,922 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:06:06,922 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:06:06,922 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:06:06,922 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:06:06,924 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:06:06,930 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Forceful destruction successful, exit code 0 [2025-03-04 16:06:06,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:06:06,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:06:06,932 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:06:06,934 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2025-03-04 16:06:06,935 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 [2025-03-04 16:06:06,945 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:06:06,945 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:06:06,945 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:06:06,945 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:06:06,945 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:06:06,946 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:06:06,946 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:06:06,948 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 16:06:06,951 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-04 16:06:06,951 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-03-04 16:06:06,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:06:06,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:06:06,953 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:06:06,954 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2025-03-04 16:06:06,955 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 16:06:06,955 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-04 16:06:06,955 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 16:06:06,955 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~d~0#1) = -2*ULTIMATE.start_main_~d~0#1 + 11 Supporting invariants [] [2025-03-04 16:06:06,961 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Forceful destruction successful, exit code 0 [2025-03-04 16:06:06,961 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-04 16:06:06,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:06:06,972 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 16:06:06,975 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 16:06:06,975 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:06:06,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:06:06,976 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 16:06:06,976 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 16:06:06,980 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-04 16:06:06,981 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-04 16:06:06,981 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:06:06,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:06:06,981 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 16:06:06,982 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 16:06:06,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 16:06:06,982 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2025-03-04 16:06:06,982 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 424 states and 489 transitions. cyclomatic complexity: 71 Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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) [2025-03-04 16:06:06,989 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 424 states and 489 transitions. cyclomatic complexity: 71. Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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 456 states and 525 transitions. Complement of second has 5 states. [2025-03-04 16:06:06,991 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 [2025-03-04 16:06:06,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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) [2025-03-04 16:06:06,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2025-03-04 16:06:06,993 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 5 letters. Loop has 1 letters. [2025-03-04 16:06:06,993 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 16:06:06,993 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 6 letters. Loop has 1 letters. [2025-03-04 16:06:06,993 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 16:06:06,993 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 5 letters. Loop has 2 letters. [2025-03-04 16:06:06,993 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 16:06:06,993 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 456 states and 525 transitions. [2025-03-04 16:06:06,995 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 59 [2025-03-04 16:06:06,997 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 456 states to 451 states and 519 transitions. [2025-03-04 16:06:06,998 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 64 [2025-03-04 16:06:06,998 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 64 [2025-03-04 16:06:06,998 INFO L73 IsDeterministic]: Start isDeterministic. Operand 451 states and 519 transitions. [2025-03-04 16:06:06,998 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 16:06:06,998 INFO L218 hiAutomatonCegarLoop]: Abstraction has 451 states and 519 transitions. [2025-03-04 16:06:06,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states and 519 transitions. [2025-03-04 16:06:07,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 424. [2025-03-04 16:06:07,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 424 states, 424 states have (on average 1.150943396226415) internal successors, (488), 423 states have internal predecessors, (488), 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) [2025-03-04 16:06:07,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 488 transitions. [2025-03-04 16:06:07,007 INFO L240 hiAutomatonCegarLoop]: Abstraction has 424 states and 488 transitions. [2025-03-04 16:06:07,007 INFO L432 stractBuchiCegarLoop]: Abstraction has 424 states and 488 transitions. [2025-03-04 16:06:07,007 INFO L338 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2025-03-04 16:06:07,007 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 424 states and 488 transitions. [2025-03-04 16:06:07,009 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 59 [2025-03-04 16:06:07,009 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 16:06:07,009 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 16:06:07,009 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [6, 2, 1, 1, 1, 1, 1] [2025-03-04 16:06:07,009 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-03-04 16:06:07,009 INFO L752 eck$LassoCheckResult]: Stem: "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);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~pre4#1, main_#t~pre5#1, main_#t~pre6#1, main_#t~pre7#1, main_~a~0#1, main_~b~0#1, main_~c~0#1, main_~d~0#1;main_~a~0#1 := 6;main_~b~0#1 := 6;main_~c~0#1 := 6;main_~d~0#1 := 6;main_~a~0#1 := 0;" "assume main_~a~0#1 < 6;main_~b~0#1 := 0;" "assume main_~b~0#1 < 6;main_~c~0#1 := 0;" "assume main_~c~0#1 < 6;main_~d~0#1 := 0;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume !(main_~d~0#1 < 6);main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1;" "assume main_~c~0#1 < 6;main_~d~0#1 := 0;" [2025-03-04 16:06:07,009 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" [2025-03-04 16:06:07,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:06:07,010 INFO L85 PathProgramCache]: Analyzing trace with hash 514858541, now seen corresponding path program 2 times [2025-03-04 16:06:07,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:06:07,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148396904] [2025-03-04 16:06:07,010 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 16:06:07,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:06:07,011 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 13 statements into 2 equivalence classes. [2025-03-04 16:06:07,013 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 16:06:07,013 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 16:06:07,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:06:07,013 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:06:07,014 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 16:06:07,016 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 16:06:07,016 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:06:07,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:06:07,017 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:06:07,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:06:07,018 INFO L85 PathProgramCache]: Analyzing trace with hash 40, now seen corresponding path program 2 times [2025-03-04 16:06:07,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:06:07,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873290175] [2025-03-04 16:06:07,018 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 16:06:07,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:06:07,019 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1 statements into 1 equivalence classes. [2025-03-04 16:06:07,019 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-04 16:06:07,019 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 16:06:07,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:06:07,019 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:06:07,020 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-04 16:06:07,020 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-04 16:06:07,021 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:06:07,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:06:07,021 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:06:07,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:06:07,022 INFO L85 PathProgramCache]: Analyzing trace with hash -1219254404, now seen corresponding path program 3 times [2025-03-04 16:06:07,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:06:07,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730938619] [2025-03-04 16:06:07,022 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 16:06:07,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:06:07,024 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 14 statements into 5 equivalence classes. [2025-03-04 16:06:07,026 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 16:06:07,027 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-03-04 16:06:07,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:06:07,027 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:06:07,028 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 16:06:07,029 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 16:06:07,029 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:06:07,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:06:07,030 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:06:07,040 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 16:06:07,040 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 16:06:07,040 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 16:06:07,040 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 16:06:07,040 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-04 16:06:07,040 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:06:07,040 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 16:06:07,040 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 16:06:07,040 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested_4.c_Iteration13_Loop [2025-03-04 16:06:07,040 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 16:06:07,040 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 16:06:07,041 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:06:07,045 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:06:07,057 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 16:06:07,057 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-04 16:06:07,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:06:07,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:06:07,060 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:06:07,062 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2025-03-04 16:06:07,063 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 16:06:07,063 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 16:06:07,078 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Forceful destruction successful, exit code 0 [2025-03-04 16:06:07,078 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:06:07,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:06:07,080 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:06:07,081 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2025-03-04 16:06:07,081 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-04 16:06:07,081 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 16:06:07,101 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-04 16:06:07,105 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Ended with exit code 0 [2025-03-04 16:06:07,105 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 16:06:07,105 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 16:06:07,105 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 16:06:07,105 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 16:06:07,105 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 16:06:07,105 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:06:07,105 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 16:06:07,105 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 16:06:07,105 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested_4.c_Iteration13_Loop [2025-03-04 16:06:07,105 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 16:06:07,105 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 16:06:07,105 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:06:07,113 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:06:07,125 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 16:06:07,125 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 16:06:07,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:06:07,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:06:07,129 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:06:07,130 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2025-03-04 16:06:07,130 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 [2025-03-04 16:06:07,140 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:06:07,140 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:06:07,140 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:06:07,140 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:06:07,140 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:06:07,140 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:06:07,140 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:06:07,142 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 16:06:07,143 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-04 16:06:07,143 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-03-04 16:06:07,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:06:07,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:06:07,145 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:06:07,146 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2025-03-04 16:06:07,147 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 16:06:07,147 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-04 16:06:07,147 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 16:06:07,147 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~d~0#1) = -2*ULTIMATE.start_main_~d~0#1 + 11 Supporting invariants [] [2025-03-04 16:06:07,152 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Forceful destruction successful, exit code 0 [2025-03-04 16:06:07,152 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-04 16:06:07,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:06:07,165 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 16:06:07,171 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 16:06:07,171 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:06:07,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:06:07,171 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 16:06:07,171 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 16:06:07,185 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-04 16:06:07,185 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-04 16:06:07,185 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:06:07,185 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:06:07,186 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 16:06:07,186 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 16:06:07,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 16:06:07,186 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2025-03-04 16:06:07,186 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 424 states and 488 transitions. cyclomatic complexity: 70 Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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) [2025-03-04 16:06:07,192 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 424 states and 488 transitions. cyclomatic complexity: 70. Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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 454 states and 522 transitions. Complement of second has 5 states. [2025-03-04 16:06:07,193 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 [2025-03-04 16:06:07,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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) [2025-03-04 16:06:07,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2025-03-04 16:06:07,193 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 13 letters. Loop has 1 letters. [2025-03-04 16:06:07,193 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 16:06:07,194 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-04 16:06:07,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:06:07,204 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 16:06:07,208 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 16:06:07,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:06:07,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:06:07,208 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 16:06:07,208 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 16:06:07,221 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-04 16:06:07,223 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-04 16:06:07,223 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:06:07,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:06:07,223 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 16:06:07,224 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 16:06:07,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 16:06:07,224 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 1 loop predicates [2025-03-04 16:06:07,224 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 424 states and 488 transitions. cyclomatic complexity: 70 Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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) [2025-03-04 16:06:07,230 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 424 states and 488 transitions. cyclomatic complexity: 70. Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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 454 states and 522 transitions. Complement of second has 5 states. [2025-03-04 16:06:07,230 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 [2025-03-04 16:06:07,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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) [2025-03-04 16:06:07,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2025-03-04 16:06:07,231 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 13 letters. Loop has 1 letters. [2025-03-04 16:06:07,231 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 16:06:07,231 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-04 16:06:07,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:06:07,244 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 16:06:07,250 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 16:06:07,250 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:06:07,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:06:07,250 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 16:06:07,250 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 16:06:07,263 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-04 16:06:07,264 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-04 16:06:07,264 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:06:07,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:06:07,264 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 16:06:07,264 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 16:06:07,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 16:06:07,264 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2025-03-04 16:06:07,265 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 424 states and 488 transitions. cyclomatic complexity: 70 Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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) [2025-03-04 16:06:07,273 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 424 states and 488 transitions. cyclomatic complexity: 70. Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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 499 states and 565 transitions. Complement of second has 4 states. [2025-03-04 16:06:07,274 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 [2025-03-04 16:06:07,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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) [2025-03-04 16:06:07,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 16 transitions. [2025-03-04 16:06:07,275 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 13 letters. Loop has 1 letters. [2025-03-04 16:06:07,275 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 16:06:07,275 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 14 letters. Loop has 1 letters. [2025-03-04 16:06:07,275 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 16:06:07,275 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 13 letters. Loop has 2 letters. [2025-03-04 16:06:07,275 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 16:06:07,275 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 499 states and 565 transitions. [2025-03-04 16:06:07,277 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 58 [2025-03-04 16:06:07,278 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 499 states to 418 states and 479 transitions. [2025-03-04 16:06:07,278 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2025-03-04 16:06:07,279 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2025-03-04 16:06:07,279 INFO L73 IsDeterministic]: Start isDeterministic. Operand 418 states and 479 transitions. [2025-03-04 16:06:07,279 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 16:06:07,279 INFO L218 hiAutomatonCegarLoop]: Abstraction has 418 states and 479 transitions. [2025-03-04 16:06:07,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states and 479 transitions. [2025-03-04 16:06:07,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 414. [2025-03-04 16:06:07,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 414 states, 414 states have (on average 1.1473429951690821) internal successors, (475), 413 states have internal predecessors, (475), 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) [2025-03-04 16:06:07,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 475 transitions. [2025-03-04 16:06:07,286 INFO L240 hiAutomatonCegarLoop]: Abstraction has 414 states and 475 transitions. [2025-03-04 16:06:07,286 INFO L432 stractBuchiCegarLoop]: Abstraction has 414 states and 475 transitions. [2025-03-04 16:06:07,286 INFO L338 stractBuchiCegarLoop]: ======== Iteration 14 ============ [2025-03-04 16:06:07,286 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 414 states and 475 transitions. [2025-03-04 16:06:07,287 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 58 [2025-03-04 16:06:07,287 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 16:06:07,287 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 16:06:07,288 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [36, 6, 6, 2, 1, 1, 1, 1] [2025-03-04 16:06:07,289 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [6, 1, 1] [2025-03-04 16:06:07,289 INFO L752 eck$LassoCheckResult]: Stem: "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);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~pre4#1, main_#t~pre5#1, main_#t~pre6#1, main_#t~pre7#1, main_~a~0#1, main_~b~0#1, main_~c~0#1, main_~d~0#1;main_~a~0#1 := 6;main_~b~0#1 := 6;main_~c~0#1 := 6;main_~d~0#1 := 6;main_~a~0#1 := 0;" "assume main_~a~0#1 < 6;main_~b~0#1 := 0;" "assume main_~b~0#1 < 6;main_~c~0#1 := 0;" "assume main_~c~0#1 < 6;main_~d~0#1 := 0;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume !(main_~d~0#1 < 6);main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1;" "assume main_~c~0#1 < 6;main_~d~0#1 := 0;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume !(main_~d~0#1 < 6);main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1;" "assume main_~c~0#1 < 6;main_~d~0#1 := 0;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume !(main_~d~0#1 < 6);main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1;" "assume main_~c~0#1 < 6;main_~d~0#1 := 0;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume !(main_~d~0#1 < 6);main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1;" "assume main_~c~0#1 < 6;main_~d~0#1 := 0;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume !(main_~d~0#1 < 6);main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1;" "assume main_~c~0#1 < 6;main_~d~0#1 := 0;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume !(main_~d~0#1 < 6);main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1;" "assume !(main_~c~0#1 < 6);main_#t~pre6#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre6#1;" "assume main_~b~0#1 < 6;main_~c~0#1 := 0;" [2025-03-04 16:06:07,289 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~c~0#1 < 6;main_~d~0#1 := 0;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume !(main_~d~0#1 < 6);main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1;" [2025-03-04 16:06:07,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:06:07,290 INFO L85 PathProgramCache]: Analyzing trace with hash -86334601, now seen corresponding path program 2 times [2025-03-04 16:06:07,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:06:07,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468238690] [2025-03-04 16:06:07,290 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 16:06:07,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:06:07,292 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 54 statements into 2 equivalence classes. [2025-03-04 16:06:07,298 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 54 of 54 statements. [2025-03-04 16:06:07,298 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 16:06:07,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:06:07,298 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:06:07,299 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-04 16:06:07,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-04 16:06:07,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:06:07,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:06:07,304 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:06:07,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:06:07,305 INFO L85 PathProgramCache]: Analyzing trace with hash -1895370657, now seen corresponding path program 2 times [2025-03-04 16:06:07,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:06:07,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565017852] [2025-03-04 16:06:07,305 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 16:06:07,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:06:07,307 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 8 statements into 2 equivalence classes. [2025-03-04 16:06:07,307 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 16:06:07,307 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 16:06:07,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:06:07,307 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:06:07,308 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 16:06:07,309 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 16:06:07,309 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:06:07,309 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:06:07,309 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:06:07,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:06:07,310 INFO L85 PathProgramCache]: Analyzing trace with hash -98976299, now seen corresponding path program 3 times [2025-03-04 16:06:07,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:06:07,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493779706] [2025-03-04 16:06:07,310 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 16:06:07,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:06:07,313 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 62 statements into 26 equivalence classes. [2025-03-04 16:06:07,321 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 26 check-sat command(s) and asserted 62 of 62 statements. [2025-03-04 16:06:07,321 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 26 check-sat command(s) [2025-03-04 16:06:07,321 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:06:07,321 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:06:07,323 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-04 16:06:07,328 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-04 16:06:07,328 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:06:07,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:06:07,329 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:06:07,370 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 16:06:07,371 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 16:06:07,371 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 16:06:07,371 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 16:06:07,371 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-04 16:06:07,371 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:06:07,371 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 16:06:07,371 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 16:06:07,371 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested_4.c_Iteration14_Loop [2025-03-04 16:06:07,371 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 16:06:07,371 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 16:06:07,371 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:06:07,375 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:06:07,378 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:06:07,379 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:06:07,398 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 16:06:07,398 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-04 16:06:07,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:06:07,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:06:07,400 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:06:07,402 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2025-03-04 16:06:07,403 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 16:06:07,403 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 16:06:07,418 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Forceful destruction successful, exit code 0 [2025-03-04 16:06:07,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:06:07,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:06:07,422 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:06:07,423 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2025-03-04 16:06:07,424 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-04 16:06:07,425 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 16:06:07,447 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-04 16:06:07,451 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Ended with exit code 0 [2025-03-04 16:06:07,451 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 16:06:07,451 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 16:06:07,451 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 16:06:07,451 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 16:06:07,451 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 16:06:07,451 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:06:07,451 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 16:06:07,451 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 16:06:07,451 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested_4.c_Iteration14_Loop [2025-03-04 16:06:07,451 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 16:06:07,451 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 16:06:07,452 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:06:07,457 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:06:07,458 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:06:07,460 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:06:07,481 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 16:06:07,481 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 16:06:07,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:06:07,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:06:07,484 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:06:07,485 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2025-03-04 16:06:07,486 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 [2025-03-04 16:06:07,495 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:06:07,496 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:06:07,496 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:06:07,496 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:06:07,496 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:06:07,496 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:06:07,496 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:06:07,498 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 16:06:07,499 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-04 16:06:07,499 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-03-04 16:06:07,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:06:07,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:06:07,502 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:06:07,503 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2025-03-04 16:06:07,504 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 16:06:07,504 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-04 16:06:07,504 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 16:06:07,504 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~c~0#1) = -2*ULTIMATE.start_main_~c~0#1 + 11 Supporting invariants [] [2025-03-04 16:06:07,509 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Forceful destruction successful, exit code 0 [2025-03-04 16:06:07,510 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-04 16:06:07,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:06:07,527 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-04 16:06:07,543 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-04 16:06:07,543 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:06:07,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:06:07,544 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 16:06:07,544 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 16:06:07,591 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 16:06:07,593 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 16:06:07,594 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:06:07,594 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:06:07,594 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 16:06:07,594 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 16:06:07,626 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-04 16:06:07,627 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-03-04 16:06:07,627 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 414 states and 475 transitions. cyclomatic complexity: 65 Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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) [2025-03-04 16:06:07,644 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 414 states and 475 transitions. cyclomatic complexity: 65. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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 601 states and 691 transitions. Complement of second has 7 states. [2025-03-04 16:06:07,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-03-04 16:06:07,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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) [2025-03-04 16:06:07,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 8 transitions. [2025-03-04 16:06:07,648 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 54 letters. Loop has 8 letters. [2025-03-04 16:06:07,648 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 16:06:07,648 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-04 16:06:07,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:06:07,662 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-04 16:06:07,675 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-04 16:06:07,675 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:06:07,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:06:07,676 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 16:06:07,676 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 16:06:07,727 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 16:06:07,732 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 16:06:07,733 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:06:07,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:06:07,733 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 16:06:07,733 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 16:06:07,754 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-04 16:06:07,755 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2025-03-04 16:06:07,755 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 414 states and 475 transitions. cyclomatic complexity: 65 Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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) [2025-03-04 16:06:07,767 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 414 states and 475 transitions. cyclomatic complexity: 65. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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 601 states and 691 transitions. Complement of second has 7 states. [2025-03-04 16:06:07,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-03-04 16:06:07,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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) [2025-03-04 16:06:07,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 8 transitions. [2025-03-04 16:06:07,768 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 54 letters. Loop has 8 letters. [2025-03-04 16:06:07,768 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 16:06:07,768 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-04 16:06:07,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:06:07,792 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-04 16:06:07,807 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-04 16:06:07,807 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:06:07,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:06:07,808 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 16:06:07,809 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 16:06:07,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 16:06:07,859 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 16:06:07,860 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:06:07,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:06:07,860 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 16:06:07,860 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 16:06:07,883 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-04 16:06:07,884 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-03-04 16:06:07,884 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 414 states and 475 transitions. cyclomatic complexity: 65 Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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) [2025-03-04 16:06:07,901 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 414 states and 475 transitions. cyclomatic complexity: 65. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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 771 states and 890 transitions. Complement of second has 6 states. [2025-03-04 16:06:07,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-03-04 16:06:07,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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) [2025-03-04 16:06:07,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2025-03-04 16:06:07,902 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 54 letters. Loop has 8 letters. [2025-03-04 16:06:07,903 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 16:06:07,903 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 62 letters. Loop has 8 letters. [2025-03-04 16:06:07,903 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 16:06:07,903 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 54 letters. Loop has 16 letters. [2025-03-04 16:06:07,903 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 16:06:07,903 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 771 states and 890 transitions. [2025-03-04 16:06:07,906 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 50 [2025-03-04 16:06:07,907 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 771 states to 357 states and 408 transitions. [2025-03-04 16:06:07,907 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2025-03-04 16:06:07,907 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2025-03-04 16:06:07,907 INFO L73 IsDeterministic]: Start isDeterministic. Operand 357 states and 408 transitions. [2025-03-04 16:06:07,907 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 16:06:07,907 INFO L218 hiAutomatonCegarLoop]: Abstraction has 357 states and 408 transitions. [2025-03-04 16:06:07,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states and 408 transitions. [2025-03-04 16:06:07,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 355. [2025-03-04 16:06:07,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 355 states, 355 states have (on average 1.143661971830986) internal successors, (406), 354 states have internal predecessors, (406), 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) [2025-03-04 16:06:07,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 406 transitions. [2025-03-04 16:06:07,913 INFO L240 hiAutomatonCegarLoop]: Abstraction has 355 states and 406 transitions. [2025-03-04 16:06:07,913 INFO L432 stractBuchiCegarLoop]: Abstraction has 355 states and 406 transitions. [2025-03-04 16:06:07,913 INFO L338 stractBuchiCegarLoop]: ======== Iteration 15 ============ [2025-03-04 16:06:07,913 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 355 states and 406 transitions. [2025-03-04 16:06:07,917 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 50 [2025-03-04 16:06:07,918 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 16:06:07,918 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 16:06:07,920 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [216, 36, 36, 6, 6, 2, 1, 1, 1] [2025-03-04 16:06:07,920 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [36, 6, 6, 1, 1] [2025-03-04 16:06:07,920 INFO L752 eck$LassoCheckResult]: Stem: "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);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~pre4#1, main_#t~pre5#1, main_#t~pre6#1, main_#t~pre7#1, main_~a~0#1, main_~b~0#1, main_~c~0#1, main_~d~0#1;main_~a~0#1 := 6;main_~b~0#1 := 6;main_~c~0#1 := 6;main_~d~0#1 := 6;main_~a~0#1 := 0;" "assume main_~a~0#1 < 6;main_~b~0#1 := 0;" "assume main_~b~0#1 < 6;main_~c~0#1 := 0;" "assume main_~c~0#1 < 6;main_~d~0#1 := 0;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume !(main_~d~0#1 < 6);main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1;" "assume main_~c~0#1 < 6;main_~d~0#1 := 0;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume !(main_~d~0#1 < 6);main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1;" "assume main_~c~0#1 < 6;main_~d~0#1 := 0;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume !(main_~d~0#1 < 6);main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1;" "assume main_~c~0#1 < 6;main_~d~0#1 := 0;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume !(main_~d~0#1 < 6);main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1;" "assume main_~c~0#1 < 6;main_~d~0#1 := 0;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume !(main_~d~0#1 < 6);main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1;" "assume main_~c~0#1 < 6;main_~d~0#1 := 0;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume !(main_~d~0#1 < 6);main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1;" "assume !(main_~c~0#1 < 6);main_#t~pre6#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre6#1;" "assume main_~b~0#1 < 6;main_~c~0#1 := 0;" "assume main_~c~0#1 < 6;main_~d~0#1 := 0;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume !(main_~d~0#1 < 6);main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1;" "assume main_~c~0#1 < 6;main_~d~0#1 := 0;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume !(main_~d~0#1 < 6);main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1;" "assume main_~c~0#1 < 6;main_~d~0#1 := 0;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume !(main_~d~0#1 < 6);main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1;" "assume main_~c~0#1 < 6;main_~d~0#1 := 0;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume !(main_~d~0#1 < 6);main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1;" "assume main_~c~0#1 < 6;main_~d~0#1 := 0;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume !(main_~d~0#1 < 6);main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1;" "assume main_~c~0#1 < 6;main_~d~0#1 := 0;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume !(main_~d~0#1 < 6);main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1;" "assume !(main_~c~0#1 < 6);main_#t~pre6#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre6#1;" "assume main_~b~0#1 < 6;main_~c~0#1 := 0;" "assume main_~c~0#1 < 6;main_~d~0#1 := 0;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume !(main_~d~0#1 < 6);main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1;" "assume main_~c~0#1 < 6;main_~d~0#1 := 0;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume !(main_~d~0#1 < 6);main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1;" "assume main_~c~0#1 < 6;main_~d~0#1 := 0;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume !(main_~d~0#1 < 6);main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1;" "assume main_~c~0#1 < 6;main_~d~0#1 := 0;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume !(main_~d~0#1 < 6);main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1;" "assume main_~c~0#1 < 6;main_~d~0#1 := 0;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume !(main_~d~0#1 < 6);main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1;" "assume main_~c~0#1 < 6;main_~d~0#1 := 0;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume !(main_~d~0#1 < 6);main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1;" "assume !(main_~c~0#1 < 6);main_#t~pre6#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre6#1;" "assume main_~b~0#1 < 6;main_~c~0#1 := 0;" "assume main_~c~0#1 < 6;main_~d~0#1 := 0;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume !(main_~d~0#1 < 6);main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1;" "assume main_~c~0#1 < 6;main_~d~0#1 := 0;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume !(main_~d~0#1 < 6);main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1;" "assume main_~c~0#1 < 6;main_~d~0#1 := 0;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume !(main_~d~0#1 < 6);main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1;" "assume main_~c~0#1 < 6;main_~d~0#1 := 0;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume !(main_~d~0#1 < 6);main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1;" "assume main_~c~0#1 < 6;main_~d~0#1 := 0;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume !(main_~d~0#1 < 6);main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1;" "assume main_~c~0#1 < 6;main_~d~0#1 := 0;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume !(main_~d~0#1 < 6);main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1;" "assume !(main_~c~0#1 < 6);main_#t~pre6#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre6#1;" "assume main_~b~0#1 < 6;main_~c~0#1 := 0;" "assume main_~c~0#1 < 6;main_~d~0#1 := 0;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume !(main_~d~0#1 < 6);main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1;" "assume main_~c~0#1 < 6;main_~d~0#1 := 0;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume !(main_~d~0#1 < 6);main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1;" "assume main_~c~0#1 < 6;main_~d~0#1 := 0;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume !(main_~d~0#1 < 6);main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1;" "assume main_~c~0#1 < 6;main_~d~0#1 := 0;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume !(main_~d~0#1 < 6);main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1;" "assume main_~c~0#1 < 6;main_~d~0#1 := 0;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume !(main_~d~0#1 < 6);main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1;" "assume main_~c~0#1 < 6;main_~d~0#1 := 0;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume !(main_~d~0#1 < 6);main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1;" "assume !(main_~c~0#1 < 6);main_#t~pre6#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre6#1;" "assume main_~b~0#1 < 6;main_~c~0#1 := 0;" "assume main_~c~0#1 < 6;main_~d~0#1 := 0;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume !(main_~d~0#1 < 6);main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1;" "assume main_~c~0#1 < 6;main_~d~0#1 := 0;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume !(main_~d~0#1 < 6);main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1;" "assume main_~c~0#1 < 6;main_~d~0#1 := 0;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume !(main_~d~0#1 < 6);main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1;" "assume main_~c~0#1 < 6;main_~d~0#1 := 0;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume !(main_~d~0#1 < 6);main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1;" "assume main_~c~0#1 < 6;main_~d~0#1 := 0;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume !(main_~d~0#1 < 6);main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1;" "assume main_~c~0#1 < 6;main_~d~0#1 := 0;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume !(main_~d~0#1 < 6);main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1;" "assume !(main_~c~0#1 < 6);main_#t~pre6#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre6#1;" "assume !(main_~b~0#1 < 6);main_#t~pre7#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre7#1;" "assume main_~a~0#1 < 6;main_~b~0#1 := 0;" [2025-03-04 16:06:07,921 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~b~0#1 < 6;main_~c~0#1 := 0;" "assume main_~c~0#1 < 6;main_~d~0#1 := 0;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume !(main_~d~0#1 < 6);main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1;" "assume main_~c~0#1 < 6;main_~d~0#1 := 0;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume !(main_~d~0#1 < 6);main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1;" "assume main_~c~0#1 < 6;main_~d~0#1 := 0;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume !(main_~d~0#1 < 6);main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1;" "assume main_~c~0#1 < 6;main_~d~0#1 := 0;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume !(main_~d~0#1 < 6);main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1;" "assume main_~c~0#1 < 6;main_~d~0#1 := 0;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume !(main_~d~0#1 < 6);main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1;" "assume main_~c~0#1 < 6;main_~d~0#1 := 0;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume main_~d~0#1 < 6;main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1;" "assume !(main_~d~0#1 < 6);main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1;" "assume !(main_~c~0#1 < 6);main_#t~pre6#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre6#1;" [2025-03-04 16:06:07,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:06:07,921 INFO L85 PathProgramCache]: Analyzing trace with hash 1816479266, now seen corresponding path program 2 times [2025-03-04 16:06:07,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:06:07,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885001245] [2025-03-04 16:06:07,921 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 16:06:07,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:06:07,930 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 305 statements into 2 equivalence classes. [2025-03-04 16:06:07,967 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 305 of 305 statements. [2025-03-04 16:06:07,967 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 16:06:07,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:06:07,967 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:06:07,973 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 305 statements into 1 equivalence classes. [2025-03-04 16:06:08,012 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Ended with exit code 0 [2025-03-04 16:06:08,020 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Ended with exit code 0 [2025-03-04 16:06:08,023 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Forceful destruction successful, exit code 0 [2025-03-04 16:06:08,033 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 305 of 305 statements. [2025-03-04 16:06:08,034 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:06:08,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:06:08,042 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:06:08,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:06:08,043 INFO L85 PathProgramCache]: Analyzing trace with hash 359571817, now seen corresponding path program 2 times [2025-03-04 16:06:08,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:06:08,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214035728] [2025-03-04 16:06:08,043 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 16:06:08,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:06:08,046 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 50 statements into 2 equivalence classes. [2025-03-04 16:06:08,049 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 50 of 50 statements. [2025-03-04 16:06:08,049 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 16:06:08,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:06:08,049 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:06:08,050 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-04 16:06:08,053 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-04 16:06:08,053 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:06:08,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:06:08,055 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:06:08,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:06:08,055 INFO L85 PathProgramCache]: Analyzing trace with hash 1166359882, now seen corresponding path program 3 times [2025-03-04 16:06:08,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:06:08,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008650586] [2025-03-04 16:06:08,055 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 16:06:08,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:06:08,065 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 355 statements into 152 equivalence classes. [2025-03-04 16:06:08,124 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 152 check-sat command(s) and asserted 355 of 355 statements. [2025-03-04 16:06:08,124 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 152 check-sat command(s) [2025-03-04 16:06:08,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:06:08,124 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:06:08,131 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 355 statements into 1 equivalence classes. [2025-03-04 16:06:08,174 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 355 of 355 statements. [2025-03-04 16:06:08,175 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:06:08,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:06:08,191 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:06:08,672 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 16:06:08,672 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 16:06:08,672 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 16:06:08,672 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 16:06:08,672 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-04 16:06:08,673 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:06:08,673 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 16:06:08,673 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 16:06:08,673 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested_4.c_Iteration15_Loop [2025-03-04 16:06:08,673 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 16:06:08,673 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 16:06:08,673 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:06:08,674 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:06:08,676 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:06:08,678 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:06:08,680 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:06:08,681 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:06:08,703 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 16:06:08,704 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-04 16:06:08,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:06:08,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:06:08,707 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:06:08,708 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Waiting until timeout for monitored process [2025-03-04 16:06:08,709 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 16:06:08,709 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 16:06:08,718 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 16:06:08,719 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~pre4#1=0} Honda state: {ULTIMATE.start_main_#t~pre4#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-04 16:06:08,723 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Forceful destruction successful, exit code 0 [2025-03-04 16:06:08,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:06:08,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:06:08,725 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:06:08,726 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Waiting until timeout for monitored process [2025-03-04 16:06:08,727 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 16:06:08,727 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 16:06:08,736 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 16:06:08,737 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~pre6#1=0} Honda state: {ULTIMATE.start_main_#t~pre6#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-04 16:06:08,742 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Ended with exit code 0 [2025-03-04 16:06:08,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:06:08,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:06:08,743 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:06:08,744 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Waiting until timeout for monitored process [2025-03-04 16:06:08,745 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 16:06:08,745 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 16:06:08,755 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 16:06:08,755 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~pre5#1=0} Honda state: {ULTIMATE.start_main_#t~pre5#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-04 16:06:08,760 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Ended with exit code 0 [2025-03-04 16:06:08,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:06:08,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:06:08,762 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:06:08,763 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Waiting until timeout for monitored process [2025-03-04 16:06:08,764 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 16:06:08,764 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 16:06:08,774 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 16:06:08,774 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~c~0#1=6} Honda state: {ULTIMATE.start_main_~c~0#1=6} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-04 16:06:08,779 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Ended with exit code 0 [2025-03-04 16:06:08,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:06:08,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:06:08,781 INFO L229 MonitoredProcess]: Starting monitored process 58 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:06:08,782 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Waiting until timeout for monitored process [2025-03-04 16:06:08,783 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 16:06:08,783 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 16:06:08,793 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 16:06:08,793 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~d~0#1=6} Honda state: {ULTIMATE.start_main_~d~0#1=6} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-04 16:06:08,798 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Ended with exit code 0 [2025-03-04 16:06:08,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:06:08,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:06:08,799 INFO L229 MonitoredProcess]: Starting monitored process 59 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:06:08,800 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Waiting until timeout for monitored process [2025-03-04 16:06:08,801 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 16:06:08,801 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 16:06:08,816 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Ended with exit code 0 [2025-03-04 16:06:08,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:06:08,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:06:08,817 INFO L229 MonitoredProcess]: Starting monitored process 60 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:06:08,818 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Waiting until timeout for monitored process [2025-03-04 16:06:08,819 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-04 16:06:08,819 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 16:06:08,839 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-04 16:06:08,843 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Ended with exit code 0 [2025-03-04 16:06:08,843 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 16:06:08,843 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 16:06:08,843 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 16:06:08,843 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 16:06:08,843 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 16:06:08,843 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:06:08,843 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 16:06:08,843 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 16:06:08,843 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested_4.c_Iteration15_Loop [2025-03-04 16:06:08,843 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 16:06:08,843 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 16:06:08,844 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:06:08,846 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:06:08,847 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:06:08,848 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:06:08,850 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:06:08,852 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:06:08,877 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 16:06:08,878 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 16:06:08,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:06:08,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:06:08,879 INFO L229 MonitoredProcess]: Starting monitored process 61 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:06:08,880 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Waiting until timeout for monitored process [2025-03-04 16:06:08,881 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 [2025-03-04 16:06:08,890 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:06:08,890 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:06:08,890 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:06:08,890 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:06:08,890 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:06:08,891 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:06:08,891 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:06:08,892 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:06:08,897 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Forceful destruction successful, exit code 0 [2025-03-04 16:06:08,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:06:08,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:06:08,899 INFO L229 MonitoredProcess]: Starting monitored process 62 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:06:08,899 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Waiting until timeout for monitored process [2025-03-04 16:06:08,901 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 [2025-03-04 16:06:08,910 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:06:08,910 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:06:08,911 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:06:08,911 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:06:08,911 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:06:08,911 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:06:08,911 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:06:08,912 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:06:08,917 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Ended with exit code 0 [2025-03-04 16:06:08,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:06:08,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:06:08,919 INFO L229 MonitoredProcess]: Starting monitored process 63 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:06:08,919 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Waiting until timeout for monitored process [2025-03-04 16:06:08,920 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 [2025-03-04 16:06:08,930 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:06:08,930 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:06:08,930 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:06:08,930 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:06:08,930 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:06:08,930 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:06:08,930 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:06:08,931 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:06:08,936 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Ended with exit code 0 [2025-03-04 16:06:08,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:06:08,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:06:08,938 INFO L229 MonitoredProcess]: Starting monitored process 64 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:06:08,938 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Waiting until timeout for monitored process [2025-03-04 16:06:08,939 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 [2025-03-04 16:06:08,948 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:06:08,948 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:06:08,949 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:06:08,949 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:06:08,949 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:06:08,949 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:06:08,949 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:06:08,950 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:06:08,955 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Ended with exit code 0 [2025-03-04 16:06:08,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:06:08,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:06:08,957 INFO L229 MonitoredProcess]: Starting monitored process 65 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:06:08,958 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Waiting until timeout for monitored process [2025-03-04 16:06:08,958 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 [2025-03-04 16:06:08,967 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:06:08,968 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:06:08,968 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:06:08,968 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:06:08,968 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:06:08,968 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:06:08,968 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:06:08,970 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:06:08,975 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Ended with exit code 0 [2025-03-04 16:06:08,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:06:08,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:06:08,976 INFO L229 MonitoredProcess]: Starting monitored process 66 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:06:08,977 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Waiting until timeout for monitored process [2025-03-04 16:06:08,978 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 [2025-03-04 16:06:08,987 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:06:08,987 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:06:08,988 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:06:08,988 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:06:08,988 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:06:08,988 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:06:08,988 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:06:08,990 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 16:06:08,991 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-04 16:06:08,991 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-03-04 16:06:08,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:06:08,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:06:08,993 INFO L229 MonitoredProcess]: Starting monitored process 67 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:06:08,994 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Waiting until timeout for monitored process [2025-03-04 16:06:08,995 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 16:06:08,995 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-04 16:06:08,995 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 16:06:08,995 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~b~0#1) = -2*ULTIMATE.start_main_~b~0#1 + 11 Supporting invariants [] [2025-03-04 16:06:09,000 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Ended with exit code 0 [2025-03-04 16:06:09,000 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-04 16:06:09,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:06:09,036 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 305 statements into 1 equivalence classes. [2025-03-04 16:06:09,105 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 305 of 305 statements. [2025-03-04 16:06:09,105 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:06:09,105 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:06:09,108 INFO L256 TraceCheckSpWp]: Trace formula consists of 938 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 16:06:09,111 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 16:06:09,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-04 16:06:09,378 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-04 16:06:09,378 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:06:09,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:06:09,379 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 16:06:09,379 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 16:06:09,497 INFO L134 CoverageAnalysis]: Checked inductivity of 882 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 882 trivial. 0 not checked. [2025-03-04 16:06:09,498 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-03-04 16:06:09,498 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 355 states and 406 transitions. cyclomatic complexity: 53 Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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) [2025-03-04 16:06:09,512 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 355 states and 406 transitions. cyclomatic complexity: 53. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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 952 states and 1090 transitions. Complement of second has 7 states. [2025-03-04 16:06:09,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-03-04 16:06:09,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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) [2025-03-04 16:06:09,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2025-03-04 16:06:09,513 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 305 letters. Loop has 50 letters. [2025-03-04 16:06:09,513 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 16:06:09,513 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-04 16:06:09,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:06:09,548 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 305 statements into 1 equivalence classes. [2025-03-04 16:06:09,610 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 305 of 305 statements. [2025-03-04 16:06:09,610 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:06:09,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:06:09,613 INFO L256 TraceCheckSpWp]: Trace formula consists of 938 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 16:06:09,627 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 16:06:09,632 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Forceful destruction successful, exit code 0 [2025-03-04 16:06:09,880 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-04 16:06:09,890 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-04 16:06:09,890 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:06:09,890 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:06:09,891 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 16:06:09,891 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 16:06:10,012 INFO L134 CoverageAnalysis]: Checked inductivity of 882 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 882 trivial. 0 not checked. [2025-03-04 16:06:10,012 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2025-03-04 16:06:10,013 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 355 states and 406 transitions. cyclomatic complexity: 53 Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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) [2025-03-04 16:06:10,031 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 355 states and 406 transitions. cyclomatic complexity: 53. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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 952 states and 1090 transitions. Complement of second has 7 states. [2025-03-04 16:06:10,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-03-04 16:06:10,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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) [2025-03-04 16:06:10,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2025-03-04 16:06:10,032 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 305 letters. Loop has 50 letters. [2025-03-04 16:06:10,032 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 16:06:10,032 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-04 16:06:10,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:06:10,073 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 305 statements into 1 equivalence classes. [2025-03-04 16:06:10,142 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 305 of 305 statements. [2025-03-04 16:06:10,143 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:06:10,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:06:10,146 INFO L256 TraceCheckSpWp]: Trace formula consists of 938 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 16:06:10,149 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 16:06:10,394 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-04 16:06:10,404 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-04 16:06:10,405 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:06:10,405 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:06:10,405 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 16:06:10,405 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 16:06:10,511 INFO L134 CoverageAnalysis]: Checked inductivity of 882 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 882 trivial. 0 not checked. [2025-03-04 16:06:10,512 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-03-04 16:06:10,512 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 355 states and 406 transitions. cyclomatic complexity: 53 Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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) [2025-03-04 16:06:10,524 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 355 states and 406 transitions. cyclomatic complexity: 53. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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 700 states and 802 transitions. Complement of second has 6 states. [2025-03-04 16:06:10,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-03-04 16:06:10,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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) [2025-03-04 16:06:10,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2025-03-04 16:06:10,525 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 305 letters. Loop has 50 letters. [2025-03-04 16:06:10,526 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 16:06:10,526 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 355 letters. Loop has 50 letters. [2025-03-04 16:06:10,527 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 16:06:10,527 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 305 letters. Loop has 100 letters. [2025-03-04 16:06:10,527 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 16:06:10,528 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 700 states and 802 transitions. [2025-03-04 16:06:10,530 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-03-04 16:06:10,530 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 700 states to 0 states and 0 transitions. [2025-03-04 16:06:10,531 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-03-04 16:06:10,531 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-03-04 16:06:10,531 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-03-04 16:06:10,531 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-04 16:06:10,531 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 16:06:10,531 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 16:06:10,531 INFO L432 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 16:06:10,531 INFO L338 stractBuchiCegarLoop]: ======== Iteration 16 ============ [2025-03-04 16:06:10,531 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-03-04 16:06:10,531 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-03-04 16:06:10,531 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-03-04 16:06:10,536 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 04.03 04:06:10 BoogieIcfgContainer [2025-03-04 16:06:10,536 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-03-04 16:06:10,537 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 16:06:10,537 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 16:06:10,537 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 16:06:10,537 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 04:05:47" (3/4) ... [2025-03-04 16:06:10,539 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-04 16:06:10,539 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 16:06:10,540 INFO L158 Benchmark]: Toolchain (without parser) took 23381.58ms. Allocated memory was 167.8MB in the beginning and 335.5MB in the end (delta: 167.8MB). Free memory was 134.1MB in the beginning and 149.7MB in the end (delta: -15.6MB). Peak memory consumption was 151.2MB. Max. memory is 16.1GB. [2025-03-04 16:06:10,540 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 127.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 16:06:10,540 INFO L158 Benchmark]: CACSL2BoogieTranslator took 139.57ms. Allocated memory is still 167.8MB. Free memory was 133.6MB in the beginning and 123.4MB in the end (delta: 10.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 16:06:10,540 INFO L158 Benchmark]: Boogie Procedure Inliner took 20.89ms. Allocated memory is still 167.8MB. Free memory was 123.4MB in the beginning and 122.5MB in the end (delta: 903.3kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 16:06:10,540 INFO L158 Benchmark]: Boogie Preprocessor took 20.25ms. Allocated memory is still 167.8MB. Free memory was 122.5MB in the beginning and 121.5MB in the end (delta: 999.2kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 16:06:10,541 INFO L158 Benchmark]: IcfgBuilder took 167.43ms. Allocated memory is still 167.8MB. Free memory was 121.0MB in the beginning and 110.5MB in the end (delta: 10.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 16:06:10,541 INFO L158 Benchmark]: BuchiAutomizer took 23026.62ms. Allocated memory was 167.8MB in the beginning and 335.5MB in the end (delta: 167.8MB). Free memory was 110.5MB in the beginning and 149.8MB in the end (delta: -39.3MB). Peak memory consumption was 126.0MB. Max. memory is 16.1GB. [2025-03-04 16:06:10,541 INFO L158 Benchmark]: Witness Printer took 2.53ms. Allocated memory is still 335.5MB. Free memory was 149.8MB in the beginning and 149.7MB in the end (delta: 101.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 16:06:10,542 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.20ms. Allocated memory is still 201.3MB. Free memory is still 127.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 139.57ms. Allocated memory is still 167.8MB. Free memory was 133.6MB in the beginning and 123.4MB in the end (delta: 10.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 20.89ms. Allocated memory is still 167.8MB. Free memory was 123.4MB in the beginning and 122.5MB in the end (delta: 903.3kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 20.25ms. Allocated memory is still 167.8MB. Free memory was 122.5MB in the beginning and 121.5MB in the end (delta: 999.2kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 167.43ms. Allocated memory is still 167.8MB. Free memory was 121.0MB in the beginning and 110.5MB in the end (delta: 10.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * BuchiAutomizer took 23026.62ms. Allocated memory was 167.8MB in the beginning and 335.5MB in the end (delta: 167.8MB). Free memory was 110.5MB in the beginning and 149.8MB in the end (delta: -39.3MB). Peak memory consumption was 126.0MB. Max. memory is 16.1GB. * Witness Printer took 2.53ms. Allocated memory is still 335.5MB. Free memory was 149.8MB in the beginning and 149.7MB in the end (delta: 101.6kB). There was no memory consumed. 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 15 terminating modules (8 trivial, 4 deterministic, 3 nondeterministic). One deterministic module has affine ranking function (((long long) -2 * a) + 11) and consists of 3 locations. One deterministic module has affine ranking function (((long long) -2 * b) + 11) and consists of 4 locations. One deterministic module has affine ranking function (((long long) -2 * c) + 11) and consists of 4 locations. One deterministic module has affine ranking function (((long long) -2 * d) + 11) and consists of 3 locations. One nondeterministic module has affine ranking function (((long long) -2 * d) + 11) and consists of 3 locations. One nondeterministic module has affine ranking function (((long long) -2 * c) + 11) and consists of 4 locations. One nondeterministic module has affine ranking function (((long long) -2 * b) + 11) and consists of 4 locations. 8 modules have a trivial ranking function, the largest among these consists of 10 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 22.9s and 16 iterations. TraceHistogramMax:216. Analysis of lassos took 18.9s. Construction of modules took 0.2s. Büchi inclusion checks took 3.6s. Highest rank in rank-based complementation 3. Minimization of det autom 9. Minimization of nondet autom 6. Automata minimization 0.1s AutomataMinimizationTime, 14 MinimizatonAttempts, 779 StatesRemovedByMinimization, 10 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [4, 0, 3, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 34314/34314 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 281 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 268 mSDsluCounter, 278 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 114 mSDsCounter, 56 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 214 IncrementalHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 56 mSolverCounterUnsat, 164 mSDtfsCounter, 214 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI8 SFLT7 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital13 mio100 ax100 hnf100 lsp75 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq160 hnf93 smp100 dnf100 smp100 tf113 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 21ms VariablesStem: 0 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 17 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 7 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.5s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-03-04 16:06:10,552 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-04 16:06:10,754 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-04 16:06:10,953 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-04 16:06:11,153 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 16:06:11,356 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 16:06:11,559 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE