./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-restricted-15/NO_04.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-restricted-15/NO_04.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 26441cee42562e2fd703b97b1a86d2baa847af9810285d31267fccda11d2ea67 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 15:36:08,962 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 15:36:09,012 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2025-03-04 15:36:09,017 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 15:36:09,018 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 15:36:09,018 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2025-03-04 15:36:09,038 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 15:36:09,039 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 15:36:09,039 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 15:36:09,040 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 15:36:09,040 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 15:36:09,040 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 15:36:09,040 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 15:36:09,040 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 15:36:09,041 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-03-04 15:36:09,041 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-03-04 15:36:09,041 INFO L153 SettingsManager]: * Use old map elimination=false [2025-03-04 15:36:09,041 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-03-04 15:36:09,041 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-03-04 15:36:09,041 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-03-04 15:36:09,041 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 15:36:09,041 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-03-04 15:36:09,041 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 15:36:09,041 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 15:36:09,042 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-03-04 15:36:09,042 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-03-04 15:36:09,042 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-03-04 15:36:09,042 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 15:36:09,042 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 15:36:09,042 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-03-04 15:36:09,042 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 15:36:09,042 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 15:36:09,042 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 15:36:09,042 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 15:36:09,042 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 15:36:09,042 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 15:36:09,043 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-03-04 15:36:09,043 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 -> 26441cee42562e2fd703b97b1a86d2baa847af9810285d31267fccda11d2ea67 [2025-03-04 15:36:09,244 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 15:36:09,251 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 15:36:09,253 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 15:36:09,254 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 15:36:09,254 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 15:36:09,256 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-restricted-15/NO_04.c [2025-03-04 15:36:10,398 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5431cd4a0/8154f16f72b84b7b99c50990f2463b74/FLAG0d3f9cad8 [2025-03-04 15:36:10,585 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 15:36:10,585 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-restricted-15/NO_04.c [2025-03-04 15:36:10,593 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5431cd4a0/8154f16f72b84b7b99c50990f2463b74/FLAG0d3f9cad8 [2025-03-04 15:36:10,968 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5431cd4a0/8154f16f72b84b7b99c50990f2463b74 [2025-03-04 15:36:10,970 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 15:36:10,971 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 15:36:10,972 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 15:36:10,972 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 15:36:10,975 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 15:36:10,975 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:36:10" (1/1) ... [2025-03-04 15:36:10,976 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52a12a52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:36:10, skipping insertion in model container [2025-03-04 15:36:10,976 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:36:10" (1/1) ... [2025-03-04 15:36:10,984 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 15:36:11,072 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:36:11,076 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 15:36:11,089 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:36:11,098 INFO L204 MainTranslator]: Completed translation [2025-03-04 15:36:11,099 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:36:11 WrapperNode [2025-03-04 15:36:11,099 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 15:36:11,100 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 15:36:11,100 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 15:36:11,100 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 15:36:11,104 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:36:11" (1/1) ... [2025-03-04 15:36:11,107 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:36:11" (1/1) ... [2025-03-04 15:36:11,118 INFO L138 Inliner]: procedures = 4, calls = 2, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 28 [2025-03-04 15:36:11,118 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 15:36:11,119 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 15:36:11,119 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 15:36:11,119 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 15:36:11,124 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:36:11" (1/1) ... [2025-03-04 15:36:11,124 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:36:11" (1/1) ... [2025-03-04 15:36:11,124 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:36:11" (1/1) ... [2025-03-04 15:36:11,129 INFO L175 MemorySlicer]: No memory access in input program. [2025-03-04 15:36:11,129 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:36:11" (1/1) ... [2025-03-04 15:36:11,129 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:36:11" (1/1) ... [2025-03-04 15:36:11,130 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:36:11" (1/1) ... [2025-03-04 15:36:11,130 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:36:11" (1/1) ... [2025-03-04 15:36:11,130 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:36:11" (1/1) ... [2025-03-04 15:36:11,131 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:36:11" (1/1) ... [2025-03-04 15:36:11,131 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 15:36:11,134 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 15:36:11,135 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 15:36:11,135 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 15:36:11,136 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:36:11" (1/1) ... [2025-03-04 15:36:11,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:11,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:11,163 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:36:11,170 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2025-03-04 15:36:11,189 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 15:36:11,190 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 15:36:11,235 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 15:36:11,237 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 15:36:11,294 INFO L? ?]: Removed 9 outVars from TransFormulas that were not future-live. [2025-03-04 15:36:11,295 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 15:36:11,300 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 15:36:11,300 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 15:36:11,300 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:36:11 BoogieIcfgContainer [2025-03-04 15:36:11,300 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 15:36:11,301 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-03-04 15:36:11,301 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-03-04 15:36:11,305 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-03-04 15:36:11,306 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-04 15:36:11,306 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 04.03 03:36:10" (1/3) ... [2025-03-04 15:36:11,306 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4cd0a714 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 04.03 03:36:11, skipping insertion in model container [2025-03-04 15:36:11,307 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-04 15:36:11,307 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:36:11" (2/3) ... [2025-03-04 15:36:11,307 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4cd0a714 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 04.03 03:36:11, skipping insertion in model container [2025-03-04 15:36:11,307 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-04 15:36:11,307 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:36:11" (3/3) ... [2025-03-04 15:36:11,308 INFO L363 chiAutomizerObserver]: Analyzing ICFG NO_04.c [2025-03-04 15:36:11,346 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-03-04 15:36:11,346 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-03-04 15:36:11,346 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-03-04 15:36:11,346 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-03-04 15:36:11,346 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-03-04 15:36:11,346 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-03-04 15:36:11,346 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-03-04 15:36:11,346 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-03-04 15:36:11,350 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 10 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 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-04 15:36:11,358 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-03-04 15:36:11,358 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:36:11,358 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:36:11,361 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-03-04 15:36:11,361 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-04 15:36:11,361 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-03-04 15:36:11,361 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 10 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 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-04 15:36:11,362 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-03-04 15:36:11,362 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:36:11,362 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:36:11,362 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-03-04 15:36:11,362 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-04 15:36:11,366 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_~i~0#1, main_~j~0#1, main_~k~0#1, main_~l~0#1, main_~m~0#1, main_~a~0#1, main_~b~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~l~0#1;havoc main_~m~0#1;havoc main_~a~0#1;havoc main_~b~0#1;main_~i~0#1 := 0;" [2025-03-04 15:36:11,367 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~i~0#1 < 100;main_~a~0#1 := 2 + main_~i~0#1;main_~j~0#1 := 0;" "assume !(main_~j~0#1 < main_~a~0#1);main_~i~0#1 := 1 + main_~i~0#1;" [2025-03-04 15:36:11,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:36:11,370 INFO L85 PathProgramCache]: Analyzing trace with hash 1376, now seen corresponding path program 1 times [2025-03-04 15:36:11,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:36:11,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197588265] [2025-03-04 15:36:11,378 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:36:11,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:36:11,427 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:36:11,429 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:36:11,429 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:11,429 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:36:11,429 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:36:11,434 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:36:11,435 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:36:11,435 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:11,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:36:11,445 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:36:11,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:36:11,448 INFO L85 PathProgramCache]: Analyzing trace with hash 1305, now seen corresponding path program 1 times [2025-03-04 15:36:11,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:36:11,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050151865] [2025-03-04 15:36:11,448 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:36:11,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:36:11,454 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:36:11,458 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:36:11,460 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:11,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:36:11,460 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:36:11,463 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:36:11,466 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:36:11,466 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:11,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:36:11,467 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:36:11,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:36:11,469 INFO L85 PathProgramCache]: Analyzing trace with hash 1322680, now seen corresponding path program 1 times [2025-03-04 15:36:11,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:36:11,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143399300] [2025-03-04 15:36:11,469 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:36:11,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:36:11,473 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 15:36:11,479 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 15:36:11,480 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:11,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:11,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:36:11,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:36:11,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143399300] [2025-03-04 15:36:11,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143399300] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:36:11,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:36:11,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:36:11,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696151502] [2025-03-04 15:36:11,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:36:11,608 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:36:11,609 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:36:11,609 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:36:11,609 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:36:11,609 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-04 15:36:11,609 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:11,609 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:36:11,609 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:36:11,609 INFO L132 ssoRankerPreferences]: Filename of dumped script: NO_04.c_Iteration1_Loop [2025-03-04 15:36:11,609 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:36:11,609 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:36:11,618 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:11,627 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:11,634 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:11,637 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:11,639 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:11,694 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:36:11,695 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-04 15:36:11,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:11,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:11,698 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-04 15:36:11,700 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-04 15:36:11,701 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:36:11,701 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:36:11,724 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 15:36:11,724 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-04 15:36:11,729 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-04 15:36:11,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:11,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:11,731 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-04 15:36:11,732 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-04 15:36:11,733 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:36:11,733 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:36:11,752 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 15:36:11,752 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-04 15:36:11,757 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2025-03-04 15:36:11,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:11,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:11,759 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-04 15:36:11,761 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-04 15:36:11,762 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:36:11,762 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:36:11,773 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 15:36:11,773 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~a~0#1=0} Honda state: {ULTIMATE.start_main_~a~0#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-04 15:36:11,778 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2025-03-04 15:36:11,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:11,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:11,782 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-04 15:36:11,783 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-04 15:36:11,784 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:36:11,786 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:36:11,798 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 15:36:11,798 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~j~0#1=0} Honda state: {ULTIMATE.start_main_~j~0#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-04 15:36:11,803 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-04 15:36:11,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:11,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:11,805 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-04 15:36:11,807 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-04 15:36:11,808 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:36:11,808 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:36:11,825 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-04 15:36:11,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:11,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:11,827 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:36:11,828 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-03-04 15:36:11,829 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-04 15:36:11,829 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:36:11,856 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-04 15:36:11,860 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2025-03-04 15:36:11,860 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:36:11,860 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:36:11,860 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:36:11,860 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:36:11,860 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 15:36:11,860 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:11,860 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:36:11,860 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:36:11,860 INFO L132 ssoRankerPreferences]: Filename of dumped script: NO_04.c_Iteration1_Loop [2025-03-04 15:36:11,860 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:36:11,860 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:36:11,861 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:11,865 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:11,868 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:11,875 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:11,877 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:11,912 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:36:11,915 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 15:36:11,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:11,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:11,917 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:36:11,920 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-03-04 15:36:11,920 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:36:11,931 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:36:11,931 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:36:11,932 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:36:11,932 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:36:11,937 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:36:11,937 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:36:11,946 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:36:11,952 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2025-03-04 15:36:11,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:11,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:11,955 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:36:11,956 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-03-04 15:36:11,959 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:36:11,970 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:36:11,970 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:36:11,970 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:36:11,970 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:36:11,972 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:36:11,972 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:36:11,976 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:36:11,983 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2025-03-04 15:36:11,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:11,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:11,985 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:36:11,986 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-03-04 15:36:11,987 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:36:11,997 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:36:11,997 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:36:11,998 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:36:11,998 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:36:11,998 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:36:11,999 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:36:11,999 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:36:12,001 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 15:36:12,003 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2025-03-04 15:36:12,006 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-03-04 15:36:12,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:12,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:12,010 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:36:12,011 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-03-04 15:36:12,012 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 15:36:12,012 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-04 15:36:12,012 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 15:36:12,013 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-04 15:36:12,018 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-04 15:36:12,021 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-04 15:36:12,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:36:12,043 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:36:12,044 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:36:12,045 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:12,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:12,046 INFO L256 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 15:36:12,046 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:36:12,053 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:36:12,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:36:12,055 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:12,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:12,055 WARN L254 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 15:36:12,056 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:36:12,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:36:12,097 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-03-04 15:36:12,099 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 10 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 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) Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:36:12,149 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 10 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 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). 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) Result 27 states and 46 transitions. Complement of second has 7 states. [2025-03-04 15:36:12,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-03-04 15:36:12,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:36:12,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 20 transitions. [2025-03-04 15:36:12,157 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 2 letters. Loop has 2 letters. [2025-03-04 15:36:12,158 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:36:12,158 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 4 letters. Loop has 2 letters. [2025-03-04 15:36:12,158 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:36:12,158 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 2 letters. Loop has 4 letters. [2025-03-04 15:36:12,158 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:36:12,158 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 46 transitions. [2025-03-04 15:36:12,159 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2025-03-04 15:36:12,161 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 23 states and 40 transitions. [2025-03-04 15:36:12,161 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2025-03-04 15:36:12,161 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2025-03-04 15:36:12,161 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 40 transitions. [2025-03-04 15:36:12,162 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:36:12,162 INFO L218 hiAutomatonCegarLoop]: Abstraction has 23 states and 40 transitions. [2025-03-04 15:36:12,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 40 transitions. [2025-03-04 15:36:12,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 16. [2025-03-04 15:36:12,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.6875) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:36:12,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 27 transitions. [2025-03-04 15:36:12,176 INFO L240 hiAutomatonCegarLoop]: Abstraction has 16 states and 27 transitions. [2025-03-04 15:36:12,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:36:12,179 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:36:12,179 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:36:12,180 INFO L87 Difference]: Start difference. First operand 16 states and 27 transitions. Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:36:12,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:36:12,207 INFO L93 Difference]: Finished difference Result 21 states and 36 transitions. [2025-03-04 15:36:12,207 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 36 transitions. [2025-03-04 15:36:12,208 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2025-03-04 15:36:12,208 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 12 states and 19 transitions. [2025-03-04 15:36:12,208 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2025-03-04 15:36:12,208 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2025-03-04 15:36:12,208 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 19 transitions. [2025-03-04 15:36:12,208 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-04 15:36:12,208 INFO L218 hiAutomatonCegarLoop]: Abstraction has 12 states and 19 transitions. [2025-03-04 15:36:12,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 19 transitions. [2025-03-04 15:36:12,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 8. [2025-03-04 15:36:12,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.5) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:36:12,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 12 transitions. [2025-03-04 15:36:12,209 INFO L240 hiAutomatonCegarLoop]: Abstraction has 8 states and 12 transitions. [2025-03-04 15:36:12,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:36:12,211 INFO L432 stractBuchiCegarLoop]: Abstraction has 8 states and 12 transitions. [2025-03-04 15:36:12,211 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-03-04 15:36:12,211 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 12 transitions. [2025-03-04 15:36:12,211 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2025-03-04 15:36:12,211 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:36:12,211 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:36:12,211 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-03-04 15:36:12,211 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-03-04 15:36:12,211 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_~i~0#1, main_~j~0#1, main_~k~0#1, main_~l~0#1, main_~m~0#1, main_~a~0#1, main_~b~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~l~0#1;havoc main_~m~0#1;havoc main_~a~0#1;havoc main_~b~0#1;main_~i~0#1 := 0;" [2025-03-04 15:36:12,212 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~i~0#1 < 100;main_~a~0#1 := 2 + main_~i~0#1;main_~j~0#1 := 0;" "assume main_~j~0#1 < main_~a~0#1;main_~k~0#1 := 3 + (main_~i~0#1 + main_~j~0#1);" "assume !(main_~k~0#1 >= 0);main_~j~0#1 := 1 + main_~j~0#1;" "assume !(main_~j~0#1 < main_~a~0#1);main_~i~0#1 := 1 + main_~i~0#1;" [2025-03-04 15:36:12,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:36:12,212 INFO L85 PathProgramCache]: Analyzing trace with hash 1376, now seen corresponding path program 2 times [2025-03-04 15:36:12,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:36:12,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725466836] [2025-03-04 15:36:12,212 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:36:12,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:36:12,215 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:36:12,215 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:36:12,215 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:36:12,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:36:12,215 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:36:12,216 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:36:12,216 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:36:12,216 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:12,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:36:12,217 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:36:12,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:36:12,217 INFO L85 PathProgramCache]: Analyzing trace with hash 1260959, now seen corresponding path program 1 times [2025-03-04 15:36:12,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:36:12,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378526181] [2025-03-04 15:36:12,217 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:36:12,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:36:12,219 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 15:36:12,222 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 15:36:12,222 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:12,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:12,248 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:36:12,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:36:12,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378526181] [2025-03-04 15:36:12,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378526181] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:36:12,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:36:12,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:36:12,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042609324] [2025-03-04 15:36:12,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:36:12,248 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-04 15:36:12,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:36:12,249 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:36:12,249 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:36:12,249 INFO L87 Difference]: Start difference. First operand 8 states and 12 transitions. cyclomatic complexity: 5 Second operand has 4 states, 4 states have (on average 1.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-04 15:36:12,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:36:12,284 INFO L93 Difference]: Finished difference Result 11 states and 17 transitions. [2025-03-04 15:36:12,284 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 17 transitions. [2025-03-04 15:36:12,284 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2025-03-04 15:36:12,285 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 11 states and 17 transitions. [2025-03-04 15:36:12,285 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2025-03-04 15:36:12,286 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2025-03-04 15:36:12,286 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 17 transitions. [2025-03-04 15:36:12,286 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-04 15:36:12,286 INFO L218 hiAutomatonCegarLoop]: Abstraction has 11 states and 17 transitions. [2025-03-04 15:36:12,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 17 transitions. [2025-03-04 15:36:12,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 9. [2025-03-04 15:36:12,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 8 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:36:12,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 13 transitions. [2025-03-04 15:36:12,287 INFO L240 hiAutomatonCegarLoop]: Abstraction has 9 states and 13 transitions. [2025-03-04 15:36:12,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:36:12,288 INFO L432 stractBuchiCegarLoop]: Abstraction has 9 states and 13 transitions. [2025-03-04 15:36:12,289 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-03-04 15:36:12,289 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 13 transitions. [2025-03-04 15:36:12,289 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2025-03-04 15:36:12,289 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:36:12,289 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:36:12,290 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-03-04 15:36:12,290 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2025-03-04 15:36:12,290 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_~i~0#1, main_~j~0#1, main_~k~0#1, main_~l~0#1, main_~m~0#1, main_~a~0#1, main_~b~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~l~0#1;havoc main_~m~0#1;havoc main_~a~0#1;havoc main_~b~0#1;main_~i~0#1 := 0;" [2025-03-04 15:36:12,291 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~i~0#1 < 100;main_~a~0#1 := 2 + main_~i~0#1;main_~j~0#1 := 0;" "assume main_~j~0#1 < main_~a~0#1;main_~k~0#1 := 3 + (main_~i~0#1 + main_~j~0#1);" "assume main_~k~0#1 >= 0;main_~b~0#1 := 4 + (main_~i~0#1 + main_~j~0#1 + main_~k~0#1);main_~l~0#1 := 0;" "assume !(main_~l~0#1 < main_~b~0#1);main_~k~0#1 := main_~k~0#1 - 1;" "assume !(main_~k~0#1 >= 0);main_~j~0#1 := 1 + main_~j~0#1;" "assume !(main_~j~0#1 < main_~a~0#1);main_~i~0#1 := 1 + main_~i~0#1;" [2025-03-04 15:36:12,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:36:12,291 INFO L85 PathProgramCache]: Analyzing trace with hash 1376, now seen corresponding path program 3 times [2025-03-04 15:36:12,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:36:12,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394187361] [2025-03-04 15:36:12,291 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 15:36:12,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:36:12,295 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:36:12,295 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:36:12,295 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 15:36:12,295 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:36:12,295 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:36:12,296 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:36:12,296 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:36:12,296 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:12,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:36:12,298 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:36:12,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:36:12,299 INFO L85 PathProgramCache]: Analyzing trace with hash 1211932603, now seen corresponding path program 1 times [2025-03-04 15:36:12,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:36:12,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868339261] [2025-03-04 15:36:12,299 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:36:12,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:36:12,302 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:36:12,309 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:36:12,309 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:12,309 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:12,351 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:36:12,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:36:12,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868339261] [2025-03-04 15:36:12,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868339261] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:36:12,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:36:12,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 15:36:12,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056578982] [2025-03-04 15:36:12,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:36:12,351 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-04 15:36:12,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:36:12,352 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:36:12,352 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:36:12,352 INFO L87 Difference]: Start difference. First operand 9 states and 13 transitions. cyclomatic complexity: 5 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-04 15:36:12,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:36:12,371 INFO L93 Difference]: Finished difference Result 10 states and 14 transitions. [2025-03-04 15:36:12,371 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10 states and 14 transitions. [2025-03-04 15:36:12,371 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2025-03-04 15:36:12,371 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10 states to 10 states and 14 transitions. [2025-03-04 15:36:12,371 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2025-03-04 15:36:12,372 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2025-03-04 15:36:12,372 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 14 transitions. [2025-03-04 15:36:12,372 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-04 15:36:12,372 INFO L218 hiAutomatonCegarLoop]: Abstraction has 10 states and 14 transitions. [2025-03-04 15:36:12,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 14 transitions. [2025-03-04 15:36:12,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2025-03-04 15:36:12,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.4) internal successors, (14), 9 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-04 15:36:12,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 14 transitions. [2025-03-04 15:36:12,372 INFO L240 hiAutomatonCegarLoop]: Abstraction has 10 states and 14 transitions. [2025-03-04 15:36:12,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:36:12,373 INFO L432 stractBuchiCegarLoop]: Abstraction has 10 states and 14 transitions. [2025-03-04 15:36:12,373 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-03-04 15:36:12,373 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 14 transitions. [2025-03-04 15:36:12,373 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2025-03-04 15:36:12,373 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:36:12,373 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:36:12,374 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-03-04 15:36:12,374 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:36:12,374 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_~i~0#1, main_~j~0#1, main_~k~0#1, main_~l~0#1, main_~m~0#1, main_~a~0#1, main_~b~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~l~0#1;havoc main_~m~0#1;havoc main_~a~0#1;havoc main_~b~0#1;main_~i~0#1 := 0;" [2025-03-04 15:36:12,374 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~i~0#1 < 100;main_~a~0#1 := 2 + main_~i~0#1;main_~j~0#1 := 0;" "assume main_~j~0#1 < main_~a~0#1;main_~k~0#1 := 3 + (main_~i~0#1 + main_~j~0#1);" "assume main_~k~0#1 >= 0;main_~b~0#1 := 4 + (main_~i~0#1 + main_~j~0#1 + main_~k~0#1);main_~l~0#1 := 0;" "assume main_~l~0#1 < main_~b~0#1;main_~m~0#1 := 1000 + (main_~i~0#1 + main_~j~0#1 + main_~k~0#1 + main_~l~0#1);" "assume !(main_~m~0#1 >= 0);main_~l~0#1 := 1 + main_~l~0#1;" "assume !(main_~l~0#1 < main_~b~0#1);main_~k~0#1 := main_~k~0#1 - 1;" "assume !(main_~k~0#1 >= 0);main_~j~0#1 := 1 + main_~j~0#1;" "assume !(main_~j~0#1 < main_~a~0#1);main_~i~0#1 := 1 + main_~i~0#1;" [2025-03-04 15:36:12,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:36:12,374 INFO L85 PathProgramCache]: Analyzing trace with hash 1376, now seen corresponding path program 4 times [2025-03-04 15:36:12,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:36:12,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494730659] [2025-03-04 15:36:12,374 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 15:36:12,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:36:12,377 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 2 statements into 2 equivalence classes. [2025-03-04 15:36:12,377 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:36:12,377 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 15:36:12,377 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:36:12,377 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:36:12,378 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:36:12,378 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:36:12,378 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:12,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:36:12,396 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:36:12,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:36:12,397 INFO L85 PathProgramCache]: Analyzing trace with hash 733926461, now seen corresponding path program 1 times [2025-03-04 15:36:12,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:36:12,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411959081] [2025-03-04 15:36:12,397 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:36:12,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:36:12,402 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 15:36:12,408 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-04 15:36:12,414 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 15:36:12,414 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:12,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:12,450 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:36:12,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:36:12,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411959081] [2025-03-04 15:36:12,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411959081] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:36:12,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:36:12,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 15:36:12,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752841019] [2025-03-04 15:36:12,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:36:12,451 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-04 15:36:12,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:36:12,451 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 15:36:12,451 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 15:36:12,451 INFO L87 Difference]: Start difference. First operand 10 states and 14 transitions. cyclomatic complexity: 5 Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:36:12,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:36:12,474 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2025-03-04 15:36:12,474 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 7 states and 7 transitions. [2025-03-04 15:36:12,475 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2025-03-04 15:36:12,475 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 7 states to 7 states and 7 transitions. [2025-03-04 15:36:12,475 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2025-03-04 15:36:12,475 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2025-03-04 15:36:12,475 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 7 transitions. [2025-03-04 15:36:12,475 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-04 15:36:12,475 INFO L218 hiAutomatonCegarLoop]: Abstraction has 7 states and 7 transitions. [2025-03-04 15:36:12,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states and 7 transitions. [2025-03-04 15:36:12,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2025-03-04 15:36:12,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.0) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:36:12,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2025-03-04 15:36:12,476 INFO L240 hiAutomatonCegarLoop]: Abstraction has 7 states and 7 transitions. [2025-03-04 15:36:12,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 15:36:12,477 INFO L432 stractBuchiCegarLoop]: Abstraction has 7 states and 7 transitions. [2025-03-04 15:36:12,477 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-03-04 15:36:12,477 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 7 transitions. [2025-03-04 15:36:12,477 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2025-03-04 15:36:12,478 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:36:12,478 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:36:12,478 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2025-03-04 15:36:12,478 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-03-04 15:36:12,478 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_~i~0#1, main_~j~0#1, main_~k~0#1, main_~l~0#1, main_~m~0#1, main_~a~0#1, main_~b~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~l~0#1;havoc main_~m~0#1;havoc main_~a~0#1;havoc main_~b~0#1;main_~i~0#1 := 0;" "assume main_~i~0#1 < 100;main_~a~0#1 := 2 + main_~i~0#1;main_~j~0#1 := 0;" "assume main_~j~0#1 < main_~a~0#1;main_~k~0#1 := 3 + (main_~i~0#1 + main_~j~0#1);" "assume main_~k~0#1 >= 0;main_~b~0#1 := 4 + (main_~i~0#1 + main_~j~0#1 + main_~k~0#1);main_~l~0#1 := 0;" "assume main_~l~0#1 < main_~b~0#1;main_~m~0#1 := 1000 + (main_~i~0#1 + main_~j~0#1 + main_~k~0#1 + main_~l~0#1);" [2025-03-04 15:36:12,478 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~m~0#1 >= 0;main_~m~0#1 := main_~m~0#1;" [2025-03-04 15:36:12,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:36:12,479 INFO L85 PathProgramCache]: Analyzing trace with hash 1271102494, now seen corresponding path program 1 times [2025-03-04 15:36:12,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:36:12,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741187471] [2025-03-04 15:36:12,479 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:36:12,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:36:12,481 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:36:12,485 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:36:12,485 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:12,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:36:12,485 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:36:12,488 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:36:12,492 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:36:12,492 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:12,492 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:36:12,493 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:36:12,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:36:12,494 INFO L85 PathProgramCache]: Analyzing trace with hash 38, now seen corresponding path program 1 times [2025-03-04 15:36:12,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:36:12,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031036062] [2025-03-04 15:36:12,494 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:36:12,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:36:12,497 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-04 15:36:12,499 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-04 15:36:12,499 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:12,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:36:12,499 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:36:12,500 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-04 15:36:12,501 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-04 15:36:12,501 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:12,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:36:12,501 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:36:12,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:36:12,502 INFO L85 PathProgramCache]: Analyzing trace with hash 749471657, now seen corresponding path program 1 times [2025-03-04 15:36:12,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:36:12,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481147783] [2025-03-04 15:36:12,502 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:36:12,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:36:12,504 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:36:12,506 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:36:12,506 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:12,506 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:36:12,506 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:36:12,509 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:36:12,511 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:36:12,511 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:12,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:36:12,512 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:36:12,608 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:36:12,610 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:36:12,610 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:12,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:36:12,610 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:36:12,613 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:36:12,616 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:36:12,616 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:12,616 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:36:12,641 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 04.03 03:36:12 BoogieIcfgContainer [2025-03-04 15:36:12,641 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-03-04 15:36:12,642 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 15:36:12,642 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 15:36:12,642 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 15:36:12,643 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:36:11" (3/4) ... [2025-03-04 15:36:12,644 INFO L143 WitnessPrinter]: Generating witness for non-termination counterexample [2025-03-04 15:36:12,675 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-04 15:36:12,676 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 15:36:12,676 INFO L158 Benchmark]: Toolchain (without parser) took 1705.21ms. Allocated memory is still 167.8MB. Free memory was 125.7MB in the beginning and 99.1MB in the end (delta: 26.5MB). Peak memory consumption was 22.2MB. Max. memory is 16.1GB. [2025-03-04 15:36:12,677 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 117.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 15:36:12,677 INFO L158 Benchmark]: CACSL2BoogieTranslator took 127.37ms. Allocated memory is still 167.8MB. Free memory was 125.7MB in the beginning and 115.4MB in the end (delta: 10.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 15:36:12,677 INFO L158 Benchmark]: Boogie Procedure Inliner took 18.82ms. Allocated memory is still 167.8MB. Free memory was 115.4MB in the beginning and 114.5MB in the end (delta: 847.5kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 15:36:12,677 INFO L158 Benchmark]: Boogie Preprocessor took 14.75ms. Allocated memory is still 167.8MB. Free memory was 114.5MB in the beginning and 113.6MB in the end (delta: 860.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 15:36:12,677 INFO L158 Benchmark]: IcfgBuilder took 165.75ms. Allocated memory is still 167.8MB. Free memory was 113.6MB in the beginning and 102.8MB in the end (delta: 10.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 15:36:12,678 INFO L158 Benchmark]: BuchiAutomizer took 1340.57ms. Allocated memory is still 167.8MB. Free memory was 102.8MB in the beginning and 102.6MB in the end (delta: 188.2kB). Peak memory consumption was 5.4MB. Max. memory is 16.1GB. [2025-03-04 15:36:12,679 INFO L158 Benchmark]: Witness Printer took 33.73ms. Allocated memory is still 167.8MB. Free memory was 102.6MB in the beginning and 99.1MB in the end (delta: 3.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 15:36:12,680 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.18ms. Allocated memory is still 201.3MB. Free memory is still 117.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 127.37ms. Allocated memory is still 167.8MB. Free memory was 125.7MB in the beginning and 115.4MB in the end (delta: 10.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 18.82ms. Allocated memory is still 167.8MB. Free memory was 115.4MB in the beginning and 114.5MB in the end (delta: 847.5kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 14.75ms. Allocated memory is still 167.8MB. Free memory was 114.5MB in the beginning and 113.6MB in the end (delta: 860.6kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 165.75ms. Allocated memory is still 167.8MB. Free memory was 113.6MB in the beginning and 102.8MB in the end (delta: 10.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * BuchiAutomizer took 1340.57ms. Allocated memory is still 167.8MB. Free memory was 102.8MB in the beginning and 102.6MB in the end (delta: 188.2kB). Peak memory consumption was 5.4MB. Max. memory is 16.1GB. * Witness Printer took 33.73ms. Allocated memory is still 167.8MB. Free memory was 102.6MB in the beginning and 99.1MB in the end (delta: 3.5MB). 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 5 terminating modules (4 trivial, 1 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function ((long) -1 * i) and consists of 4 locations. 4 modules have a trivial ranking function, the largest among these consists of 5 locations. The remainder module has 7 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.2s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 0.9s. Construction of modules took 0.0s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 3. Minimization of det autom 4. Minimization of nondet autom 1. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 13 StatesRemovedByMinimization, 3 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, 71 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 70 mSDsluCounter, 51 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 26 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 69 IncrementalHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 25 mSDtfsCounter, 69 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI3 SFLT0 conc0 concLT1 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital12 mio100 ax200 hnf100 lsp50 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq150 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: 4 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.1s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - LassoShapedNonTerminationArgument [Line: 25]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L6] int i; [L7] int j; [L8] int k; [L9] int l; [L10] int m; [L11] int a; [L12] int b; [L13] i = 0 VAL [i=0] [L15] COND TRUE i < 100 [L16] a = i+2 [L17] j = 0 VAL [a=2, i=0, j=0] [L18] COND TRUE j < a [L19] k = i+j+3 VAL [a=2, i=0, j=0, k=3] [L20] COND TRUE k >= 0 [L21] b = i+j+k+4 [L22] l = 0 VAL [a=2, b=7, i=0, j=0, k=3, l=0] [L23] COND TRUE l < b [L24] m = i+j+k+l+1000 VAL [a=2, b=7, i=0, j=0, k=3, l=0, m=1003] Loop: [L25] COND TRUE m >= 0 [L26] m = m-0 End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 25]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L6] int i; [L7] int j; [L8] int k; [L9] int l; [L10] int m; [L11] int a; [L12] int b; [L13] i = 0 VAL [i=0] [L15] COND TRUE i < 100 [L16] a = i+2 [L17] j = 0 VAL [a=2, i=0, j=0] [L18] COND TRUE j < a [L19] k = i+j+3 VAL [a=2, i=0, j=0, k=3] [L20] COND TRUE k >= 0 [L21] b = i+j+k+4 [L22] l = 0 VAL [a=2, b=7, i=0, j=0, k=3, l=0] [L23] COND TRUE l < b [L24] m = i+j+k+l+1000 VAL [a=2, b=7, i=0, j=0, k=3, l=0, m=1003] Loop: [L25] COND TRUE m >= 0 [L26] m = m-0 End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2025-03-04 15:36:12,691 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)