./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 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/loop-simple/nested_4.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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-?-48c9605-m [2025-02-08 14:40:43,400 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 14:40:43,468 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2025-02-08 14:40:43,474 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 14:40:43,476 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 14:40:43,476 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2025-02-08 14:40:43,505 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 14:40:43,506 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 14:40:43,507 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 14:40:43,507 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 14:40:43,508 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 14:40:43,508 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 14:40:43,508 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 14:40:43,509 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 14:40:43,509 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-02-08 14:40:43,509 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-02-08 14:40:43,509 INFO L153 SettingsManager]: * Use old map elimination=false [2025-02-08 14:40:43,509 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-02-08 14:40:43,510 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-02-08 14:40:43,510 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-02-08 14:40:43,510 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 14:40:43,510 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-02-08 14:40:43,510 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 14:40:43,510 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 14:40:43,510 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 14:40:43,510 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 14:40:43,510 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-02-08 14:40:43,510 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-02-08 14:40:43,511 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-02-08 14:40:43,511 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 14:40:43,511 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 14:40:43,511 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 14:40:43,511 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-02-08 14:40:43,512 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 14:40:43,512 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 14:40:43,512 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 14:40:43,512 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 14:40:43,512 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 14:40:43,512 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 14:40:43,512 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-02-08 14:40:43,512 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-jdk21/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-02-08 14:40:43,800 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 14:40:43,808 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 14:40:43,810 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 14:40:43,811 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 14:40:43,811 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 14:40:43,813 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-simple/nested_4.c [2025-02-08 14:40:45,156 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5b94dc318/88912b76c4824f769b3e1da921d968df/FLAG6f98626de [2025-02-08 14:40:45,378 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 14:40:45,380 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/loop-simple/nested_4.c [2025-02-08 14:40:45,387 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5b94dc318/88912b76c4824f769b3e1da921d968df/FLAG6f98626de [2025-02-08 14:40:45,420 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5b94dc318/88912b76c4824f769b3e1da921d968df [2025-02-08 14:40:45,424 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 14:40:45,426 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 14:40:45,427 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 14:40:45,427 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 14:40:45,432 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 14:40:45,433 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 02:40:45" (1/1) ... [2025-02-08 14:40:45,434 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36ca37eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:40:45, skipping insertion in model container [2025-02-08 14:40:45,434 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 02:40:45" (1/1) ... [2025-02-08 14:40:45,446 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 14:40:45,576 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 14:40:45,588 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 14:40:45,600 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 14:40:45,615 INFO L204 MainTranslator]: Completed translation [2025-02-08 14:40:45,615 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:40:45 WrapperNode [2025-02-08 14:40:45,616 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 14:40:45,617 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 14:40:45,617 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 14:40:45,617 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 14:40:45,622 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:40:45" (1/1) ... [2025-02-08 14:40:45,627 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:40:45" (1/1) ... [2025-02-08 14:40:45,639 INFO L138 Inliner]: procedures = 10, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 38 [2025-02-08 14:40:45,640 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 14:40:45,640 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 14:40:45,641 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 14:40:45,641 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 14:40:45,647 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:40:45" (1/1) ... [2025-02-08 14:40:45,647 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:40:45" (1/1) ... [2025-02-08 14:40:45,648 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:40:45" (1/1) ... [2025-02-08 14:40:45,657 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-02-08 14:40:45,658 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:40:45" (1/1) ... [2025-02-08 14:40:45,658 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:40:45" (1/1) ... [2025-02-08 14:40:45,662 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:40:45" (1/1) ... [2025-02-08 14:40:45,665 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:40:45" (1/1) ... [2025-02-08 14:40:45,666 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:40:45" (1/1) ... [2025-02-08 14:40:45,666 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:40:45" (1/1) ... [2025-02-08 14:40:45,667 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 14:40:45,667 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 14:40:45,668 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 14:40:45,668 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 14:40:45,670 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:40:45" (1/1) ... [2025-02-08 14:40:45,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:40:45,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:40:45,701 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:40:45,704 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2025-02-08 14:40:45,723 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 14:40:45,724 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 14:40:45,724 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 14:40:45,724 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 14:40:45,768 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 14:40:45,770 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 14:40:45,883 INFO L? ?]: Removed 6 outVars from TransFormulas that were not future-live. [2025-02-08 14:40:45,883 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 14:40:45,894 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 14:40:45,894 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 14:40:45,895 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 02:40:45 BoogieIcfgContainer [2025-02-08 14:40:45,895 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 14:40:45,896 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-02-08 14:40:45,896 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-02-08 14:40:45,901 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-02-08 14:40:45,904 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-08 14:40:45,904 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 08.02 02:40:45" (1/3) ... [2025-02-08 14:40:45,905 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4ddfa52b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 08.02 02:40:45, skipping insertion in model container [2025-02-08 14:40:45,905 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-08 14:40:45,906 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:40:45" (2/3) ... [2025-02-08 14:40:45,906 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4ddfa52b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 08.02 02:40:45, skipping insertion in model container [2025-02-08 14:40:45,906 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-08 14:40:45,906 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 02:40:45" (3/3) ... [2025-02-08 14:40:45,907 INFO L363 chiAutomizerObserver]: Analyzing ICFG nested_4.c [2025-02-08 14:40:45,953 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-02-08 14:40:45,954 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-02-08 14:40:45,954 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-02-08 14:40:45,954 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-02-08 14:40:45,954 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-02-08 14:40:45,955 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-02-08 14:40:45,955 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-02-08 14:40:45,955 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-02-08 14:40:45,960 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 9 states, 8 states have (on average 1.625) internal successors, (13), 8 states have internal predecessors, (13), 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-02-08 14:40:45,974 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2025-02-08 14:40:45,974 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:40:45,975 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:40:45,978 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-02-08 14:40:45,978 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-08 14:40:45,978 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-02-08 14:40:45,979 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 9 states, 8 states have (on average 1.625) internal successors, (13), 8 states have internal predecessors, (13), 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-02-08 14:40:45,979 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2025-02-08 14:40:45,980 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:40:45,980 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:40:45,981 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-02-08 14:40:45,981 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-08 14:40:45,986 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-02-08 14:40:45,986 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-02-08 14:40:45,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:40:45,991 INFO L85 PathProgramCache]: Analyzing trace with hash 42, now seen corresponding path program 1 times [2025-02-08 14:40:45,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:40:45,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542925024] [2025-02-08 14:40:45,999 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:40:45,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:40:46,058 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-08 14:40:46,073 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-08 14:40:46,073 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:40:46,073 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:40:46,074 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:40:46,078 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-08 14:40:46,083 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-08 14:40:46,083 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:40:46,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:40:46,098 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:40:46,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:40:46,101 INFO L85 PathProgramCache]: Analyzing trace with hash 1243, now seen corresponding path program 1 times [2025-02-08 14:40:46,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:40:46,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483943740] [2025-02-08 14:40:46,101 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:40:46,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:40:46,108 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-08 14:40:46,112 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-08 14:40:46,117 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:40:46,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:40:46,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:40:46,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:40:46,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483943740] [2025-02-08 14:40:46,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483943740] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:40:46,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:40:46,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 14:40:46,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499255412] [2025-02-08 14:40:46,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:40:46,175 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-02-08 14:40:46,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:40:46,198 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 14:40:46,199 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 14:40:46,201 INFO L87 Difference]: Start difference. First operand has 9 states, 8 states have (on average 1.625) internal successors, (13), 8 states have internal predecessors, (13), 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-02-08 14:40:46,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 14:40:46,233 INFO L93 Difference]: Finished difference Result 12 states and 17 transitions. [2025-02-08 14:40:46,235 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 17 transitions. [2025-02-08 14:40:46,236 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2025-02-08 14:40:46,240 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 8 states and 13 transitions. [2025-02-08 14:40:46,241 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2025-02-08 14:40:46,241 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2025-02-08 14:40:46,242 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 13 transitions. [2025-02-08 14:40:46,242 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-08 14:40:46,242 INFO L218 hiAutomatonCegarLoop]: Abstraction has 8 states and 13 transitions. [2025-02-08 14:40:46,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states and 13 transitions. [2025-02-08 14:40:46,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 6. [2025-02-08 14:40:46,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 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-02-08 14:40:46,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 9 transitions. [2025-02-08 14:40:46,266 INFO L240 hiAutomatonCegarLoop]: Abstraction has 6 states and 9 transitions. [2025-02-08 14:40:46,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 14:40:46,270 INFO L432 stractBuchiCegarLoop]: Abstraction has 6 states and 9 transitions. [2025-02-08 14:40:46,270 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-02-08 14:40:46,271 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6 states and 9 transitions. [2025-02-08 14:40:46,271 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-02-08 14:40:46,271 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:40:46,271 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:40:46,271 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-02-08 14:40:46,271 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-02-08 14:40:46,271 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-02-08 14:40:46,276 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-02-08 14:40:46,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:40:46,276 INFO L85 PathProgramCache]: Analyzing trace with hash 42, now seen corresponding path program 2 times [2025-02-08 14:40:46,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:40:46,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961758847] [2025-02-08 14:40:46,277 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 14:40:46,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:40:46,284 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1 statements into 1 equivalence classes. [2025-02-08 14:40:46,287 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-08 14:40:46,287 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 14:40:46,287 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:40:46,287 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:40:46,289 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-08 14:40:46,292 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-08 14:40:46,292 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:40:46,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:40:46,293 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:40:46,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:40:46,294 INFO L85 PathProgramCache]: Analyzing trace with hash 1199455, now seen corresponding path program 1 times [2025-02-08 14:40:46,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:40:46,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624536524] [2025-02-08 14:40:46,294 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:40:46,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:40:46,298 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 14:40:46,301 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 14:40:46,301 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:40:46,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:40:46,328 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:40:46,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:40:46,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624536524] [2025-02-08 14:40:46,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624536524] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:40:46,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:40:46,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 14:40:46,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619309606] [2025-02-08 14:40:46,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:40:46,329 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-02-08 14:40:46,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:40:46,329 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 14:40:46,330 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 14:40:46,330 INFO L87 Difference]: Start difference. First operand 6 states and 9 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-02-08 14:40:46,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 14:40:46,340 INFO L93 Difference]: Finished difference Result 8 states and 12 transitions. [2025-02-08 14:40:46,340 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 8 states and 12 transitions. [2025-02-08 14:40:46,340 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2025-02-08 14:40:46,340 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 8 states to 8 states and 12 transitions. [2025-02-08 14:40:46,340 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2025-02-08 14:40:46,341 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2025-02-08 14:40:46,341 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 12 transitions. [2025-02-08 14:40:46,341 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-08 14:40:46,341 INFO L218 hiAutomatonCegarLoop]: Abstraction has 8 states and 12 transitions. [2025-02-08 14:40:46,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states and 12 transitions. [2025-02-08 14:40:46,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 7. [2025-02-08 14:40:46,341 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-02-08 14:40:46,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 10 transitions. [2025-02-08 14:40:46,342 INFO L240 hiAutomatonCegarLoop]: Abstraction has 7 states and 10 transitions. [2025-02-08 14:40:46,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 14:40:46,343 INFO L432 stractBuchiCegarLoop]: Abstraction has 7 states and 10 transitions. [2025-02-08 14:40:46,344 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-02-08 14:40:46,344 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 10 transitions. [2025-02-08 14:40:46,344 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2025-02-08 14:40:46,345 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:40:46,345 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:40:46,345 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-02-08 14:40:46,345 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2025-02-08 14:40:46,345 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-02-08 14:40:46,346 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-02-08 14:40:46,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:40:46,346 INFO L85 PathProgramCache]: Analyzing trace with hash 42, now seen corresponding path program 3 times [2025-02-08 14:40:46,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:40:46,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309990988] [2025-02-08 14:40:46,347 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 14:40:46,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:40:46,351 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 1 statements into 1 equivalence classes. [2025-02-08 14:40:46,354 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-08 14:40:46,354 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-08 14:40:46,354 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:40:46,354 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:40:46,356 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-08 14:40:46,358 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-08 14:40:46,358 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:40:46,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:40:46,360 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:40:46,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:40:46,360 INFO L85 PathProgramCache]: Analyzing trace with hash 1152767677, now seen corresponding path program 1 times [2025-02-08 14:40:46,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:40:46,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282223146] [2025-02-08 14:40:46,361 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:40:46,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:40:46,364 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 14:40:46,368 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 14:40:46,368 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:40:46,368 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:40:46,394 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:40:46,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:40:46,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282223146] [2025-02-08 14:40:46,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282223146] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:40:46,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:40:46,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 14:40:46,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317647372] [2025-02-08 14:40:46,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:40:46,396 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-02-08 14:40:46,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:40:46,397 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 14:40:46,397 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 14:40:46,397 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 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-02-08 14:40:46,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 14:40:46,413 INFO L93 Difference]: Finished difference Result 8 states and 11 transitions. [2025-02-08 14:40:46,413 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 8 states and 11 transitions. [2025-02-08 14:40:46,413 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2025-02-08 14:40:46,413 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 8 states to 8 states and 11 transitions. [2025-02-08 14:40:46,413 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2025-02-08 14:40:46,413 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2025-02-08 14:40:46,414 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 11 transitions. [2025-02-08 14:40:46,414 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-08 14:40:46,414 INFO L218 hiAutomatonCegarLoop]: Abstraction has 8 states and 11 transitions. [2025-02-08 14:40:46,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states and 11 transitions. [2025-02-08 14:40:46,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2025-02-08 14:40:46,414 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-02-08 14:40:46,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 11 transitions. [2025-02-08 14:40:46,415 INFO L240 hiAutomatonCegarLoop]: Abstraction has 8 states and 11 transitions. [2025-02-08 14:40:46,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 14:40:46,416 INFO L432 stractBuchiCegarLoop]: Abstraction has 8 states and 11 transitions. [2025-02-08 14:40:46,416 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-02-08 14:40:46,416 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 11 transitions. [2025-02-08 14:40:46,417 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2025-02-08 14:40:46,418 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:40:46,418 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:40:46,418 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-02-08 14:40:46,418 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:40:46,418 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-02-08 14:40:46,418 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-02-08 14:40:46,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:40:46,420 INFO L85 PathProgramCache]: Analyzing trace with hash 42, now seen corresponding path program 4 times [2025-02-08 14:40:46,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:40:46,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065143965] [2025-02-08 14:40:46,420 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 14:40:46,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:40:46,425 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 1 statements into 2 equivalence classes. [2025-02-08 14:40:46,428 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 1 of 1 statements. [2025-02-08 14:40:46,428 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-08 14:40:46,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:40:46,428 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:40:46,430 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-08 14:40:46,432 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-08 14:40:46,432 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:40:46,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:40:46,433 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:40:46,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:40:46,434 INFO L85 PathProgramCache]: Analyzing trace with hash 1376090405, now seen corresponding path program 1 times [2025-02-08 14:40:46,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:40:46,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135098634] [2025-02-08 14:40:46,434 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:40:46,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:40:46,438 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 14:40:46,442 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 14:40:46,444 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:40:46,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:40:46,486 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:40:46,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:40:46,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135098634] [2025-02-08 14:40:46,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135098634] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:40:46,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [285860736] [2025-02-08 14:40:46,488 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:40:46,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:40:46,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:40:46,491 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 14:40:46,492 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-08 14:40:46,518 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 14:40:46,525 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 14:40:46,528 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:40:46,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:40:46,532 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 14:40:46,533 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:40:46,561 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:40:46,561 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 14:40:46,597 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:40:46,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [285860736] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 14:40:46,597 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 14:40:46,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2025-02-08 14:40:46,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398158506] [2025-02-08 14:40:46,598 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 14:40:46,598 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-02-08 14:40:46,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:40:46,598 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 14:40:46,598 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 14:40:46,599 INFO L87 Difference]: Start difference. First operand 8 states and 11 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-02-08 14:40:46,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 14:40:46,618 INFO L93 Difference]: Finished difference Result 11 states and 14 transitions. [2025-02-08 14:40:46,618 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 14 transitions. [2025-02-08 14:40:46,619 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2025-02-08 14:40:46,619 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 11 states and 14 transitions. [2025-02-08 14:40:46,619 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2025-02-08 14:40:46,619 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2025-02-08 14:40:46,620 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 14 transitions. [2025-02-08 14:40:46,620 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-08 14:40:46,620 INFO L218 hiAutomatonCegarLoop]: Abstraction has 11 states and 14 transitions. [2025-02-08 14:40:46,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 14 transitions. [2025-02-08 14:40:46,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2025-02-08 14:40:46,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 10 states have internal predecessors, (14), 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-02-08 14:40:46,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 14 transitions. [2025-02-08 14:40:46,621 INFO L240 hiAutomatonCegarLoop]: Abstraction has 11 states and 14 transitions. [2025-02-08 14:40:46,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 14:40:46,623 INFO L432 stractBuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2025-02-08 14:40:46,623 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-02-08 14:40:46,623 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 14 transitions. [2025-02-08 14:40:46,623 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2025-02-08 14:40:46,623 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:40:46,623 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:40:46,624 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-02-08 14:40:46,624 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [4, 1, 1, 1, 1, 1, 1] [2025-02-08 14:40:46,624 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-02-08 14:40:46,624 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-02-08 14:40:46,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:40:46,625 INFO L85 PathProgramCache]: Analyzing trace with hash 42, now seen corresponding path program 5 times [2025-02-08 14:40:46,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:40:46,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2147177690] [2025-02-08 14:40:46,625 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-08 14:40:46,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:40:46,629 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 1 statements into 1 equivalence classes. [2025-02-08 14:40:46,635 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-08 14:40:46,635 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 14:40:46,635 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:40:46,635 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:40:46,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-08 14:40:46,639 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-08 14:40:46,639 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:40:46,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:40:46,641 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:40:46,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:40:46,641 INFO L85 PathProgramCache]: Analyzing trace with hash -323014467, now seen corresponding path program 2 times [2025-02-08 14:40:46,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:40:46,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662942808] [2025-02-08 14:40:46,642 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 14:40:46,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:40:46,646 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 10 statements into 2 equivalence classes. [2025-02-08 14:40:46,651 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 14:40:46,652 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 14:40:46,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:40:46,705 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-02-08 14:40:46,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:40:46,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662942808] [2025-02-08 14:40:46,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662942808] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:40:46,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1884862639] [2025-02-08 14:40:46,707 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 14:40:46,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:40:46,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:40:46,710 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 14:40:46,713 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-08 14:40:46,746 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 10 statements into 2 equivalence classes. [2025-02-08 14:40:46,759 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 14:40:46,759 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 14:40:46,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:40:46,759 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-08 14:40:46,761 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:40:46,827 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:40:46,827 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 14:40:46,894 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:40:46,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1884862639] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 14:40:46,895 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 14:40:46,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 7, 7] total 10 [2025-02-08 14:40:46,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408180105] [2025-02-08 14:40:46,896 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 14:40:46,897 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-02-08 14:40:46,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:40:46,897 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 14:40:46,897 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-02-08 14:40:46,897 INFO L87 Difference]: Start difference. First operand 11 states and 14 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-02-08 14:40:47,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 14:40:47,079 INFO L93 Difference]: Finished difference Result 32 states and 39 transitions. [2025-02-08 14:40:47,079 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 39 transitions. [2025-02-08 14:40:47,080 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 31 [2025-02-08 14:40:47,081 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 32 states and 39 transitions. [2025-02-08 14:40:47,081 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 32 [2025-02-08 14:40:47,081 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 32 [2025-02-08 14:40:47,081 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 39 transitions. [2025-02-08 14:40:47,081 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-08 14:40:47,081 INFO L218 hiAutomatonCegarLoop]: Abstraction has 32 states and 39 transitions. [2025-02-08 14:40:47,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 39 transitions. [2025-02-08 14:40:47,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 23. [2025-02-08 14:40:47,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 22 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:40:47,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 28 transitions. [2025-02-08 14:40:47,086 INFO L240 hiAutomatonCegarLoop]: Abstraction has 23 states and 28 transitions. [2025-02-08 14:40:47,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-02-08 14:40:47,088 INFO L432 stractBuchiCegarLoop]: Abstraction has 23 states and 28 transitions. [2025-02-08 14:40:47,088 INFO L338 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-02-08 14:40:47,088 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 28 transitions. [2025-02-08 14:40:47,089 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 22 [2025-02-08 14:40:47,089 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:40:47,089 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:40:47,089 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-02-08 14:40:47,089 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [12, 2, 2, 2, 2, 1, 1] [2025-02-08 14:40:47,090 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-02-08 14:40:47,090 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-02-08 14:40:47,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:40:47,090 INFO L85 PathProgramCache]: Analyzing trace with hash 42, now seen corresponding path program 6 times [2025-02-08 14:40:47,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:40:47,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491221235] [2025-02-08 14:40:47,090 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-08 14:40:47,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:40:47,097 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 1 statements into 1 equivalence classes. [2025-02-08 14:40:47,101 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-08 14:40:47,101 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-02-08 14:40:47,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:40:47,101 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:40:47,103 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-08 14:40:47,108 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-08 14:40:47,110 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:40:47,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:40:47,112 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:40:47,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:40:47,116 INFO L85 PathProgramCache]: Analyzing trace with hash 228181023, now seen corresponding path program 3 times [2025-02-08 14:40:47,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:40:47,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739176906] [2025-02-08 14:40:47,116 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 14:40:47,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:40:47,123 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 22 statements into 11 equivalence classes. [2025-02-08 14:40:47,141 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 22 of 22 statements. [2025-02-08 14:40:47,145 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-02-08 14:40:47,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:40:47,221 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2025-02-08 14:40:47,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:40:47,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739176906] [2025-02-08 14:40:47,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739176906] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:40:47,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [937320552] [2025-02-08 14:40:47,222 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 14:40:47,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:40:47,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:40:47,251 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 14:40:47,253 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-08 14:40:47,276 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 22 statements into 11 equivalence classes. [2025-02-08 14:40:47,289 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 22 of 22 statements. [2025-02-08 14:40:47,289 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-02-08 14:40:47,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:40:47,290 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 14:40:47,291 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:40:47,321 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 55 proven. 1 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2025-02-08 14:40:47,321 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 14:40:47,365 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 55 proven. 1 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2025-02-08 14:40:47,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [937320552] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 14:40:47,365 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 14:40:47,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 9 [2025-02-08 14:40:47,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770779897] [2025-02-08 14:40:47,365 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 14:40:47,365 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-02-08 14:40:47,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:40:47,366 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-08 14:40:47,366 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-02-08 14:40:47,366 INFO L87 Difference]: Start difference. First operand 23 states and 28 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-02-08 14:40:47,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 14:40:47,560 INFO L93 Difference]: Finished difference Result 138 states and 159 transitions. [2025-02-08 14:40:47,560 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 138 states and 159 transitions. [2025-02-08 14:40:47,562 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 137 [2025-02-08 14:40:47,564 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 138 states to 138 states and 159 transitions. [2025-02-08 14:40:47,564 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 138 [2025-02-08 14:40:47,564 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 138 [2025-02-08 14:40:47,565 INFO L73 IsDeterministic]: Start isDeterministic. Operand 138 states and 159 transitions. [2025-02-08 14:40:47,565 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-08 14:40:47,565 INFO L218 hiAutomatonCegarLoop]: Abstraction has 138 states and 159 transitions. [2025-02-08 14:40:47,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states and 159 transitions. [2025-02-08 14:40:47,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 105. [2025-02-08 14:40:47,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 105 states have (on average 1.1523809523809523) internal successors, (121), 104 states have internal predecessors, (121), 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-02-08 14:40:47,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 121 transitions. [2025-02-08 14:40:47,574 INFO L240 hiAutomatonCegarLoop]: Abstraction has 105 states and 121 transitions. [2025-02-08 14:40:47,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-02-08 14:40:47,575 INFO L432 stractBuchiCegarLoop]: Abstraction has 105 states and 121 transitions. [2025-02-08 14:40:47,576 INFO L338 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-02-08 14:40:47,576 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 105 states and 121 transitions. [2025-02-08 14:40:47,579 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 104 [2025-02-08 14:40:47,580 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:40:47,580 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:40:47,584 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-02-08 14:40:47,584 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [72, 12, 12, 3, 3, 1, 1] [2025-02-08 14:40:47,584 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-02-08 14:40:47,584 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-02-08 14:40:47,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:40:47,586 INFO L85 PathProgramCache]: Analyzing trace with hash 42, now seen corresponding path program 7 times [2025-02-08 14:40:47,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:40:47,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756159616] [2025-02-08 14:40:47,586 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-08 14:40:47,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:40:47,592 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-08 14:40:47,594 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-08 14:40:47,595 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:40:47,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:40:47,596 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:40:47,597 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-08 14:40:47,602 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-08 14:40:47,602 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:40:47,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:40:47,603 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:40:47,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:40:47,604 INFO L85 PathProgramCache]: Analyzing trace with hash -1728902705, now seen corresponding path program 4 times [2025-02-08 14:40:47,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:40:47,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704099332] [2025-02-08 14:40:47,604 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 14:40:47,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:40:47,636 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 104 statements into 2 equivalence classes. [2025-02-08 14:40:47,668 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-02-08 14:40:47,668 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-02-08 14:40:47,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:40:47,844 INFO L134 CoverageAnalysis]: Checked inductivity of 3597 backedges. 1621 proven. 304 refuted. 0 times theorem prover too weak. 1672 trivial. 0 not checked. [2025-02-08 14:40:47,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:40:47,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704099332] [2025-02-08 14:40:47,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704099332] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:40:47,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [267629965] [2025-02-08 14:40:47,845 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 14:40:47,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:40:47,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:40:47,847 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 14:40:47,850 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-08 14:40:47,890 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 104 statements into 2 equivalence classes. [2025-02-08 14:40:47,931 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-02-08 14:40:47,932 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-02-08 14:40:47,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:40:47,933 INFO L256 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-08 14:40:47,937 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:40:48,004 INFO L134 CoverageAnalysis]: Checked inductivity of 3597 backedges. 1621 proven. 304 refuted. 0 times theorem prover too weak. 1672 trivial. 0 not checked. [2025-02-08 14:40:48,004 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 14:40:48,095 INFO L134 CoverageAnalysis]: Checked inductivity of 3597 backedges. 1621 proven. 304 refuted. 0 times theorem prover too weak. 1672 trivial. 0 not checked. [2025-02-08 14:40:48,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [267629965] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 14:40:48,096 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 14:40:48,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 8 [2025-02-08 14:40:48,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328683710] [2025-02-08 14:40:48,096 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 14:40:48,096 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-02-08 14:40:48,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:40:48,097 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 14:40:48,097 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2025-02-08 14:40:48,097 INFO L87 Difference]: Start difference. First operand 105 states and 121 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-02-08 14:40:48,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 14:40:48,133 INFO L93 Difference]: Finished difference Result 153 states and 175 transitions. [2025-02-08 14:40:48,133 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 153 states and 175 transitions. [2025-02-08 14:40:48,135 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 152 [2025-02-08 14:40:48,138 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 153 states to 153 states and 175 transitions. [2025-02-08 14:40:48,139 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 153 [2025-02-08 14:40:48,139 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 153 [2025-02-08 14:40:48,140 INFO L73 IsDeterministic]: Start isDeterministic. Operand 153 states and 175 transitions. [2025-02-08 14:40:48,140 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-08 14:40:48,140 INFO L218 hiAutomatonCegarLoop]: Abstraction has 153 states and 175 transitions. [2025-02-08 14:40:48,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states and 175 transitions. [2025-02-08 14:40:48,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2025-02-08 14:40:48,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 153 states have (on average 1.1437908496732025) internal successors, (175), 152 states have internal predecessors, (175), 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-02-08 14:40:48,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 175 transitions. [2025-02-08 14:40:48,147 INFO L240 hiAutomatonCegarLoop]: Abstraction has 153 states and 175 transitions. [2025-02-08 14:40:48,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 14:40:48,148 INFO L432 stractBuchiCegarLoop]: Abstraction has 153 states and 175 transitions. [2025-02-08 14:40:48,148 INFO L338 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2025-02-08 14:40:48,148 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 153 states and 175 transitions. [2025-02-08 14:40:48,150 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 152 [2025-02-08 14:40:48,150 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:40:48,150 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:40:48,151 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-02-08 14:40:48,151 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [108, 18, 18, 3, 3, 1, 1] [2025-02-08 14:40:48,151 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-02-08 14:40:48,151 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-02-08 14:40:48,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:40:48,155 INFO L85 PathProgramCache]: Analyzing trace with hash 42, now seen corresponding path program 8 times [2025-02-08 14:40:48,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:40:48,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22728860] [2025-02-08 14:40:48,155 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 14:40:48,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:40:48,158 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1 statements into 1 equivalence classes. [2025-02-08 14:40:48,159 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-08 14:40:48,159 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 14:40:48,159 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:40:48,159 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:40:48,160 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-08 14:40:48,161 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-08 14:40:48,161 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:40:48,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:40:48,162 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:40:48,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:40:48,162 INFO L85 PathProgramCache]: Analyzing trace with hash 993461507, now seen corresponding path program 5 times [2025-02-08 14:40:48,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:40:48,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798554655] [2025-02-08 14:40:48,163 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-08 14:40:48,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:40:48,184 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 152 statements into 76 equivalence classes. [2025-02-08 14:40:48,253 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 76 check-sat command(s) and asserted 152 of 152 statements. [2025-02-08 14:40:48,253 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 76 check-sat command(s) [2025-02-08 14:40:48,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:40:48,494 INFO L134 CoverageAnalysis]: Checked inductivity of 8091 backedges. 0 proven. 5445 refuted. 0 times theorem prover too weak. 2646 trivial. 0 not checked. [2025-02-08 14:40:48,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:40:48,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798554655] [2025-02-08 14:40:48,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798554655] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:40:48,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [991819184] [2025-02-08 14:40:48,495 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-08 14:40:48,495 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:40:48,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:40:48,498 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 14:40:48,500 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-08 14:40:48,548 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 152 statements into 76 equivalence classes. [2025-02-08 14:40:48,651 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 76 check-sat command(s) and asserted 152 of 152 statements. [2025-02-08 14:40:48,651 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 76 check-sat command(s) [2025-02-08 14:40:48,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:40:48,654 INFO L256 TraceCheckSpWp]: Trace formula consists of 458 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-08 14:40:48,659 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:40:48,886 INFO L134 CoverageAnalysis]: Checked inductivity of 8091 backedges. 0 proven. 5445 refuted. 0 times theorem prover too weak. 2646 trivial. 0 not checked. [2025-02-08 14:40:48,886 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 14:40:49,142 INFO L134 CoverageAnalysis]: Checked inductivity of 8091 backedges. 0 proven. 5445 refuted. 0 times theorem prover too weak. 2646 trivial. 0 not checked. [2025-02-08 14:40:49,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [991819184] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 14:40:49,143 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 14:40:49,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2025-02-08 14:40:49,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609555922] [2025-02-08 14:40:49,143 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 14:40:49,145 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-02-08 14:40:49,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:40:49,145 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 14:40:49,146 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2025-02-08 14:40:49,146 INFO L87 Difference]: Start difference. First operand 153 states and 175 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-02-08 14:40:49,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 14:40:49,181 INFO L93 Difference]: Finished difference Result 303 states and 346 transitions. [2025-02-08 14:40:49,181 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 303 states and 346 transitions. [2025-02-08 14:40:49,183 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 302 [2025-02-08 14:40:49,185 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 303 states to 303 states and 346 transitions. [2025-02-08 14:40:49,185 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 303 [2025-02-08 14:40:49,185 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 303 [2025-02-08 14:40:49,185 INFO L73 IsDeterministic]: Start isDeterministic. Operand 303 states and 346 transitions. [2025-02-08 14:40:49,186 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-08 14:40:49,186 INFO L218 hiAutomatonCegarLoop]: Abstraction has 303 states and 346 transitions. [2025-02-08 14:40:49,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states and 346 transitions. [2025-02-08 14:40:49,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 303. [2025-02-08 14:40:49,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 303 states have (on average 1.141914191419142) internal successors, (346), 302 states have internal predecessors, (346), 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-02-08 14:40:49,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 346 transitions. [2025-02-08 14:40:49,203 INFO L240 hiAutomatonCegarLoop]: Abstraction has 303 states and 346 transitions. [2025-02-08 14:40:49,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 14:40:49,210 INFO L432 stractBuchiCegarLoop]: Abstraction has 303 states and 346 transitions. [2025-02-08 14:40:49,210 INFO L338 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2025-02-08 14:40:49,210 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 303 states and 346 transitions. [2025-02-08 14:40:49,214 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 302 [2025-02-08 14:40:49,214 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:40:49,214 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:40:49,217 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-02-08 14:40:49,220 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [216, 36, 36, 6, 6, 1, 1] [2025-02-08 14:40:49,221 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-02-08 14:40:49,221 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-02-08 14:40:49,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:40:49,222 INFO L85 PathProgramCache]: Analyzing trace with hash 42, now seen corresponding path program 9 times [2025-02-08 14:40:49,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:40:49,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890698397] [2025-02-08 14:40:49,223 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 14:40:49,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:40:49,226 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 1 statements into 1 equivalence classes. [2025-02-08 14:40:49,228 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-08 14:40:49,228 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-08 14:40:49,228 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:40:49,228 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:40:49,229 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-08 14:40:49,230 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-08 14:40:49,231 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:40:49,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:40:49,232 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:40:49,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:40:49,232 INFO L85 PathProgramCache]: Analyzing trace with hash 1872983851, now seen corresponding path program 6 times [2025-02-08 14:40:49,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:40:49,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227167069] [2025-02-08 14:40:49,233 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-08 14:40:49,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:40:49,254 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 302 statements into 151 equivalence classes. [2025-02-08 14:40:49,338 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 151 check-sat command(s) and asserted 302 of 302 statements. [2025-02-08 14:40:49,338 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 151 check-sat command(s) [2025-02-08 14:40:49,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:40:49,338 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:40:49,347 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 302 statements into 1 equivalence classes. [2025-02-08 14:40:49,454 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 302 of 302 statements. [2025-02-08 14:40:49,455 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:40:49,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:40:49,478 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:40:49,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:40:49,480 INFO L85 PathProgramCache]: Analyzing trace with hash 1473542036, now seen corresponding path program 1 times [2025-02-08 14:40:49,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:40:49,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140572965] [2025-02-08 14:40:49,480 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:40:49,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:40:49,501 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 303 statements into 1 equivalence classes. [2025-02-08 14:40:49,596 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 303 of 303 statements. [2025-02-08 14:40:49,596 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:40:49,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:40:49,596 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:40:49,607 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 303 statements into 1 equivalence classes. [2025-02-08 14:40:49,716 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 303 of 303 statements. [2025-02-08 14:40:49,717 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:40:49,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:40:49,746 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:41:05,187 WARN L286 SmtUtils]: Spent 15.32s 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-02-08 14:41:07,026 INFO L204 LassoAnalysis]: Preferences: [2025-02-08 14:41:07,027 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-08 14:41:07,027 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-08 14:41:07,027 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-08 14:41:07,027 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-08 14:41:07,027 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:41:07,028 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-08 14:41:07,028 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-08 14:41:07,028 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested_4.c_Iteration9_Loop [2025-02-08 14:41:07,028 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-08 14:41:07,028 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-08 14:41:07,045 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:41:07,051 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:41:07,055 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:41:07,058 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:41:07,060 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:41:07,063 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:41:07,065 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:41:07,067 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:41:07,124 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-08 14:41:07,124 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-08 14:41:07,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:41:07,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:41:07,129 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:41:07,130 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-02-08 14:41:07,132 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-08 14:41:07,133 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-08 14:41:07,149 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-02-08 14:41:07,150 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-02-08 14:41:07,158 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2025-02-08 14:41:07,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:41:07,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:41:07,160 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:41:07,163 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-02-08 14:41:07,164 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-08 14:41:07,164 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-08 14:41:07,180 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-02-08 14:41:07,180 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-02-08 14:41:07,188 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2025-02-08 14:41:07,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:41:07,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:41:07,191 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:41:07,193 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-02-08 14:41:07,195 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-08 14:41:07,195 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-08 14:41:07,209 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-02-08 14:41:07,209 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-02-08 14:41:07,217 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2025-02-08 14:41:07,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:41:07,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:41:07,220 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:41:07,222 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-02-08 14:41:07,223 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-08 14:41:07,223 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-08 14:41:07,239 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-02-08 14:41:07,240 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-02-08 14:41:07,253 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2025-02-08 14:41:07,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:41:07,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:41:07,256 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:41:07,258 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-02-08 14:41:07,259 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-08 14:41:07,259 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-08 14:41:07,278 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-02-08 14:41:07,278 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-02-08 14:41:07,287 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2025-02-08 14:41:07,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:41:07,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:41:07,290 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:41:07,293 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2025-02-08 14:41:07,294 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-08 14:41:07,294 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-08 14:41:07,309 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-02-08 14:41:07,309 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-02-08 14:41:07,316 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2025-02-08 14:41:07,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:41:07,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:41:07,319 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:41:07,327 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2025-02-08 14:41:07,328 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-08 14:41:07,328 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-08 14:41:07,341 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-02-08 14:41:07,341 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-02-08 14:41:07,348 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2025-02-08 14:41:07,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:41:07,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:41:07,351 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:41:07,352 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2025-02-08 14:41:07,354 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-08 14:41:07,354 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-08 14:41:07,373 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2025-02-08 14:41:07,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:41:07,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:41:07,376 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:41:07,379 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2025-02-08 14:41:07,379 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-08 14:41:07,380 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-08 14:41:07,408 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-08 14:41:07,413 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2025-02-08 14:41:07,413 INFO L204 LassoAnalysis]: Preferences: [2025-02-08 14:41:07,413 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-08 14:41:07,413 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-08 14:41:07,413 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-08 14:41:07,413 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-08 14:41:07,413 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:41:07,413 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-08 14:41:07,413 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-08 14:41:07,413 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested_4.c_Iteration9_Loop [2025-02-08 14:41:07,413 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-08 14:41:07,413 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-08 14:41:07,414 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:41:07,418 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:41:07,420 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:41:07,423 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:41:07,426 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:41:07,429 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:41:07,432 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:41:07,434 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:41:07,491 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-08 14:41:07,496 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-08 14:41:07,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:41:07,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:41:07,499 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:41:07,503 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2025-02-08 14:41:07,504 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-02-08 14:41:07,516 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:41:07,517 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:41:07,517 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:41:07,517 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:41:07,518 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:41:07,524 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:41:07,524 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:41:07,528 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:41:07,535 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2025-02-08 14:41:07,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:41:07,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:41:07,538 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:41:07,541 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2025-02-08 14:41:07,541 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-02-08 14:41:07,553 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:41:07,554 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:41:07,554 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:41:07,554 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:41:07,554 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:41:07,554 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:41:07,554 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:41:07,557 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:41:07,564 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2025-02-08 14:41:07,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:41:07,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:41:07,568 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:41:07,572 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-02-08 14:41:07,572 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2025-02-08 14:41:07,584 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:41:07,585 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:41:07,585 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:41:07,585 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:41:07,586 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:41:07,586 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:41:07,586 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:41:07,590 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:41:07,598 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2025-02-08 14:41:07,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:41:07,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:41:07,601 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:41:07,603 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2025-02-08 14:41:07,604 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-02-08 14:41:07,615 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:41:07,616 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:41:07,616 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:41:07,616 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:41:07,616 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:41:07,616 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:41:07,616 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:41:07,618 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:41:07,626 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2025-02-08 14:41:07,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:41:07,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:41:07,629 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:41:07,631 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2025-02-08 14:41:07,632 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-02-08 14:41:07,642 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:41:07,642 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:41:07,642 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:41:07,642 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:41:07,642 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:41:07,643 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:41:07,643 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:41:07,645 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:41:07,652 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2025-02-08 14:41:07,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:41:07,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:41:07,655 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:41:07,656 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2025-02-08 14:41:07,657 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-02-08 14:41:07,667 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:41:07,667 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:41:07,667 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:41:07,667 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:41:07,667 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:41:07,668 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:41:07,668 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:41:07,670 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:41:07,676 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2025-02-08 14:41:07,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:41:07,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:41:07,679 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:41:07,681 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2025-02-08 14:41:07,682 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-02-08 14:41:07,693 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:41:07,693 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:41:07,693 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:41:07,693 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:41:07,693 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:41:07,694 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:41:07,694 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:41:07,698 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:41:07,704 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2025-02-08 14:41:07,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:41:07,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:41:07,706 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:41:07,707 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2025-02-08 14:41:07,708 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-02-08 14:41:07,717 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:41:07,717 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:41:07,718 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:41:07,718 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:41:07,718 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:41:07,718 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:41:07,718 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:41:07,720 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-08 14:41:07,722 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-02-08 14:41:07,727 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-02-08 14:41:07,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:41:07,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:41:07,732 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:41:07,734 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2025-02-08 14:41:07,734 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-08 14:41:07,734 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-08 14:41:07,734 INFO L474 LassoAnalysis]: Proved termination. [2025-02-08 14:41:07,735 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-02-08 14:41:07,740 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2025-02-08 14:41:07,742 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-08 14:41:07,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:41:07,767 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-08 14:41:07,770 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-08 14:41:07,770 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:41:07,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:41:07,771 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-08 14:41:07,771 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:41:07,818 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 302 statements into 1 equivalence classes. [2025-02-08 14:41:07,921 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 302 of 302 statements. [2025-02-08 14:41:07,922 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:41:07,922 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:41:07,925 INFO L256 TraceCheckSpWp]: Trace formula consists of 908 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-08 14:41:07,931 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:41:08,907 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2025-02-08 14:41:09,089 INFO L134 CoverageAnalysis]: Checked inductivity of 32508 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32508 trivial. 0 not checked. [2025-02-08 14:41:09,097 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-02-08 14:41:09,099 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 303 states and 346 transitions. cyclomatic complexity: 44 Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 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-02-08 14:41:09,133 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 303 states and 346 transitions. cyclomatic complexity: 44. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 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 605 states and 692 transitions. Complement of second has 4 states. [2025-02-08 14:41:09,134 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-02-08 14:41:09,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 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-02-08 14:41:09,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 8 transitions. [2025-02-08 14:41:09,139 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 1 letters. Loop has 302 letters. [2025-02-08 14:41:09,143 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:41:09,143 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 303 letters. Loop has 302 letters. [2025-02-08 14:41:09,147 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:41:09,147 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 1 letters. Loop has 604 letters. [2025-02-08 14:41:09,148 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:41:09,148 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 605 states and 692 transitions. [2025-02-08 14:41:09,156 INFO L131 ngComponentsAnalysis]: Automaton has 31 accepting balls. 115 [2025-02-08 14:41:09,159 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 605 states to 605 states and 692 transitions. [2025-02-08 14:41:09,159 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 302 [2025-02-08 14:41:09,159 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 303 [2025-02-08 14:41:09,160 INFO L73 IsDeterministic]: Start isDeterministic. Operand 605 states and 692 transitions. [2025-02-08 14:41:09,163 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-08 14:41:09,163 INFO L218 hiAutomatonCegarLoop]: Abstraction has 605 states and 692 transitions. [2025-02-08 14:41:09,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states and 692 transitions. [2025-02-08 14:41:09,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 354. [2025-02-08 14:41:09,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 354 states have (on average 1.1468926553672316) internal successors, (406), 353 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-02-08 14:41:09,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 406 transitions. [2025-02-08 14:41:09,183 INFO L240 hiAutomatonCegarLoop]: Abstraction has 354 states and 406 transitions. [2025-02-08 14:41:09,183 INFO L432 stractBuchiCegarLoop]: Abstraction has 354 states and 406 transitions. [2025-02-08 14:41:09,183 INFO L338 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2025-02-08 14:41:09,183 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 354 states and 406 transitions. [2025-02-08 14:41:09,184 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 50 [2025-02-08 14:41:09,184 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:41:09,185 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:41:09,185 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-02-08 14:41:09,185 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [36, 6, 6, 1, 1] [2025-02-08 14:41:09,185 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-02-08 14:41:09,185 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-02-08 14:41:09,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:41:09,187 INFO L85 PathProgramCache]: Analyzing trace with hash 1311, now seen corresponding path program 1 times [2025-02-08 14:41:09,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:41:09,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802578509] [2025-02-08 14:41:09,187 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:41:09,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:41:09,191 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-08 14:41:09,192 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-08 14:41:09,192 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:41:09,192 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:41:09,192 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:41:09,193 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-08 14:41:09,194 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-08 14:41:09,194 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:41:09,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:41:09,195 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:41:09,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:41:09,195 INFO L85 PathProgramCache]: Analyzing trace with hash 1105246217, now seen corresponding path program 1 times [2025-02-08 14:41:09,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:41:09,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690709864] [2025-02-08 14:41:09,197 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:41:09,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:41:09,201 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-02-08 14:41:09,213 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-02-08 14:41:09,213 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:41:09,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:41:09,213 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:41:09,218 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-02-08 14:41:09,223 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-02-08 14:41:09,224 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:41:09,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:41:09,229 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:41:09,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:41:09,229 INFO L85 PathProgramCache]: Analyzing trace with hash -473761369, now seen corresponding path program 1 times [2025-02-08 14:41:09,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:41:09,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027636778] [2025-02-08 14:41:09,229 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:41:09,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:41:09,233 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-02-08 14:41:09,239 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-02-08 14:41:09,239 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:41:09,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:41:09,239 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:41:09,241 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-02-08 14:41:09,247 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-02-08 14:41:09,247 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:41:09,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:41:09,249 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:41:09,926 INFO L204 LassoAnalysis]: Preferences: [2025-02-08 14:41:09,926 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-08 14:41:09,926 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-08 14:41:09,926 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-08 14:41:09,926 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-08 14:41:09,926 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:41:09,926 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-08 14:41:09,926 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-08 14:41:09,926 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested_4.c_Iteration10_Loop [2025-02-08 14:41:09,926 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-08 14:41:09,926 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-08 14:41:09,927 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:41:09,930 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:41:09,934 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:41:09,935 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:41:09,938 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:41:09,939 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:41:09,969 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-08 14:41:09,969 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-08 14:41:09,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:41:09,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:41:09,971 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:41:09,971 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2025-02-08 14:41:09,972 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-08 14:41:09,972 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-08 14:41:09,982 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-02-08 14:41:09,982 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-02-08 14:41:09,987 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2025-02-08 14:41:09,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:41:09,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:41:09,990 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:41:09,992 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2025-02-08 14:41:09,992 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-08 14:41:09,992 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-08 14:41:10,009 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2025-02-08 14:41:10,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:41:10,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:41:10,011 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:41:10,012 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2025-02-08 14:41:10,012 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-08 14:41:10,013 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-08 14:41:10,034 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-08 14:41:10,039 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2025-02-08 14:41:10,039 INFO L204 LassoAnalysis]: Preferences: [2025-02-08 14:41:10,039 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-08 14:41:10,039 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-08 14:41:10,039 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-08 14:41:10,039 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-08 14:41:10,039 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:41:10,039 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-08 14:41:10,039 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-08 14:41:10,039 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested_4.c_Iteration10_Loop [2025-02-08 14:41:10,039 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-08 14:41:10,039 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-08 14:41:10,040 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:41:10,044 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:41:10,047 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:41:10,048 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:41:10,050 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:41:10,054 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:41:10,086 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-08 14:41:10,086 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-08 14:41:10,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:41:10,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:41:10,090 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:41:10,093 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2025-02-08 14:41:10,093 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-02-08 14:41:10,103 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:41:10,103 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:41:10,103 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:41:10,103 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:41:10,103 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:41:10,104 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:41:10,104 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:41:10,106 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-08 14:41:10,108 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-02-08 14:41:10,108 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-02-08 14:41:10,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:41:10,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:41:10,110 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:41:10,111 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2025-02-08 14:41:10,112 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-08 14:41:10,112 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-08 14:41:10,112 INFO L474 LassoAnalysis]: Proved termination. [2025-02-08 14:41:10,112 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-02-08 14:41:10,119 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2025-02-08 14:41:10,120 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-08 14:41:10,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:41:10,137 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-08 14:41:10,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-08 14:41:10,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:41:10,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:41:10,141 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-08 14:41:10,141 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:41:10,152 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-02-08 14:41:10,169 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-02-08 14:41:10,170 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:41:10,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:41:10,171 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-08 14:41:10,171 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:41:10,333 INFO L134 CoverageAnalysis]: Checked inductivity of 882 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 882 trivial. 0 not checked. [2025-02-08 14:41:10,334 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-02-08 14:41:10,334 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 354 states and 406 transitions. cyclomatic complexity: 54 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-02-08 14:41:10,357 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 354 states and 406 transitions. cyclomatic complexity: 54. 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 1051 states and 1205 transitions. Complement of second has 7 states. [2025-02-08 14:41:10,358 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-02-08 14:41:10,359 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-02-08 14:41:10,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 8 transitions. [2025-02-08 14:41:10,359 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 2 letters. Loop has 50 letters. [2025-02-08 14:41:10,360 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:41:10,360 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 52 letters. Loop has 50 letters. [2025-02-08 14:41:10,360 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:41:10,360 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 2 letters. Loop has 100 letters. [2025-02-08 14:41:10,360 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:41:10,360 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1051 states and 1205 transitions. [2025-02-08 14:41:10,371 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 63 [2025-02-08 14:41:10,374 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1051 states to 756 states and 867 transitions. [2025-02-08 14:41:10,375 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 101 [2025-02-08 14:41:10,375 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 102 [2025-02-08 14:41:10,375 INFO L73 IsDeterministic]: Start isDeterministic. Operand 756 states and 867 transitions. [2025-02-08 14:41:10,375 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-08 14:41:10,375 INFO L218 hiAutomatonCegarLoop]: Abstraction has 756 states and 867 transitions. [2025-02-08 14:41:10,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 756 states and 867 transitions. [2025-02-08 14:41:10,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 756 to 413. [2025-02-08 14:41:10,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 413 states, 413 states have (on average 1.1501210653753027) internal successors, (475), 412 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-02-08 14:41:10,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 475 transitions. [2025-02-08 14:41:10,384 INFO L240 hiAutomatonCegarLoop]: Abstraction has 413 states and 475 transitions. [2025-02-08 14:41:10,384 INFO L432 stractBuchiCegarLoop]: Abstraction has 413 states and 475 transitions. [2025-02-08 14:41:10,384 INFO L338 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2025-02-08 14:41:10,384 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 413 states and 475 transitions. [2025-02-08 14:41:10,386 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 58 [2025-02-08 14:41:10,386 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:41:10,386 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:41:10,386 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-02-08 14:41:10,386 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [6, 1, 1] [2025-02-08 14:41:10,387 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-02-08 14:41:10,387 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-02-08 14:41:10,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:41:10,387 INFO L85 PathProgramCache]: Analyzing trace with hash 40649, now seen corresponding path program 1 times [2025-02-08 14:41:10,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:41:10,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590956256] [2025-02-08 14:41:10,387 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:41:10,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:41:10,389 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 14:41:10,390 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 14:41:10,391 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:41:10,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:41:10,391 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:41:10,391 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 14:41:10,392 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 14:41:10,392 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:41:10,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:41:10,393 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:41:10,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:41:10,394 INFO L85 PathProgramCache]: Analyzing trace with hash -1285128481, now seen corresponding path program 1 times [2025-02-08 14:41:10,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:41:10,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622146300] [2025-02-08 14:41:10,394 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:41:10,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:41:10,395 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 14:41:10,396 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 14:41:10,397 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:41:10,397 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:41:10,397 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:41:10,397 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 14:41:10,398 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 14:41:10,398 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:41:10,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:41:10,399 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:41:10,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:41:10,400 INFO L85 PathProgramCache]: Analyzing trace with hash -983575129, now seen corresponding path program 1 times [2025-02-08 14:41:10,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:41:10,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513048400] [2025-02-08 14:41:10,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:41:10,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:41:10,402 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 14:41:10,403 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 14:41:10,403 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:41:10,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:41:10,403 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:41:10,404 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 14:41:10,406 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 14:41:10,406 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:41:10,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:41:10,407 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:41:10,463 INFO L204 LassoAnalysis]: Preferences: [2025-02-08 14:41:10,464 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-08 14:41:10,464 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-08 14:41:10,464 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-08 14:41:10,464 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-08 14:41:10,464 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:41:10,464 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-08 14:41:10,464 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-08 14:41:10,464 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested_4.c_Iteration11_Loop [2025-02-08 14:41:10,464 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-08 14:41:10,464 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-08 14:41:10,464 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:41:10,466 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:41:10,467 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:41:10,469 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:41:10,493 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-08 14:41:10,493 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-08 14:41:10,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:41:10,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:41:10,496 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:41:10,497 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2025-02-08 14:41:10,497 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-08 14:41:10,498 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-08 14:41:10,508 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-02-08 14:41:10,508 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-02-08 14:41:10,513 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2025-02-08 14:41:10,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:41:10,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:41:10,515 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:41:10,517 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2025-02-08 14:41:10,518 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-08 14:41:10,518 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-08 14:41:10,528 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-02-08 14:41:10,528 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-02-08 14:41:10,533 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2025-02-08 14:41:10,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:41:10,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:41:10,535 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:41:10,536 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2025-02-08 14:41:10,537 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-08 14:41:10,537 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-08 14:41:10,548 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-02-08 14:41:10,548 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-02-08 14:41:10,555 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2025-02-08 14:41:10,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:41:10,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:41:10,558 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:41:10,560 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2025-02-08 14:41:10,561 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-08 14:41:10,561 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-08 14:41:10,580 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2025-02-08 14:41:10,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:41:10,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:41:10,583 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:41:10,585 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2025-02-08 14:41:10,586 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-08 14:41:10,586 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-08 14:41:10,613 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-08 14:41:10,617 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2025-02-08 14:41:10,619 INFO L204 LassoAnalysis]: Preferences: [2025-02-08 14:41:10,619 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-08 14:41:10,619 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-08 14:41:10,619 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-08 14:41:10,619 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-08 14:41:10,619 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:41:10,619 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-08 14:41:10,619 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-08 14:41:10,619 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested_4.c_Iteration11_Loop [2025-02-08 14:41:10,619 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-08 14:41:10,619 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-08 14:41:10,620 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:41:10,624 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:41:10,626 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:41:10,628 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:41:10,649 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-08 14:41:10,649 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-08 14:41:10,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:41:10,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:41:10,651 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:41:10,652 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2025-02-08 14:41:10,653 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-02-08 14:41:10,662 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:41:10,662 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:41:10,662 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:41:10,662 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:41:10,662 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:41:10,663 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:41:10,663 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:41:10,664 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:41:10,669 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Ended with exit code 0 [2025-02-08 14:41:10,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:41:10,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:41:10,671 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:41:10,672 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2025-02-08 14:41:10,673 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-02-08 14:41:10,682 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:41:10,682 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:41:10,682 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:41:10,682 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:41:10,682 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:41:10,683 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:41:10,683 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:41:10,685 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:41:10,691 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Ended with exit code 0 [2025-02-08 14:41:10,691 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:41:10,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:41:10,693 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:41:10,694 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2025-02-08 14:41:10,695 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-02-08 14:41:10,704 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:41:10,704 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:41:10,704 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:41:10,704 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:41:10,704 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:41:10,705 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:41:10,705 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:41:10,706 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:41:10,711 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Ended with exit code 0 [2025-02-08 14:41:10,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:41:10,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:41:10,713 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:41:10,714 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2025-02-08 14:41:10,715 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-02-08 14:41:10,724 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:41:10,724 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:41:10,724 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:41:10,725 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:41:10,725 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:41:10,725 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:41:10,725 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:41:10,727 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-08 14:41:10,730 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-02-08 14:41:10,730 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-02-08 14:41:10,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:41:10,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:41:10,732 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:41:10,733 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2025-02-08 14:41:10,733 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-08 14:41:10,733 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-08 14:41:10,733 INFO L474 LassoAnalysis]: Proved termination. [2025-02-08 14:41:10,733 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-02-08 14:41:10,739 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Ended with exit code 0 [2025-02-08 14:41:10,739 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-08 14:41:10,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:41:10,750 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 14:41:10,753 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 14:41:10,754 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:41:10,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:41:10,754 INFO L256 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-08 14:41:10,754 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:41:10,759 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 14:41:10,761 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 14:41:10,762 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:41:10,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:41:10,762 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-08 14:41:10,762 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:41:10,796 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-02-08 14:41:10,797 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-02-08 14:41:10,797 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 413 states and 475 transitions. cyclomatic complexity: 66 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-02-08 14:41:10,816 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 413 states and 475 transitions. cyclomatic complexity: 66. 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) Result 616 states and 710 transitions. Complement of second has 7 states. [2025-02-08 14:41:10,817 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-02-08 14:41:10,817 INFO L82 GeneralOperation]: Start removeUnreachable. 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-02-08 14:41:10,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 7 transitions. [2025-02-08 14:41:10,817 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 3 letters. Loop has 8 letters. [2025-02-08 14:41:10,818 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:41:10,818 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 11 letters. Loop has 8 letters. [2025-02-08 14:41:10,818 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:41:10,818 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 3 letters. Loop has 16 letters. [2025-02-08 14:41:10,818 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:41:10,818 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 616 states and 710 transitions. [2025-02-08 14:41:10,827 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 59 [2025-02-08 14:41:10,830 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 616 states to 530 states and 610 transitions. [2025-02-08 14:41:10,831 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 68 [2025-02-08 14:41:10,831 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 69 [2025-02-08 14:41:10,831 INFO L73 IsDeterministic]: Start isDeterministic. Operand 530 states and 610 transitions. [2025-02-08 14:41:10,832 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-08 14:41:10,832 INFO L218 hiAutomatonCegarLoop]: Abstraction has 530 states and 610 transitions. [2025-02-08 14:41:10,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states and 610 transitions. [2025-02-08 14:41:10,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 423. [2025-02-08 14:41:10,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 423 states, 423 states have (on average 1.153664302600473) internal successors, (488), 422 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-02-08 14:41:10,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 488 transitions. [2025-02-08 14:41:10,839 INFO L240 hiAutomatonCegarLoop]: Abstraction has 423 states and 488 transitions. [2025-02-08 14:41:10,839 INFO L432 stractBuchiCegarLoop]: Abstraction has 423 states and 488 transitions. [2025-02-08 14:41:10,839 INFO L338 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2025-02-08 14:41:10,839 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 423 states and 488 transitions. [2025-02-08 14:41:10,841 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 59 [2025-02-08 14:41:10,841 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:41:10,841 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:41:10,842 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-02-08 14:41:10,842 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-02-08 14:41:10,842 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-02-08 14:41:10,842 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-02-08 14:41:10,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:41:10,842 INFO L85 PathProgramCache]: Analyzing trace with hash 1260126, now seen corresponding path program 1 times [2025-02-08 14:41:10,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:41:10,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425311211] [2025-02-08 14:41:10,843 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:41:10,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:41:10,845 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 14:41:10,850 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 14:41:10,850 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:41:10,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:41:10,851 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:41:10,851 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 14:41:10,852 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 14:41:10,852 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:41:10,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:41:10,853 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:41:10,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:41:10,857 INFO L85 PathProgramCache]: Analyzing trace with hash 37, now seen corresponding path program 1 times [2025-02-08 14:41:10,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:41:10,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289387689] [2025-02-08 14:41:10,858 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:41:10,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:41:10,859 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-08 14:41:10,860 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-08 14:41:10,860 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:41:10,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:41:10,860 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:41:10,860 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-08 14:41:10,860 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-08 14:41:10,860 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:41:10,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:41:10,861 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:41:10,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:41:10,861 INFO L85 PathProgramCache]: Analyzing trace with hash 39063912, now seen corresponding path program 1 times [2025-02-08 14:41:10,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:41:10,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279616865] [2025-02-08 14:41:10,861 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:41:10,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:41:10,863 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 14:41:10,865 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 14:41:10,866 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:41:10,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:41:10,866 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:41:10,867 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 14:41:10,868 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 14:41:10,869 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:41:10,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:41:10,870 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:41:10,884 INFO L204 LassoAnalysis]: Preferences: [2025-02-08 14:41:10,884 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-08 14:41:10,884 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-08 14:41:10,884 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-08 14:41:10,884 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-08 14:41:10,884 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:41:10,884 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-08 14:41:10,884 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-08 14:41:10,884 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested_4.c_Iteration12_Loop [2025-02-08 14:41:10,884 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-08 14:41:10,884 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-08 14:41:10,884 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:41:10,886 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:41:10,905 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-08 14:41:10,905 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-08 14:41:10,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:41:10,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:41:10,908 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:41:10,911 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2025-02-08 14:41:10,912 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-08 14:41:10,912 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-08 14:41:10,927 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-02-08 14:41:10,927 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-02-08 14:41:10,936 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Forceful destruction successful, exit code 0 [2025-02-08 14:41:10,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:41:10,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:41:10,939 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:41:10,941 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2025-02-08 14:41:10,942 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-08 14:41:10,942 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-08 14:41:10,962 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Ended with exit code 0 [2025-02-08 14:41:10,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:41:10,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:41:10,965 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:41:10,968 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-08 14:41:10,968 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-08 14:41:10,969 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2025-02-08 14:41:10,997 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-08 14:41:11,003 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Ended with exit code 0 [2025-02-08 14:41:11,004 INFO L204 LassoAnalysis]: Preferences: [2025-02-08 14:41:11,004 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-08 14:41:11,004 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-08 14:41:11,004 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-08 14:41:11,004 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-08 14:41:11,004 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:41:11,004 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-08 14:41:11,004 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-08 14:41:11,004 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested_4.c_Iteration12_Loop [2025-02-08 14:41:11,004 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-08 14:41:11,004 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-08 14:41:11,005 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:41:11,010 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:41:11,040 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-08 14:41:11,040 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-08 14:41:11,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:41:11,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:41:11,052 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:41:11,061 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2025-02-08 14:41:11,061 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-02-08 14:41:11,092 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:41:11,092 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:41:11,092 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:41:11,092 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:41:11,092 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:41:11,093 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:41:11,093 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:41:11,095 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:41:11,117 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Ended with exit code 0 [2025-02-08 14:41:11,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:41:11,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:41:11,120 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:41:11,124 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2025-02-08 14:41:11,127 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-02-08 14:41:11,142 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:41:11,142 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:41:11,142 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:41:11,142 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:41:11,142 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:41:11,143 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:41:11,143 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:41:11,145 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-08 14:41:11,148 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-02-08 14:41:11,149 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-02-08 14:41:11,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:41:11,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:41:11,152 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:41:11,153 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2025-02-08 14:41:11,154 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-08 14:41:11,154 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-08 14:41:11,154 INFO L474 LassoAnalysis]: Proved termination. [2025-02-08 14:41:11,154 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-02-08 14:41:11,161 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Forceful destruction successful, exit code 0 [2025-02-08 14:41:11,161 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-08 14:41:11,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:41:11,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 14:41:11,180 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 14:41:11,180 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:41:11,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:41:11,180 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-08 14:41:11,180 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:41:11,186 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-08 14:41:11,186 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-08 14:41:11,187 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:41:11,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:41:11,187 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-08 14:41:11,187 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:41:11,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:41:11,188 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-02-08 14:41:11,188 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 423 states and 488 transitions. cyclomatic complexity: 71 Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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-02-08 14:41:11,196 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 423 states and 488 transitions. cyclomatic complexity: 71. Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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 455 states and 524 transitions. Complement of second has 5 states. [2025-02-08 14:41:11,197 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-02-08 14:41:11,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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-02-08 14:41:11,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 6 transitions. [2025-02-08 14:41:11,198 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 4 letters. Loop has 1 letters. [2025-02-08 14:41:11,198 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:41:11,198 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 5 letters. Loop has 1 letters. [2025-02-08 14:41:11,198 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:41:11,198 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 4 letters. Loop has 2 letters. [2025-02-08 14:41:11,198 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:41:11,198 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 455 states and 524 transitions. [2025-02-08 14:41:11,201 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 59 [2025-02-08 14:41:11,205 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 455 states to 450 states and 518 transitions. [2025-02-08 14:41:11,205 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 63 [2025-02-08 14:41:11,205 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 63 [2025-02-08 14:41:11,205 INFO L73 IsDeterministic]: Start isDeterministic. Operand 450 states and 518 transitions. [2025-02-08 14:41:11,205 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-08 14:41:11,205 INFO L218 hiAutomatonCegarLoop]: Abstraction has 450 states and 518 transitions. [2025-02-08 14:41:11,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states and 518 transitions. [2025-02-08 14:41:11,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 423. [2025-02-08 14:41:11,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 423 states, 423 states have (on average 1.1513002364066194) internal successors, (487), 422 states have internal predecessors, (487), 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-02-08 14:41:11,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 487 transitions. [2025-02-08 14:41:11,215 INFO L240 hiAutomatonCegarLoop]: Abstraction has 423 states and 487 transitions. [2025-02-08 14:41:11,215 INFO L432 stractBuchiCegarLoop]: Abstraction has 423 states and 487 transitions. [2025-02-08 14:41:11,215 INFO L338 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2025-02-08 14:41:11,215 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 423 states and 487 transitions. [2025-02-08 14:41:11,217 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 59 [2025-02-08 14:41:11,217 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:41:11,217 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:41:11,217 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [6, 2, 1, 1, 1, 1] [2025-02-08 14:41:11,218 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-02-08 14:41:11,218 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-02-08 14:41:11,218 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-02-08 14:41:11,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:41:11,218 INFO L85 PathProgramCache]: Analyzing trace with hash -426057920, now seen corresponding path program 2 times [2025-02-08 14:41:11,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:41:11,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377880995] [2025-02-08 14:41:11,219 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 14:41:11,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:41:11,222 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 12 statements into 2 equivalence classes. [2025-02-08 14:41:11,224 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 12 of 12 statements. [2025-02-08 14:41:11,225 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 14:41:11,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:41:11,225 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:41:11,226 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-08 14:41:11,228 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-08 14:41:11,228 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:41:11,228 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:41:11,231 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:41:11,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:41:11,232 INFO L85 PathProgramCache]: Analyzing trace with hash 37, now seen corresponding path program 2 times [2025-02-08 14:41:11,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:41:11,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349129544] [2025-02-08 14:41:11,232 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 14:41:11,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:41:11,233 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1 statements into 1 equivalence classes. [2025-02-08 14:41:11,234 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-08 14:41:11,234 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 14:41:11,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:41:11,234 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:41:11,235 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-08 14:41:11,235 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-08 14:41:11,235 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:41:11,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:41:11,236 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:41:11,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:41:11,237 INFO L85 PathProgramCache]: Analyzing trace with hash -322893626, now seen corresponding path program 3 times [2025-02-08 14:41:11,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:41:11,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188926002] [2025-02-08 14:41:11,237 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 14:41:11,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:41:11,239 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 13 statements into 5 equivalence classes. [2025-02-08 14:41:11,241 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 13 of 13 statements. [2025-02-08 14:41:11,241 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-02-08 14:41:11,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:41:11,241 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:41:11,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-08 14:41:11,243 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-08 14:41:11,244 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:41:11,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:41:11,245 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:41:11,257 INFO L204 LassoAnalysis]: Preferences: [2025-02-08 14:41:11,257 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-08 14:41:11,257 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-08 14:41:11,257 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-08 14:41:11,257 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-08 14:41:11,257 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:41:11,257 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-08 14:41:11,257 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-08 14:41:11,258 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested_4.c_Iteration13_Loop [2025-02-08 14:41:11,258 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-08 14:41:11,258 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-08 14:41:11,258 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:41:11,262 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:41:11,279 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-08 14:41:11,282 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-08 14:41:11,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:41:11,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:41:11,284 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:41:11,287 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2025-02-08 14:41:11,288 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-08 14:41:11,288 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-08 14:41:11,308 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Forceful destruction successful, exit code 0 [2025-02-08 14:41:11,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:41:11,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:41:11,311 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:41:11,313 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2025-02-08 14:41:11,315 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-08 14:41:11,315 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-08 14:41:11,343 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-08 14:41:11,347 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Forceful destruction successful, exit code 0 [2025-02-08 14:41:11,348 INFO L204 LassoAnalysis]: Preferences: [2025-02-08 14:41:11,348 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-08 14:41:11,348 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-08 14:41:11,348 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-08 14:41:11,348 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-08 14:41:11,348 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:41:11,348 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-08 14:41:11,348 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-08 14:41:11,348 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested_4.c_Iteration13_Loop [2025-02-08 14:41:11,348 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-08 14:41:11,348 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-08 14:41:11,349 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:41:11,355 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:41:11,372 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-08 14:41:11,372 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-08 14:41:11,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:41:11,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:41:11,374 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:41:11,377 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2025-02-08 14:41:11,377 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-02-08 14:41:11,389 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:41:11,389 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:41:11,389 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:41:11,390 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:41:11,390 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:41:11,391 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:41:11,391 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:41:11,393 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-08 14:41:11,397 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-02-08 14:41:11,397 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-02-08 14:41:11,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:41:11,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:41:11,401 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:41:11,402 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2025-02-08 14:41:11,402 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-08 14:41:11,402 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-08 14:41:11,403 INFO L474 LassoAnalysis]: Proved termination. [2025-02-08 14:41:11,403 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-02-08 14:41:11,410 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Forceful destruction successful, exit code 0 [2025-02-08 14:41:11,411 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-08 14:41:11,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:41:11,430 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-08 14:41:11,436 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-08 14:41:11,437 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:41:11,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:41:11,437 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-08 14:41:11,438 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:41:11,451 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-08 14:41:11,452 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-08 14:41:11,452 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:41:11,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:41:11,452 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-08 14:41:11,452 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:41:11,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:41:11,453 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-02-08 14:41:11,453 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 423 states and 487 transitions. cyclomatic complexity: 70 Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 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-02-08 14:41:11,463 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 423 states and 487 transitions. cyclomatic complexity: 70. Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 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 453 states and 521 transitions. Complement of second has 5 states. [2025-02-08 14:41:11,463 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-02-08 14:41:11,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 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-02-08 14:41:11,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 6 transitions. [2025-02-08 14:41:11,464 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 12 letters. Loop has 1 letters. [2025-02-08 14:41:11,464 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:41:11,464 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-02-08 14:41:11,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:41:11,480 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-08 14:41:11,485 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-08 14:41:11,485 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:41:11,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:41:11,486 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-08 14:41:11,486 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:41:11,502 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-08 14:41:11,502 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-08 14:41:11,502 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:41:11,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:41:11,503 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-08 14:41:11,503 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:41:11,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:41:11,503 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-02-08 14:41:11,503 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 423 states and 487 transitions. cyclomatic complexity: 70 Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 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-02-08 14:41:11,510 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 423 states and 487 transitions. cyclomatic complexity: 70. Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 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 453 states and 521 transitions. Complement of second has 5 states. [2025-02-08 14:41:11,511 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-02-08 14:41:11,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 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-02-08 14:41:11,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 6 transitions. [2025-02-08 14:41:11,513 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 12 letters. Loop has 1 letters. [2025-02-08 14:41:11,513 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:41:11,513 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-02-08 14:41:11,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:41:11,532 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-08 14:41:11,537 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-08 14:41:11,537 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:41:11,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:41:11,538 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-08 14:41:11,538 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:41:11,550 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-08 14:41:11,551 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-08 14:41:11,551 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:41:11,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:41:11,552 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-08 14:41:11,552 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:41:11,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:41:11,552 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-02-08 14:41:11,552 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 423 states and 487 transitions. cyclomatic complexity: 70 Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 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-02-08 14:41:11,562 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 423 states and 487 transitions. cyclomatic complexity: 70. Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 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 498 states and 564 transitions. Complement of second has 4 states. [2025-02-08 14:41:11,563 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-02-08 14:41:11,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 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-02-08 14:41:11,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 15 transitions. [2025-02-08 14:41:11,565 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 12 letters. Loop has 1 letters. [2025-02-08 14:41:11,565 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:41:11,565 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 13 letters. Loop has 1 letters. [2025-02-08 14:41:11,565 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:41:11,565 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 12 letters. Loop has 2 letters. [2025-02-08 14:41:11,566 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:41:11,566 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 498 states and 564 transitions. [2025-02-08 14:41:11,568 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 58 [2025-02-08 14:41:11,571 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 498 states to 417 states and 478 transitions. [2025-02-08 14:41:11,571 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2025-02-08 14:41:11,571 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2025-02-08 14:41:11,571 INFO L73 IsDeterministic]: Start isDeterministic. Operand 417 states and 478 transitions. [2025-02-08 14:41:11,571 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-08 14:41:11,571 INFO L218 hiAutomatonCegarLoop]: Abstraction has 417 states and 478 transitions. [2025-02-08 14:41:11,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states and 478 transitions. [2025-02-08 14:41:11,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 413. [2025-02-08 14:41:11,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 413 states, 413 states have (on average 1.1476997578692494) internal successors, (474), 412 states have internal predecessors, (474), 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-02-08 14:41:11,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 474 transitions. [2025-02-08 14:41:11,585 INFO L240 hiAutomatonCegarLoop]: Abstraction has 413 states and 474 transitions. [2025-02-08 14:41:11,585 INFO L432 stractBuchiCegarLoop]: Abstraction has 413 states and 474 transitions. [2025-02-08 14:41:11,585 INFO L338 stractBuchiCegarLoop]: ======== Iteration 14 ============ [2025-02-08 14:41:11,585 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 413 states and 474 transitions. [2025-02-08 14:41:11,587 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 58 [2025-02-08 14:41:11,587 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:41:11,587 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:41:11,588 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [36, 6, 6, 2, 1, 1, 1] [2025-02-08 14:41:11,588 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [6, 1, 1] [2025-02-08 14:41:11,588 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-02-08 14:41:11,588 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-02-08 14:41:11,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:41:11,588 INFO L85 PathProgramCache]: Analyzing trace with hash -1801700543, now seen corresponding path program 2 times [2025-02-08 14:41:11,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:41:11,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334468093] [2025-02-08 14:41:11,588 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 14:41:11,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:41:11,593 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 53 statements into 2 equivalence classes. [2025-02-08 14:41:11,600 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 53 of 53 statements. [2025-02-08 14:41:11,601 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 14:41:11,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:41:11,601 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:41:11,603 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-02-08 14:41:11,609 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-02-08 14:41:11,610 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:41:11,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:41:11,613 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:41:11,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:41:11,615 INFO L85 PathProgramCache]: Analyzing trace with hash -1285128481, now seen corresponding path program 2 times [2025-02-08 14:41:11,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:41:11,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93646670] [2025-02-08 14:41:11,615 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 14:41:11,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:41:11,617 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 8 statements into 2 equivalence classes. [2025-02-08 14:41:11,618 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 14:41:11,618 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 14:41:11,618 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:41:11,618 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:41:11,619 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 14:41:11,620 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 14:41:11,620 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:41:11,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:41:11,621 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:41:11,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:41:11,621 INFO L85 PathProgramCache]: Analyzing trace with hash -1028425185, now seen corresponding path program 3 times [2025-02-08 14:41:11,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:41:11,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398934078] [2025-02-08 14:41:11,622 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 14:41:11,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:41:11,625 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 61 statements into 26 equivalence classes. [2025-02-08 14:41:11,638 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 26 check-sat command(s) and asserted 61 of 61 statements. [2025-02-08 14:41:11,639 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 26 check-sat command(s) [2025-02-08 14:41:11,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:41:11,639 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:41:11,641 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-02-08 14:41:11,647 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-02-08 14:41:11,647 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:41:11,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:41:11,650 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:41:11,705 INFO L204 LassoAnalysis]: Preferences: [2025-02-08 14:41:11,705 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-08 14:41:11,705 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-08 14:41:11,705 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-08 14:41:11,706 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-08 14:41:11,706 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:41:11,706 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-08 14:41:11,706 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-08 14:41:11,706 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested_4.c_Iteration14_Loop [2025-02-08 14:41:11,706 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-08 14:41:11,706 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-08 14:41:11,706 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:41:11,711 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:41:11,713 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:41:11,716 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:41:11,748 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2025-02-08 14:41:11,759 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Ended with exit code 0 [2025-02-08 14:41:11,768 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-08 14:41:11,769 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-08 14:41:11,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:41:11,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:41:11,769 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Ended with exit code 0 [2025-02-08 14:41:11,775 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Ended with exit code 0 [2025-02-08 14:41:11,777 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:41:11,779 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2025-02-08 14:41:11,781 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-08 14:41:11,781 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-08 14:41:11,804 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Forceful destruction successful, exit code 0 [2025-02-08 14:41:11,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:41:11,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:41:11,807 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:41:11,808 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2025-02-08 14:41:11,809 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-08 14:41:11,809 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-08 14:41:11,837 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-08 14:41:11,841 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Ended with exit code 0 [2025-02-08 14:41:11,841 INFO L204 LassoAnalysis]: Preferences: [2025-02-08 14:41:11,841 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-08 14:41:11,841 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-08 14:41:11,841 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-08 14:41:11,842 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-08 14:41:11,842 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:41:11,842 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-08 14:41:11,842 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-08 14:41:11,842 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested_4.c_Iteration14_Loop [2025-02-08 14:41:11,842 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-08 14:41:11,842 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-08 14:41:11,842 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:41:11,848 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:41:11,850 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:41:11,852 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:41:11,878 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-08 14:41:11,879 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-08 14:41:11,880 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:41:11,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:41:11,881 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:41:11,882 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2025-02-08 14:41:11,883 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-02-08 14:41:11,895 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:41:11,895 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:41:11,895 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:41:11,895 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:41:11,895 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:41:11,896 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:41:11,896 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:41:11,898 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-08 14:41:11,900 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-02-08 14:41:11,900 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-02-08 14:41:11,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:41:11,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:41:11,902 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:41:11,904 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2025-02-08 14:41:11,905 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-08 14:41:11,906 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-08 14:41:11,906 INFO L474 LassoAnalysis]: Proved termination. [2025-02-08 14:41:11,906 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-02-08 14:41:11,912 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Ended with exit code 0 [2025-02-08 14:41:11,912 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-08 14:41:11,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:41:11,933 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-02-08 14:41:11,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-02-08 14:41:11,953 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:41:11,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:41:11,954 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-08 14:41:11,955 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:41:12,014 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 14:41:12,018 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 14:41:12,018 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:41:12,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:41:12,018 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-08 14:41:12,019 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:41:12,047 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-02-08 14:41:12,047 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-02-08 14:41:12,048 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 413 states and 474 transitions. cyclomatic complexity: 65 Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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-02-08 14:41:12,072 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 413 states and 474 transitions. cyclomatic complexity: 65. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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) Result 600 states and 690 transitions. Complement of second has 7 states. [2025-02-08 14:41:12,073 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-02-08 14:41:12,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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-02-08 14:41:12,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 7 transitions. [2025-02-08 14:41:12,074 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 53 letters. Loop has 8 letters. [2025-02-08 14:41:12,074 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:41:12,074 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-02-08 14:41:12,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:41:12,092 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-02-08 14:41:12,113 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-02-08 14:41:12,113 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:41:12,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:41:12,114 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-08 14:41:12,115 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:41:12,175 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 14:41:12,178 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 14:41:12,178 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:41:12,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:41:12,179 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-08 14:41:12,179 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:41:12,208 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-02-08 14:41:12,209 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-02-08 14:41:12,209 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 413 states and 474 transitions. cyclomatic complexity: 65 Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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-02-08 14:41:12,227 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 413 states and 474 transitions. cyclomatic complexity: 65. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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) Result 600 states and 690 transitions. Complement of second has 7 states. [2025-02-08 14:41:12,228 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-02-08 14:41:12,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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-02-08 14:41:12,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 7 transitions. [2025-02-08 14:41:12,229 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 53 letters. Loop has 8 letters. [2025-02-08 14:41:12,229 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:41:12,229 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-02-08 14:41:12,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:41:12,253 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-02-08 14:41:12,272 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-02-08 14:41:12,272 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:41:12,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:41:12,273 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-08 14:41:12,274 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:41:12,323 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 14:41:12,326 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 14:41:12,326 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:41:12,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:41:12,326 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-08 14:41:12,327 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:41:12,357 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-02-08 14:41:12,358 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-02-08 14:41:12,358 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 413 states and 474 transitions. cyclomatic complexity: 65 Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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-02-08 14:41:12,380 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 413 states and 474 transitions. cyclomatic complexity: 65. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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) Result 770 states and 889 transitions. Complement of second has 6 states. [2025-02-08 14:41:12,382 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-02-08 14:41:12,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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-02-08 14:41:12,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2025-02-08 14:41:12,383 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 53 letters. Loop has 8 letters. [2025-02-08 14:41:12,383 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:41:12,383 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 61 letters. Loop has 8 letters. [2025-02-08 14:41:12,383 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:41:12,383 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 53 letters. Loop has 16 letters. [2025-02-08 14:41:12,383 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:41:12,383 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 770 states and 889 transitions. [2025-02-08 14:41:12,388 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 50 [2025-02-08 14:41:12,389 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 770 states to 356 states and 407 transitions. [2025-02-08 14:41:12,390 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 [2025-02-08 14:41:12,390 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2025-02-08 14:41:12,390 INFO L73 IsDeterministic]: Start isDeterministic. Operand 356 states and 407 transitions. [2025-02-08 14:41:12,390 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-08 14:41:12,390 INFO L218 hiAutomatonCegarLoop]: Abstraction has 356 states and 407 transitions. [2025-02-08 14:41:12,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states and 407 transitions. [2025-02-08 14:41:12,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 354. [2025-02-08 14:41:12,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 354 states have (on average 1.1440677966101696) internal successors, (405), 353 states have internal predecessors, (405), 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-02-08 14:41:12,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 405 transitions. [2025-02-08 14:41:12,399 INFO L240 hiAutomatonCegarLoop]: Abstraction has 354 states and 405 transitions. [2025-02-08 14:41:12,400 INFO L432 stractBuchiCegarLoop]: Abstraction has 354 states and 405 transitions. [2025-02-08 14:41:12,400 INFO L338 stractBuchiCegarLoop]: ======== Iteration 15 ============ [2025-02-08 14:41:12,401 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 354 states and 405 transitions. [2025-02-08 14:41:12,402 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 50 [2025-02-08 14:41:12,402 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:41:12,402 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:41:12,407 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [216, 36, 36, 6, 6, 2, 1, 1] [2025-02-08 14:41:12,407 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [36, 6, 6, 1, 1] [2025-02-08 14:41:12,407 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-02-08 14:41:12,407 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-02-08 14:41:12,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:41:12,408 INFO L85 PathProgramCache]: Analyzing trace with hash -1564837131, now seen corresponding path program 2 times [2025-02-08 14:41:12,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:41:12,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427805371] [2025-02-08 14:41:12,408 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 14:41:12,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:41:12,421 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 304 statements into 2 equivalence classes. [2025-02-08 14:41:12,481 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 304 of 304 statements. [2025-02-08 14:41:12,481 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 14:41:12,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:41:12,481 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:41:12,488 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 304 statements into 1 equivalence classes. [2025-02-08 14:41:12,547 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 304 of 304 statements. [2025-02-08 14:41:12,547 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:41:12,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:41:12,561 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:41:12,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:41:12,562 INFO L85 PathProgramCache]: Analyzing trace with hash 1105246217, now seen corresponding path program 2 times [2025-02-08 14:41:12,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:41:12,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164639870] [2025-02-08 14:41:12,562 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 14:41:12,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:41:12,566 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 50 statements into 2 equivalence classes. [2025-02-08 14:41:12,570 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 50 of 50 statements. [2025-02-08 14:41:12,570 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 14:41:12,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:41:12,570 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:41:12,572 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-02-08 14:41:12,577 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-02-08 14:41:12,578 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:41:12,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:41:12,580 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:41:12,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:41:12,581 INFO L85 PathProgramCache]: Analyzing trace with hash -1360982531, now seen corresponding path program 3 times [2025-02-08 14:41:12,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:41:12,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973665922] [2025-02-08 14:41:12,581 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 14:41:12,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:41:12,595 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 354 statements into 152 equivalence classes. [2025-02-08 14:41:12,639 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Ended with exit code 0 [2025-02-08 14:41:12,697 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 152 check-sat command(s) and asserted 354 of 354 statements. [2025-02-08 14:41:12,697 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 152 check-sat command(s) [2025-02-08 14:41:12,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:41:12,697 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:41:12,704 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 354 statements into 1 equivalence classes. [2025-02-08 14:41:12,775 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 354 of 354 statements. [2025-02-08 14:41:12,777 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:41:12,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:41:12,802 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:41:13,418 INFO L204 LassoAnalysis]: Preferences: [2025-02-08 14:41:13,419 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-08 14:41:13,419 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-08 14:41:13,419 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-08 14:41:13,419 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-08 14:41:13,419 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:41:13,419 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-08 14:41:13,419 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-08 14:41:13,419 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested_4.c_Iteration15_Loop [2025-02-08 14:41:13,419 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-08 14:41:13,419 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-08 14:41:13,420 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:41:13,422 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:41:13,424 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:41:13,426 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:41:13,430 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:41:13,433 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:41:13,469 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-08 14:41:13,469 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-08 14:41:13,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:41:13,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:41:13,472 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:41:13,473 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Waiting until timeout for monitored process [2025-02-08 14:41:13,474 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-08 14:41:13,474 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-08 14:41:13,484 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-02-08 14:41:13,484 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-02-08 14:41:13,490 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Ended with exit code 0 [2025-02-08 14:41:13,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:41:13,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:41:13,492 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:41:13,493 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Waiting until timeout for monitored process [2025-02-08 14:41:13,494 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-08 14:41:13,494 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-08 14:41:13,504 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-02-08 14:41:13,504 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-02-08 14:41:13,510 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Ended with exit code 0 [2025-02-08 14:41:13,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:41:13,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:41:13,512 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:41:13,513 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Waiting until timeout for monitored process [2025-02-08 14:41:13,514 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-08 14:41:13,514 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-08 14:41:13,524 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-02-08 14:41:13,524 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-02-08 14:41:13,529 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Ended with exit code 0 [2025-02-08 14:41:13,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:41:13,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:41:13,532 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:41:13,533 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Waiting until timeout for monitored process [2025-02-08 14:41:13,533 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-08 14:41:13,533 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-08 14:41:13,544 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-02-08 14:41:13,544 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-02-08 14:41:13,549 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Ended with exit code 0 [2025-02-08 14:41:13,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:41:13,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:41:13,551 INFO L229 MonitoredProcess]: Starting monitored process 58 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:41:13,552 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Waiting until timeout for monitored process [2025-02-08 14:41:13,552 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-08 14:41:13,552 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-08 14:41:13,563 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-02-08 14:41:13,563 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-02-08 14:41:13,568 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Ended with exit code 0 [2025-02-08 14:41:13,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:41:13,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:41:13,570 INFO L229 MonitoredProcess]: Starting monitored process 59 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:41:13,571 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Waiting until timeout for monitored process [2025-02-08 14:41:13,572 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-08 14:41:13,572 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-08 14:41:13,588 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Ended with exit code 0 [2025-02-08 14:41:13,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:41:13,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:41:13,590 INFO L229 MonitoredProcess]: Starting monitored process 60 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:41:13,591 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Waiting until timeout for monitored process [2025-02-08 14:41:13,592 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-08 14:41:13,592 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-08 14:41:13,612 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-08 14:41:13,615 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Ended with exit code 0 [2025-02-08 14:41:13,616 INFO L204 LassoAnalysis]: Preferences: [2025-02-08 14:41:13,616 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-08 14:41:13,616 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-08 14:41:13,616 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-08 14:41:13,616 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-08 14:41:13,616 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:41:13,616 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-08 14:41:13,616 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-08 14:41:13,616 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested_4.c_Iteration15_Loop [2025-02-08 14:41:13,616 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-08 14:41:13,616 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-08 14:41:13,616 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:41:13,618 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:41:13,620 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:41:13,622 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:41:13,623 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:41:13,625 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:41:13,663 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-08 14:41:13,664 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-08 14:41:13,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:41:13,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:41:13,666 INFO L229 MonitoredProcess]: Starting monitored process 61 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:41:13,668 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Waiting until timeout for monitored process [2025-02-08 14:41:13,669 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-02-08 14:41:13,680 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:41:13,681 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:41:13,681 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:41:13,681 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:41:13,681 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:41:13,682 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:41:13,682 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:41:13,685 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:41:13,692 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Ended with exit code 0 [2025-02-08 14:41:13,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:41:13,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:41:13,695 INFO L229 MonitoredProcess]: Starting monitored process 62 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:41:13,697 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Waiting until timeout for monitored process [2025-02-08 14:41:13,698 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-02-08 14:41:13,710 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:41:13,711 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:41:13,711 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:41:13,711 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:41:13,711 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:41:13,711 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:41:13,711 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:41:13,712 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:41:13,718 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Ended with exit code 0 [2025-02-08 14:41:13,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:41:13,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:41:13,720 INFO L229 MonitoredProcess]: Starting monitored process 63 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:41:13,721 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Waiting until timeout for monitored process [2025-02-08 14:41:13,721 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-02-08 14:41:13,731 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:41:13,731 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:41:13,731 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:41:13,731 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:41:13,731 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:41:13,732 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:41:13,732 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:41:13,733 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:41:13,738 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Ended with exit code 0 [2025-02-08 14:41:13,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:41:13,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:41:13,740 INFO L229 MonitoredProcess]: Starting monitored process 64 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:41:13,741 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Waiting until timeout for monitored process [2025-02-08 14:41:13,742 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-02-08 14:41:13,753 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:41:13,753 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:41:13,753 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:41:13,753 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:41:13,753 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:41:13,753 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:41:13,753 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:41:13,755 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:41:13,760 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Ended with exit code 0 [2025-02-08 14:41:13,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:41:13,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:41:13,762 INFO L229 MonitoredProcess]: Starting monitored process 65 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:41:13,764 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Waiting until timeout for monitored process [2025-02-08 14:41:13,765 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-02-08 14:41:13,774 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:41:13,774 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:41:13,774 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:41:13,774 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:41:13,774 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:41:13,775 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:41:13,775 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:41:13,777 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:41:13,782 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Forceful destruction successful, exit code 0 [2025-02-08 14:41:13,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:41:13,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:41:13,784 INFO L229 MonitoredProcess]: Starting monitored process 66 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:41:13,784 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Waiting until timeout for monitored process [2025-02-08 14:41:13,785 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-02-08 14:41:13,795 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:41:13,795 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:41:13,795 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:41:13,795 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:41:13,795 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:41:13,796 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:41:13,796 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:41:13,797 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-08 14:41:13,799 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-02-08 14:41:13,799 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-02-08 14:41:13,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:41:13,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:41:13,801 INFO L229 MonitoredProcess]: Starting monitored process 67 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:41:13,801 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Waiting until timeout for monitored process [2025-02-08 14:41:13,802 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-08 14:41:13,802 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-08 14:41:13,802 INFO L474 LassoAnalysis]: Proved termination. [2025-02-08 14:41:13,802 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-02-08 14:41:13,807 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Ended with exit code 0 [2025-02-08 14:41:13,808 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-08 14:41:13,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:41:13,856 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 304 statements into 1 equivalence classes. [2025-02-08 14:41:13,947 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 304 of 304 statements. [2025-02-08 14:41:13,948 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:41:13,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:41:13,950 INFO L256 TraceCheckSpWp]: Trace formula consists of 938 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-08 14:41:13,953 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:41:14,273 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-02-08 14:41:14,292 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-02-08 14:41:14,292 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:41:14,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:41:14,294 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-08 14:41:14,295 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:41:14,452 INFO L134 CoverageAnalysis]: Checked inductivity of 882 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 882 trivial. 0 not checked. [2025-02-08 14:41:14,453 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-02-08 14:41:14,453 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 354 states and 405 transitions. cyclomatic complexity: 53 Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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-02-08 14:41:14,471 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 354 states and 405 transitions. cyclomatic complexity: 53. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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 951 states and 1089 transitions. Complement of second has 7 states. [2025-02-08 14:41:14,471 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-02-08 14:41:14,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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-02-08 14:41:14,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 8 transitions. [2025-02-08 14:41:14,472 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 304 letters. Loop has 50 letters. [2025-02-08 14:41:14,472 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:41:14,472 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-02-08 14:41:14,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:41:14,521 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 304 statements into 1 equivalence classes. [2025-02-08 14:41:14,580 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Ended with exit code 0 [2025-02-08 14:41:14,640 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 304 of 304 statements. [2025-02-08 14:41:14,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:41:14,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:41:14,644 INFO L256 TraceCheckSpWp]: Trace formula consists of 938 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-08 14:41:14,648 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:41:14,958 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-02-08 14:41:14,973 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-02-08 14:41:14,973 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:41:14,973 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:41:14,974 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-08 14:41:14,975 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:41:15,150 INFO L134 CoverageAnalysis]: Checked inductivity of 882 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 882 trivial. 0 not checked. [2025-02-08 14:41:15,150 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-02-08 14:41:15,151 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 354 states and 405 transitions. cyclomatic complexity: 53 Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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-02-08 14:41:15,170 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 354 states and 405 transitions. cyclomatic complexity: 53. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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 951 states and 1089 transitions. Complement of second has 7 states. [2025-02-08 14:41:15,170 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-02-08 14:41:15,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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-02-08 14:41:15,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 8 transitions. [2025-02-08 14:41:15,171 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 304 letters. Loop has 50 letters. [2025-02-08 14:41:15,172 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:41:15,172 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-02-08 14:41:15,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:41:15,223 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 304 statements into 1 equivalence classes. [2025-02-08 14:41:15,311 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 304 of 304 statements. [2025-02-08 14:41:15,312 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:41:15,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:41:15,314 INFO L256 TraceCheckSpWp]: Trace formula consists of 938 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-08 14:41:15,318 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:41:15,621 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-02-08 14:41:15,641 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-02-08 14:41:15,641 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:41:15,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:41:15,642 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-08 14:41:15,643 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:41:15,793 INFO L134 CoverageAnalysis]: Checked inductivity of 882 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 882 trivial. 0 not checked. [2025-02-08 14:41:15,794 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-02-08 14:41:15,794 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 354 states and 405 transitions. cyclomatic complexity: 53 Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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-02-08 14:41:15,816 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 354 states and 405 transitions. cyclomatic complexity: 53. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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 699 states and 801 transitions. Complement of second has 6 states. [2025-02-08 14:41:15,817 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-02-08 14:41:15,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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-02-08 14:41:15,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2025-02-08 14:41:15,817 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 304 letters. Loop has 50 letters. [2025-02-08 14:41:15,818 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:41:15,818 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 354 letters. Loop has 50 letters. [2025-02-08 14:41:15,819 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:41:15,819 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 304 letters. Loop has 100 letters. [2025-02-08 14:41:15,820 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:41:15,820 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 699 states and 801 transitions. [2025-02-08 14:41:15,825 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-02-08 14:41:15,825 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 699 states to 0 states and 0 transitions. [2025-02-08 14:41:15,825 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-02-08 14:41:15,825 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-02-08 14:41:15,825 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-02-08 14:41:15,825 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-08 14:41:15,825 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-08 14:41:15,825 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-08 14:41:15,825 INFO L432 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-08 14:41:15,826 INFO L338 stractBuchiCegarLoop]: ======== Iteration 16 ============ [2025-02-08 14:41:15,826 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-02-08 14:41:15,826 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-02-08 14:41:15,826 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-02-08 14:41:15,834 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 08.02 02:41:15 BoogieIcfgContainer [2025-02-08 14:41:15,834 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-02-08 14:41:15,835 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 14:41:15,835 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 14:41:15,835 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 14:41:15,836 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 02:40:45" (3/4) ... [2025-02-08 14:41:15,838 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-08 14:41:15,838 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 14:41:15,839 INFO L158 Benchmark]: Toolchain (without parser) took 30414.15ms. Allocated memory was 201.3MB in the beginning and 352.3MB in the end (delta: 151.0MB). Free memory was 155.0MB in the beginning and 156.7MB in the end (delta: -1.7MB). Peak memory consumption was 148.6MB. Max. memory is 16.1GB. [2025-02-08 14:41:15,839 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 117.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 14:41:15,839 INFO L158 Benchmark]: CACSL2BoogieTranslator took 189.02ms. Allocated memory is still 201.3MB. Free memory was 154.7MB in the beginning and 144.4MB in the end (delta: 10.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 14:41:15,840 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.48ms. Allocated memory is still 201.3MB. Free memory was 144.4MB in the beginning and 143.3MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 14:41:15,840 INFO L158 Benchmark]: Boogie Preprocessor took 26.33ms. Allocated memory is still 201.3MB. Free memory was 143.3MB in the beginning and 142.1MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 14:41:15,840 INFO L158 Benchmark]: IcfgBuilder took 228.07ms. Allocated memory is still 201.3MB. Free memory was 142.1MB in the beginning and 131.3MB in the end (delta: 10.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-08 14:41:15,840 INFO L158 Benchmark]: BuchiAutomizer took 29938.05ms. Allocated memory was 201.3MB in the beginning and 352.3MB in the end (delta: 151.0MB). Free memory was 131.3MB in the beginning and 156.8MB in the end (delta: -25.4MB). Peak memory consumption was 123.4MB. Max. memory is 16.1GB. [2025-02-08 14:41:15,841 INFO L158 Benchmark]: Witness Printer took 3.40ms. Allocated memory is still 352.3MB. Free memory was 156.8MB in the beginning and 156.7MB in the end (delta: 57.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 14:41:15,842 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.21ms. Allocated memory is still 201.3MB. Free memory is still 117.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 189.02ms. Allocated memory is still 201.3MB. Free memory was 154.7MB in the beginning and 144.4MB in the end (delta: 10.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 23.48ms. Allocated memory is still 201.3MB. Free memory was 144.4MB in the beginning and 143.3MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 26.33ms. Allocated memory is still 201.3MB. Free memory was 143.3MB in the beginning and 142.1MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 228.07ms. Allocated memory is still 201.3MB. Free memory was 142.1MB in the beginning and 131.3MB in the end (delta: 10.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * BuchiAutomizer took 29938.05ms. Allocated memory was 201.3MB in the beginning and 352.3MB in the end (delta: 151.0MB). Free memory was 131.3MB in the beginning and 156.8MB in the end (delta: -25.4MB). Peak memory consumption was 123.4MB. Max. memory is 16.1GB. * Witness Printer took 3.40ms. Allocated memory is still 352.3MB. Free memory was 156.8MB in the beginning and 156.7MB in the end (delta: 57.1kB). 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 29.8s and 16 iterations. TraceHistogramMax:216. Analysis of lassos took 24.5s. Construction of modules took 0.2s. Büchi inclusion checks took 4.7s. 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, 240 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 227 mSDsluCounter, 229 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 87 mSDsCounter, 53 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 206 IncrementalHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 53 mSolverCounterUnsat, 142 mSDtfsCounter, 206 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: 31ms VariablesStem: 0 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 17 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 7 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.7s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-02-08 14:41:15,860 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-08 14:41:16,058 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-08 14:41:16,258 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-08 14:41:16,458 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-08 14:41:16,658 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-08 14:41:16,861 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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