./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-restricted-15/Ex08.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-restricted-15/Ex08.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash e9f5cf3ddf7f2bce97ea02caa876a19793443837e6b09c62b997f759c9b40cc6 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 19:52:24,637 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 19:52:24,684 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2025-03-17 19:52:24,687 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 19:52:24,687 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 19:52:24,687 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2025-03-17 19:52:24,701 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 19:52:24,702 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 19:52:24,702 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 19:52:24,703 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 19:52:24,703 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 19:52:24,704 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 19:52:24,704 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 19:52:24,705 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 19:52:24,705 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-03-17 19:52:24,705 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-03-17 19:52:24,705 INFO L153 SettingsManager]: * Use old map elimination=false [2025-03-17 19:52:24,705 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-03-17 19:52:24,705 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-03-17 19:52:24,705 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-03-17 19:52:24,706 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 19:52:24,706 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-03-17 19:52:24,706 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 19:52:24,706 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 19:52:24,706 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-03-17 19:52:24,706 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-03-17 19:52:24,706 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-03-17 19:52:24,706 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 19:52:24,706 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 19:52:24,706 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-03-17 19:52:24,707 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 19:52:24,707 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 19:52:24,707 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 19:52:24,707 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 19:52:24,707 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 19:52:24,707 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 19:52:24,708 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-03-17 19:52:24,708 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e9f5cf3ddf7f2bce97ea02caa876a19793443837e6b09c62b997f759c9b40cc6 [2025-03-17 19:52:24,961 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 19:52:24,969 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 19:52:24,972 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 19:52:24,973 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 19:52:24,974 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 19:52:24,975 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-restricted-15/Ex08.c [2025-03-17 19:52:26,139 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a4c56091d/279a576bb9cc464fa6788888e0177f9b/FLAGcfb5e4f1f [2025-03-17 19:52:26,359 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 19:52:26,363 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-restricted-15/Ex08.c [2025-03-17 19:52:26,370 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a4c56091d/279a576bb9cc464fa6788888e0177f9b/FLAGcfb5e4f1f [2025-03-17 19:52:26,388 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a4c56091d/279a576bb9cc464fa6788888e0177f9b [2025-03-17 19:52:26,392 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 19:52:26,394 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 19:52:26,395 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 19:52:26,395 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 19:52:26,400 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 19:52:26,401 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 07:52:26" (1/1) ... [2025-03-17 19:52:26,401 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e30f422 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:52:26, skipping insertion in model container [2025-03-17 19:52:26,402 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 07:52:26" (1/1) ... [2025-03-17 19:52:26,416 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 19:52:26,522 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 19:52:26,526 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 19:52:26,537 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 19:52:26,547 INFO L204 MainTranslator]: Completed translation [2025-03-17 19:52:26,547 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:52:26 WrapperNode [2025-03-17 19:52:26,547 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 19:52:26,548 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 19:52:26,548 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 19:52:26,548 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 19:52:26,553 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:52:26" (1/1) ... [2025-03-17 19:52:26,556 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:52:26" (1/1) ... [2025-03-17 19:52:26,568 INFO L138 Inliner]: procedures = 4, calls = 2, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 18 [2025-03-17 19:52:26,568 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 19:52:26,568 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 19:52:26,568 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 19:52:26,568 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 19:52:26,575 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:52:26" (1/1) ... [2025-03-17 19:52:26,575 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:52:26" (1/1) ... [2025-03-17 19:52:26,577 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:52:26" (1/1) ... [2025-03-17 19:52:26,580 INFO L175 MemorySlicer]: No memory access in input program. [2025-03-17 19:52:26,582 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:52:26" (1/1) ... [2025-03-17 19:52:26,582 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:52:26" (1/1) ... [2025-03-17 19:52:26,583 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:52:26" (1/1) ... [2025-03-17 19:52:26,584 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:52:26" (1/1) ... [2025-03-17 19:52:26,585 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:52:26" (1/1) ... [2025-03-17 19:52:26,585 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:52:26" (1/1) ... [2025-03-17 19:52:26,586 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 19:52:26,587 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 19:52:26,591 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 19:52:26,591 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 19:52:26,592 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:52:26" (1/1) ... [2025-03-17 19:52:26,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:26,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:26,618 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:52:26,621 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2025-03-17 19:52:26,642 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 19:52:26,642 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 19:52:26,688 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 19:52:26,690 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 19:52:26,740 INFO L? ?]: Removed 2 outVars from TransFormulas that were not future-live. [2025-03-17 19:52:26,740 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 19:52:26,746 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 19:52:26,747 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 19:52:26,747 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 07:52:26 BoogieIcfgContainer [2025-03-17 19:52:26,748 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 19:52:26,749 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-03-17 19:52:26,749 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-03-17 19:52:26,753 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-03-17 19:52:26,754 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-17 19:52:26,754 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 17.03 07:52:26" (1/3) ... [2025-03-17 19:52:26,756 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4654357f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.03 07:52:26, skipping insertion in model container [2025-03-17 19:52:26,756 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-17 19:52:26,756 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:52:26" (2/3) ... [2025-03-17 19:52:26,757 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4654357f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.03 07:52:26, skipping insertion in model container [2025-03-17 19:52:26,757 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-17 19:52:26,757 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 07:52:26" (3/3) ... [2025-03-17 19:52:26,759 INFO L363 chiAutomizerObserver]: Analyzing ICFG Ex08.c [2025-03-17 19:52:26,798 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-03-17 19:52:26,798 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-03-17 19:52:26,798 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-03-17 19:52:26,798 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-03-17 19:52:26,798 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-03-17 19:52:26,799 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-03-17 19:52:26,799 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-03-17 19:52:26,799 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-03-17 19:52:26,802 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:52:26,812 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2025-03-17 19:52:26,813 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:52:26,813 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:52:26,815 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-03-17 19:52:26,816 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-03-17 19:52:26,816 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-03-17 19:52:26,816 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:52:26,817 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2025-03-17 19:52:26,817 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:52:26,817 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:52:26,818 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-03-17 19:52:26,818 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-03-17 19:52:26,823 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0;" [2025-03-17 19:52:26,823 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~i~0#1 > 0;" "assume 1 == main_~i~0#1;main_~up~0#1 := 1;" "assume 10 == main_~i~0#1;main_~up~0#1 := 0;" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" [2025-03-17 19:52:26,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:26,828 INFO L85 PathProgramCache]: Analyzing trace with hash 39, now seen corresponding path program 1 times [2025-03-17 19:52:26,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:52:26,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999200001] [2025-03-17 19:52:26,835 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:52:26,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:52:26,885 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-17 19:52:26,887 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-17 19:52:26,887 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:26,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:52:26,888 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:52:26,889 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-17 19:52:26,891 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-17 19:52:26,891 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:26,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:52:26,901 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:52:26,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:26,905 INFO L85 PathProgramCache]: Analyzing trace with hash 1136957, now seen corresponding path program 1 times [2025-03-17 19:52:26,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:52:26,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121576442] [2025-03-17 19:52:26,905 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:52:26,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:52:26,911 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 19:52:26,919 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 19:52:26,919 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:26,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:26,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:52:26,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:52:26,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121576442] [2025-03-17 19:52:26,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121576442] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:52:26,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:52:26,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 19:52:26,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320360092] [2025-03-17 19:52:26,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:52:26,968 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-17 19:52:26,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:52:26,986 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 19:52:26,986 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 19:52:26,988 INFO L87 Difference]: Start difference. First operand has 7 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) Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:52:27,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:52:27,016 INFO L93 Difference]: Finished difference Result 11 states and 17 transitions. [2025-03-17 19:52:27,017 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 17 transitions. [2025-03-17 19:52:27,022 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2025-03-17 19:52:27,027 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 9 states and 14 transitions. [2025-03-17 19:52:27,028 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2025-03-17 19:52:27,028 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2025-03-17 19:52:27,029 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 14 transitions. [2025-03-17 19:52:27,030 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-17 19:52:27,030 INFO L218 hiAutomatonCegarLoop]: Abstraction has 9 states and 14 transitions. [2025-03-17 19:52:27,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 14 transitions. [2025-03-17 19:52:27,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2025-03-17 19:52:27,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 8 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-03-17 19:52:27,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 14 transitions. [2025-03-17 19:52:27,050 INFO L240 hiAutomatonCegarLoop]: Abstraction has 9 states and 14 transitions. [2025-03-17 19:52:27,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 19:52:27,053 INFO L432 stractBuchiCegarLoop]: Abstraction has 9 states and 14 transitions. [2025-03-17 19:52:27,053 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-03-17 19:52:27,054 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 14 transitions. [2025-03-17 19:52:27,054 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2025-03-17 19:52:27,054 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:52:27,054 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:52:27,054 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-03-17 19:52:27,054 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-03-17 19:52:27,054 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0;" [2025-03-17 19:52:27,055 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~i~0#1 > 0;" "assume !(1 == main_~i~0#1);" "assume 10 == main_~i~0#1;main_~up~0#1 := 0;" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" [2025-03-17 19:52:27,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:27,055 INFO L85 PathProgramCache]: Analyzing trace with hash 39, now seen corresponding path program 2 times [2025-03-17 19:52:27,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:52:27,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841534677] [2025-03-17 19:52:27,055 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:52:27,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:52:27,058 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1 statements into 1 equivalence classes. [2025-03-17 19:52:27,058 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-17 19:52:27,059 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 19:52:27,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:52:27,059 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:52:27,059 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-17 19:52:27,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-17 19:52:27,060 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:27,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:52:27,061 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:52:27,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:27,062 INFO L85 PathProgramCache]: Analyzing trace with hash 1137918, now seen corresponding path program 1 times [2025-03-17 19:52:27,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:52:27,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845731232] [2025-03-17 19:52:27,062 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:52:27,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:52:27,065 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 19:52:27,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 19:52:27,066 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:27,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:27,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:52:27,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:52:27,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845731232] [2025-03-17 19:52:27,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845731232] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:52:27,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:52:27,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 19:52:27,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802472991] [2025-03-17 19:52:27,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:52:27,086 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-17 19:52:27,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:52:27,086 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 19:52:27,087 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 19:52:27,087 INFO L87 Difference]: Start difference. First operand 9 states and 14 transitions. cyclomatic complexity: 6 Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:52:27,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:52:27,098 INFO L93 Difference]: Finished difference Result 13 states and 20 transitions. [2025-03-17 19:52:27,098 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 20 transitions. [2025-03-17 19:52:27,098 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2025-03-17 19:52:27,099 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 13 states and 20 transitions. [2025-03-17 19:52:27,099 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2025-03-17 19:52:27,099 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2025-03-17 19:52:27,099 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 20 transitions. [2025-03-17 19:52:27,099 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-17 19:52:27,099 INFO L218 hiAutomatonCegarLoop]: Abstraction has 13 states and 20 transitions. [2025-03-17 19:52:27,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 20 transitions. [2025-03-17 19:52:27,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2025-03-17 19:52:27,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 12 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:52:27,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 20 transitions. [2025-03-17 19:52:27,100 INFO L240 hiAutomatonCegarLoop]: Abstraction has 13 states and 20 transitions. [2025-03-17 19:52:27,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 19:52:27,101 INFO L432 stractBuchiCegarLoop]: Abstraction has 13 states and 20 transitions. [2025-03-17 19:52:27,101 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-03-17 19:52:27,101 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 20 transitions. [2025-03-17 19:52:27,101 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2025-03-17 19:52:27,101 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:52:27,101 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:52:27,101 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-03-17 19:52:27,101 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-03-17 19:52:27,102 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0;" [2025-03-17 19:52:27,102 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~i~0#1 > 0;" "assume !(1 == main_~i~0#1);" "assume 10 == main_~i~0#1;main_~up~0#1 := 0;" "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" [2025-03-17 19:52:27,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:27,102 INFO L85 PathProgramCache]: Analyzing trace with hash 39, now seen corresponding path program 3 times [2025-03-17 19:52:27,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:52:27,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137326213] [2025-03-17 19:52:27,102 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 19:52:27,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:52:27,105 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 1 statements into 1 equivalence classes. [2025-03-17 19:52:27,106 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-17 19:52:27,106 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-17 19:52:27,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:52:27,106 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:52:27,107 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-17 19:52:27,107 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-17 19:52:27,107 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:27,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:52:27,108 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:52:27,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:27,108 INFO L85 PathProgramCache]: Analyzing trace with hash 1137919, now seen corresponding path program 1 times [2025-03-17 19:52:27,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:52:27,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068388282] [2025-03-17 19:52:27,108 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:52:27,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:52:27,111 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 19:52:27,115 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 19:52:27,115 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:27,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:52:27,115 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:52:27,117 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 19:52:27,120 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 19:52:27,120 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:27,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:52:27,121 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:52:27,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:27,121 INFO L85 PathProgramCache]: Analyzing trace with hash 36231717, now seen corresponding path program 1 times [2025-03-17 19:52:27,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:52:27,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420237698] [2025-03-17 19:52:27,122 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:52:27,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:52:27,125 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 19:52:27,127 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 19:52:27,127 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:27,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:52:27,127 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:52:27,129 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 19:52:27,130 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 19:52:27,130 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:27,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:52:27,131 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:52:27,182 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 19:52:27,183 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 19:52:27,183 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 19:52:27,183 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 19:52:27,184 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-17 19:52:27,184 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:27,184 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 19:52:27,184 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 19:52:27,185 INFO L132 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration3_Loop [2025-03-17 19:52:27,185 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 19:52:27,185 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 19:52:27,198 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:27,212 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:27,223 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:27,228 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:27,303 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 19:52:27,304 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-17 19:52:27,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:27,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:27,327 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:52:27,329 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2025-03-17 19:52:27,330 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 19:52:27,331 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:52:27,346 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 19:52:27,346 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~up~0#1=0} Honda state: {ULTIMATE.start_main_~up~0#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-17 19:52:27,356 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2025-03-17 19:52:27,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:27,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:27,361 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:52:27,362 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-03-17 19:52:27,363 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 19:52:27,363 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:52:27,381 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 19:52:27,382 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_1=1} Honda state: {v_rep~unnamed0~0~true_1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-17 19:52:27,388 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2025-03-17 19:52:27,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:27,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:27,390 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:52:27,391 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-03-17 19:52:27,393 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 19:52:27,393 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:52:27,411 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 19:52:27,411 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_1=0} Honda state: {v_rep~unnamed0~0~false_1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-17 19:52:27,417 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2025-03-17 19:52:27,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:27,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:27,420 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:52:27,421 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-03-17 19:52:27,423 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 19:52:27,423 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:52:27,440 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2025-03-17 19:52:27,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:27,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:27,443 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:52:27,444 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-03-17 19:52:27,446 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-17 19:52:27,446 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:52:27,463 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-17 19:52:27,470 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2025-03-17 19:52:27,470 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 19:52:27,470 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 19:52:27,470 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 19:52:27,470 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 19:52:27,471 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 19:52:27,471 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:27,471 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 19:52:27,471 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 19:52:27,471 INFO L132 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration3_Loop [2025-03-17 19:52:27,471 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 19:52:27,471 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 19:52:27,472 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:27,475 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:27,478 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:27,485 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:27,531 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 19:52:27,534 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 19:52:27,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:27,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:27,536 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:52:27,538 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-03-17 19:52:27,539 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:52:27,550 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:52:27,550 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:52:27,550 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:52:27,550 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:52:27,562 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:52:27,563 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:52:27,569 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:52:27,576 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2025-03-17 19:52:27,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:27,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:27,578 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:52:27,579 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-03-17 19:52:27,580 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:52:27,590 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:52:27,590 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:52:27,590 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:52:27,590 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:52:27,593 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:52:27,593 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:52:27,599 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:52:27,605 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2025-03-17 19:52:27,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:27,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:27,607 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:52:27,609 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-03-17 19:52:27,610 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:52:27,620 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:52:27,620 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:52:27,620 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:52:27,620 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:52:27,620 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:52:27,621 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:52:27,621 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:52:27,623 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-17 19:52:27,627 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-17 19:52:27,632 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-03-17 19:52:27,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:27,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:27,636 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:52:27,637 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-03-17 19:52:27,638 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-17 19:52:27,638 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-17 19:52:27,638 INFO L474 LassoAnalysis]: Proved termination. [2025-03-17 19:52:27,639 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = 1*ULTIMATE.start_main_~i~0#1 Supporting invariants [] [2025-03-17 19:52:27,644 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2025-03-17 19:52:27,647 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-17 19:52:27,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:27,666 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-17 19:52:27,667 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-17 19:52:27,667 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:27,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:27,668 WARN L254 TraceCheckSpWp]: Trace formula consists of 4 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 19:52:27,668 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:52:27,672 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 19:52:27,674 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 19:52:27,674 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:27,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:27,674 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 19:52:27,675 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:52:27,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:52:27,694 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-03-17 19:52:27,695 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 20 transitions. cyclomatic complexity: 8 Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 3 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-03-17 19:52:27,730 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 20 transitions. cyclomatic complexity: 8. Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 3 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 34 states and 50 transitions. Complement of second has 7 states. [2025-03-17 19:52:27,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-03-17 19:52:27,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 3 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-03-17 19:52:27,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2025-03-17 19:52:27,734 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 1 letters. Loop has 4 letters. [2025-03-17 19:52:27,734 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:52:27,734 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 5 letters. Loop has 4 letters. [2025-03-17 19:52:27,734 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:52:27,734 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 1 letters. Loop has 8 letters. [2025-03-17 19:52:27,735 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:52:27,735 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 50 transitions. [2025-03-17 19:52:27,736 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 20 [2025-03-17 19:52:27,737 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 29 states and 43 transitions. [2025-03-17 19:52:27,738 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2025-03-17 19:52:27,738 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2025-03-17 19:52:27,738 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 43 transitions. [2025-03-17 19:52:27,738 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:52:27,739 INFO L218 hiAutomatonCegarLoop]: Abstraction has 29 states and 43 transitions. [2025-03-17 19:52:27,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 43 transitions. [2025-03-17 19:52:27,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 24. [2025-03-17 19:52:27,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.4583333333333333) internal successors, (35), 23 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:52:27,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 35 transitions. [2025-03-17 19:52:27,744 INFO L240 hiAutomatonCegarLoop]: Abstraction has 24 states and 35 transitions. [2025-03-17 19:52:27,744 INFO L432 stractBuchiCegarLoop]: Abstraction has 24 states and 35 transitions. [2025-03-17 19:52:27,744 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-03-17 19:52:27,744 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 35 transitions. [2025-03-17 19:52:27,744 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 16 [2025-03-17 19:52:27,744 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:52:27,744 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:52:27,744 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-03-17 19:52:27,744 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-03-17 19:52:27,744 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0;" "assume main_~i~0#1 > 0;" [2025-03-17 19:52:27,744 INFO L754 eck$LassoCheckResult]: Loop: "assume !(1 == main_~i~0#1);" "assume !(10 == main_~i~0#1);" "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 > 0;" [2025-03-17 19:52:27,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:27,745 INFO L85 PathProgramCache]: Analyzing trace with hash 1216, now seen corresponding path program 1 times [2025-03-17 19:52:27,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:52:27,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768540939] [2025-03-17 19:52:27,745 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:52:27,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:52:27,747 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 19:52:27,748 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 19:52:27,748 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:27,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:52:27,748 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:52:27,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 19:52:27,749 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 19:52:27,749 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:27,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:52:27,750 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:52:27,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:27,750 INFO L85 PathProgramCache]: Analyzing trace with hash 1106180, now seen corresponding path program 1 times [2025-03-17 19:52:27,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:52:27,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765251162] [2025-03-17 19:52:27,750 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:52:27,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:52:27,752 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 19:52:27,753 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 19:52:27,753 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:27,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:52:27,753 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:52:27,754 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 19:52:27,755 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 19:52:27,755 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:27,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:52:27,760 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:52:27,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:27,760 INFO L85 PathProgramCache]: Analyzing trace with hash 1123184195, now seen corresponding path program 1 times [2025-03-17 19:52:27,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:52:27,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750410864] [2025-03-17 19:52:27,760 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:52:27,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:52:27,763 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 19:52:27,764 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 19:52:27,764 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:27,764 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:52:27,764 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:52:27,765 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 19:52:27,767 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 19:52:27,767 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:27,767 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:52:27,768 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:52:27,810 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 19:52:27,810 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 19:52:27,810 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 19:52:27,810 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 19:52:27,810 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-17 19:52:27,811 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:27,811 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 19:52:27,811 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 19:52:27,811 INFO L132 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration4_Loop [2025-03-17 19:52:27,811 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 19:52:27,811 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 19:52:27,812 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:27,815 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:27,822 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:27,825 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:27,897 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 19:52:27,898 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-17 19:52:27,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:27,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:27,902 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:52:27,903 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-03-17 19:52:27,904 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 19:52:27,904 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:52:27,922 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 19:52:27,922 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_3=0} Honda state: {v_rep~unnamed0~0~false_3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-17 19:52:27,928 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2025-03-17 19:52:27,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:27,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:27,930 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:52:27,932 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2025-03-17 19:52:27,933 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 19:52:27,933 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:52:27,950 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2025-03-17 19:52:27,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:27,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:27,952 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:52:27,954 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2025-03-17 19:52:27,955 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-17 19:52:27,955 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:52:27,988 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-17 19:52:27,992 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2025-03-17 19:52:27,992 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 19:52:27,992 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 19:52:27,992 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 19:52:27,992 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 19:52:27,992 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 19:52:27,992 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:27,992 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 19:52:27,992 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 19:52:27,993 INFO L132 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration4_Loop [2025-03-17 19:52:27,993 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 19:52:27,993 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 19:52:27,994 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:27,997 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:28,002 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:28,005 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:28,048 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2025-03-17 19:52:28,101 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 19:52:28,102 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 19:52:28,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:28,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:28,105 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:52:28,114 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:52:28,118 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2025-03-17 19:52:28,125 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:52:28,125 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:52:28,125 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:52:28,125 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:52:28,128 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:52:28,128 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:52:28,133 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:52:28,142 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2025-03-17 19:52:28,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:28,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:28,147 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:52:28,148 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2025-03-17 19:52:28,149 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:52:28,159 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:52:28,159 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:52:28,159 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:52:28,159 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-03-17 19:52:28,159 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:52:28,162 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2025-03-17 19:52:28,162 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:52:28,165 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-17 19:52:28,167 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2025-03-17 19:52:28,167 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-03-17 19:52:28,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:28,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:28,169 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:52:28,170 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2025-03-17 19:52:28,172 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-17 19:52:28,173 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-17 19:52:28,174 INFO L474 LassoAnalysis]: Proved termination. [2025-03-17 19:52:28,174 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = 1*ULTIMATE.start_main_~i~0#1 Supporting invariants [] [2025-03-17 19:52:28,181 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2025-03-17 19:52:28,182 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-17 19:52:28,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:28,196 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 19:52:28,197 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 19:52:28,197 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:28,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:28,198 INFO L256 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 19:52:28,198 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:52:28,206 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 19:52:28,207 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 19:52:28,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:28,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:28,208 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 19:52:28,208 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:52:28,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:52:28,228 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-03-17 19:52:28,228 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 35 transitions. cyclomatic complexity: 14 Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:52:28,250 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states and 35 transitions. cyclomatic complexity: 14. Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 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 40 states and 58 transitions. Complement of second has 7 states. [2025-03-17 19:52:28,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-03-17 19:52:28,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:52:28,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 8 transitions. [2025-03-17 19:52:28,253 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 2 letters. Loop has 4 letters. [2025-03-17 19:52:28,253 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:52:28,253 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 6 letters. Loop has 4 letters. [2025-03-17 19:52:28,253 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:52:28,253 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 2 letters. Loop has 8 letters. [2025-03-17 19:52:28,253 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:52:28,253 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 58 transitions. [2025-03-17 19:52:28,256 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2025-03-17 19:52:28,256 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 31 states and 48 transitions. [2025-03-17 19:52:28,256 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2025-03-17 19:52:28,256 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2025-03-17 19:52:28,256 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 48 transitions. [2025-03-17 19:52:28,256 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:52:28,256 INFO L218 hiAutomatonCegarLoop]: Abstraction has 31 states and 48 transitions. [2025-03-17 19:52:28,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 48 transitions. [2025-03-17 19:52:28,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2025-03-17 19:52:28,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 1.5483870967741935) internal successors, (48), 30 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:52:28,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 48 transitions. [2025-03-17 19:52:28,261 INFO L240 hiAutomatonCegarLoop]: Abstraction has 31 states and 48 transitions. [2025-03-17 19:52:28,261 INFO L432 stractBuchiCegarLoop]: Abstraction has 31 states and 48 transitions. [2025-03-17 19:52:28,261 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-03-17 19:52:28,261 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 48 transitions. [2025-03-17 19:52:28,261 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2025-03-17 19:52:28,263 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:52:28,263 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:52:28,263 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-03-17 19:52:28,263 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-03-17 19:52:28,264 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0;" "assume main_~i~0#1 > 0;" "assume 1 == main_~i~0#1;main_~up~0#1 := 1;" "assume !(10 == main_~i~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" [2025-03-17 19:52:28,264 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~i~0#1 > 0;" "assume 1 == main_~i~0#1;main_~up~0#1 := 1;" "assume !(10 == main_~i~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" [2025-03-17 19:52:28,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:28,264 INFO L85 PathProgramCache]: Analyzing trace with hash 36230786, now seen corresponding path program 1 times [2025-03-17 19:52:28,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:52:28,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481049369] [2025-03-17 19:52:28,264 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:52:28,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:52:28,266 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 19:52:28,267 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 19:52:28,267 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:28,267 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:52:28,267 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:52:28,268 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 19:52:28,272 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 19:52:28,273 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:28,273 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:52:28,273 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:52:28,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:28,274 INFO L85 PathProgramCache]: Analyzing trace with hash 1136988, now seen corresponding path program 1 times [2025-03-17 19:52:28,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:52:28,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283172950] [2025-03-17 19:52:28,274 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:52:28,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:52:28,276 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 19:52:28,281 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 19:52:28,281 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:28,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:52:28,281 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:52:28,282 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 19:52:28,283 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 19:52:28,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:28,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:52:28,283 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:52:28,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:28,284 INFO L85 PathProgramCache]: Analyzing trace with hash 2096695133, now seen corresponding path program 2 times [2025-03-17 19:52:28,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:52:28,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023836091] [2025-03-17 19:52:28,284 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:52:28,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:52:28,286 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 9 statements into 2 equivalence classes. [2025-03-17 19:52:28,291 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 9 of 9 statements. [2025-03-17 19:52:28,291 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 19:52:28,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:28,330 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:52:28,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:52:28,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023836091] [2025-03-17 19:52:28,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023836091] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:52:28,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:52:28,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 19:52:28,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640987172] [2025-03-17 19:52:28,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:52:28,354 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 19:52:28,354 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 19:52:28,354 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 19:52:28,354 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 19:52:28,354 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-17 19:52:28,354 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:28,354 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 19:52:28,354 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 19:52:28,354 INFO L132 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration5_Loop [2025-03-17 19:52:28,354 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 19:52:28,354 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 19:52:28,355 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:28,360 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:28,363 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:28,365 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:28,401 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 19:52:28,401 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-17 19:52:28,401 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:28,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:28,403 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:52:28,404 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2025-03-17 19:52:28,405 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 19:52:28,405 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:52:28,422 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2025-03-17 19:52:28,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:28,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:28,424 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:52:28,425 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2025-03-17 19:52:28,426 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-17 19:52:28,426 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:52:28,439 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-17 19:52:28,445 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2025-03-17 19:52:28,445 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 19:52:28,445 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 19:52:28,445 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 19:52:28,445 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 19:52:28,445 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 19:52:28,445 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:28,445 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 19:52:28,445 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 19:52:28,445 INFO L132 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration5_Loop [2025-03-17 19:52:28,445 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 19:52:28,445 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 19:52:28,446 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:28,451 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:28,454 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:28,456 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:28,490 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 19:52:28,490 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 19:52:28,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:28,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:28,493 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:52:28,495 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2025-03-17 19:52:28,496 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:52:28,506 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:52:28,506 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:52:28,506 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:52:28,506 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:52:28,506 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:52:28,507 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:52:28,509 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:52:28,511 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-17 19:52:28,513 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-17 19:52:28,513 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-03-17 19:52:28,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:28,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:28,516 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:52:28,524 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2025-03-17 19:52:28,524 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-17 19:52:28,524 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-17 19:52:28,525 INFO L474 LassoAnalysis]: Proved termination. [2025-03-17 19:52:28,525 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = -2*ULTIMATE.start_main_~i~0#1 + 3 Supporting invariants [] [2025-03-17 19:52:28,532 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2025-03-17 19:52:28,533 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-17 19:52:28,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:28,555 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 19:52:28,556 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 19:52:28,556 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:28,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:28,557 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 19:52:28,557 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:52:28,563 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 19:52:28,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 19:52:28,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:28,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:28,566 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 19:52:28,566 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:52:28,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:52:28,591 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-03-17 19:52:28,592 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 31 states and 48 transitions. cyclomatic complexity: 21 Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:52:28,623 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 31 states and 48 transitions. cyclomatic complexity: 21. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 48 states and 72 transitions. Complement of second has 7 states. [2025-03-17 19:52:28,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-03-17 19:52:28,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:52:28,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 17 transitions. [2025-03-17 19:52:28,624 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 5 letters. Loop has 4 letters. [2025-03-17 19:52:28,624 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:52:28,624 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 9 letters. Loop has 4 letters. [2025-03-17 19:52:28,625 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:52:28,625 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 5 letters. Loop has 8 letters. [2025-03-17 19:52:28,625 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:52:28,625 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 72 transitions. [2025-03-17 19:52:28,626 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 16 [2025-03-17 19:52:28,627 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 47 states and 71 transitions. [2025-03-17 19:52:28,627 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2025-03-17 19:52:28,627 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2025-03-17 19:52:28,627 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 71 transitions. [2025-03-17 19:52:28,627 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:52:28,627 INFO L218 hiAutomatonCegarLoop]: Abstraction has 47 states and 71 transitions. [2025-03-17 19:52:28,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states and 71 transitions. [2025-03-17 19:52:28,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 45. [2025-03-17 19:52:28,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 45 states have (on average 1.511111111111111) internal successors, (68), 44 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:52:28,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 68 transitions. [2025-03-17 19:52:28,630 INFO L240 hiAutomatonCegarLoop]: Abstraction has 45 states and 68 transitions. [2025-03-17 19:52:28,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:52:28,630 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 19:52:28,630 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 19:52:28,630 INFO L87 Difference]: Start difference. First operand 45 states and 68 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:52:28,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:52:28,651 INFO L93 Difference]: Finished difference Result 50 states and 71 transitions. [2025-03-17 19:52:28,651 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 50 states and 71 transitions. [2025-03-17 19:52:28,652 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 21 [2025-03-17 19:52:28,652 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 50 states to 46 states and 66 transitions. [2025-03-17 19:52:28,653 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2025-03-17 19:52:28,653 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2025-03-17 19:52:28,653 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 66 transitions. [2025-03-17 19:52:28,653 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:52:28,653 INFO L218 hiAutomatonCegarLoop]: Abstraction has 46 states and 66 transitions. [2025-03-17 19:52:28,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states and 66 transitions. [2025-03-17 19:52:28,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 33. [2025-03-17 19:52:28,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 33 states have (on average 1.5151515151515151) internal successors, (50), 32 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:52:28,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 50 transitions. [2025-03-17 19:52:28,655 INFO L240 hiAutomatonCegarLoop]: Abstraction has 33 states and 50 transitions. [2025-03-17 19:52:28,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 19:52:28,656 INFO L432 stractBuchiCegarLoop]: Abstraction has 33 states and 50 transitions. [2025-03-17 19:52:28,656 INFO L338 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-03-17 19:52:28,656 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 50 transitions. [2025-03-17 19:52:28,656 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2025-03-17 19:52:28,656 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:52:28,656 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:52:28,656 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-03-17 19:52:28,656 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-03-17 19:52:28,657 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0;" "assume main_~i~0#1 > 0;" "assume 1 == main_~i~0#1;main_~up~0#1 := 1;" "assume !(10 == main_~i~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" [2025-03-17 19:52:28,657 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~i~0#1 > 0;" "assume !(1 == main_~i~0#1);" "assume !(10 == main_~i~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" [2025-03-17 19:52:28,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:28,657 INFO L85 PathProgramCache]: Analyzing trace with hash 36230786, now seen corresponding path program 3 times [2025-03-17 19:52:28,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:52:28,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052437374] [2025-03-17 19:52:28,657 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 19:52:28,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:52:28,660 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 5 statements into 1 equivalence classes. [2025-03-17 19:52:28,661 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 19:52:28,661 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-17 19:52:28,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:52:28,661 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:52:28,661 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 19:52:28,662 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 19:52:28,662 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:28,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:52:28,663 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:52:28,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:28,668 INFO L85 PathProgramCache]: Analyzing trace with hash 1137949, now seen corresponding path program 1 times [2025-03-17 19:52:28,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:52:28,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330601576] [2025-03-17 19:52:28,668 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:52:28,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:52:28,673 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 19:52:28,675 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 19:52:28,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:28,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:52:28,678 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:52:28,679 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 19:52:28,680 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 19:52:28,680 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:28,680 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:52:28,680 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:52:28,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:28,683 INFO L85 PathProgramCache]: Analyzing trace with hash 2096696094, now seen corresponding path program 1 times [2025-03-17 19:52:28,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:52:28,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512107804] [2025-03-17 19:52:28,684 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:52:28,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:52:28,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-17 19:52:28,688 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-17 19:52:28,691 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:28,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:52:28,692 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:52:28,692 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-17 19:52:28,694 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-17 19:52:28,694 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:28,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:52:28,699 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:52:28,722 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 19:52:28,722 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 19:52:28,722 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 19:52:28,722 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 19:52:28,722 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-17 19:52:28,722 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:28,722 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 19:52:28,722 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 19:52:28,722 INFO L132 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration6_Loop [2025-03-17 19:52:28,722 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 19:52:28,722 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 19:52:28,723 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:28,726 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:28,729 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:28,731 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:28,811 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 19:52:28,812 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-17 19:52:28,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:28,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:28,814 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:52:28,829 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2025-03-17 19:52:28,829 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 19:52:28,829 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:52:28,845 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 19:52:28,846 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~up~0#1=1} Honda state: {ULTIMATE.start_main_~up~0#1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-17 19:52:28,856 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2025-03-17 19:52:28,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:28,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:28,858 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:52:28,860 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2025-03-17 19:52:28,861 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 19:52:28,861 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:52:28,881 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 19:52:28,881 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_7=1} Honda state: {v_rep~unnamed0~0~true_7=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-17 19:52:28,887 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2025-03-17 19:52:28,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:28,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:28,889 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:52:28,890 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2025-03-17 19:52:28,891 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 19:52:28,891 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:52:28,908 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 19:52:28,908 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_7=0} Honda state: {v_rep~unnamed0~0~false_7=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-17 19:52:28,915 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2025-03-17 19:52:28,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:28,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:28,917 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:52:28,918 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2025-03-17 19:52:28,919 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 19:52:28,919 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:52:28,936 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2025-03-17 19:52:28,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:28,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:28,938 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:52:28,939 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2025-03-17 19:52:28,941 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-17 19:52:28,941 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:52:28,968 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 19:52:28,968 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~i~0#1=11} Honda state: {ULTIMATE.start_main_~i~0#1=11} Generalized eigenvectors: [{ULTIMATE.start_main_~i~0#1=0}, {ULTIMATE.start_main_~i~0#1=0}, {ULTIMATE.start_main_~i~0#1=1}] Lambdas: [7, 23, 1] Nus: [1, 0] [2025-03-17 19:52:28,974 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2025-03-17 19:52:29,001 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 19:52:29,001 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 19:52:29,001 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 19:52:29,001 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 19:52:29,001 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-17 19:52:29,001 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:29,001 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 19:52:29,001 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 19:52:29,001 INFO L132 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration6_Lasso [2025-03-17 19:52:29,001 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 19:52:29,001 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 19:52:29,002 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:29,009 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:29,011 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:29,013 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:29,015 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:29,017 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:29,103 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 19:52:29,103 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-17 19:52:29,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:29,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:29,105 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:52:29,106 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2025-03-17 19:52:29,107 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 19:52:29,107 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:52:29,123 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2025-03-17 19:52:29,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:29,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:29,125 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:52:29,126 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2025-03-17 19:52:29,127 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-17 19:52:29,127 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:52:29,148 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-17 19:52:29,152 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2025-03-17 19:52:29,152 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 19:52:29,152 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 19:52:29,152 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 19:52:29,152 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 19:52:29,152 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 19:52:29,152 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:29,152 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 19:52:29,152 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 19:52:29,152 INFO L132 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration6_Lasso [2025-03-17 19:52:29,152 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 19:52:29,152 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 19:52:29,153 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:29,160 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:29,162 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:29,164 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:29,166 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:29,167 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:29,238 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 19:52:29,238 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 19:52:29,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:29,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:29,241 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:52:29,242 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2025-03-17 19:52:29,243 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:52:29,252 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:52:29,252 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:52:29,252 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-03-17 19:52:29,252 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:52:29,257 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2025-03-17 19:52:29,257 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-03-17 19:52:29,266 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-17 19:52:29,280 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2025-03-17 19:52:29,280 INFO L444 ModelExtractionUtils]: 0 out of 11 variables were initially zero. Simplification set additionally 6 variables to zero. [2025-03-17 19:52:29,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:29,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:29,283 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:52:29,284 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2025-03-17 19:52:29,285 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-17 19:52:29,298 INFO L438 nArgumentSynthesizer]: Removed 3 redundant supporting invariants from a total of 4. [2025-03-17 19:52:29,298 INFO L474 LassoAnalysis]: Proved termination. [2025-03-17 19:52:29,298 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = -2*ULTIMATE.start_main_~i~0#1 + 21 Supporting invariants [-1*ULTIMATE.start_main_~i~0#1 + 10 >= 0] [2025-03-17 19:52:29,304 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2025-03-17 19:52:29,311 INFO L156 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2025-03-17 19:52:29,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:29,330 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 19:52:29,332 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 19:52:29,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:29,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:29,332 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 19:52:29,333 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:52:29,372 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2025-03-17 19:52:29,375 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 19:52:29,376 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2025-03-17 19:52:29,377 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 19:52:29,377 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:29,377 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:29,379 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2025-03-17 19:52:29,379 WARN L254 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 19:52:29,380 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:52:29,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:52:29,413 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2025-03-17 19:52:29,413 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 33 states and 50 transitions. cyclomatic complexity: 21 Second operand has 5 states, 5 states have (on average 1.8) 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-03-17 19:52:29,469 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 33 states and 50 transitions. cyclomatic complexity: 21. Second operand has 5 states, 5 states have (on average 1.8) 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) Result 43 states and 63 transitions. Complement of second has 8 states. [2025-03-17 19:52:29,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2025-03-17 19:52:29,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.8) 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-03-17 19:52:29,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 18 transitions. [2025-03-17 19:52:29,472 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 5 letters. Loop has 4 letters. [2025-03-17 19:52:29,472 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:52:29,472 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 9 letters. Loop has 4 letters. [2025-03-17 19:52:29,472 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:52:29,472 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 5 letters. Loop has 8 letters. [2025-03-17 19:52:29,472 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:52:29,473 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 63 transitions. [2025-03-17 19:52:29,473 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2025-03-17 19:52:29,475 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 42 states and 62 transitions. [2025-03-17 19:52:29,475 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2025-03-17 19:52:29,475 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2025-03-17 19:52:29,475 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 62 transitions. [2025-03-17 19:52:29,475 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:52:29,475 INFO L218 hiAutomatonCegarLoop]: Abstraction has 42 states and 62 transitions. [2025-03-17 19:52:29,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 62 transitions. [2025-03-17 19:52:29,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2025-03-17 19:52:29,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 41 states have (on average 1.4878048780487805) internal successors, (61), 40 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:52:29,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 61 transitions. [2025-03-17 19:52:29,480 INFO L240 hiAutomatonCegarLoop]: Abstraction has 41 states and 61 transitions. [2025-03-17 19:52:29,480 INFO L432 stractBuchiCegarLoop]: Abstraction has 41 states and 61 transitions. [2025-03-17 19:52:29,480 INFO L338 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-03-17 19:52:29,480 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 61 transitions. [2025-03-17 19:52:29,481 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2025-03-17 19:52:29,481 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:52:29,481 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:52:29,481 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1] [2025-03-17 19:52:29,481 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-03-17 19:52:29,481 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0;" "assume main_~i~0#1 > 0;" "assume 1 == main_~i~0#1;main_~up~0#1 := 1;" "assume !(10 == main_~i~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 > 0;" "assume !(1 == main_~i~0#1);" "assume 10 == main_~i~0#1;main_~up~0#1 := 0;" [2025-03-17 19:52:29,481 INFO L754 eck$LassoCheckResult]: Loop: "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 > 0;" "assume !(1 == main_~i~0#1);" "assume 10 == main_~i~0#1;main_~up~0#1 := 0;" [2025-03-17 19:52:29,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:29,482 INFO L85 PathProgramCache]: Analyzing trace with hash 1314561346, now seen corresponding path program 1 times [2025-03-17 19:52:29,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:52:29,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438036434] [2025-03-17 19:52:29,482 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:52:29,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:52:29,487 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-17 19:52:29,488 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-17 19:52:29,491 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:29,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:29,513 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:52:29,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:52:29,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438036434] [2025-03-17 19:52:29,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438036434] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:52:29,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1361565846] [2025-03-17 19:52:29,514 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:52:29,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:52:29,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:29,516 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:52:29,517 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2025-03-17 19:52:29,530 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-17 19:52:29,531 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-17 19:52:29,532 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:29,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:29,532 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 19:52:29,532 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:52:29,538 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:52:29,538 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:52:29,559 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:52:29,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1361565846] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:52:29,559 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:52:29,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2025-03-17 19:52:29,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685667484] [2025-03-17 19:52:29,559 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:52:29,559 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-17 19:52:29,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:29,559 INFO L85 PathProgramCache]: Analyzing trace with hash 990019, now seen corresponding path program 2 times [2025-03-17 19:52:29,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:52:29,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337524300] [2025-03-17 19:52:29,559 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:52:29,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:52:29,561 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 4 statements into 1 equivalence classes. [2025-03-17 19:52:29,563 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 19:52:29,563 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 19:52:29,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:52:29,564 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:52:29,564 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 19:52:29,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 19:52:29,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:29,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:52:29,565 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:52:29,588 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 19:52:29,588 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 19:52:29,588 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 19:52:29,588 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 19:52:29,588 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-17 19:52:29,588 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:29,588 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 19:52:29,588 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 19:52:29,588 INFO L132 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration7_Loop [2025-03-17 19:52:29,588 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 19:52:29,588 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 19:52:29,588 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:29,593 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:29,595 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:29,599 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:29,633 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 19:52:29,633 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-17 19:52:29,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:29,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:29,635 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:52:29,635 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2025-03-17 19:52:29,636 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 19:52:29,636 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:52:29,652 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2025-03-17 19:52:29,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:29,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:29,653 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:52:29,654 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2025-03-17 19:52:29,657 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-17 19:52:29,657 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:52:29,668 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-17 19:52:29,673 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2025-03-17 19:52:29,673 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 19:52:29,673 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 19:52:29,673 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 19:52:29,673 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 19:52:29,673 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 19:52:29,673 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:29,673 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 19:52:29,673 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 19:52:29,673 INFO L132 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration7_Loop [2025-03-17 19:52:29,673 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 19:52:29,673 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 19:52:29,674 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:29,678 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:29,679 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:29,681 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:29,714 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 19:52:29,714 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 19:52:29,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:29,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:29,716 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:52:29,717 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2025-03-17 19:52:29,718 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:52:29,728 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:52:29,728 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:52:29,728 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:52:29,728 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:52:29,728 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:52:29,729 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:52:29,729 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:52:29,730 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-17 19:52:29,734 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2025-03-17 19:52:29,734 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-03-17 19:52:29,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:29,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:29,736 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:52:29,737 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2025-03-17 19:52:29,737 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-17 19:52:29,737 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-17 19:52:29,737 INFO L474 LassoAnalysis]: Proved termination. [2025-03-17 19:52:29,737 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = 1*ULTIMATE.start_main_~i~0#1 Supporting invariants [] [2025-03-17 19:52:29,742 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2025-03-17 19:52:29,743 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-17 19:52:29,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:29,755 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-17 19:52:29,757 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-17 19:52:29,757 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:29,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:29,757 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 19:52:29,757 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:52:29,764 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 19:52:29,765 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 19:52:29,765 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:29,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:29,766 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 19:52:29,766 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:52:29,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:52:29,777 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-03-17 19:52:29,777 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 41 states and 61 transitions. cyclomatic complexity: 25 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-03-17 19:52:29,801 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 41 states and 61 transitions. cyclomatic complexity: 25. 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 104 states and 155 transitions. Complement of second has 7 states. [2025-03-17 19:52:29,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-03-17 19:52:29,803 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-03-17 19:52:29,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2025-03-17 19:52:29,804 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 8 letters. Loop has 4 letters. [2025-03-17 19:52:29,804 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:52:29,804 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 12 letters. Loop has 4 letters. [2025-03-17 19:52:29,804 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:52:29,804 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 8 letters. Loop has 8 letters. [2025-03-17 19:52:29,804 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:52:29,804 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 104 states and 155 transitions. [2025-03-17 19:52:29,805 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 24 [2025-03-17 19:52:29,806 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 104 states to 86 states and 128 transitions. [2025-03-17 19:52:29,806 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 41 [2025-03-17 19:52:29,806 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 43 [2025-03-17 19:52:29,806 INFO L73 IsDeterministic]: Start isDeterministic. Operand 86 states and 128 transitions. [2025-03-17 19:52:29,806 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:52:29,806 INFO L218 hiAutomatonCegarLoop]: Abstraction has 86 states and 128 transitions. [2025-03-17 19:52:29,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states and 128 transitions. [2025-03-17 19:52:29,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 81. [2025-03-17 19:52:29,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 81 states have (on average 1.5061728395061729) internal successors, (122), 80 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:52:29,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 122 transitions. [2025-03-17 19:52:29,811 INFO L240 hiAutomatonCegarLoop]: Abstraction has 81 states and 122 transitions. [2025-03-17 19:52:29,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:52:29,812 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 19:52:29,812 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 19:52:29,812 INFO L87 Difference]: Start difference. First operand 81 states and 122 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 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-03-17 19:52:29,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:52:29,849 INFO L93 Difference]: Finished difference Result 157 states and 214 transitions. [2025-03-17 19:52:29,849 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 157 states and 214 transitions. [2025-03-17 19:52:29,850 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 60 [2025-03-17 19:52:29,851 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 157 states to 157 states and 214 transitions. [2025-03-17 19:52:29,851 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 97 [2025-03-17 19:52:29,851 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 97 [2025-03-17 19:52:29,851 INFO L73 IsDeterministic]: Start isDeterministic. Operand 157 states and 214 transitions. [2025-03-17 19:52:29,851 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:52:29,852 INFO L218 hiAutomatonCegarLoop]: Abstraction has 157 states and 214 transitions. [2025-03-17 19:52:29,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states and 214 transitions. [2025-03-17 19:52:29,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 137. [2025-03-17 19:52:29,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 137 states have (on average 1.3868613138686132) internal successors, (190), 136 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:52:29,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 190 transitions. [2025-03-17 19:52:29,856 INFO L240 hiAutomatonCegarLoop]: Abstraction has 137 states and 190 transitions. [2025-03-17 19:52:29,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 19:52:29,858 INFO L432 stractBuchiCegarLoop]: Abstraction has 137 states and 190 transitions. [2025-03-17 19:52:29,858 INFO L338 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2025-03-17 19:52:29,858 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 137 states and 190 transitions. [2025-03-17 19:52:29,859 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 52 [2025-03-17 19:52:29,859 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:52:29,859 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:52:29,859 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1] [2025-03-17 19:52:29,859 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-03-17 19:52:29,860 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0;" "assume main_~i~0#1 > 0;" "assume 1 == main_~i~0#1;main_~up~0#1 := 1;" "assume !(10 == main_~i~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 > 0;" "assume !(1 == main_~i~0#1);" "assume !(10 == main_~i~0#1);" "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" [2025-03-17 19:52:29,860 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~i~0#1 > 0;" "assume 1 == main_~i~0#1;main_~up~0#1 := 1;" "assume !(10 == main_~i~0#1);" "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" [2025-03-17 19:52:29,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:29,860 INFO L85 PathProgramCache]: Analyzing trace with hash 2096696095, now seen corresponding path program 1 times [2025-03-17 19:52:29,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:52:29,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533845124] [2025-03-17 19:52:29,860 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:52:29,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:52:29,862 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-17 19:52:29,863 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-17 19:52:29,863 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:29,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:29,876 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 19:52:29,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:52:29,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533845124] [2025-03-17 19:52:29,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533845124] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:52:29,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:52:29,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 19:52:29,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220882428] [2025-03-17 19:52:29,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:52:29,876 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-17 19:52:29,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:29,877 INFO L85 PathProgramCache]: Analyzing trace with hash 1136989, now seen corresponding path program 1 times [2025-03-17 19:52:29,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:52:29,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776688164] [2025-03-17 19:52:29,877 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:52:29,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:52:29,878 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 19:52:29,879 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 19:52:29,879 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:29,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:29,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:52:29,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:52:29,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776688164] [2025-03-17 19:52:29,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776688164] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:52:29,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:52:29,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 19:52:29,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401617682] [2025-03-17 19:52:29,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:52:29,893 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-17 19:52:29,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:52:29,893 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 19:52:29,893 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 19:52:29,893 INFO L87 Difference]: Start difference. First operand 137 states and 190 transitions. cyclomatic complexity: 64 Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:52:29,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:52:29,897 INFO L93 Difference]: Finished difference Result 101 states and 119 transitions. [2025-03-17 19:52:29,897 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 101 states and 119 transitions. [2025-03-17 19:52:29,898 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 22 [2025-03-17 19:52:29,898 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 101 states to 81 states and 95 transitions. [2025-03-17 19:52:29,898 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 39 [2025-03-17 19:52:29,898 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 39 [2025-03-17 19:52:29,898 INFO L73 IsDeterministic]: Start isDeterministic. Operand 81 states and 95 transitions. [2025-03-17 19:52:29,898 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:52:29,898 INFO L218 hiAutomatonCegarLoop]: Abstraction has 81 states and 95 transitions. [2025-03-17 19:52:29,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states and 95 transitions. [2025-03-17 19:52:29,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 78. [2025-03-17 19:52:29,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 78 states have (on average 1.1794871794871795) internal successors, (92), 77 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:52:29,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 92 transitions. [2025-03-17 19:52:29,901 INFO L240 hiAutomatonCegarLoop]: Abstraction has 78 states and 92 transitions. [2025-03-17 19:52:29,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 19:52:29,901 INFO L432 stractBuchiCegarLoop]: Abstraction has 78 states and 92 transitions. [2025-03-17 19:52:29,901 INFO L338 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2025-03-17 19:52:29,901 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 78 states and 92 transitions. [2025-03-17 19:52:29,902 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 21 [2025-03-17 19:52:29,902 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:52:29,902 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:52:29,902 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [6, 4, 4, 4, 2, 1, 1, 1] [2025-03-17 19:52:29,902 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [5, 4, 4, 4, 1, 1, 1] [2025-03-17 19:52:29,902 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0;" "assume main_~i~0#1 > 0;" "assume 1 == main_~i~0#1;main_~up~0#1 := 1;" "assume !(10 == main_~i~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 > 0;" "assume !(1 == main_~i~0#1);" "assume !(10 == main_~i~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 > 0;" "assume !(1 == main_~i~0#1);" "assume !(10 == main_~i~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 > 0;" "assume !(1 == main_~i~0#1);" "assume !(10 == main_~i~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 > 0;" "assume !(1 == main_~i~0#1);" "assume 10 == main_~i~0#1;main_~up~0#1 := 0;" "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 > 0;" "assume 1 == main_~i~0#1;main_~up~0#1 := 1;" [2025-03-17 19:52:29,902 INFO L754 eck$LassoCheckResult]: Loop: "assume !(10 == main_~i~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 > 0;" "assume !(1 == main_~i~0#1);" "assume !(10 == main_~i~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 > 0;" "assume !(1 == main_~i~0#1);" "assume !(10 == main_~i~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 > 0;" "assume !(1 == main_~i~0#1);" "assume !(10 == main_~i~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 > 0;" "assume !(1 == main_~i~0#1);" "assume 10 == main_~i~0#1;main_~up~0#1 := 0;" "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 > 0;" "assume 1 == main_~i~0#1;main_~up~0#1 := 1;" [2025-03-17 19:52:29,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:29,903 INFO L85 PathProgramCache]: Analyzing trace with hash 1251848370, now seen corresponding path program 1 times [2025-03-17 19:52:29,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:52:29,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856309002] [2025-03-17 19:52:29,903 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:52:29,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:52:29,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-17 19:52:29,907 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-17 19:52:29,907 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:29,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:29,940 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-17 19:52:29,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:52:29,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856309002] [2025-03-17 19:52:29,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856309002] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:52:29,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:52:29,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 19:52:29,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544012344] [2025-03-17 19:52:29,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:52:29,941 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-17 19:52:29,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:29,942 INFO L85 PathProgramCache]: Analyzing trace with hash 486762350, now seen corresponding path program 1 times [2025-03-17 19:52:29,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:52:29,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793808226] [2025-03-17 19:52:29,942 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:52:29,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:52:29,944 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-17 19:52:29,946 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-17 19:52:29,946 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:29,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:29,970 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-17 19:52:29,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:52:29,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793808226] [2025-03-17 19:52:29,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793808226] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:52:29,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:52:29,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 19:52:29,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681425288] [2025-03-17 19:52:29,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:52:29,971 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-17 19:52:29,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:52:29,971 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 19:52:29,971 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 19:52:29,972 INFO L87 Difference]: Start difference. First operand 78 states and 92 transitions. cyclomatic complexity: 21 Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:52:29,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:52:29,984 INFO L93 Difference]: Finished difference Result 93 states and 109 transitions. [2025-03-17 19:52:29,984 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 93 states and 109 transitions. [2025-03-17 19:52:29,985 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 26 [2025-03-17 19:52:29,985 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 93 states to 93 states and 109 transitions. [2025-03-17 19:52:29,985 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 41 [2025-03-17 19:52:29,985 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 41 [2025-03-17 19:52:29,985 INFO L73 IsDeterministic]: Start isDeterministic. Operand 93 states and 109 transitions. [2025-03-17 19:52:29,985 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:52:29,986 INFO L218 hiAutomatonCegarLoop]: Abstraction has 93 states and 109 transitions. [2025-03-17 19:52:29,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states and 109 transitions. [2025-03-17 19:52:29,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 84. [2025-03-17 19:52:29,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 84 states have (on average 1.1547619047619047) internal successors, (97), 83 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:52:29,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 97 transitions. [2025-03-17 19:52:29,991 INFO L240 hiAutomatonCegarLoop]: Abstraction has 84 states and 97 transitions. [2025-03-17 19:52:29,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 19:52:29,991 INFO L432 stractBuchiCegarLoop]: Abstraction has 84 states and 97 transitions. [2025-03-17 19:52:29,991 INFO L338 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2025-03-17 19:52:29,992 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 84 states and 97 transitions. [2025-03-17 19:52:29,992 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 24 [2025-03-17 19:52:29,992 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:52:29,992 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:52:29,992 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [7, 5, 5, 4, 2, 2, 1, 1] [2025-03-17 19:52:29,992 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [6, 5, 5, 4, 2, 1, 1] [2025-03-17 19:52:29,993 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0;" "assume main_~i~0#1 > 0;" "assume 1 == main_~i~0#1;main_~up~0#1 := 1;" "assume !(10 == main_~i~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 > 0;" "assume !(1 == main_~i~0#1);" "assume !(10 == main_~i~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 > 0;" "assume !(1 == main_~i~0#1);" "assume !(10 == main_~i~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 > 0;" "assume !(1 == main_~i~0#1);" "assume !(10 == main_~i~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 > 0;" "assume !(1 == main_~i~0#1);" "assume 10 == main_~i~0#1;main_~up~0#1 := 0;" "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 > 0;" "assume !(1 == main_~i~0#1);" "assume !(10 == main_~i~0#1);" "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 > 0;" "assume 1 == main_~i~0#1;main_~up~0#1 := 1;" [2025-03-17 19:52:29,993 INFO L754 eck$LassoCheckResult]: Loop: "assume !(10 == main_~i~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 > 0;" "assume !(1 == main_~i~0#1);" "assume !(10 == main_~i~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 > 0;" "assume !(1 == main_~i~0#1);" "assume !(10 == main_~i~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 > 0;" "assume !(1 == main_~i~0#1);" "assume !(10 == main_~i~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 > 0;" "assume !(1 == main_~i~0#1);" "assume 10 == main_~i~0#1;main_~up~0#1 := 0;" "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 > 0;" "assume !(1 == main_~i~0#1);" "assume !(10 == main_~i~0#1);" "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 > 0;" "assume 1 == main_~i~0#1;main_~up~0#1 := 1;" [2025-03-17 19:52:29,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:29,993 INFO L85 PathProgramCache]: Analyzing trace with hash 1847720207, now seen corresponding path program 2 times [2025-03-17 19:52:29,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:52:29,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028427941] [2025-03-17 19:52:29,993 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:52:29,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:52:29,999 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-03-17 19:52:30,003 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-03-17 19:52:30,003 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 19:52:30,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:30,058 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 41 proven. 28 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 19:52:30,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:52:30,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028427941] [2025-03-17 19:52:30,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028427941] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:52:30,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1221890573] [2025-03-17 19:52:30,059 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:52:30,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:52:30,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:30,061 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:52:30,062 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2025-03-17 19:52:30,079 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-03-17 19:52:30,085 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-03-17 19:52:30,085 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 19:52:30,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:30,086 INFO L256 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 19:52:30,086 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:52:30,114 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 41 proven. 28 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 19:52:30,114 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:52:30,171 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 41 proven. 28 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 19:52:30,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1221890573] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:52:30,171 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:52:30,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2025-03-17 19:52:30,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43931559] [2025-03-17 19:52:30,171 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:52:30,171 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-17 19:52:30,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:30,172 INFO L85 PathProgramCache]: Analyzing trace with hash -1793723957, now seen corresponding path program 2 times [2025-03-17 19:52:30,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:52:30,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329047] [2025-03-17 19:52:30,172 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:52:30,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:52:30,177 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-03-17 19:52:30,179 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-03-17 19:52:30,179 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 19:52:30,179 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:30,200 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 29 proven. 3 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-17 19:52:30,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:52:30,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329047] [2025-03-17 19:52:30,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329047] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:52:30,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1541676783] [2025-03-17 19:52:30,201 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:52:30,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:52:30,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:30,202 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:52:30,204 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2025-03-17 19:52:30,219 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-03-17 19:52:30,223 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-03-17 19:52:30,223 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 19:52:30,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:30,223 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 19:52:30,224 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:52:30,235 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 29 proven. 3 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-17 19:52:30,235 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:52:30,257 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 29 proven. 3 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-17 19:52:30,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1541676783] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:52:30,257 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:52:30,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-17 19:52:30,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940539917] [2025-03-17 19:52:30,257 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:52:30,258 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-17 19:52:30,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:52:30,258 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 19:52:30,258 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2025-03-17 19:52:30,258 INFO L87 Difference]: Start difference. First operand 84 states and 97 transitions. cyclomatic complexity: 20 Second operand has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:52:30,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:52:30,289 INFO L93 Difference]: Finished difference Result 157 states and 185 transitions. [2025-03-17 19:52:30,289 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 157 states and 185 transitions. [2025-03-17 19:52:30,290 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 42 [2025-03-17 19:52:30,291 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 157 states to 157 states and 185 transitions. [2025-03-17 19:52:30,291 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 57 [2025-03-17 19:52:30,291 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 57 [2025-03-17 19:52:30,291 INFO L73 IsDeterministic]: Start isDeterministic. Operand 157 states and 185 transitions. [2025-03-17 19:52:30,291 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:52:30,291 INFO L218 hiAutomatonCegarLoop]: Abstraction has 157 states and 185 transitions. [2025-03-17 19:52:30,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states and 185 transitions. [2025-03-17 19:52:30,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 132. [2025-03-17 19:52:30,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 132 states have (on average 1.1590909090909092) internal successors, (153), 131 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:52:30,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 153 transitions. [2025-03-17 19:52:30,297 INFO L240 hiAutomatonCegarLoop]: Abstraction has 132 states and 153 transitions. [2025-03-17 19:52:30,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 19:52:30,302 INFO L432 stractBuchiCegarLoop]: Abstraction has 132 states and 153 transitions. [2025-03-17 19:52:30,302 INFO L338 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2025-03-17 19:52:30,302 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 132 states and 153 transitions. [2025-03-17 19:52:30,303 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 40 [2025-03-17 19:52:30,303 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:52:30,303 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:52:30,303 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [11, 9, 9, 6, 4, 2, 1, 1] [2025-03-17 19:52:30,303 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [10, 9, 9, 6, 4, 1, 1] [2025-03-17 19:52:30,303 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0;" "assume main_~i~0#1 > 0;" "assume 1 == main_~i~0#1;main_~up~0#1 := 1;" "assume !(10 == main_~i~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 > 0;" "assume !(1 == main_~i~0#1);" "assume !(10 == main_~i~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 > 0;" "assume !(1 == main_~i~0#1);" "assume !(10 == main_~i~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 > 0;" "assume !(1 == main_~i~0#1);" "assume !(10 == main_~i~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 > 0;" "assume !(1 == main_~i~0#1);" "assume 10 == main_~i~0#1;main_~up~0#1 := 0;" "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 > 0;" "assume !(1 == main_~i~0#1);" "assume !(10 == main_~i~0#1);" "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 > 0;" "assume !(1 == main_~i~0#1);" "assume !(10 == main_~i~0#1);" "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 > 0;" "assume !(1 == main_~i~0#1);" "assume !(10 == main_~i~0#1);" "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 > 0;" "assume !(1 == main_~i~0#1);" "assume !(10 == main_~i~0#1);" "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 > 0;" "assume !(1 == main_~i~0#1);" "assume !(10 == main_~i~0#1);" "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 > 0;" "assume 1 == main_~i~0#1;main_~up~0#1 := 1;" [2025-03-17 19:52:30,303 INFO L754 eck$LassoCheckResult]: Loop: "assume !(10 == main_~i~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 > 0;" "assume !(1 == main_~i~0#1);" "assume !(10 == main_~i~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 > 0;" "assume !(1 == main_~i~0#1);" "assume !(10 == main_~i~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 > 0;" "assume !(1 == main_~i~0#1);" "assume !(10 == main_~i~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 > 0;" "assume !(1 == main_~i~0#1);" "assume 10 == main_~i~0#1;main_~up~0#1 := 0;" "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 > 0;" "assume !(1 == main_~i~0#1);" "assume !(10 == main_~i~0#1);" "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 > 0;" "assume !(1 == main_~i~0#1);" "assume !(10 == main_~i~0#1);" "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 > 0;" "assume !(1 == main_~i~0#1);" "assume !(10 == main_~i~0#1);" "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 > 0;" "assume !(1 == main_~i~0#1);" "assume !(10 == main_~i~0#1);" "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 > 0;" "assume !(1 == main_~i~0#1);" "assume !(10 == main_~i~0#1);" "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 > 0;" "assume 1 == main_~i~0#1;main_~up~0#1 := 1;" [2025-03-17 19:52:30,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:30,304 INFO L85 PathProgramCache]: Analyzing trace with hash -745211517, now seen corresponding path program 3 times [2025-03-17 19:52:30,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:52:30,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12891863] [2025-03-17 19:52:30,304 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 19:52:30,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:52:30,308 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 43 statements into 11 equivalence classes. [2025-03-17 19:52:30,313 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) and asserted 35 of 43 statements. [2025-03-17 19:52:30,313 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2025-03-17 19:52:30,313 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:30,345 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Ended with exit code 0 [2025-03-17 19:52:30,399 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 109 proven. 55 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-17 19:52:30,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:52:30,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12891863] [2025-03-17 19:52:30,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12891863] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:52:30,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1553766634] [2025-03-17 19:52:30,399 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 19:52:30,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:52:30,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:30,401 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:52:30,402 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2025-03-17 19:52:30,418 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 43 statements into 11 equivalence classes. [2025-03-17 19:52:30,426 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) and asserted 35 of 43 statements. [2025-03-17 19:52:30,426 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2025-03-17 19:52:30,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:30,426 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 19:52:30,427 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:52:30,461 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 109 proven. 55 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-17 19:52:30,461 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:52:30,523 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 109 proven. 55 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-17 19:52:30,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1553766634] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:52:30,523 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:52:30,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 10 [2025-03-17 19:52:30,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017322015] [2025-03-17 19:52:30,523 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:52:30,523 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-17 19:52:30,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:30,523 INFO L85 PathProgramCache]: Analyzing trace with hash -2141717953, now seen corresponding path program 3 times [2025-03-17 19:52:30,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:52:30,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857572987] [2025-03-17 19:52:30,524 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 19:52:30,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:52:30,526 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 40 statements into 10 equivalence classes. [2025-03-17 19:52:30,528 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) and asserted 32 of 40 statements. [2025-03-17 19:52:30,528 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2025-03-17 19:52:30,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:30,594 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 97 proven. 55 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-17 19:52:30,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:52:30,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857572987] [2025-03-17 19:52:30,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857572987] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:52:30,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [980822977] [2025-03-17 19:52:30,594 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 19:52:30,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:52:30,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:30,597 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:52:30,598 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2025-03-17 19:52:30,613 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 40 statements into 10 equivalence classes. [2025-03-17 19:52:30,619 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) and asserted 32 of 40 statements. [2025-03-17 19:52:30,619 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2025-03-17 19:52:30,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:30,620 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 19:52:30,621 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:52:30,657 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 97 proven. 55 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-17 19:52:30,657 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:52:30,722 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 97 proven. 55 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-17 19:52:30,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [980822977] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:52:30,722 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:52:30,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 10 [2025-03-17 19:52:30,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764736537] [2025-03-17 19:52:30,723 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:52:30,723 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-17 19:52:30,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:52:30,724 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 19:52:30,724 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2025-03-17 19:52:30,724 INFO L87 Difference]: Start difference. First operand 132 states and 153 transitions. cyclomatic complexity: 28 Second operand has 11 states, 10 states have (on average 3.8) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:52:30,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:52:30,770 INFO L93 Difference]: Finished difference Result 205 states and 242 transitions. [2025-03-17 19:52:30,770 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 205 states and 242 transitions. [2025-03-17 19:52:30,771 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 54 [2025-03-17 19:52:30,772 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 205 states to 205 states and 242 transitions. [2025-03-17 19:52:30,772 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 69 [2025-03-17 19:52:30,772 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 69 [2025-03-17 19:52:30,772 INFO L73 IsDeterministic]: Start isDeterministic. Operand 205 states and 242 transitions. [2025-03-17 19:52:30,772 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:52:30,772 INFO L218 hiAutomatonCegarLoop]: Abstraction has 205 states and 242 transitions. [2025-03-17 19:52:30,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states and 242 transitions. [2025-03-17 19:52:30,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 168. [2025-03-17 19:52:30,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 168 states have (on average 1.1607142857142858) internal successors, (195), 167 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:52:30,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 195 transitions. [2025-03-17 19:52:30,775 INFO L240 hiAutomatonCegarLoop]: Abstraction has 168 states and 195 transitions. [2025-03-17 19:52:30,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 19:52:30,776 INFO L432 stractBuchiCegarLoop]: Abstraction has 168 states and 195 transitions. [2025-03-17 19:52:30,776 INFO L338 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2025-03-17 19:52:30,776 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 168 states and 195 transitions. [2025-03-17 19:52:30,777 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 52 [2025-03-17 19:52:30,777 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:52:30,777 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:52:30,778 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [14, 12, 12, 9, 4, 2, 1, 1] [2025-03-17 19:52:30,778 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [13, 12, 12, 9, 4, 1, 1] [2025-03-17 19:52:30,778 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0;" "assume main_~i~0#1 > 0;" "assume 1 == main_~i~0#1;main_~up~0#1 := 1;" "assume !(10 == main_~i~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 > 0;" "assume !(1 == main_~i~0#1);" "assume !(10 == main_~i~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 > 0;" "assume !(1 == main_~i~0#1);" "assume !(10 == main_~i~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 > 0;" "assume !(1 == main_~i~0#1);" "assume !(10 == main_~i~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 > 0;" "assume !(1 == main_~i~0#1);" "assume 10 == main_~i~0#1;main_~up~0#1 := 0;" "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 > 0;" "assume !(1 == main_~i~0#1);" "assume !(10 == main_~i~0#1);" "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 > 0;" "assume !(1 == main_~i~0#1);" "assume !(10 == main_~i~0#1);" "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 > 0;" "assume !(1 == main_~i~0#1);" "assume !(10 == main_~i~0#1);" "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 > 0;" "assume !(1 == main_~i~0#1);" "assume !(10 == main_~i~0#1);" "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 > 0;" "assume !(1 == main_~i~0#1);" "assume !(10 == main_~i~0#1);" "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 > 0;" "assume !(1 == main_~i~0#1);" "assume !(10 == main_~i~0#1);" "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 > 0;" "assume !(1 == main_~i~0#1);" "assume !(10 == main_~i~0#1);" "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 > 0;" "assume !(1 == main_~i~0#1);" "assume !(10 == main_~i~0#1);" "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 > 0;" "assume 1 == main_~i~0#1;main_~up~0#1 := 1;" [2025-03-17 19:52:30,778 INFO L754 eck$LassoCheckResult]: Loop: "assume !(10 == main_~i~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 > 0;" "assume !(1 == main_~i~0#1);" "assume !(10 == main_~i~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 > 0;" "assume !(1 == main_~i~0#1);" "assume !(10 == main_~i~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 > 0;" "assume !(1 == main_~i~0#1);" "assume !(10 == main_~i~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 > 0;" "assume !(1 == main_~i~0#1);" "assume 10 == main_~i~0#1;main_~up~0#1 := 0;" "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 > 0;" "assume !(1 == main_~i~0#1);" "assume !(10 == main_~i~0#1);" "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 > 0;" "assume !(1 == main_~i~0#1);" "assume !(10 == main_~i~0#1);" "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 > 0;" "assume !(1 == main_~i~0#1);" "assume !(10 == main_~i~0#1);" "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 > 0;" "assume !(1 == main_~i~0#1);" "assume !(10 == main_~i~0#1);" "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 > 0;" "assume !(1 == main_~i~0#1);" "assume !(10 == main_~i~0#1);" "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 > 0;" "assume !(1 == main_~i~0#1);" "assume !(10 == main_~i~0#1);" "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 > 0;" "assume !(1 == main_~i~0#1);" "assume !(10 == main_~i~0#1);" "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 > 0;" "assume !(1 == main_~i~0#1);" "assume !(10 == main_~i~0#1);" "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 > 0;" "assume 1 == main_~i~0#1;main_~up~0#1 := 1;" [2025-03-17 19:52:30,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:30,778 INFO L85 PathProgramCache]: Analyzing trace with hash 138214810, now seen corresponding path program 4 times [2025-03-17 19:52:30,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:52:30,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649587273] [2025-03-17 19:52:30,779 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 19:52:30,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:52:30,782 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 55 statements into 2 equivalence classes. [2025-03-17 19:52:30,784 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-17 19:52:30,784 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-17 19:52:30,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:30,839 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 174 proven. 28 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2025-03-17 19:52:30,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:52:30,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649587273] [2025-03-17 19:52:30,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649587273] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:52:30,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [991344602] [2025-03-17 19:52:30,839 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 19:52:30,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:52:30,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:30,841 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:52:30,843 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2025-03-17 19:52:30,860 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 55 statements into 2 equivalence classes. [2025-03-17 19:52:30,869 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-17 19:52:30,869 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-17 19:52:30,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:30,869 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 19:52:30,870 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:52:30,887 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 174 proven. 28 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2025-03-17 19:52:30,887 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:52:30,935 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 174 proven. 28 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2025-03-17 19:52:30,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [991344602] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:52:30,935 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:52:30,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2025-03-17 19:52:30,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609932336] [2025-03-17 19:52:30,936 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:52:30,936 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-17 19:52:30,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:30,936 INFO L85 PathProgramCache]: Analyzing trace with hash -793197482, now seen corresponding path program 4 times [2025-03-17 19:52:30,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:52:30,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372805747] [2025-03-17 19:52:30,936 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 19:52:30,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:52:30,938 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 52 statements into 2 equivalence classes. [2025-03-17 19:52:30,941 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 52 of 52 statements. [2025-03-17 19:52:30,941 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 19:52:30,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:52:30,941 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:52:30,942 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-17 19:52:30,947 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-17 19:52:30,947 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:30,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:52:30,950 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:52:31,108 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 19:52:31,108 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 19:52:31,108 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 19:52:31,108 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 19:52:31,108 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-17 19:52:31,108 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:31,108 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 19:52:31,108 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 19:52:31,108 INFO L132 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration12_Loop [2025-03-17 19:52:31,108 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 19:52:31,108 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 19:52:31,109 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:31,111 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:31,114 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:31,118 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:31,148 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 19:52:31,148 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-17 19:52:31,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:31,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:31,150 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:52:31,151 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2025-03-17 19:52:31,152 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 19:52:31,152 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:52:31,170 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 19:52:31,170 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_12=1} Honda state: {v_rep~unnamed0~0~true_12=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-17 19:52:31,175 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Forceful destruction successful, exit code 0 [2025-03-17 19:52:31,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:31,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:31,177 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:52:31,178 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2025-03-17 19:52:31,179 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 19:52:31,179 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:52:31,202 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Ended with exit code 0 [2025-03-17 19:52:31,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:31,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:31,204 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:52:31,205 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2025-03-17 19:52:31,208 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-17 19:52:31,208 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:52:31,220 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-17 19:52:31,226 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Ended with exit code 0 [2025-03-17 19:52:31,226 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 19:52:31,226 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 19:52:31,226 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 19:52:31,226 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 19:52:31,226 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 19:52:31,226 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:31,226 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 19:52:31,226 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 19:52:31,226 INFO L132 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration12_Loop [2025-03-17 19:52:31,226 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 19:52:31,226 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 19:52:31,226 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:31,230 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:31,233 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:31,237 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:31,265 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 19:52:31,265 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 19:52:31,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:31,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:31,267 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:52:31,269 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2025-03-17 19:52:31,270 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:52:31,280 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:52:31,280 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:52:31,280 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:52:31,280 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:52:31,281 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:52:31,281 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:52:31,283 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:52:31,289 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Ended with exit code 0 [2025-03-17 19:52:31,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:31,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:31,291 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:52:31,292 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2025-03-17 19:52:31,293 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:52:31,303 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:52:31,303 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:52:31,303 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:52:31,303 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:52:31,304 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:52:31,304 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:52:31,304 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:52:31,306 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-17 19:52:31,308 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-17 19:52:31,308 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-03-17 19:52:31,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:31,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:31,310 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:52:31,311 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2025-03-17 19:52:31,311 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-17 19:52:31,311 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-17 19:52:31,312 INFO L474 LassoAnalysis]: Proved termination. [2025-03-17 19:52:31,312 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = 1*ULTIMATE.start_main_~i~0#1 Supporting invariants [] [2025-03-17 19:52:31,317 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Forceful destruction successful, exit code 0 [2025-03-17 19:52:31,317 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-17 19:52:31,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:31,330 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-17 19:52:31,344 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-17 19:52:31,344 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:31,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:31,344 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 19:52:31,345 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:52:31,399 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-17 19:52:31,407 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-17 19:52:31,407 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:31,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:31,407 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 19:52:31,408 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:52:31,491 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 176 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2025-03-17 19:52:31,491 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2025-03-17 19:52:31,492 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 168 states and 195 transitions. cyclomatic complexity: 34 Second operand has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:52:31,664 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 168 states and 195 transitions. cyclomatic complexity: 34. Second operand has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 0 states have call successors, (0), 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 590 states and 698 transitions. Complement of second has 23 states. [2025-03-17 19:52:31,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 1 stem states 10 non-accepting loop states 1 accepting loop states [2025-03-17 19:52:31,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:52:31,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 53 transitions. [2025-03-17 19:52:31,666 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 53 transitions. Stem has 55 letters. Loop has 52 letters. [2025-03-17 19:52:31,667 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:52:31,667 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 53 transitions. Stem has 107 letters. Loop has 52 letters. [2025-03-17 19:52:31,667 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:52:31,667 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 53 transitions. Stem has 55 letters. Loop has 104 letters. [2025-03-17 19:52:31,668 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:52:31,668 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 590 states and 698 transitions. [2025-03-17 19:52:31,674 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 56 [2025-03-17 19:52:31,676 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 590 states to 489 states and 568 transitions. [2025-03-17 19:52:31,676 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 115 [2025-03-17 19:52:31,676 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 122 [2025-03-17 19:52:31,676 INFO L73 IsDeterministic]: Start isDeterministic. Operand 489 states and 568 transitions. [2025-03-17 19:52:31,676 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:52:31,676 INFO L218 hiAutomatonCegarLoop]: Abstraction has 489 states and 568 transitions. [2025-03-17 19:52:31,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states and 568 transitions. [2025-03-17 19:52:31,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 445. [2025-03-17 19:52:31,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 445 states, 445 states have (on average 1.1775280898876404) internal successors, (524), 444 states have internal predecessors, (524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:52:31,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 524 transitions. [2025-03-17 19:52:31,687 INFO L240 hiAutomatonCegarLoop]: Abstraction has 445 states and 524 transitions. [2025-03-17 19:52:31,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:52:31,687 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 19:52:31,687 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2025-03-17 19:52:31,687 INFO L87 Difference]: Start difference. First operand 445 states and 524 transitions. Second operand has 11 states, 11 states have (on average 3.909090909090909) internal successors, (43), 11 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:52:31,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:52:31,732 INFO L93 Difference]: Finished difference Result 283 states and 310 transitions. [2025-03-17 19:52:31,732 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 283 states and 310 transitions. [2025-03-17 19:52:31,734 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 73 [2025-03-17 19:52:31,735 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 283 states to 235 states and 262 transitions. [2025-03-17 19:52:31,735 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 88 [2025-03-17 19:52:31,735 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 88 [2025-03-17 19:52:31,735 INFO L73 IsDeterministic]: Start isDeterministic. Operand 235 states and 262 transitions. [2025-03-17 19:52:31,735 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:52:31,735 INFO L218 hiAutomatonCegarLoop]: Abstraction has 235 states and 262 transitions. [2025-03-17 19:52:31,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states and 262 transitions. [2025-03-17 19:52:31,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 228. [2025-03-17 19:52:31,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 228 states have (on average 1.118421052631579) internal successors, (255), 227 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:52:31,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 255 transitions. [2025-03-17 19:52:31,738 INFO L240 hiAutomatonCegarLoop]: Abstraction has 228 states and 255 transitions. [2025-03-17 19:52:31,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 19:52:31,738 INFO L432 stractBuchiCegarLoop]: Abstraction has 228 states and 255 transitions. [2025-03-17 19:52:31,738 INFO L338 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2025-03-17 19:52:31,738 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 228 states and 255 transitions. [2025-03-17 19:52:31,739 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 72 [2025-03-17 19:52:31,739 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:52:31,739 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:52:31,740 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [19, 17, 17, 9, 9, 2, 1, 1] [2025-03-17 19:52:31,740 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [18, 17, 17, 9, 9, 1, 1] [2025-03-17 19:52:31,741 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0;" "assume main_~i~0#1 > 0;" "assume 1 == main_~i~0#1;main_~up~0#1 := 1;" "assume !(10 == main_~i~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 > 0;" "assume !(1 == main_~i~0#1);" "assume !(10 == main_~i~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 > 0;" "assume !(1 == main_~i~0#1);" "assume !(10 == main_~i~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 > 0;" "assume !(1 == main_~i~0#1);" "assume !(10 == main_~i~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 > 0;" "assume !(1 == main_~i~0#1);" "assume !(10 == main_~i~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 > 0;" "assume !(1 == main_~i~0#1);" "assume !(10 == main_~i~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 > 0;" "assume !(1 == main_~i~0#1);" "assume !(10 == main_~i~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 > 0;" "assume !(1 == main_~i~0#1);" "assume !(10 == main_~i~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 > 0;" "assume !(1 == main_~i~0#1);" "assume !(10 == main_~i~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 > 0;" "assume !(1 == main_~i~0#1);" "assume 10 == main_~i~0#1;main_~up~0#1 := 0;" "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 > 0;" "assume !(1 == main_~i~0#1);" "assume !(10 == main_~i~0#1);" "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 > 0;" "assume !(1 == main_~i~0#1);" "assume !(10 == main_~i~0#1);" "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 > 0;" "assume !(1 == main_~i~0#1);" "assume !(10 == main_~i~0#1);" "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 > 0;" "assume !(1 == main_~i~0#1);" "assume !(10 == main_~i~0#1);" "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 > 0;" "assume !(1 == main_~i~0#1);" "assume !(10 == main_~i~0#1);" "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 > 0;" "assume !(1 == main_~i~0#1);" "assume !(10 == main_~i~0#1);" "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 > 0;" "assume !(1 == main_~i~0#1);" "assume !(10 == main_~i~0#1);" "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 > 0;" "assume !(1 == main_~i~0#1);" "assume !(10 == main_~i~0#1);" "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 > 0;" "assume 1 == main_~i~0#1;main_~up~0#1 := 1;" [2025-03-17 19:52:31,741 INFO L754 eck$LassoCheckResult]: Loop: "assume !(10 == main_~i~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 > 0;" "assume !(1 == main_~i~0#1);" "assume !(10 == main_~i~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 > 0;" "assume !(1 == main_~i~0#1);" "assume !(10 == main_~i~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 > 0;" "assume !(1 == main_~i~0#1);" "assume !(10 == main_~i~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 > 0;" "assume !(1 == main_~i~0#1);" "assume !(10 == main_~i~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 > 0;" "assume !(1 == main_~i~0#1);" "assume !(10 == main_~i~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 > 0;" "assume !(1 == main_~i~0#1);" "assume !(10 == main_~i~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 > 0;" "assume !(1 == main_~i~0#1);" "assume !(10 == main_~i~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 > 0;" "assume !(1 == main_~i~0#1);" "assume !(10 == main_~i~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 > 0;" "assume !(1 == main_~i~0#1);" "assume 10 == main_~i~0#1;main_~up~0#1 := 0;" "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 > 0;" "assume !(1 == main_~i~0#1);" "assume !(10 == main_~i~0#1);" "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 > 0;" "assume !(1 == main_~i~0#1);" "assume !(10 == main_~i~0#1);" "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 > 0;" "assume !(1 == main_~i~0#1);" "assume !(10 == main_~i~0#1);" "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 > 0;" "assume !(1 == main_~i~0#1);" "assume !(10 == main_~i~0#1);" "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 > 0;" "assume !(1 == main_~i~0#1);" "assume !(10 == main_~i~0#1);" "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 > 0;" "assume !(1 == main_~i~0#1);" "assume !(10 == main_~i~0#1);" "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 > 0;" "assume !(1 == main_~i~0#1);" "assume !(10 == main_~i~0#1);" "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 > 0;" "assume !(1 == main_~i~0#1);" "assume !(10 == main_~i~0#1);" "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 > 0;" "assume 1 == main_~i~0#1;main_~up~0#1 := 1;" [2025-03-17 19:52:31,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:31,741 INFO L85 PathProgramCache]: Analyzing trace with hash 1536155046, now seen corresponding path program 5 times [2025-03-17 19:52:31,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:52:31,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608824766] [2025-03-17 19:52:31,741 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 19:52:31,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:52:31,744 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 75 statements into 19 equivalence classes. [2025-03-17 19:52:31,749 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 19 check-sat command(s) and asserted 75 of 75 statements. [2025-03-17 19:52:31,749 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 19 check-sat command(s) [2025-03-17 19:52:31,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:52:31,749 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:52:31,750 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-17 19:52:31,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-17 19:52:31,753 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:31,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:52:31,754 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:52:31,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:31,754 INFO L85 PathProgramCache]: Analyzing trace with hash -1497305502, now seen corresponding path program 5 times [2025-03-17 19:52:31,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:52:31,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335630583] [2025-03-17 19:52:31,754 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 19:52:31,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:52:31,757 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 72 statements into 18 equivalence classes. [2025-03-17 19:52:31,760 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) and asserted 72 of 72 statements. [2025-03-17 19:52:31,761 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2025-03-17 19:52:31,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:52:31,761 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:52:31,761 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-17 19:52:31,764 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-17 19:52:31,764 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:31,764 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:52:31,765 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:52:31,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:31,766 INFO L85 PathProgramCache]: Analyzing trace with hash -1670926585, now seen corresponding path program 6 times [2025-03-17 19:52:31,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:52:31,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983404751] [2025-03-17 19:52:31,766 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-17 19:52:31,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:52:31,770 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 147 statements into 37 equivalence classes. [2025-03-17 19:52:31,779 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 37 check-sat command(s) and asserted 147 of 147 statements. [2025-03-17 19:52:31,781 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 37 check-sat command(s) [2025-03-17 19:52:31,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:52:31,781 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:52:31,783 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-17 19:52:31,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-17 19:52:31,790 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:31,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:52:31,793 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:52:31,858 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Ended with exit code 0 [2025-03-17 19:52:32,274 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-17 19:52:32,280 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-17 19:52:32,280 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:32,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:52:32,280 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:52:32,282 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-17 19:52:32,288 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-17 19:52:32,288 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:32,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:52:32,348 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 17.03 07:52:32 BoogieIcfgContainer [2025-03-17 19:52:32,348 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-03-17 19:52:32,349 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 19:52:32,349 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 19:52:32,349 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 19:52:32,349 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 07:52:26" (3/4) ... [2025-03-17 19:52:32,350 INFO L143 WitnessPrinter]: Generating witness for non-termination counterexample [2025-03-17 19:52:32,402 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-17 19:52:32,402 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 19:52:32,403 INFO L158 Benchmark]: Toolchain (without parser) took 6009.52ms. Allocated memory is still 167.8MB. Free memory was 122.8MB in the beginning and 106.0MB in the end (delta: 16.7MB). Peak memory consumption was 11.6MB. Max. memory is 16.1GB. [2025-03-17 19:52:32,403 INFO L158 Benchmark]: CDTParser took 0.66ms. Allocated memory is still 201.3MB. Free memory is still 120.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 19:52:32,404 INFO L158 Benchmark]: CACSL2BoogieTranslator took 152.95ms. Allocated memory is still 167.8MB. Free memory was 122.4MB in the beginning and 112.7MB in the end (delta: 9.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 19:52:32,404 INFO L158 Benchmark]: Boogie Procedure Inliner took 19.76ms. Allocated memory is still 167.8MB. Free memory was 112.7MB in the beginning and 111.8MB in the end (delta: 833.9kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 19:52:32,404 INFO L158 Benchmark]: Boogie Preprocessor took 17.62ms. Allocated memory is still 167.8MB. Free memory was 111.8MB in the beginning and 111.0MB in the end (delta: 882.0kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 19:52:32,404 INFO L158 Benchmark]: IcfgBuilder took 160.96ms. Allocated memory is still 167.8MB. Free memory was 111.0MB in the beginning and 101.6MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 19:52:32,405 INFO L158 Benchmark]: BuchiAutomizer took 5599.56ms. Allocated memory is still 167.8MB. Free memory was 101.2MB in the beginning and 111.0MB in the end (delta: -9.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 19:52:32,405 INFO L158 Benchmark]: Witness Printer took 53.61ms. Allocated memory is still 167.8MB. Free memory was 111.0MB in the beginning and 106.0MB in the end (delta: 5.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 19:52:32,407 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.66ms. Allocated memory is still 201.3MB. Free memory is still 120.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 152.95ms. Allocated memory is still 167.8MB. Free memory was 122.4MB in the beginning and 112.7MB in the end (delta: 9.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 19.76ms. Allocated memory is still 167.8MB. Free memory was 112.7MB in the beginning and 111.8MB in the end (delta: 833.9kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 17.62ms. Allocated memory is still 167.8MB. Free memory was 111.8MB in the beginning and 111.0MB in the end (delta: 882.0kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 160.96ms. Allocated memory is still 167.8MB. Free memory was 111.0MB in the beginning and 101.6MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * BuchiAutomizer took 5599.56ms. Allocated memory is still 167.8MB. Free memory was 101.2MB in the beginning and 111.0MB in the end (delta: -9.8MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 53.61ms. Allocated memory is still 167.8MB. Free memory was 111.0MB in the beginning and 106.0MB in the end (delta: 5.0MB). 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 (9 trivial, 6 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function i and consists of 4 locations. One deterministic module has affine ranking function i and consists of 4 locations. One deterministic module has affine ranking function (((long) -2 * i) + 3) and consists of 4 locations. One deterministic module has affine ranking function (((long) -2 * i) + 21) and consists of 5 locations. One deterministic module has affine ranking function i and consists of 4 locations. One deterministic module has affine ranking function i and consists of 12 locations. 9 modules have a trivial ranking function, the largest among these consists of 11 locations. The remainder module has 228 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 5.5s and 13 iterations. TraceHistogramMax:19. Analysis of lassos took 4.2s. Construction of modules took 0.2s. Büchi inclusion checks took 0.8s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 13. Automata minimization 0.1s AutomataMinimizationTime, 15 MinimizatonAttempts, 171 StatesRemovedByMinimization, 12 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 [6, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 136/312 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 163 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 158 mSDsluCounter, 104 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7 mSDsCounter, 57 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 450 IncrementalHoareTripleChecker+Invalid, 507 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 57 mSolverCounterUnsat, 97 mSDtfsCounter, 450 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI2 SFLT2 conc0 concLT1 SILN0 SILU0 SILI4 SILT2 lasso1 LassoPreprocessingBenchmarks: Lassos: inital16 mio100 ax180 hnf100 lsp39 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq190 hnf92 smp94 dnf125 smp96 tf109 neg100 sie108 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 59ms VariablesStem: 1 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 16 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 8 LassoNonterminationAnalysisSatUnbounded: 1 LassoNonterminationAnalysisUnsat: 6 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.5s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - LassoShapedNonTerminationArgument [Line: 15]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L6] int i; [L7] int up; [L8] i = __VERIFIER_nondet_int() [L9] up = 0 VAL [up=0] [L11] COND TRUE i > 0 VAL [i=1, up=0] [L12] COND TRUE i == 1 [L13] up = 1 VAL [i=1, up=1] [L15] COND FALSE !(i == 10) VAL [i=1, up=1] [L18] COND TRUE up == 1 [L19] i = i+1 VAL [i=2, up=1] [L11] COND TRUE i > 0 VAL [i=2, up=1] [L12] COND FALSE !(i == 1) VAL [i=2, up=1] [L15] COND FALSE !(i == 10) VAL [i=2, up=1] [L18] COND TRUE up == 1 [L19] i = i+1 VAL [i=3, up=1] [L11] COND TRUE i > 0 VAL [i=3, up=1] [L12] COND FALSE !(i == 1) VAL [i=3, up=1] [L15] COND FALSE !(i == 10) VAL [i=3, up=1] [L18] COND TRUE up == 1 [L19] i = i+1 VAL [i=4, up=1] [L11] COND TRUE i > 0 VAL [i=4, up=1] [L12] COND FALSE !(i == 1) VAL [i=4, up=1] [L15] COND FALSE !(i == 10) VAL [i=4, up=1] [L18] COND TRUE up == 1 [L19] i = i+1 VAL [i=5, up=1] [L11] COND TRUE i > 0 VAL [i=5, up=1] [L12] COND FALSE !(i == 1) VAL [i=5, up=1] [L15] COND FALSE !(i == 10) VAL [i=5, up=1] [L18] COND TRUE up == 1 [L19] i = i+1 VAL [i=6, up=1] [L11] COND TRUE i > 0 VAL [i=6, up=1] [L12] COND FALSE !(i == 1) VAL [i=6, up=1] [L15] COND FALSE !(i == 10) VAL [i=6, up=1] [L18] COND TRUE up == 1 [L19] i = i+1 VAL [i=7, up=1] [L11] COND TRUE i > 0 VAL [i=7, up=1] [L12] COND FALSE !(i == 1) VAL [i=7, up=1] [L15] COND FALSE !(i == 10) VAL [i=7, up=1] [L18] COND TRUE up == 1 [L19] i = i+1 VAL [i=8, up=1] [L11] COND TRUE i > 0 VAL [i=8, up=1] [L12] COND FALSE !(i == 1) VAL [i=8, up=1] [L15] COND FALSE !(i == 10) VAL [i=8, up=1] [L18] COND TRUE up == 1 [L19] i = i+1 VAL [i=9, up=1] [L11] COND TRUE i > 0 VAL [i=9, up=1] [L12] COND FALSE !(i == 1) VAL [i=9, up=1] [L15] COND FALSE !(i == 10) VAL [i=9, up=1] [L18] COND TRUE up == 1 [L19] i = i+1 VAL [i=10, up=1] [L11] COND TRUE i > 0 VAL [i=10, up=1] [L12] COND FALSE !(i == 1) VAL [i=10, up=1] [L15] COND TRUE i == 10 [L16] up = 0 VAL [i=10, up=0] [L18] COND FALSE !(up == 1) [L21] i = i-1 VAL [i=9, up=0] [L11] COND TRUE i > 0 VAL [i=9, up=0] [L12] COND FALSE !(i == 1) VAL [i=9, up=0] [L15] COND FALSE !(i == 10) VAL [i=9, up=0] [L18] COND FALSE !(up == 1) [L21] i = i-1 VAL [i=8, up=0] [L11] COND TRUE i > 0 VAL [i=8, up=0] [L12] COND FALSE !(i == 1) VAL [i=8, up=0] [L15] COND FALSE !(i == 10) VAL [i=8, up=0] [L18] COND FALSE !(up == 1) [L21] i = i-1 VAL [i=7, up=0] [L11] COND TRUE i > 0 VAL [i=7, up=0] [L12] COND FALSE !(i == 1) VAL [i=7, up=0] [L15] COND FALSE !(i == 10) VAL [i=7, up=0] [L18] COND FALSE !(up == 1) [L21] i = i-1 VAL [i=6, up=0] [L11] COND TRUE i > 0 VAL [i=6, up=0] [L12] COND FALSE !(i == 1) VAL [i=6, up=0] [L15] COND FALSE !(i == 10) VAL [i=6, up=0] [L18] COND FALSE !(up == 1) [L21] i = i-1 VAL [i=5, up=0] [L11] COND TRUE i > 0 VAL [i=5, up=0] [L12] COND FALSE !(i == 1) VAL [i=5, up=0] [L15] COND FALSE !(i == 10) VAL [i=5, up=0] [L18] COND FALSE !(up == 1) [L21] i = i-1 VAL [i=4, up=0] [L11] COND TRUE i > 0 VAL [i=4, up=0] [L12] COND FALSE !(i == 1) VAL [i=4, up=0] [L15] COND FALSE !(i == 10) VAL [i=4, up=0] [L18] COND FALSE !(up == 1) [L21] i = i-1 VAL [i=3, up=0] [L11] COND TRUE i > 0 VAL [i=3, up=0] [L12] COND FALSE !(i == 1) VAL [i=3, up=0] [L15] COND FALSE !(i == 10) VAL [i=3, up=0] [L18] COND FALSE !(up == 1) [L21] i = i-1 VAL [i=2, up=0] [L11] COND TRUE i > 0 VAL [i=2, up=0] [L12] COND FALSE !(i == 1) VAL [i=2, up=0] [L15] COND FALSE !(i == 10) VAL [i=2, up=0] [L18] COND FALSE !(up == 1) [L21] i = i-1 VAL [i=1, up=0] [L11] COND TRUE i > 0 VAL [i=1, up=0] [L12] COND TRUE i == 1 [L13] up = 1 VAL [i=1, up=1] Loop: [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND TRUE i == 10 [L16] up = 0 [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND TRUE i == 1 [L13] up = 1 End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 15]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L6] int i; [L7] int up; [L8] i = __VERIFIER_nondet_int() [L9] up = 0 VAL [up=0] [L11] COND TRUE i > 0 VAL [i=1, up=0] [L12] COND TRUE i == 1 [L13] up = 1 VAL [i=1, up=1] [L15] COND FALSE !(i == 10) VAL [i=1, up=1] [L18] COND TRUE up == 1 [L19] i = i+1 VAL [i=2, up=1] [L11] COND TRUE i > 0 VAL [i=2, up=1] [L12] COND FALSE !(i == 1) VAL [i=2, up=1] [L15] COND FALSE !(i == 10) VAL [i=2, up=1] [L18] COND TRUE up == 1 [L19] i = i+1 VAL [i=3, up=1] [L11] COND TRUE i > 0 VAL [i=3, up=1] [L12] COND FALSE !(i == 1) VAL [i=3, up=1] [L15] COND FALSE !(i == 10) VAL [i=3, up=1] [L18] COND TRUE up == 1 [L19] i = i+1 VAL [i=4, up=1] [L11] COND TRUE i > 0 VAL [i=4, up=1] [L12] COND FALSE !(i == 1) VAL [i=4, up=1] [L15] COND FALSE !(i == 10) VAL [i=4, up=1] [L18] COND TRUE up == 1 [L19] i = i+1 VAL [i=5, up=1] [L11] COND TRUE i > 0 VAL [i=5, up=1] [L12] COND FALSE !(i == 1) VAL [i=5, up=1] [L15] COND FALSE !(i == 10) VAL [i=5, up=1] [L18] COND TRUE up == 1 [L19] i = i+1 VAL [i=6, up=1] [L11] COND TRUE i > 0 VAL [i=6, up=1] [L12] COND FALSE !(i == 1) VAL [i=6, up=1] [L15] COND FALSE !(i == 10) VAL [i=6, up=1] [L18] COND TRUE up == 1 [L19] i = i+1 VAL [i=7, up=1] [L11] COND TRUE i > 0 VAL [i=7, up=1] [L12] COND FALSE !(i == 1) VAL [i=7, up=1] [L15] COND FALSE !(i == 10) VAL [i=7, up=1] [L18] COND TRUE up == 1 [L19] i = i+1 VAL [i=8, up=1] [L11] COND TRUE i > 0 VAL [i=8, up=1] [L12] COND FALSE !(i == 1) VAL [i=8, up=1] [L15] COND FALSE !(i == 10) VAL [i=8, up=1] [L18] COND TRUE up == 1 [L19] i = i+1 VAL [i=9, up=1] [L11] COND TRUE i > 0 VAL [i=9, up=1] [L12] COND FALSE !(i == 1) VAL [i=9, up=1] [L15] COND FALSE !(i == 10) VAL [i=9, up=1] [L18] COND TRUE up == 1 [L19] i = i+1 VAL [i=10, up=1] [L11] COND TRUE i > 0 VAL [i=10, up=1] [L12] COND FALSE !(i == 1) VAL [i=10, up=1] [L15] COND TRUE i == 10 [L16] up = 0 VAL [i=10, up=0] [L18] COND FALSE !(up == 1) [L21] i = i-1 VAL [i=9, up=0] [L11] COND TRUE i > 0 VAL [i=9, up=0] [L12] COND FALSE !(i == 1) VAL [i=9, up=0] [L15] COND FALSE !(i == 10) VAL [i=9, up=0] [L18] COND FALSE !(up == 1) [L21] i = i-1 VAL [i=8, up=0] [L11] COND TRUE i > 0 VAL [i=8, up=0] [L12] COND FALSE !(i == 1) VAL [i=8, up=0] [L15] COND FALSE !(i == 10) VAL [i=8, up=0] [L18] COND FALSE !(up == 1) [L21] i = i-1 VAL [i=7, up=0] [L11] COND TRUE i > 0 VAL [i=7, up=0] [L12] COND FALSE !(i == 1) VAL [i=7, up=0] [L15] COND FALSE !(i == 10) VAL [i=7, up=0] [L18] COND FALSE !(up == 1) [L21] i = i-1 VAL [i=6, up=0] [L11] COND TRUE i > 0 VAL [i=6, up=0] [L12] COND FALSE !(i == 1) VAL [i=6, up=0] [L15] COND FALSE !(i == 10) VAL [i=6, up=0] [L18] COND FALSE !(up == 1) [L21] i = i-1 VAL [i=5, up=0] [L11] COND TRUE i > 0 VAL [i=5, up=0] [L12] COND FALSE !(i == 1) VAL [i=5, up=0] [L15] COND FALSE !(i == 10) VAL [i=5, up=0] [L18] COND FALSE !(up == 1) [L21] i = i-1 VAL [i=4, up=0] [L11] COND TRUE i > 0 VAL [i=4, up=0] [L12] COND FALSE !(i == 1) VAL [i=4, up=0] [L15] COND FALSE !(i == 10) VAL [i=4, up=0] [L18] COND FALSE !(up == 1) [L21] i = i-1 VAL [i=3, up=0] [L11] COND TRUE i > 0 VAL [i=3, up=0] [L12] COND FALSE !(i == 1) VAL [i=3, up=0] [L15] COND FALSE !(i == 10) VAL [i=3, up=0] [L18] COND FALSE !(up == 1) [L21] i = i-1 VAL [i=2, up=0] [L11] COND TRUE i > 0 VAL [i=2, up=0] [L12] COND FALSE !(i == 1) VAL [i=2, up=0] [L15] COND FALSE !(i == 10) VAL [i=2, up=0] [L18] COND FALSE !(up == 1) [L21] i = i-1 VAL [i=1, up=0] [L11] COND TRUE i > 0 VAL [i=1, up=0] [L12] COND TRUE i == 1 [L13] up = 1 VAL [i=1, up=1] Loop: [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND TRUE i == 10 [L16] up = 0 [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND TRUE i == 1 [L13] up = 1 End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2025-03-17 19:52:32,426 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Forceful destruction successful, exit code 0 [2025-03-17 19:52:32,625 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Forceful destruction successful, exit code 0 [2025-03-17 19:52:32,824 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Ended with exit code 0 [2025-03-17 19:52:33,024 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Forceful destruction successful, exit code 0 [2025-03-17 19:52:33,225 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Forceful destruction successful, exit code 0 [2025-03-17 19:52:33,425 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Ended with exit code 0 [2025-03-17 19:52:33,626 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM)