./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-restricted-15/Ex06.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-restricted-15/Ex06.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 7e66e5d0ac00f8e474147a7ee8b0260ea4ced8ccde7952ff642446632cdde4c3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 07:02:01,591 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 07:02:01,658 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2025-01-10 07:02:01,669 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 07:02:01,669 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 07:02:01,704 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 07:02:01,705 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 07:02:01,708 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 07:02:01,709 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 07:02:01,709 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 07:02:01,709 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 07:02:01,709 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 07:02:01,709 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 07:02:01,710 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-01-10 07:02:01,710 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-01-10 07:02:01,710 INFO L153 SettingsManager]: * Use old map elimination=false [2025-01-10 07:02:01,710 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-01-10 07:02:01,710 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-01-10 07:02:01,710 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-01-10 07:02:01,710 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 07:02:01,710 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-01-10 07:02:01,710 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 07:02:01,710 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 07:02:01,710 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-01-10 07:02:01,710 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-01-10 07:02:01,710 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-01-10 07:02:01,711 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 07:02:01,711 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 07:02:01,711 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-01-10 07:02:01,711 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 07:02:01,711 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 07:02:01,711 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 07:02:01,711 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 07:02:01,712 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 07:02:01,712 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 07:02:01,712 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-01-10 07:02:01,712 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7e66e5d0ac00f8e474147a7ee8b0260ea4ced8ccde7952ff642446632cdde4c3 [2025-01-10 07:02:01,922 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 07:02:01,927 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 07:02:01,928 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 07:02:01,929 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 07:02:01,929 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 07:02:01,930 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-restricted-15/Ex06.c [2025-01-10 07:02:03,168 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f76411089/a3ca7a4069c24d9683d1a56d94ccda4f/FLAG0226a663d [2025-01-10 07:02:03,401 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 07:02:03,402 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/termination-restricted-15/Ex06.c [2025-01-10 07:02:03,408 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f76411089/a3ca7a4069c24d9683d1a56d94ccda4f/FLAG0226a663d [2025-01-10 07:02:03,422 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f76411089/a3ca7a4069c24d9683d1a56d94ccda4f [2025-01-10 07:02:03,424 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 07:02:03,425 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 07:02:03,426 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 07:02:03,427 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 07:02:03,430 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 07:02:03,430 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 07:02:03" (1/1) ... [2025-01-10 07:02:03,431 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79a7697c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:02:03, skipping insertion in model container [2025-01-10 07:02:03,431 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 07:02:03" (1/1) ... [2025-01-10 07:02:03,440 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 07:02:03,535 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 07:02:03,538 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 07:02:03,545 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 07:02:03,554 INFO L204 MainTranslator]: Completed translation [2025-01-10 07:02:03,554 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:02:03 WrapperNode [2025-01-10 07:02:03,554 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 07:02:03,555 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 07:02:03,555 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 07:02:03,555 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 07:02:03,560 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:02:03" (1/1) ... [2025-01-10 07:02:03,562 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:02:03" (1/1) ... [2025-01-10 07:02:03,571 INFO L138 Inliner]: procedures = 4, calls = 2, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 13 [2025-01-10 07:02:03,572 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 07:02:03,572 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 07:02:03,572 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 07:02:03,572 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 07:02:03,577 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:02:03" (1/1) ... [2025-01-10 07:02:03,577 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:02:03" (1/1) ... [2025-01-10 07:02:03,578 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:02:03" (1/1) ... [2025-01-10 07:02:03,580 INFO L175 MemorySlicer]: No memory access in input program. [2025-01-10 07:02:03,581 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:02:03" (1/1) ... [2025-01-10 07:02:03,581 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:02:03" (1/1) ... [2025-01-10 07:02:03,582 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:02:03" (1/1) ... [2025-01-10 07:02:03,582 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:02:03" (1/1) ... [2025-01-10 07:02:03,584 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:02:03" (1/1) ... [2025-01-10 07:02:03,584 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:02:03" (1/1) ... [2025-01-10 07:02:03,584 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:02:03" (1/1) ... [2025-01-10 07:02:03,586 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 07:02:03,587 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 07:02:03,587 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 07:02:03,588 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 07:02:03,588 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:02:03" (1/1) ... [2025-01-10 07:02:03,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:02:03,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:02:03,616 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:02:03,626 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2025-01-10 07:02:03,645 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 07:02:03,646 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 07:02:03,686 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 07:02:03,687 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 07:02:03,730 INFO L? ?]: Removed 3 outVars from TransFormulas that were not future-live. [2025-01-10 07:02:03,731 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 07:02:03,737 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 07:02:03,737 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 07:02:03,738 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 07:02:03 BoogieIcfgContainer [2025-01-10 07:02:03,738 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 07:02:03,739 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-01-10 07:02:03,739 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-01-10 07:02:03,743 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-01-10 07:02:03,743 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-01-10 07:02:03,743 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.01 07:02:03" (1/3) ... [2025-01-10 07:02:03,744 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2465cfbe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.01 07:02:03, skipping insertion in model container [2025-01-10 07:02:03,744 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-01-10 07:02:03,744 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:02:03" (2/3) ... [2025-01-10 07:02:03,744 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2465cfbe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.01 07:02:03, skipping insertion in model container [2025-01-10 07:02:03,744 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-01-10 07:02:03,744 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 07:02:03" (3/3) ... [2025-01-10 07:02:03,745 INFO L363 chiAutomizerObserver]: Analyzing ICFG Ex06.c [2025-01-10 07:02:03,776 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-01-10 07:02:03,777 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-01-10 07:02:03,777 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-01-10 07:02:03,777 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-01-10 07:02:03,777 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-01-10 07:02:03,777 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-01-10 07:02:03,777 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-01-10 07:02:03,777 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-01-10 07:02:03,780 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 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-01-10 07:02:03,787 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-01-10 07:02:03,788 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:02:03,788 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:02:03,790 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-01-10 07:02:03,790 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-01-10 07:02:03,790 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-01-10 07:02:03,790 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 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-01-10 07:02:03,791 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-01-10 07:02:03,791 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:02:03,791 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:02:03,791 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-01-10 07:02:03,791 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-01-10 07:02:03,795 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;havoc main_~i~0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;" [2025-01-10 07:02:03,795 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~i~0#1 >= -5 && main_~i~0#1 <= 5;" "assume main_~i~0#1 > 0;main_~i~0#1 := main_~i~0#1 - 1;" "assume !(main_~i~0#1 < 0);" [2025-01-10 07:02:03,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:02:03,799 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2025-01-10 07:02:03,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:02:03,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620411879] [2025-01-10 07:02:03,803 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:02:03,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:02:03,844 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 07:02:03,846 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:02:03,846 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:03,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:02:03,847 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:02:03,848 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 07:02:03,848 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:02:03,848 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:03,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:02:03,857 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:02:03,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:02:03,859 INFO L85 PathProgramCache]: Analyzing trace with hash 35853, now seen corresponding path program 1 times [2025-01-10 07:02:03,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:02:03,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077335341] [2025-01-10 07:02:03,859 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:02:03,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:02:03,862 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:02:03,865 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:02:03,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:03,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:02:03,865 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:02:03,866 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:02:03,867 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:02:03,868 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:03,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:02:03,868 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:02:03,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:02:03,869 INFO L85 PathProgramCache]: Analyzing trace with hash 28694795, now seen corresponding path program 1 times [2025-01-10 07:02:03,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:02:03,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990494169] [2025-01-10 07:02:03,870 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:02:03,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:02:03,873 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 07:02:03,874 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 07:02:03,874 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:03,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:02:03,874 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:02:03,875 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 07:02:03,877 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 07:02:03,877 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:03,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:02:03,877 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:02:03,923 INFO L204 LassoAnalysis]: Preferences: [2025-01-10 07:02:03,924 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-01-10 07:02:03,924 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-01-10 07:02:03,924 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-01-10 07:02:03,924 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-01-10 07:02:03,924 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:02:03,924 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-01-10 07:02:03,924 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-01-10 07:02:03,924 INFO L132 ssoRankerPreferences]: Filename of dumped script: Ex06.c_Iteration1_Loop [2025-01-10 07:02:03,925 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-01-10 07:02:03,925 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-01-10 07:02:03,936 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:02:03,943 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:02:03,946 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:02:03,991 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-01-10 07:02:03,991 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-01-10 07:02:03,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:02:03,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:02:03,994 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:02:03,996 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2025-01-10 07:02:03,997 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-01-10 07:02:03,997 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 07:02:04,018 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-01-10 07:02:04,018 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-01-10 07:02:04,024 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2025-01-10 07:02:04,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:02:04,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:02:04,027 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:02:04,028 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-01-10 07:02:04,029 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-01-10 07:02:04,029 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 07:02:04,047 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-01-10 07:02:04,047 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-01-10 07:02:04,052 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2025-01-10 07:02:04,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:02:04,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:02:04,055 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:02:04,056 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-01-10 07:02:04,058 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-01-10 07:02:04,059 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 07:02:04,075 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2025-01-10 07:02:04,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:02:04,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:02:04,078 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:02:04,079 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-01-10 07:02:04,081 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-01-10 07:02:04,081 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 07:02:04,095 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-01-10 07:02:04,103 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2025-01-10 07:02:04,104 INFO L204 LassoAnalysis]: Preferences: [2025-01-10 07:02:04,104 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-01-10 07:02:04,104 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-01-10 07:02:04,104 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-01-10 07:02:04,104 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-01-10 07:02:04,104 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:02:04,104 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-01-10 07:02:04,104 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-01-10 07:02:04,104 INFO L132 ssoRankerPreferences]: Filename of dumped script: Ex06.c_Iteration1_Loop [2025-01-10 07:02:04,104 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-01-10 07:02:04,104 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-01-10 07:02:04,105 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:02:04,112 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:02:04,117 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:02:04,157 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-01-10 07:02:04,160 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-01-10 07:02:04,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:02:04,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:02:04,163 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:02:04,164 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-01-10 07:02:04,169 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-01-10 07:02:04,179 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:02:04,180 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:02:04,180 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:02:04,180 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:02:04,184 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:02:04,185 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:02:04,191 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:02:04,198 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2025-01-10 07:02:04,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:02:04,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:02:04,200 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:02:04,204 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-01-10 07:02:04,205 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-01-10 07:02:04,215 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:02:04,215 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:02:04,215 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:02:04,215 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:02:04,217 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:02:04,217 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:02:04,223 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:02:04,229 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2025-01-10 07:02:04,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:02:04,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:02:04,231 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:02:04,236 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-01-10 07:02:04,237 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-01-10 07:02:04,247 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:02:04,247 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:02:04,248 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:02:04,248 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:02:04,248 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:02:04,249 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:02:04,249 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:02:04,251 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-01-10 07:02:04,253 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-01-10 07:02:04,255 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-01-10 07:02:04,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:02:04,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:02:04,258 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:02:04,260 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-01-10 07:02:04,261 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-01-10 07:02:04,261 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-01-10 07:02:04,261 INFO L474 LassoAnalysis]: Proved termination. [2025-01-10 07:02:04,261 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-01-10 07:02:04,270 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2025-01-10 07:02:04,273 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-01-10 07:02:04,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:02:04,292 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 07:02:04,293 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:02:04,293 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:04,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:02:04,294 WARN L254 TraceCheckSpWp]: Trace formula consists of 4 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 07:02:04,294 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:02:04,301 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:02:04,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:02:04,302 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:04,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:02:04,303 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 07:02:04,303 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:02:04,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:02:04,370 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-01-10 07:02:04,374 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 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 4 states, 4 states have (on average 1.25) internal successors, (5), 4 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-01-10 07:02:04,401 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 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 4 states, 4 states have (on average 1.25) internal successors, (5), 4 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 20 states and 31 transitions. Complement of second has 5 states. [2025-01-10 07:02:04,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-01-10 07:02:04,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 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-01-10 07:02:04,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 8 transitions. [2025-01-10 07:02:04,409 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 2 letters. Loop has 3 letters. [2025-01-10 07:02:04,409 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:02:04,410 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 5 letters. Loop has 3 letters. [2025-01-10 07:02:04,410 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:02:04,410 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 2 letters. Loop has 6 letters. [2025-01-10 07:02:04,410 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:02:04,410 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 31 transitions. [2025-01-10 07:02:04,411 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2025-01-10 07:02:04,413 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 16 states and 23 transitions. [2025-01-10 07:02:04,413 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2025-01-10 07:02:04,413 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2025-01-10 07:02:04,413 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 23 transitions. [2025-01-10 07:02:04,414 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 07:02:04,414 INFO L218 hiAutomatonCegarLoop]: Abstraction has 16 states and 23 transitions. [2025-01-10 07:02:04,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 23 transitions. [2025-01-10 07:02:04,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 13. [2025-01-10 07:02:04,427 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-01-10 07:02:04,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 20 transitions. [2025-01-10 07:02:04,428 INFO L240 hiAutomatonCegarLoop]: Abstraction has 13 states and 20 transitions. [2025-01-10 07:02:04,428 INFO L432 stractBuchiCegarLoop]: Abstraction has 13 states and 20 transitions. [2025-01-10 07:02:04,428 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-01-10 07:02:04,428 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 20 transitions. [2025-01-10 07:02:04,429 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2025-01-10 07:02:04,429 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:02:04,429 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:02:04,429 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-01-10 07:02:04,429 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-01-10 07:02:04,429 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;havoc main_~i~0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;" "assume main_~i~0#1 >= -5 && main_~i~0#1 <= 5;" [2025-01-10 07:02:04,429 INFO L754 eck$LassoCheckResult]: Loop: "assume !(main_~i~0#1 > 0);" "assume !(main_~i~0#1 < 0);" "assume main_~i~0#1 >= -5 && main_~i~0#1 <= 5;" [2025-01-10 07:02:04,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:02:04,430 INFO L85 PathProgramCache]: Analyzing trace with hash 29859, now seen corresponding path program 1 times [2025-01-10 07:02:04,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:02:04,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645921667] [2025-01-10 07:02:04,430 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:02:04,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:02:04,432 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:02:04,433 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:02:04,433 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:04,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:02:04,433 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:02:04,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:02:04,434 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:02:04,434 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:04,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:02:04,435 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:02:04,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:02:04,435 INFO L85 PathProgramCache]: Analyzing trace with hash 40895, now seen corresponding path program 1 times [2025-01-10 07:02:04,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:02:04,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527763632] [2025-01-10 07:02:04,435 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:02:04,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:02:04,437 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:02:04,438 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:02:04,438 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:04,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:02:04,439 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:02:04,439 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:02:04,445 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:02:04,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:04,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:02:04,446 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:02:04,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:02:04,446 INFO L85 PathProgramCache]: Analyzing trace with hash 889540573, now seen corresponding path program 1 times [2025-01-10 07:02:04,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:02:04,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113422819] [2025-01-10 07:02:04,446 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:02:04,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:02:04,448 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 07:02:04,449 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 07:02:04,449 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:04,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:02:04,449 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:02:04,450 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 07:02:04,451 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 07:02:04,451 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:04,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:02:04,451 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:02:04,478 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:02:04,479 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:02:04,479 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:04,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:02:04,479 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:02:04,480 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:02:04,481 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:02:04,481 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:04,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:02:04,494 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.01 07:02:04 BoogieIcfgContainer [2025-01-10 07:02:04,494 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-01-10 07:02:04,495 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-10 07:02:04,495 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-10 07:02:04,495 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-10 07:02:04,495 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 07:02:03" (3/4) ... [2025-01-10 07:02:04,496 INFO L143 WitnessPrinter]: Generating witness for non-termination counterexample [2025-01-10 07:02:04,516 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-10 07:02:04,516 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-10 07:02:04,516 INFO L158 Benchmark]: Toolchain (without parser) took 1091.49ms. Allocated memory is still 142.6MB. Free memory was 114.1MB in the beginning and 44.0MB in the end (delta: 70.1MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. [2025-01-10 07:02:04,517 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 201.3MB. Free memory is still 123.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 07:02:04,517 INFO L158 Benchmark]: CACSL2BoogieTranslator took 128.82ms. Allocated memory is still 142.6MB. Free memory was 114.1MB in the beginning and 104.0MB in the end (delta: 10.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 07:02:04,517 INFO L158 Benchmark]: Boogie Procedure Inliner took 16.61ms. Allocated memory is still 142.6MB. Free memory was 104.0MB in the beginning and 103.1MB in the end (delta: 909.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 07:02:04,517 INFO L158 Benchmark]: Boogie Preprocessor took 14.07ms. Allocated memory is still 142.6MB. Free memory was 103.1MB in the beginning and 102.1MB in the end (delta: 919.7kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 07:02:04,517 INFO L158 Benchmark]: RCFGBuilder took 151.18ms. Allocated memory is still 142.6MB. Free memory was 102.1MB in the beginning and 93.4MB in the end (delta: 8.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 07:02:04,518 INFO L158 Benchmark]: BuchiAutomizer took 754.98ms. Allocated memory is still 142.6MB. Free memory was 93.4MB in the beginning and 46.8MB in the end (delta: 46.6MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2025-01-10 07:02:04,518 INFO L158 Benchmark]: Witness Printer took 21.36ms. Allocated memory is still 142.6MB. Free memory was 46.8MB in the beginning and 44.0MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 07:02:04,519 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 201.3MB. Free memory is still 123.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 128.82ms. Allocated memory is still 142.6MB. Free memory was 114.1MB in the beginning and 104.0MB in the end (delta: 10.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 16.61ms. Allocated memory is still 142.6MB. Free memory was 104.0MB in the beginning and 103.1MB in the end (delta: 909.1kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 14.07ms. Allocated memory is still 142.6MB. Free memory was 103.1MB in the beginning and 102.1MB in the end (delta: 919.7kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 151.18ms. Allocated memory is still 142.6MB. Free memory was 102.1MB in the beginning and 93.4MB in the end (delta: 8.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * BuchiAutomizer took 754.98ms. Allocated memory is still 142.6MB. Free memory was 93.4MB in the beginning and 46.8MB in the end (delta: 46.6MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. * Witness Printer took 21.36ms. Allocated memory is still 142.6MB. Free memory was 46.8MB in the beginning and 44.0MB in the end (delta: 2.8MB). 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 1 terminating modules (0 trivial, 1 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function i and consists of 3 locations. The remainder module has 13 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 0.7s and 2 iterations. TraceHistogramMax:1. Analysis of lassos took 0.5s. Construction of modules took 0.0s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 3. Minimization of det autom 0. Minimization of nondet autom 1. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 3 StatesRemovedByMinimization, 1 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 [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4 mSDsluCounter, 2 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 13 IncrementalHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 2 mSDtfsCounter, 13 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT1 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital13 mio100 ax192 hnf100 lsp51 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq146 hnf94 smp100 dnf100 smp100 tf111 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 30ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 2 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - LassoShapedNonTerminationArgument [Line: 10]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L6] int i; [L7] i = __VERIFIER_nondet_int() [L9] COND TRUE i >= -5 && i <= 5 VAL [i=0] Loop: [L10] COND FALSE !(i > 0) [L13] COND FALSE !(i < 0) [L9] COND TRUE i >= -5 && i <= 5 End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 10]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L6] int i; [L7] i = __VERIFIER_nondet_int() [L9] COND TRUE i >= -5 && i <= 5 VAL [i=0] Loop: [L10] COND FALSE !(i > 0) [L13] COND FALSE !(i < 0) [L9] COND TRUE i >= -5 && i <= 5 End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2025-01-10 07:02:04,530 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2025-01-10 07:02:04,731 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM)