./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-restricted-15/UpAndDownIneq.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-restricted-15/UpAndDownIneq.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 7c4ca36c34c25cccb97ec2e65527d2a743b4e62b95f1f396c9f281ef44a01670 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 19:53:05,340 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 19:53:05,385 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2025-03-17 19:53:05,389 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 19:53:05,389 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 19:53:05,389 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2025-03-17 19:53:05,410 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 19:53:05,411 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 19:53:05,412 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 19:53:05,412 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 19:53:05,413 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 19:53:05,413 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 19:53:05,413 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 19:53:05,413 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 19:53:05,414 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-03-17 19:53:05,414 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-03-17 19:53:05,414 INFO L153 SettingsManager]: * Use old map elimination=false [2025-03-17 19:53:05,414 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-03-17 19:53:05,414 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-03-17 19:53:05,414 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-03-17 19:53:05,414 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 19:53:05,414 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-03-17 19:53:05,414 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 19:53:05,414 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 19:53:05,414 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-03-17 19:53:05,414 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-03-17 19:53:05,414 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-03-17 19:53:05,414 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 19:53:05,414 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 19:53:05,414 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-03-17 19:53:05,415 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 19:53:05,415 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 19:53:05,415 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 19:53:05,415 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 19:53:05,415 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 19:53:05,415 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 19:53:05,415 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-03-17 19:53:05,415 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 -> 7c4ca36c34c25cccb97ec2e65527d2a743b4e62b95f1f396c9f281ef44a01670 [2025-03-17 19:53:05,673 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 19:53:05,682 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 19:53:05,684 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 19:53:05,685 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 19:53:05,685 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 19:53:05,686 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-restricted-15/UpAndDownIneq.c [2025-03-17 19:53:06,885 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4af456e3a/7a08399ee2b54231a94f274a1f550f41/FLAGa516ef01e [2025-03-17 19:53:07,092 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 19:53:07,092 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-restricted-15/UpAndDownIneq.c [2025-03-17 19:53:07,107 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4af456e3a/7a08399ee2b54231a94f274a1f550f41/FLAGa516ef01e [2025-03-17 19:53:07,125 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4af456e3a/7a08399ee2b54231a94f274a1f550f41 [2025-03-17 19:53:07,127 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 19:53:07,129 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 19:53:07,130 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 19:53:07,131 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 19:53:07,134 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 19:53:07,134 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 07:53:07" (1/1) ... [2025-03-17 19:53:07,136 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d0c8dc7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:53:07, skipping insertion in model container [2025-03-17 19:53:07,136 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 07:53:07" (1/1) ... [2025-03-17 19:53:07,146 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 19:53:07,239 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 19:53:07,243 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 19:53:07,251 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 19:53:07,259 INFO L204 MainTranslator]: Completed translation [2025-03-17 19:53:07,260 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:53:07 WrapperNode [2025-03-17 19:53:07,261 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 19:53:07,261 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 19:53:07,261 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 19:53:07,261 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 19:53:07,266 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:53:07" (1/1) ... [2025-03-17 19:53:07,269 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:53:07" (1/1) ... [2025-03-17 19:53:07,278 INFO L138 Inliner]: procedures = 4, calls = 2, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 18 [2025-03-17 19:53:07,278 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 19:53:07,279 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 19:53:07,279 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 19:53:07,279 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 19:53:07,284 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:53:07" (1/1) ... [2025-03-17 19:53:07,284 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:53:07" (1/1) ... [2025-03-17 19:53:07,286 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:53:07" (1/1) ... [2025-03-17 19:53:07,289 INFO L175 MemorySlicer]: No memory access in input program. [2025-03-17 19:53:07,289 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:53:07" (1/1) ... [2025-03-17 19:53:07,289 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:53:07" (1/1) ... [2025-03-17 19:53:07,291 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:53:07" (1/1) ... [2025-03-17 19:53:07,292 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:53:07" (1/1) ... [2025-03-17 19:53:07,292 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:53:07" (1/1) ... [2025-03-17 19:53:07,293 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:53:07" (1/1) ... [2025-03-17 19:53:07,294 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 19:53:07,295 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 19:53:07,297 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 19:53:07,297 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 19:53:07,298 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:53:07" (1/1) ... [2025-03-17 19:53:07,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:53:07,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:53:07,327 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:53:07,330 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2025-03-17 19:53:07,347 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 19:53:07,347 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 19:53:07,392 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 19:53:07,393 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 19:53:07,453 INFO L? ?]: Removed 2 outVars from TransFormulas that were not future-live. [2025-03-17 19:53:07,454 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 19:53:07,460 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 19:53:07,460 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 19:53:07,461 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 07:53:07 BoogieIcfgContainer [2025-03-17 19:53:07,461 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 19:53:07,461 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-03-17 19:53:07,462 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-03-17 19:53:07,465 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-03-17 19:53:07,466 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-17 19:53:07,466 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 17.03 07:53:07" (1/3) ... [2025-03-17 19:53:07,467 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6368548b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.03 07:53:07, skipping insertion in model container [2025-03-17 19:53:07,468 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-17 19:53:07,468 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:53:07" (2/3) ... [2025-03-17 19:53:07,469 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6368548b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.03 07:53:07, skipping insertion in model container [2025-03-17 19:53:07,469 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-17 19:53:07,469 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 07:53:07" (3/3) ... [2025-03-17 19:53:07,470 INFO L363 chiAutomizerObserver]: Analyzing ICFG UpAndDownIneq.c [2025-03-17 19:53:07,510 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-03-17 19:53:07,510 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-03-17 19:53:07,510 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-03-17 19:53:07,510 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-03-17 19:53:07,511 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-03-17 19:53:07,511 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-03-17 19:53:07,511 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-03-17 19:53:07,512 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-03-17 19:53:07,515 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:53:07,525 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2025-03-17 19:53:07,526 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:53:07,526 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:53:07,529 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-03-17 19:53:07,530 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-03-17 19:53:07,530 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-03-17 19:53:07,530 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:53:07,531 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2025-03-17 19:53:07,531 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:53:07,531 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:53:07,531 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-03-17 19:53:07,531 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-03-17 19:53:07,536 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0;" [2025-03-17 19:53:07,537 INFO L754 eck$LassoCheckResult]: Loop: "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume main_~i~0#1 >= 10;main_~up~0#1 := 0;" "assume main_~i~0#1 <= 0;main_~up~0#1 := 1;" "assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1;" [2025-03-17 19:53:07,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:53:07,542 INFO L85 PathProgramCache]: Analyzing trace with hash 39, now seen corresponding path program 1 times [2025-03-17 19:53:07,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:53:07,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455252243] [2025-03-17 19:53:07,548 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:53:07,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:53:07,600 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-17 19:53:07,602 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-17 19:53:07,603 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:53:07,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:53:07,604 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:53:07,606 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-17 19:53:07,607 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-17 19:53:07,607 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:53:07,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:53:07,617 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:53:07,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:53:07,621 INFO L85 PathProgramCache]: Analyzing trace with hash 1136957, now seen corresponding path program 1 times [2025-03-17 19:53:07,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:53:07,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589398655] [2025-03-17 19:53:07,622 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:53:07,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:53:07,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 19:53:07,631 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 19:53:07,632 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:53:07,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:53:07,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:53:07,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:53:07,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589398655] [2025-03-17 19:53:07,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589398655] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:53:07,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:53:07,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 19:53:07,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649141531] [2025-03-17 19:53:07,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:53:07,699 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-17 19:53:07,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:53:07,718 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 19:53:07,719 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 19:53:07,720 INFO L87 Difference]: Start difference. First operand has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:53:07,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:53:07,756 INFO L93 Difference]: Finished difference Result 11 states and 16 transitions. [2025-03-17 19:53:07,757 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 16 transitions. [2025-03-17 19:53:07,757 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2025-03-17 19:53:07,761 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 9 states and 13 transitions. [2025-03-17 19:53:07,762 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2025-03-17 19:53:07,762 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2025-03-17 19:53:07,762 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 13 transitions. [2025-03-17 19:53:07,762 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-17 19:53:07,763 INFO L218 hiAutomatonCegarLoop]: Abstraction has 9 states and 13 transitions. [2025-03-17 19:53:07,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 13 transitions. [2025-03-17 19:53:07,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2025-03-17 19:53:07,777 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-17 19:53:07,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 13 transitions. [2025-03-17 19:53:07,778 INFO L240 hiAutomatonCegarLoop]: Abstraction has 9 states and 13 transitions. [2025-03-17 19:53:07,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 19:53:07,781 INFO L432 stractBuchiCegarLoop]: Abstraction has 9 states and 13 transitions. [2025-03-17 19:53:07,781 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-03-17 19:53:07,781 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 13 transitions. [2025-03-17 19:53:07,781 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2025-03-17 19:53:07,781 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:53:07,782 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:53:07,782 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-03-17 19:53:07,782 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-03-17 19:53:07,782 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0;" [2025-03-17 19:53:07,782 INFO L754 eck$LassoCheckResult]: Loop: "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume main_~i~0#1 >= 10;main_~up~0#1 := 0;" "assume !(main_~i~0#1 <= 0);" "assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1;" [2025-03-17 19:53:07,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:53:07,783 INFO L85 PathProgramCache]: Analyzing trace with hash 39, now seen corresponding path program 2 times [2025-03-17 19:53:07,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:53:07,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425818994] [2025-03-17 19:53:07,783 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:53:07,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:53:07,786 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1 statements into 1 equivalence classes. [2025-03-17 19:53:07,787 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-17 19:53:07,787 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 19:53:07,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:53:07,787 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:53:07,788 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-17 19:53:07,788 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-17 19:53:07,788 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:53:07,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:53:07,789 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:53:07,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:53:07,789 INFO L85 PathProgramCache]: Analyzing trace with hash 1136989, now seen corresponding path program 1 times [2025-03-17 19:53:07,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:53:07,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782619691] [2025-03-17 19:53:07,789 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:53:07,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:53:07,793 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 19:53:07,797 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 19:53:07,797 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:53:07,798 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:53:07,798 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:53:07,800 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 19:53:07,801 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 19:53:07,801 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:53:07,801 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:53:07,804 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:53:07,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:53:07,805 INFO L85 PathProgramCache]: Analyzing trace with hash 36230787, now seen corresponding path program 1 times [2025-03-17 19:53:07,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:53:07,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108274420] [2025-03-17 19:53:07,805 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:53:07,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:53:07,810 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 19:53:07,814 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 19:53:07,814 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:53:07,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:53:07,814 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:53:07,815 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 19:53:07,817 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 19:53:07,818 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:53:07,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:53:07,818 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:53:07,874 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 19:53:07,874 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 19:53:07,874 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 19:53:07,875 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 19:53:07,875 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-17 19:53:07,875 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:53:07,875 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 19:53:07,875 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 19:53:07,875 INFO L132 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq.c_Iteration2_Loop [2025-03-17 19:53:07,875 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 19:53:07,875 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 19:53:07,884 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:53:07,891 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:53:07,893 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:53:07,897 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:53:07,963 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 19:53:07,964 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-17 19:53:07,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:53:07,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:53:07,968 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:53:07,969 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2025-03-17 19:53:07,970 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 19:53:07,970 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:53:07,984 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 19:53:07,984 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~up~0#1=0} Honda state: {ULTIMATE.start_main_~up~0#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-17 19:53:07,989 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2025-03-17 19:53:07,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:53:07,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:53:07,992 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:53:07,992 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-03-17 19:53:07,997 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 19:53:07,997 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:53:08,017 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 19:53:08,017 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_1=1} Honda state: {v_rep~unnamed0~0~true_1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-17 19:53:08,024 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-17 19:53:08,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:53:08,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:53:08,027 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:53:08,029 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-03-17 19:53:08,031 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 19:53:08,031 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:53:08,049 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 19:53:08,050 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_1=0} Honda state: {v_rep~unnamed0~0~false_1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-17 19:53:08,055 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2025-03-17 19:53:08,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:53:08,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:53:08,057 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:53:08,058 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-03-17 19:53:08,059 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 19:53:08,059 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:53:08,076 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2025-03-17 19:53:08,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:53:08,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:53:08,079 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:53:08,080 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-03-17 19:53:08,081 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-17 19:53:08,081 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:53:08,096 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-17 19:53:08,102 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2025-03-17 19:53:08,102 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 19:53:08,102 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 19:53:08,102 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 19:53:08,102 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 19:53:08,102 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 19:53:08,102 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:53:08,102 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 19:53:08,102 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 19:53:08,102 INFO L132 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq.c_Iteration2_Loop [2025-03-17 19:53:08,102 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 19:53:08,102 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 19:53:08,104 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:53:08,108 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:53:08,111 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:53:08,116 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:53:08,155 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 19:53:08,157 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 19:53:08,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:53:08,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:53:08,161 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:53:08,162 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-03-17 19:53:08,163 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:53:08,173 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:53:08,174 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:53:08,174 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:53:08,174 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:53:08,179 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:53:08,179 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:53:08,183 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:53:08,189 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-17 19:53:08,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:53:08,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:53:08,191 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:53:08,193 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-03-17 19:53:08,194 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:53:08,204 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:53:08,204 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:53:08,204 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:53:08,204 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:53:08,206 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:53:08,206 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:53:08,209 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:53:08,215 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2025-03-17 19:53:08,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:53:08,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:53:08,217 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:53:08,219 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-03-17 19:53:08,220 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:53:08,230 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:53:08,230 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:53:08,230 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:53:08,230 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:53:08,230 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:53:08,231 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:53:08,231 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:53:08,233 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-17 19:53:08,236 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-17 19:53:08,238 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-03-17 19:53:08,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:53:08,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:53:08,243 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:53:08,245 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-03-17 19:53:08,245 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-17 19:53:08,246 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-17 19:53:08,246 INFO L474 LassoAnalysis]: Proved termination. [2025-03-17 19:53:08,246 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = 1*ULTIMATE.start_main_~i~0#1 Supporting invariants [] [2025-03-17 19:53:08,252 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2025-03-17 19:53:08,254 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-17 19:53:08,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:53:08,274 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-17 19:53:08,275 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-17 19:53:08,275 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:53:08,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:53:08,275 WARN L254 TraceCheckSpWp]: Trace formula consists of 4 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 19:53:08,276 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:53:08,281 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 19:53:08,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 19:53:08,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:53:08,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:53:08,283 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 19:53:08,283 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:53:08,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:53:08,303 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-03-17 19:53:08,304 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 9 states and 13 transitions. cyclomatic complexity: 5 Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:53:08,345 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 9 states and 13 transitions. cyclomatic complexity: 5. Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 24 states and 36 transitions. Complement of second has 7 states. [2025-03-17 19:53:08,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-03-17 19:53:08,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:53:08,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2025-03-17 19:53:08,352 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 1 letters. Loop has 4 letters. [2025-03-17 19:53:08,352 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:53:08,352 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 5 letters. Loop has 4 letters. [2025-03-17 19:53:08,353 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:53:08,353 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 1 letters. Loop has 8 letters. [2025-03-17 19:53:08,353 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:53:08,353 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 36 transitions. [2025-03-17 19:53:08,355 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2025-03-17 19:53:08,356 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 24 states and 36 transitions. [2025-03-17 19:53:08,356 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2025-03-17 19:53:08,356 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2025-03-17 19:53:08,356 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 36 transitions. [2025-03-17 19:53:08,357 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:53:08,357 INFO L218 hiAutomatonCegarLoop]: Abstraction has 24 states and 36 transitions. [2025-03-17 19:53:08,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 36 transitions. [2025-03-17 19:53:08,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2025-03-17 19:53:08,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.4782608695652173) internal successors, (34), 22 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:53:08,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 34 transitions. [2025-03-17 19:53:08,359 INFO L240 hiAutomatonCegarLoop]: Abstraction has 23 states and 34 transitions. [2025-03-17 19:53:08,359 INFO L432 stractBuchiCegarLoop]: Abstraction has 23 states and 34 transitions. [2025-03-17 19:53:08,359 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-03-17 19:53:08,359 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 34 transitions. [2025-03-17 19:53:08,360 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2025-03-17 19:53:08,361 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:53:08,361 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:53:08,361 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-03-17 19:53:08,361 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-03-17 19:53:08,361 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" [2025-03-17 19:53:08,361 INFO L754 eck$LassoCheckResult]: Loop: "assume !(main_~i~0#1 >= 10);" "assume main_~i~0#1 <= 0;main_~up~0#1 := 1;" "assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" [2025-03-17 19:53:08,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:53:08,362 INFO L85 PathProgramCache]: Analyzing trace with hash 1216, now seen corresponding path program 1 times [2025-03-17 19:53:08,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:53:08,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234651069] [2025-03-17 19:53:08,362 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:53:08,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:53:08,364 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 19:53:08,365 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 19:53:08,365 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:53:08,365 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:53:08,365 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:53:08,366 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 19:53:08,366 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 19:53:08,366 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:53:08,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:53:08,367 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:53:08,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:53:08,367 INFO L85 PathProgramCache]: Analyzing trace with hash 1105219, now seen corresponding path program 1 times [2025-03-17 19:53:08,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:53:08,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981334662] [2025-03-17 19:53:08,368 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:53:08,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:53:08,390 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 19:53:08,391 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 19:53:08,392 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:53:08,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:53:08,398 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2025-03-17 19:53:08,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:53:08,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:53:08,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981334662] [2025-03-17 19:53:08,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981334662] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:53:08,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:53:08,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 19:53:08,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210516514] [2025-03-17 19:53:08,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:53:08,409 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-17 19:53:08,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:53:08,409 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 19:53:08,409 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 19:53:08,409 INFO L87 Difference]: Start difference. First operand 23 states and 34 transitions. cyclomatic complexity: 14 Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:53:08,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:53:08,421 INFO L93 Difference]: Finished difference Result 29 states and 41 transitions. [2025-03-17 19:53:08,421 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 41 transitions. [2025-03-17 19:53:08,421 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 16 [2025-03-17 19:53:08,422 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 28 states and 40 transitions. [2025-03-17 19:53:08,422 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2025-03-17 19:53:08,422 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2025-03-17 19:53:08,422 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 40 transitions. [2025-03-17 19:53:08,422 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:53:08,422 INFO L218 hiAutomatonCegarLoop]: Abstraction has 28 states and 40 transitions. [2025-03-17 19:53:08,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 40 transitions. [2025-03-17 19:53:08,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2025-03-17 19:53:08,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 1.4444444444444444) internal successors, (39), 26 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:53:08,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 39 transitions. [2025-03-17 19:53:08,426 INFO L240 hiAutomatonCegarLoop]: Abstraction has 27 states and 39 transitions. [2025-03-17 19:53:08,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 19:53:08,427 INFO L432 stractBuchiCegarLoop]: Abstraction has 27 states and 39 transitions. [2025-03-17 19:53:08,427 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-03-17 19:53:08,427 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 39 transitions. [2025-03-17 19:53:08,427 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 16 [2025-03-17 19:53:08,427 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:53:08,427 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:53:08,428 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-03-17 19:53:08,428 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-03-17 19:53:08,428 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" [2025-03-17 19:53:08,428 INFO L754 eck$LassoCheckResult]: Loop: "assume !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" "assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" [2025-03-17 19:53:08,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:53:08,428 INFO L85 PathProgramCache]: Analyzing trace with hash 1216, now seen corresponding path program 2 times [2025-03-17 19:53:08,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:53:08,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754841354] [2025-03-17 19:53:08,428 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:53:08,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:53:08,430 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-03-17 19:53:08,431 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 19:53:08,431 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 19:53:08,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:53:08,431 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:53:08,432 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 19:53:08,432 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 19:53:08,432 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:53:08,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:53:08,433 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:53:08,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:53:08,433 INFO L85 PathProgramCache]: Analyzing trace with hash 1106180, now seen corresponding path program 1 times [2025-03-17 19:53:08,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:53:08,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066499027] [2025-03-17 19:53:08,433 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:53:08,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:53:08,435 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 19:53:08,436 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 19:53:08,436 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:53:08,436 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:53:08,436 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:53:08,437 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 19:53:08,437 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 19:53:08,438 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:53:08,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:53:08,438 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:53:08,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:53:08,438 INFO L85 PathProgramCache]: Analyzing trace with hash 1123184195, now seen corresponding path program 1 times [2025-03-17 19:53:08,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:53:08,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222421334] [2025-03-17 19:53:08,439 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:53:08,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:53:08,442 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 19:53:08,444 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 19:53:08,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:53:08,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:53:08,445 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:53:08,446 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 19:53:08,449 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 19:53:08,449 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:53:08,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:53:08,450 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:53:08,485 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 19:53:08,485 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 19:53:08,485 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 19:53:08,485 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 19:53:08,485 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-17 19:53:08,485 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:53:08,486 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 19:53:08,486 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 19:53:08,486 INFO L132 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq.c_Iteration4_Loop [2025-03-17 19:53:08,486 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 19:53:08,486 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 19:53:08,487 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:53:08,492 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:53:08,502 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:53:08,505 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:53:08,541 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 19:53:08,541 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-17 19:53:08,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:53:08,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:53:08,543 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:53:08,545 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-03-17 19:53:08,547 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 19:53:08,547 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:53:08,565 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 19:53:08,565 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_3=0} Honda state: {v_rep~unnamed0~0~false_3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-17 19:53:08,571 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2025-03-17 19:53:08,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:53:08,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:53:08,573 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:53:08,574 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2025-03-17 19:53:08,576 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 19:53:08,576 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:53:08,593 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2025-03-17 19:53:08,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:53:08,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:53:08,596 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:53:08,596 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2025-03-17 19:53:08,599 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-17 19:53:08,599 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:53:08,630 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-17 19:53:08,635 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2025-03-17 19:53:08,635 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 19:53:08,635 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 19:53:08,635 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 19:53:08,635 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 19:53:08,635 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 19:53:08,635 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:53:08,635 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 19:53:08,635 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 19:53:08,635 INFO L132 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq.c_Iteration4_Loop [2025-03-17 19:53:08,635 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 19:53:08,635 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 19:53:08,636 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:53:08,640 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:53:08,647 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:53:08,652 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:53:08,686 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 19:53:08,686 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 19:53:08,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:53:08,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:53:08,688 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:53:08,689 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2025-03-17 19:53:08,690 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:53:08,700 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:53:08,701 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:53:08,701 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:53:08,701 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:53:08,703 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:53:08,703 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:53:08,706 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:53:08,712 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2025-03-17 19:53:08,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:53:08,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:53:08,714 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:53:08,716 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2025-03-17 19:53:08,717 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:53:08,727 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:53:08,727 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:53:08,727 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:53:08,727 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:53:08,727 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:53:08,728 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:53:08,728 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:53:08,730 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-17 19:53:08,732 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2025-03-17 19:53:08,732 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-03-17 19:53:08,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:53:08,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:53:08,734 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:53:08,736 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2025-03-17 19:53:08,737 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-17 19:53:08,737 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-17 19:53:08,737 INFO L474 LassoAnalysis]: Proved termination. [2025-03-17 19:53:08,737 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = 1*ULTIMATE.start_main_~i~0#1 Supporting invariants [] [2025-03-17 19:53:08,742 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2025-03-17 19:53:08,743 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-17 19:53:08,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:53:08,755 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 19:53:08,756 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 19:53:08,756 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:53:08,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:53:08,756 INFO L256 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 19:53:08,756 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:53:08,760 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 19:53:08,761 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 19:53:08,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:53:08,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:53:08,761 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 19:53:08,761 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:53:08,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:53:08,795 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2025-03-17 19:53:08,795 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 39 transitions. cyclomatic complexity: 15 Second operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:53:08,818 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 39 transitions. cyclomatic complexity: 15. Second operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 45 states and 68 transitions. Complement of second has 7 states. [2025-03-17 19:53:08,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-03-17 19:53:08,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:53:08,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2025-03-17 19:53:08,820 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 2 letters. Loop has 4 letters. [2025-03-17 19:53:08,820 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:53:08,820 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 6 letters. Loop has 4 letters. [2025-03-17 19:53:08,820 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:53:08,820 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 2 letters. Loop has 8 letters. [2025-03-17 19:53:08,820 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:53:08,820 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 68 transitions. [2025-03-17 19:53:08,821 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2025-03-17 19:53:08,822 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 37 states and 55 transitions. [2025-03-17 19:53:08,822 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2025-03-17 19:53:08,822 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2025-03-17 19:53:08,822 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 55 transitions. [2025-03-17 19:53:08,822 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:53:08,822 INFO L218 hiAutomatonCegarLoop]: Abstraction has 37 states and 55 transitions. [2025-03-17 19:53:08,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 55 transitions. [2025-03-17 19:53:08,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 30. [2025-03-17 19:53:08,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 29 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:53:08,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 44 transitions. [2025-03-17 19:53:08,826 INFO L240 hiAutomatonCegarLoop]: Abstraction has 30 states and 44 transitions. [2025-03-17 19:53:08,826 INFO L432 stractBuchiCegarLoop]: Abstraction has 30 states and 44 transitions. [2025-03-17 19:53:08,826 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-03-17 19:53:08,826 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 44 transitions. [2025-03-17 19:53:08,827 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2025-03-17 19:53:08,827 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:53:08,827 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:53:08,827 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-03-17 19:53:08,827 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-03-17 19:53:08,827 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" [2025-03-17 19:53:08,827 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~i~0#1 <= 0;main_~up~0#1 := 1;" "assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" [2025-03-17 19:53:08,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:53:08,827 INFO L85 PathProgramCache]: Analyzing trace with hash 37702, now seen corresponding path program 1 times [2025-03-17 19:53:08,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:53:08,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670638166] [2025-03-17 19:53:08,827 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:53:08,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:53:08,829 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 19:53:08,830 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 19:53:08,830 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:53:08,830 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:53:08,830 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:53:08,830 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 19:53:08,831 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 19:53:08,831 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:53:08,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:53:08,831 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:53:08,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:53:08,832 INFO L85 PathProgramCache]: Analyzing trace with hash 1014078, now seen corresponding path program 1 times [2025-03-17 19:53:08,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:53:08,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908799717] [2025-03-17 19:53:08,832 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:53:08,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:53:08,833 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 19:53:08,834 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 19:53:08,834 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:53:08,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:53:08,834 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:53:08,835 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 19:53:08,836 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 19:53:08,836 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:53:08,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:53:08,836 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:53:08,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:53:08,836 INFO L85 PathProgramCache]: Analyzing trace with hash 458940931, now seen corresponding path program 1 times [2025-03-17 19:53:08,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:53:08,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213807380] [2025-03-17 19:53:08,837 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:53:08,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:53:08,838 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-17 19:53:08,839 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 19:53:08,839 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:53:08,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:53:08,839 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:53:08,840 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-17 19:53:08,841 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 19:53:08,841 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:53:08,841 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:53:08,842 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:53:08,868 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 19:53:08,868 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 19:53:08,868 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 19:53:08,868 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 19:53:08,868 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-17 19:53:08,868 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:53:08,868 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 19:53:08,868 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 19:53:08,868 INFO L132 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq.c_Iteration5_Loop [2025-03-17 19:53:08,868 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 19:53:08,868 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 19:53:08,869 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:53:08,875 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:53:08,877 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:53:08,879 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:53:08,911 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 19:53:08,911 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-17 19:53:08,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:53:08,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:53:08,913 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:53:08,915 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2025-03-17 19:53:08,916 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 19:53:08,916 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:53:08,936 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2025-03-17 19:53:08,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:53:08,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:53:08,938 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:53:08,940 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2025-03-17 19:53:08,941 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-17 19:53:08,941 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:53:08,963 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-17 19:53:08,967 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2025-03-17 19:53:08,967 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 19:53:08,967 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 19:53:08,967 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 19:53:08,967 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 19:53:08,967 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 19:53:08,967 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:53:08,967 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 19:53:08,967 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 19:53:08,967 INFO L132 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq.c_Iteration5_Loop [2025-03-17 19:53:08,967 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 19:53:08,967 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 19:53:08,969 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:53:08,974 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:53:08,977 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:53:08,979 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:53:09,011 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 19:53:09,011 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 19:53:09,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:53:09,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:53:09,013 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:53:09,014 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2025-03-17 19:53:09,015 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:53:09,025 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:53:09,025 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:53:09,025 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:53:09,025 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:53:09,025 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:53:09,026 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:53:09,026 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:53:09,027 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-17 19:53:09,029 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-17 19:53:09,029 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-03-17 19:53:09,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:53:09,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:53:09,031 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:53:09,033 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2025-03-17 19:53:09,033 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-17 19:53:09,034 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-17 19:53:09,034 INFO L474 LassoAnalysis]: Proved termination. [2025-03-17 19:53:09,034 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = -2*ULTIMATE.start_main_~i~0#1 + 1 Supporting invariants [] [2025-03-17 19:53:09,040 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2025-03-17 19:53:09,041 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-17 19:53:09,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:53:09,060 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 19:53:09,061 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 19:53:09,061 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:53:09,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:53:09,061 INFO L256 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 19:53:09,061 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:53:09,067 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 19:53:09,068 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 19:53:09,068 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:53:09,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:53:09,069 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 19:53:09,069 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:53:09,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:53:09,099 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2025-03-17 19:53:09,099 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 30 states and 44 transitions. cyclomatic complexity: 17 Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 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-17 19:53:09,120 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 30 states and 44 transitions. cyclomatic complexity: 17. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 76 states and 108 transitions. Complement of second has 7 states. [2025-03-17 19:53:09,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-03-17 19:53:09,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 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-17 19:53:09,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 17 transitions. [2025-03-17 19:53:09,121 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 3 letters. Loop has 4 letters. [2025-03-17 19:53:09,121 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:53:09,122 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 7 letters. Loop has 4 letters. [2025-03-17 19:53:09,122 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:53:09,122 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 3 letters. Loop has 8 letters. [2025-03-17 19:53:09,122 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:53:09,122 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 76 states and 108 transitions. [2025-03-17 19:53:09,123 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 26 [2025-03-17 19:53:09,124 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 76 states to 68 states and 98 transitions. [2025-03-17 19:53:09,124 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 39 [2025-03-17 19:53:09,124 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2025-03-17 19:53:09,124 INFO L73 IsDeterministic]: Start isDeterministic. Operand 68 states and 98 transitions. [2025-03-17 19:53:09,124 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:53:09,124 INFO L218 hiAutomatonCegarLoop]: Abstraction has 68 states and 98 transitions. [2025-03-17 19:53:09,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states and 98 transitions. [2025-03-17 19:53:09,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 56. [2025-03-17 19:53:09,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 56 states have (on average 1.5) internal successors, (84), 55 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:53:09,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 84 transitions. [2025-03-17 19:53:09,126 INFO L240 hiAutomatonCegarLoop]: Abstraction has 56 states and 84 transitions. [2025-03-17 19:53:09,126 INFO L432 stractBuchiCegarLoop]: Abstraction has 56 states and 84 transitions. [2025-03-17 19:53:09,127 INFO L338 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-03-17 19:53:09,127 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 56 states and 84 transitions. [2025-03-17 19:53:09,127 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 22 [2025-03-17 19:53:09,127 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:53:09,127 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:53:09,127 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-03-17 19:53:09,127 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-03-17 19:53:09,127 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" [2025-03-17 19:53:09,127 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" [2025-03-17 19:53:09,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:53:09,128 INFO L85 PathProgramCache]: Analyzing trace with hash 1168766, now seen corresponding path program 1 times [2025-03-17 19:53:09,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:53:09,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991470536] [2025-03-17 19:53:09,128 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:53:09,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:53:09,130 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 19:53:09,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 19:53:09,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:53:09,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:53:09,131 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:53:09,132 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 19:53:09,133 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 19:53:09,133 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:53:09,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:53:09,133 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:53:09,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:53:09,134 INFO L85 PathProgramCache]: Analyzing trace with hash 960229, now seen corresponding path program 1 times [2025-03-17 19:53:09,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:53:09,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398144036] [2025-03-17 19:53:09,134 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:53:09,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:53:09,135 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 19:53:09,136 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 19:53:09,136 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:53:09,136 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:53:09,137 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:53:09,137 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 19:53:09,139 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 19:53:09,139 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:53:09,139 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:53:09,140 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:53:09,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:53:09,140 INFO L85 PathProgramCache]: Analyzing trace with hash 1343190498, now seen corresponding path program 1 times [2025-03-17 19:53:09,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:53:09,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022347040] [2025-03-17 19:53:09,140 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:53:09,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:53:09,144 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-17 19:53:09,147 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-17 19:53:09,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:53:09,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:53:09,168 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-17 19:53:09,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:53:09,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022347040] [2025-03-17 19:53:09,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022347040] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:53:09,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:53:09,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 19:53:09,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081051362] [2025-03-17 19:53:09,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:53:09,195 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 19:53:09,195 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 19:53:09,195 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 19:53:09,195 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 19:53:09,195 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-17 19:53:09,195 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:53:09,195 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 19:53:09,195 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 19:53:09,195 INFO L132 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq.c_Iteration6_Loop [2025-03-17 19:53:09,195 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 19:53:09,195 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 19:53:09,196 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:53:09,198 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:53:09,200 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:53:09,205 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:53:09,237 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 19:53:09,237 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-17 19:53:09,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:53:09,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:53:09,239 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:53:09,241 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2025-03-17 19:53:09,241 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 19:53:09,242 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:53:09,258 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 19:53:09,258 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~up~0#1=1} Honda state: {ULTIMATE.start_main_~up~0#1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-17 19:53:09,263 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2025-03-17 19:53:09,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:53:09,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:53:09,265 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:53:09,266 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2025-03-17 19:53:09,267 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 19:53:09,267 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:53:09,283 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 19:53:09,283 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_7=1} Honda state: {v_rep~unnamed0~0~true_7=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-17 19:53:09,288 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2025-03-17 19:53:09,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:53:09,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:53:09,290 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:53:09,291 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2025-03-17 19:53:09,292 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 19:53:09,292 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:53:09,307 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2025-03-17 19:53:09,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:53:09,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:53:09,309 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:53:09,310 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2025-03-17 19:53:09,311 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-17 19:53:09,311 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:53:09,344 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-17 19:53:09,348 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2025-03-17 19:53:09,348 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 19:53:09,348 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 19:53:09,349 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 19:53:09,349 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 19:53:09,349 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 19:53:09,349 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:53:09,349 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 19:53:09,349 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 19:53:09,349 INFO L132 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq.c_Iteration6_Loop [2025-03-17 19:53:09,349 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 19:53:09,349 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 19:53:09,350 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:53:09,357 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:53:09,360 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:53:09,367 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:53:09,402 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 19:53:09,402 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 19:53:09,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:53:09,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:53:09,404 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:53:09,405 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2025-03-17 19:53:09,408 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:53:09,417 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:53:09,417 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:53:09,417 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:53:09,417 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:53:09,417 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:53:09,418 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:53:09,418 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:53:09,419 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:53:09,424 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2025-03-17 19:53:09,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:53:09,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:53:09,426 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:53:09,427 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2025-03-17 19:53:09,431 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:53:09,441 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:53:09,441 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:53:09,441 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:53:09,441 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:53:09,442 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:53:09,442 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:53:09,447 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:53:09,452 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2025-03-17 19:53:09,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:53:09,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:53:09,454 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:53:09,456 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2025-03-17 19:53:09,457 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:53:09,467 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:53:09,468 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:53:09,468 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:53:09,468 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:53:09,468 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:53:09,469 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:53:09,469 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:53:09,471 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-17 19:53:09,473 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-17 19:53:09,473 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-03-17 19:53:09,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:53:09,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:53:09,475 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:53:09,476 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2025-03-17 19:53:09,478 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-17 19:53:09,478 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-17 19:53:09,478 INFO L474 LassoAnalysis]: Proved termination. [2025-03-17 19:53:09,478 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = -2*ULTIMATE.start_main_~i~0#1 + 17 Supporting invariants [] [2025-03-17 19:53:09,484 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2025-03-17 19:53:09,484 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-17 19:53:09,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:53:09,498 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 19:53:09,498 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 19:53:09,498 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:53:09,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:53:09,499 INFO L256 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 19:53:09,499 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:53:09,527 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2025-03-17 19:53:09,532 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2025-03-17 19:53:09,534 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 19:53:09,535 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 19:53:09,535 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:53:09,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:53:09,536 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 19:53:09,536 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:53:09,539 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2025-03-17 19:53:09,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:53:09,557 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2025-03-17 19:53:09,557 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 56 states and 84 transitions. cyclomatic complexity: 35 Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:53:09,590 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 56 states and 84 transitions. cyclomatic complexity: 35. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 155 states and 227 transitions. Complement of second has 7 states. [2025-03-17 19:53:09,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-03-17 19:53:09,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:53:09,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 22 transitions. [2025-03-17 19:53:09,591 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 4 letters. Loop has 4 letters. [2025-03-17 19:53:09,591 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:53:09,591 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 8 letters. Loop has 4 letters. [2025-03-17 19:53:09,591 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:53:09,591 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 4 letters. Loop has 8 letters. [2025-03-17 19:53:09,591 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:53:09,591 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 155 states and 227 transitions. [2025-03-17 19:53:09,594 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 43 [2025-03-17 19:53:09,595 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 155 states to 151 states and 219 transitions. [2025-03-17 19:53:09,595 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 69 [2025-03-17 19:53:09,596 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 78 [2025-03-17 19:53:09,596 INFO L73 IsDeterministic]: Start isDeterministic. Operand 151 states and 219 transitions. [2025-03-17 19:53:09,596 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:53:09,596 INFO L218 hiAutomatonCegarLoop]: Abstraction has 151 states and 219 transitions. [2025-03-17 19:53:09,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states and 219 transitions. [2025-03-17 19:53:09,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 125. [2025-03-17 19:53:09,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 125 states have (on average 1.512) internal successors, (189), 124 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:53:09,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 189 transitions. [2025-03-17 19:53:09,602 INFO L240 hiAutomatonCegarLoop]: Abstraction has 125 states and 189 transitions. [2025-03-17 19:53:09,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:53:09,602 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 19:53:09,602 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 19:53:09,602 INFO L87 Difference]: Start difference. First operand 125 states and 189 transitions. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:53:09,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:53:09,607 INFO L93 Difference]: Finished difference Result 97 states and 129 transitions. [2025-03-17 19:53:09,607 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 97 states and 129 transitions. [2025-03-17 19:53:09,608 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 22 [2025-03-17 19:53:09,611 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 97 states to 83 states and 115 transitions. [2025-03-17 19:53:09,611 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 39 [2025-03-17 19:53:09,611 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 39 [2025-03-17 19:53:09,611 INFO L73 IsDeterministic]: Start isDeterministic. Operand 83 states and 115 transitions. [2025-03-17 19:53:09,611 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:53:09,611 INFO L218 hiAutomatonCegarLoop]: Abstraction has 83 states and 115 transitions. [2025-03-17 19:53:09,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states and 115 transitions. [2025-03-17 19:53:09,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 78. [2025-03-17 19:53:09,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 78 states have (on average 1.4102564102564104) internal successors, (110), 77 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:53:09,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 110 transitions. [2025-03-17 19:53:09,613 INFO L240 hiAutomatonCegarLoop]: Abstraction has 78 states and 110 transitions. [2025-03-17 19:53:09,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 19:53:09,615 INFO L432 stractBuchiCegarLoop]: Abstraction has 78 states and 110 transitions. [2025-03-17 19:53:09,615 INFO L338 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-03-17 19:53:09,615 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 78 states and 110 transitions. [2025-03-17 19:53:09,615 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 21 [2025-03-17 19:53:09,615 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:53:09,615 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:53:09,615 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1] [2025-03-17 19:53:09,615 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-03-17 19:53:09,616 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume main_~i~0#1 <= 0;main_~up~0#1 := 1;" "assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume main_~i~0#1 >= 10;main_~up~0#1 := 0;" [2025-03-17 19:53:09,616 INFO L754 eck$LassoCheckResult]: Loop: "assume !(main_~i~0#1 <= 0);" "assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume main_~i~0#1 >= 10;main_~up~0#1 := 0;" [2025-03-17 19:53:09,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:53:09,616 INFO L85 PathProgramCache]: Analyzing trace with hash 458940930, now seen corresponding path program 1 times [2025-03-17 19:53:09,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:53:09,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12515538] [2025-03-17 19:53:09,616 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:53:09,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:53:09,619 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-17 19:53:09,622 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 19:53:09,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:53:09,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:53:09,637 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-17 19:53:09,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:53:09,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12515538] [2025-03-17 19:53:09,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12515538] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:53:09,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:53:09,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 19:53:09,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489294340] [2025-03-17 19:53:09,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:53:09,638 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-17 19:53:09,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:53:09,639 INFO L85 PathProgramCache]: Analyzing trace with hash 1044829, now seen corresponding path program 2 times [2025-03-17 19:53:09,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:53:09,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482266545] [2025-03-17 19:53:09,639 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:53:09,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:53:09,641 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 4 statements into 1 equivalence classes. [2025-03-17 19:53:09,642 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 19:53:09,642 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 19:53:09,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:53:09,642 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:53:09,643 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 19:53:09,644 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 19:53:09,644 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:53:09,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:53:09,644 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:53:09,668 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 19:53:09,668 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 19:53:09,668 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 19:53:09,668 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 19:53:09,668 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-17 19:53:09,668 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:53:09,668 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 19:53:09,668 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 19:53:09,669 INFO L132 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq.c_Iteration7_Loop [2025-03-17 19:53:09,669 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 19:53:09,669 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 19:53:09,669 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:53:09,673 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:53:09,675 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:53:09,677 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:53:09,710 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 19:53:09,710 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-17 19:53:09,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:53:09,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:53:09,713 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:53:09,714 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2025-03-17 19:53:09,715 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 19:53:09,715 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:53:09,733 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2025-03-17 19:53:09,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:53:09,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:53:09,735 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:53:09,736 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2025-03-17 19:53:09,737 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-17 19:53:09,737 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:53:09,748 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-17 19:53:09,754 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2025-03-17 19:53:09,754 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 19:53:09,754 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 19:53:09,754 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 19:53:09,754 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 19:53:09,754 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 19:53:09,754 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:53:09,754 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 19:53:09,754 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 19:53:09,754 INFO L132 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq.c_Iteration7_Loop [2025-03-17 19:53:09,754 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 19:53:09,754 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 19:53:09,755 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:53:09,757 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:53:09,760 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:53:09,762 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:53:09,794 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 19:53:09,794 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 19:53:09,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:53:09,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:53:09,797 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:53:09,798 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2025-03-17 19:53:09,799 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:53:09,809 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:53:09,809 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:53:09,809 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:53:09,809 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:53:09,810 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:53:09,810 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:53:09,813 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:53:09,818 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2025-03-17 19:53:09,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:53:09,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:53:09,821 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:53:09,825 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2025-03-17 19:53:09,825 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:53:09,835 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:53:09,836 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:53:09,836 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:53:09,836 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:53:09,836 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:53:09,836 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:53:09,836 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:53:09,842 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-17 19:53:09,844 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-17 19:53:09,844 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-03-17 19:53:09,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:53:09,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:53:09,882 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:53:09,883 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2025-03-17 19:53:09,884 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-17 19:53:09,884 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-17 19:53:09,884 INFO L474 LassoAnalysis]: Proved termination. [2025-03-17 19:53:09,884 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = 1*ULTIMATE.start_main_~i~0#1 Supporting invariants [] [2025-03-17 19:53:09,890 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2025-03-17 19:53:09,891 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-17 19:53:09,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:53:09,903 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-17 19:53:09,907 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 19:53:09,907 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:53:09,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:53:09,908 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 19:53:09,908 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:53:09,917 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 19:53:09,918 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 19:53:09,918 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:53:09,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:53:09,918 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 19:53:09,919 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:53:09,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:53:09,933 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-03-17 19:53:09,934 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 78 states and 110 transitions. cyclomatic complexity: 43 Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:53:09,949 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 78 states and 110 transitions. cyclomatic complexity: 43. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 148 states and 199 transitions. Complement of second has 7 states. [2025-03-17 19:53:09,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-03-17 19:53:09,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:53:09,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2025-03-17 19:53:09,953 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 7 letters. Loop has 4 letters. [2025-03-17 19:53:09,953 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:53:09,953 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 11 letters. Loop has 4 letters. [2025-03-17 19:53:09,954 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:53:09,954 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 7 letters. Loop has 8 letters. [2025-03-17 19:53:09,954 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:53:09,954 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 148 states and 199 transitions. [2025-03-17 19:53:09,955 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 25 [2025-03-17 19:53:09,956 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 148 states to 121 states and 162 transitions. [2025-03-17 19:53:09,956 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 45 [2025-03-17 19:53:09,956 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 49 [2025-03-17 19:53:09,956 INFO L73 IsDeterministic]: Start isDeterministic. Operand 121 states and 162 transitions. [2025-03-17 19:53:09,956 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:53:09,956 INFO L218 hiAutomatonCegarLoop]: Abstraction has 121 states and 162 transitions. [2025-03-17 19:53:09,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states and 162 transitions. [2025-03-17 19:53:09,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 101. [2025-03-17 19:53:09,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 101 states have (on average 1.386138613861386) internal successors, (140), 100 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:53:09,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 140 transitions. [2025-03-17 19:53:09,963 INFO L240 hiAutomatonCegarLoop]: Abstraction has 101 states and 140 transitions. [2025-03-17 19:53:09,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:53:09,963 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 19:53:09,966 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 19:53:09,967 INFO L87 Difference]: Start difference. First operand 101 states and 140 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 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-17 19:53:09,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:53:09,980 INFO L93 Difference]: Finished difference Result 135 states and 179 transitions. [2025-03-17 19:53:09,980 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 135 states and 179 transitions. [2025-03-17 19:53:09,983 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 27 [2025-03-17 19:53:09,984 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 135 states to 128 states and 168 transitions. [2025-03-17 19:53:09,984 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 59 [2025-03-17 19:53:09,984 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 59 [2025-03-17 19:53:09,984 INFO L73 IsDeterministic]: Start isDeterministic. Operand 128 states and 168 transitions. [2025-03-17 19:53:09,984 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:53:09,984 INFO L218 hiAutomatonCegarLoop]: Abstraction has 128 states and 168 transitions. [2025-03-17 19:53:09,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states and 168 transitions. [2025-03-17 19:53:09,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 109. [2025-03-17 19:53:09,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 109 states have (on average 1.3027522935779816) internal successors, (142), 108 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:53:09,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 142 transitions. [2025-03-17 19:53:09,989 INFO L240 hiAutomatonCegarLoop]: Abstraction has 109 states and 142 transitions. [2025-03-17 19:53:09,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 19:53:09,993 INFO L432 stractBuchiCegarLoop]: Abstraction has 109 states and 142 transitions. [2025-03-17 19:53:09,993 INFO L338 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2025-03-17 19:53:09,993 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 109 states and 142 transitions. [2025-03-17 19:53:09,994 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 23 [2025-03-17 19:53:09,994 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:53:09,994 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:53:09,994 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1] [2025-03-17 19:53:09,994 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-03-17 19:53:09,994 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" "assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume main_~i~0#1 <= 0;main_~up~0#1 := 1;" [2025-03-17 19:53:09,994 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume main_~i~0#1 <= 0;main_~up~0#1 := 1;" [2025-03-17 19:53:09,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:53:09,994 INFO L85 PathProgramCache]: Analyzing trace with hash 1343220288, now seen corresponding path program 1 times [2025-03-17 19:53:09,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:53:09,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449074744] [2025-03-17 19:53:09,994 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:53:09,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:53:09,996 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-17 19:53:09,998 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-17 19:53:09,998 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:53:09,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:53:09,998 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:53:09,999 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-17 19:53:10,000 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-17 19:53:10,000 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:53:10,000 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:53:10,001 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:53:10,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:53:10,001 INFO L85 PathProgramCache]: Analyzing trace with hash 960228, now seen corresponding path program 2 times [2025-03-17 19:53:10,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:53:10,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677578195] [2025-03-17 19:53:10,001 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:53:10,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:53:10,002 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 4 statements into 1 equivalence classes. [2025-03-17 19:53:10,003 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 19:53:10,003 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 19:53:10,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:53:10,003 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:53:10,004 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 19:53:10,004 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 19:53:10,004 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:53:10,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:53:10,005 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:53:10,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:53:10,005 INFO L85 PathProgramCache]: Analyzing trace with hash -1785636445, now seen corresponding path program 1 times [2025-03-17 19:53:10,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:53:10,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548384662] [2025-03-17 19:53:10,005 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:53:10,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:53:10,007 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-17 19:53:10,008 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-17 19:53:10,008 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:53:10,008 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:53:10,039 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 19:53:10,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:53:10,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548384662] [2025-03-17 19:53:10,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548384662] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:53:10,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:53:10,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 19:53:10,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967196542] [2025-03-17 19:53:10,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:53:10,069 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 19:53:10,069 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 19:53:10,070 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 19:53:10,070 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 19:53:10,070 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-17 19:53:10,070 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:53:10,070 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 19:53:10,070 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 19:53:10,070 INFO L132 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq.c_Iteration8_Loop [2025-03-17 19:53:10,070 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 19:53:10,070 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 19:53:10,071 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:53:10,073 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:53:10,075 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:53:10,078 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:53:10,105 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 19:53:10,105 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-17 19:53:10,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:53:10,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:53:10,107 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:53:10,108 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2025-03-17 19:53:10,108 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 19:53:10,108 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:53:10,125 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 19:53:10,125 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_11=1} Honda state: {v_rep~unnamed0~0~true_11=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-17 19:53:10,130 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Ended with exit code 0 [2025-03-17 19:53:10,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:53:10,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:53:10,132 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:53:10,133 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2025-03-17 19:53:10,135 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 19:53:10,135 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:53:10,152 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 19:53:10,152 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_11=0} Honda state: {v_rep~unnamed0~0~false_11=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-17 19:53:10,157 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Ended with exit code 0 [2025-03-17 19:53:10,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:53:10,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:53:10,159 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:53:10,161 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2025-03-17 19:53:10,162 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 19:53:10,162 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:53:10,174 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 19:53:10,174 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~up~0#1=1} Honda state: {ULTIMATE.start_main_~up~0#1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-17 19:53:10,179 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Forceful destruction successful, exit code 0 [2025-03-17 19:53:10,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:53:10,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:53:10,181 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:53:10,183 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2025-03-17 19:53:10,185 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 19:53:10,185 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:53:10,201 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2025-03-17 19:53:10,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:53:10,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:53:10,204 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:53:10,205 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2025-03-17 19:53:10,207 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-17 19:53:10,207 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:53:10,229 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-17 19:53:10,233 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Forceful destruction successful, exit code 0 [2025-03-17 19:53:10,233 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 19:53:10,234 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 19:53:10,234 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 19:53:10,234 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 19:53:10,234 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 19:53:10,234 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:53:10,234 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 19:53:10,234 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 19:53:10,234 INFO L132 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq.c_Iteration8_Loop [2025-03-17 19:53:10,234 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 19:53:10,234 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 19:53:10,234 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:53:10,237 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:53:10,242 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:53:10,245 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:53:10,276 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 19:53:10,276 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 19:53:10,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:53:10,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:53:10,278 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:53:10,279 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2025-03-17 19:53:10,280 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:53:10,289 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:53:10,289 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:53:10,289 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:53:10,290 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:53:10,291 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:53:10,291 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:53:10,293 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:53:10,298 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Ended with exit code 0 [2025-03-17 19:53:10,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:53:10,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:53:10,300 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:53:10,301 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2025-03-17 19:53:10,302 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:53:10,311 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:53:10,311 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:53:10,311 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:53:10,311 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:53:10,311 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:53:10,312 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:53:10,312 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:53:10,314 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:53:10,319 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Ended with exit code 0 [2025-03-17 19:53:10,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:53:10,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:53:10,321 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:53:10,321 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2025-03-17 19:53:10,322 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:53:10,332 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:53:10,332 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:53:10,332 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:53:10,332 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:53:10,332 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:53:10,333 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:53:10,333 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:53:10,335 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-17 19:53:10,336 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-17 19:53:10,336 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-03-17 19:53:10,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:53:10,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:53:10,339 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:53:10,340 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2025-03-17 19:53:10,340 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-17 19:53:10,340 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-17 19:53:10,340 INFO L474 LassoAnalysis]: Proved termination. [2025-03-17 19:53:10,340 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = -1*ULTIMATE.start_main_~i~0#1 Supporting invariants [] [2025-03-17 19:53:10,346 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Forceful destruction successful, exit code 0 [2025-03-17 19:53:10,346 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-17 19:53:10,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:53:10,360 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-17 19:53:10,361 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-17 19:53:10,361 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:53:10,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:53:10,361 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 19:53:10,362 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:53:10,370 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 19:53:10,371 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 19:53:10,371 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:53:10,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:53:10,371 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 19:53:10,371 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:53:10,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:53:10,382 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-03-17 19:53:10,383 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 109 states and 142 transitions. cyclomatic complexity: 46 Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:53:10,406 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 109 states and 142 transitions. cyclomatic complexity: 46. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 215 states and 277 transitions. Complement of second has 7 states. [2025-03-17 19:53:10,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-03-17 19:53:10,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:53:10,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 21 transitions. [2025-03-17 19:53:10,407 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 8 letters. Loop has 4 letters. [2025-03-17 19:53:10,407 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:53:10,407 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 12 letters. Loop has 4 letters. [2025-03-17 19:53:10,407 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:53:10,407 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 8 letters. Loop has 8 letters. [2025-03-17 19:53:10,407 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:53:10,407 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 215 states and 277 transitions. [2025-03-17 19:53:10,410 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 32 [2025-03-17 19:53:10,410 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 215 states to 187 states and 239 transitions. [2025-03-17 19:53:10,410 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 69 [2025-03-17 19:53:10,411 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 74 [2025-03-17 19:53:10,411 INFO L73 IsDeterministic]: Start isDeterministic. Operand 187 states and 239 transitions. [2025-03-17 19:53:10,411 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:53:10,411 INFO L218 hiAutomatonCegarLoop]: Abstraction has 187 states and 239 transitions. [2025-03-17 19:53:10,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states and 239 transitions. [2025-03-17 19:53:10,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 167. [2025-03-17 19:53:10,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 167 states have (on average 1.3053892215568863) internal successors, (218), 166 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:53:10,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 218 transitions. [2025-03-17 19:53:10,419 INFO L240 hiAutomatonCegarLoop]: Abstraction has 167 states and 218 transitions. [2025-03-17 19:53:10,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:53:10,419 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 19:53:10,419 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 19:53:10,419 INFO L87 Difference]: Start difference. First operand 167 states and 218 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 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-17 19:53:10,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:53:10,435 INFO L93 Difference]: Finished difference Result 162 states and 201 transitions. [2025-03-17 19:53:10,435 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 162 states and 201 transitions. [2025-03-17 19:53:10,436 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 28 [2025-03-17 19:53:10,436 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 162 states to 110 states and 138 transitions. [2025-03-17 19:53:10,436 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 61 [2025-03-17 19:53:10,439 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 64 [2025-03-17 19:53:10,439 INFO L73 IsDeterministic]: Start isDeterministic. Operand 110 states and 138 transitions. [2025-03-17 19:53:10,439 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:53:10,439 INFO L218 hiAutomatonCegarLoop]: Abstraction has 110 states and 138 transitions. [2025-03-17 19:53:10,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states and 138 transitions. [2025-03-17 19:53:10,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 83. [2025-03-17 19:53:10,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 83 states have (on average 1.2409638554216869) internal successors, (103), 82 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:53:10,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 103 transitions. [2025-03-17 19:53:10,441 INFO L240 hiAutomatonCegarLoop]: Abstraction has 83 states and 103 transitions. [2025-03-17 19:53:10,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 19:53:10,446 INFO L432 stractBuchiCegarLoop]: Abstraction has 83 states and 103 transitions. [2025-03-17 19:53:10,446 INFO L338 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2025-03-17 19:53:10,446 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 83 states and 103 transitions. [2025-03-17 19:53:10,446 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 16 [2025-03-17 19:53:10,447 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:53:10,447 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:53:10,447 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1] [2025-03-17 19:53:10,447 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [3, 2, 2, 2, 1, 1, 1] [2025-03-17 19:53:10,447 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume main_~i~0#1 >= 10;main_~up~0#1 := 0;" "assume !(main_~i~0#1 <= 0);" "assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume main_~i~0#1 <= 0;main_~up~0#1 := 1;" [2025-03-17 19:53:10,447 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" "assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume main_~i~0#1 >= 10;main_~up~0#1 := 0;" "assume !(main_~i~0#1 <= 0);" "assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume main_~i~0#1 <= 0;main_~up~0#1 := 1;" [2025-03-17 19:53:10,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:53:10,447 INFO L85 PathProgramCache]: Analyzing trace with hash 1314591137, now seen corresponding path program 1 times [2025-03-17 19:53:10,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:53:10,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383416404] [2025-03-17 19:53:10,447 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:53:10,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:53:10,452 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-17 19:53:10,454 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-17 19:53:10,454 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:53:10,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:53:10,477 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:53:10,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:53:10,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383416404] [2025-03-17 19:53:10,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383416404] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:53:10,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1473135628] [2025-03-17 19:53:10,477 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:53:10,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:53:10,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:53:10,479 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:53:10,480 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Waiting until timeout for monitored process [2025-03-17 19:53:10,494 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-17 19:53:10,496 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-17 19:53:10,496 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:53:10,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:53:10,496 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 19:53:10,497 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:53:10,502 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:53:10,502 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:53:10,520 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2025-03-17 19:53:10,524 ERROR L418 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Exception during sending of exit command (exit): Broken pipe [2025-03-17 19:53:10,525 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Forceful destruction successful, exit code 0 [2025-03-17 19:53:10,532 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:53:10,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1473135628] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:53:10,532 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:53:10,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2025-03-17 19:53:10,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211101669] [2025-03-17 19:53:10,532 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:53:10,532 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-17 19:53:10,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:53:10,532 INFO L85 PathProgramCache]: Analyzing trace with hash -164734356, now seen corresponding path program 1 times [2025-03-17 19:53:10,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:53:10,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304759671] [2025-03-17 19:53:10,532 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:53:10,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:53:10,536 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-17 19:53:10,539 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-17 19:53:10,539 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:53:10,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:53:10,555 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 19:53:10,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:53:10,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304759671] [2025-03-17 19:53:10,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304759671] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:53:10,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1480339322] [2025-03-17 19:53:10,557 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:53:10,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:53:10,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:53:10,559 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:53:10,559 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Waiting until timeout for monitored process [2025-03-17 19:53:10,574 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-17 19:53:10,576 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-17 19:53:10,576 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:53:10,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:53:10,576 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 19:53:10,577 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:53:10,583 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 19:53:10,583 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:53:10,596 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 19:53:10,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1480339322] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:53:10,597 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:53:10,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2025-03-17 19:53:10,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122651307] [2025-03-17 19:53:10,597 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:53:10,597 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-17 19:53:10,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:53:10,597 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 19:53:10,597 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 19:53:10,597 INFO L87 Difference]: Start difference. First operand 83 states and 103 transitions. cyclomatic complexity: 28 Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:53:10,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:53:10,620 INFO L93 Difference]: Finished difference Result 123 states and 150 transitions. [2025-03-17 19:53:10,620 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 123 states and 150 transitions. [2025-03-17 19:53:10,622 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 30 [2025-03-17 19:53:10,622 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 123 states to 112 states and 136 transitions. [2025-03-17 19:53:10,622 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 54 [2025-03-17 19:53:10,622 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 54 [2025-03-17 19:53:10,622 INFO L73 IsDeterministic]: Start isDeterministic. Operand 112 states and 136 transitions. [2025-03-17 19:53:10,622 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:53:10,622 INFO L218 hiAutomatonCegarLoop]: Abstraction has 112 states and 136 transitions. [2025-03-17 19:53:10,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states and 136 transitions. [2025-03-17 19:53:10,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 91. [2025-03-17 19:53:10,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 91 states have (on average 1.2197802197802199) internal successors, (111), 90 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:53:10,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 111 transitions. [2025-03-17 19:53:10,624 INFO L240 hiAutomatonCegarLoop]: Abstraction has 91 states and 111 transitions. [2025-03-17 19:53:10,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 19:53:10,627 INFO L432 stractBuchiCegarLoop]: Abstraction has 91 states and 111 transitions. [2025-03-17 19:53:10,627 INFO L338 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2025-03-17 19:53:10,627 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 91 states and 111 transitions. [2025-03-17 19:53:10,627 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 28 [2025-03-17 19:53:10,627 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:53:10,627 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:53:10,628 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 1, 1, 1, 1, 1] [2025-03-17 19:53:10,628 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-03-17 19:53:10,628 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" "assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume main_~i~0#1 <= 0;main_~up~0#1 := 1;" "assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" [2025-03-17 19:53:10,628 INFO L754 eck$LassoCheckResult]: Loop: "assume !(main_~i~0#1 <= 0);" "assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" [2025-03-17 19:53:10,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:53:10,628 INFO L85 PathProgramCache]: Analyzing trace with hash -334695840, now seen corresponding path program 2 times [2025-03-17 19:53:10,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:53:10,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268296289] [2025-03-17 19:53:10,628 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:53:10,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:53:10,630 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes. [2025-03-17 19:53:10,631 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 19:53:10,631 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 19:53:10,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:53:10,632 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:53:10,632 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-17 19:53:10,633 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 19:53:10,633 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:53:10,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:53:10,634 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:53:10,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:53:10,634 INFO L85 PathProgramCache]: Analyzing trace with hash 1043869, now seen corresponding path program 2 times [2025-03-17 19:53:10,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:53:10,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298085485] [2025-03-17 19:53:10,634 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:53:10,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:53:10,635 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 4 statements into 1 equivalence classes. [2025-03-17 19:53:10,636 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 19:53:10,636 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 19:53:10,636 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:53:10,636 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:53:10,636 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 19:53:10,637 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 19:53:10,637 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:53:10,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:53:10,637 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:53:10,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:53:10,638 INFO L85 PathProgramCache]: Analyzing trace with hash 1569626236, now seen corresponding path program 3 times [2025-03-17 19:53:10,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:53:10,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564322941] [2025-03-17 19:53:10,638 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 19:53:10,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:53:10,640 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 15 statements into 4 equivalence classes. [2025-03-17 19:53:10,645 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 15 of 15 statements. [2025-03-17 19:53:10,646 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-17 19:53:10,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:53:10,646 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:53:10,646 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-17 19:53:10,647 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-17 19:53:10,648 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:53:10,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:53:10,648 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:53:10,673 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 19:53:10,673 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 19:53:10,673 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 19:53:10,673 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 19:53:10,673 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-17 19:53:10,673 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:53:10,673 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 19:53:10,673 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 19:53:10,673 INFO L132 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq.c_Iteration10_Loop [2025-03-17 19:53:10,673 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 19:53:10,674 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 19:53:10,674 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:53:10,676 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:53:10,683 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:53:10,685 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:53:10,709 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 19:53:10,709 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-17 19:53:10,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:53:10,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:53:10,711 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:53:10,712 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2025-03-17 19:53:10,713 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 19:53:10,713 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:53:10,730 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 19:53:10,730 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_13=1} Honda state: {v_rep~unnamed0~0~true_13=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-17 19:53:10,735 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Ended with exit code 0 [2025-03-17 19:53:10,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:53:10,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:53:10,737 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:53:10,738 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2025-03-17 19:53:10,739 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 19:53:10,739 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:53:10,755 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Ended with exit code 0 [2025-03-17 19:53:10,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:53:10,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:53:10,757 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:53:10,759 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2025-03-17 19:53:10,760 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-17 19:53:10,760 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:53:10,783 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-17 19:53:10,786 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Ended with exit code 0 [2025-03-17 19:53:10,786 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 19:53:10,786 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 19:53:10,786 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 19:53:10,786 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 19:53:10,787 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 19:53:10,787 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:53:10,787 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 19:53:10,787 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 19:53:10,787 INFO L132 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq.c_Iteration10_Loop [2025-03-17 19:53:10,787 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 19:53:10,787 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 19:53:10,787 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:53:10,790 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:53:10,798 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:53:10,800 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:53:10,823 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 19:53:10,823 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 19:53:10,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:53:10,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:53:10,825 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:53:10,825 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2025-03-17 19:53:10,826 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:53:10,835 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:53:10,836 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:53:10,836 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:53:10,836 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:53:10,837 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:53:10,837 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:53:10,839 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:53:10,845 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Ended with exit code 0 [2025-03-17 19:53:10,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:53:10,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:53:10,847 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:53:10,848 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2025-03-17 19:53:10,849 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:53:10,859 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:53:10,859 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:53:10,859 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:53:10,859 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:53:10,859 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:53:10,860 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:53:10,860 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:53:10,862 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-17 19:53:10,864 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-17 19:53:10,864 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-03-17 19:53:10,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:53:10,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:53:10,866 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:53:10,868 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2025-03-17 19:53:10,869 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-17 19:53:10,869 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-17 19:53:10,869 INFO L474 LassoAnalysis]: Proved termination. [2025-03-17 19:53:10,869 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = -2*ULTIMATE.start_main_~i~0#1 + 17 Supporting invariants [] [2025-03-17 19:53:10,874 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Ended with exit code 0 [2025-03-17 19:53:10,875 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-17 19:53:10,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:53:10,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-17 19:53:10,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 19:53:10,894 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:53:10,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:53:10,894 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 19:53:10,894 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:53:10,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 19:53:10,906 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 19:53:10,906 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:53:10,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:53:10,906 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 19:53:10,906 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:53:10,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:53:10,916 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-03-17 19:53:10,916 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 91 states and 111 transitions. cyclomatic complexity: 27 Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 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-17 19:53:10,942 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 91 states and 111 transitions. cyclomatic complexity: 27. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 131 states and 156 transitions. Complement of second has 7 states. [2025-03-17 19:53:10,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-03-17 19:53:10,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 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-17 19:53:10,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2025-03-17 19:53:10,943 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 11 letters. Loop has 4 letters. [2025-03-17 19:53:10,943 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:53:10,943 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-17 19:53:10,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:53:10,954 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-17 19:53:10,957 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 19:53:10,957 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:53:10,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:53:10,957 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 19:53:10,957 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:53:10,968 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 19:53:10,969 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 19:53:10,969 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:53:10,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:53:10,970 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 19:53:10,970 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:53:10,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:53:10,980 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2025-03-17 19:53:10,980 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 91 states and 111 transitions. cyclomatic complexity: 27 Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 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-17 19:53:11,005 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 91 states and 111 transitions. cyclomatic complexity: 27. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 131 states and 156 transitions. Complement of second has 7 states. [2025-03-17 19:53:11,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-03-17 19:53:11,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 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-17 19:53:11,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2025-03-17 19:53:11,006 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 11 letters. Loop has 4 letters. [2025-03-17 19:53:11,006 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:53:11,006 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-17 19:53:11,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:53:11,019 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-17 19:53:11,022 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 19:53:11,022 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:53:11,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:53:11,022 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 19:53:11,022 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:53:11,034 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 19:53:11,035 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 19:53:11,035 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:53:11,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:53:11,036 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 19:53:11,036 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:53:11,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:53:11,049 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-03-17 19:53:11,049 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 91 states and 111 transitions. cyclomatic complexity: 27 Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 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-17 19:53:11,085 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 91 states and 111 transitions. cyclomatic complexity: 27. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 152 states and 180 transitions. Complement of second has 8 states. [2025-03-17 19:53:11,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-03-17 19:53:11,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 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-17 19:53:11,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 21 transitions. [2025-03-17 19:53:11,087 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 11 letters. Loop has 4 letters. [2025-03-17 19:53:11,087 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:53:11,087 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 15 letters. Loop has 4 letters. [2025-03-17 19:53:11,087 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:53:11,087 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 11 letters. Loop has 8 letters. [2025-03-17 19:53:11,087 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:53:11,087 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 152 states and 180 transitions. [2025-03-17 19:53:11,088 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 34 [2025-03-17 19:53:11,089 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 152 states to 111 states and 133 transitions. [2025-03-17 19:53:11,089 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 37 [2025-03-17 19:53:11,089 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 44 [2025-03-17 19:53:11,089 INFO L73 IsDeterministic]: Start isDeterministic. Operand 111 states and 133 transitions. [2025-03-17 19:53:11,089 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:53:11,089 INFO L218 hiAutomatonCegarLoop]: Abstraction has 111 states and 133 transitions. [2025-03-17 19:53:11,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states and 133 transitions. [2025-03-17 19:53:11,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 78. [2025-03-17 19:53:11,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 78 states have (on average 1.2307692307692308) internal successors, (96), 77 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:53:11,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 96 transitions. [2025-03-17 19:53:11,092 INFO L240 hiAutomatonCegarLoop]: Abstraction has 78 states and 96 transitions. [2025-03-17 19:53:11,092 INFO L432 stractBuchiCegarLoop]: Abstraction has 78 states and 96 transitions. [2025-03-17 19:53:11,092 INFO L338 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2025-03-17 19:53:11,092 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 78 states and 96 transitions. [2025-03-17 19:53:11,092 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 24 [2025-03-17 19:53:11,092 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:53:11,092 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:53:11,093 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [6, 5, 5, 4, 1, 1, 1, 1] [2025-03-17 19:53:11,093 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [6, 5, 5, 4, 2, 1, 1] [2025-03-17 19:53:11,094 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume main_~i~0#1 >= 10;main_~up~0#1 := 0;" "assume !(main_~i~0#1 <= 0);" "assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" "assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" "assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" "assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume main_~i~0#1 <= 0;main_~up~0#1 := 1;" "assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" [2025-03-17 19:53:11,094 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume main_~i~0#1 >= 10;main_~up~0#1 := 0;" "assume !(main_~i~0#1 <= 0);" "assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" "assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" "assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" "assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume main_~i~0#1 <= 0;main_~up~0#1 := 1;" "assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" [2025-03-17 19:53:11,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:53:11,094 INFO L85 PathProgramCache]: Analyzing trace with hash 1105098702, now seen corresponding path program 1 times [2025-03-17 19:53:11,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:53:11,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279174762] [2025-03-17 19:53:11,094 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:53:11,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:53:11,096 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-17 19:53:11,100 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-17 19:53:11,100 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:53:11,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:53:11,153 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 27 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:53:11,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:53:11,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279174762] [2025-03-17 19:53:11,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279174762] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:53:11,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [286690056] [2025-03-17 19:53:11,154 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:53:11,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:53:11,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:53:11,156 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:53:11,158 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Waiting until timeout for monitored process [2025-03-17 19:53:11,172 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-17 19:53:11,177 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-17 19:53:11,177 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:53:11,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:53:11,177 INFO L256 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 19:53:11,178 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:53:11,212 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 27 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:53:11,212 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:53:11,275 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 27 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:53:11,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [286690056] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:53:11,275 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:53:11,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2025-03-17 19:53:11,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487133178] [2025-03-17 19:53:11,276 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:53:11,276 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-17 19:53:11,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:53:11,276 INFO L85 PathProgramCache]: Analyzing trace with hash 1574145973, now seen corresponding path program 2 times [2025-03-17 19:53:11,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:53:11,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533513397] [2025-03-17 19:53:11,276 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:53:11,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:53:11,281 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-03-17 19:53:11,284 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-03-17 19:53:11,284 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 19:53:11,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:53:11,343 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 32 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:53:11,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:53:11,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533513397] [2025-03-17 19:53:11,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533513397] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:53:11,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1841413301] [2025-03-17 19:53:11,343 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:53:11,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:53:11,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:53:11,345 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:53:11,346 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Waiting until timeout for monitored process [2025-03-17 19:53:11,361 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-03-17 19:53:11,365 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-03-17 19:53:11,365 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 19:53:11,365 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:53:11,366 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 19:53:11,366 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:53:11,390 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 32 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:53:11,390 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:53:11,450 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 32 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:53:11,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1841413301] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:53:11,450 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:53:11,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2025-03-17 19:53:11,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795872621] [2025-03-17 19:53:11,450 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:53:11,450 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-17 19:53:11,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:53:11,451 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 19:53:11,451 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2025-03-17 19:53:11,451 INFO L87 Difference]: Start difference. First operand 78 states and 96 transitions. cyclomatic complexity: 24 Second operand has 12 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:53:11,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:53:11,529 INFO L93 Difference]: Finished difference Result 317 states and 376 transitions. [2025-03-17 19:53:11,529 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 317 states and 376 transitions. [2025-03-17 19:53:11,531 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 104 [2025-03-17 19:53:11,532 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 317 states to 299 states and 352 transitions. [2025-03-17 19:53:11,532 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 104 [2025-03-17 19:53:11,533 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 176 [2025-03-17 19:53:11,533 INFO L73 IsDeterministic]: Start isDeterministic. Operand 299 states and 352 transitions. [2025-03-17 19:53:11,533 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:53:11,533 INFO L218 hiAutomatonCegarLoop]: Abstraction has 299 states and 352 transitions. [2025-03-17 19:53:11,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states and 352 transitions. [2025-03-17 19:53:11,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 214. [2025-03-17 19:53:11,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 214 states have (on average 1.205607476635514) internal successors, (258), 213 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:53:11,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 258 transitions. [2025-03-17 19:53:11,537 INFO L240 hiAutomatonCegarLoop]: Abstraction has 214 states and 258 transitions. [2025-03-17 19:53:11,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 19:53:11,537 INFO L432 stractBuchiCegarLoop]: Abstraction has 214 states and 258 transitions. [2025-03-17 19:53:11,537 INFO L338 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2025-03-17 19:53:11,538 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 214 states and 258 transitions. [2025-03-17 19:53:11,538 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 80 [2025-03-17 19:53:11,539 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:53:11,539 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:53:11,539 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [11, 10, 10, 10, 1, 1, 1] [2025-03-17 19:53:11,539 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [12, 11, 11, 10, 2, 1, 1] [2025-03-17 19:53:11,540 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume main_~i~0#1 >= 10;main_~up~0#1 := 0;" "assume !(main_~i~0#1 <= 0);" "assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" "assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" "assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" "assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" "assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" "assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" "assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" "assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" "assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" "assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume main_~i~0#1 <= 0;main_~up~0#1 := 1;" [2025-03-17 19:53:11,540 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" "assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume main_~i~0#1 >= 10;main_~up~0#1 := 0;" "assume !(main_~i~0#1 <= 0);" "assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" "assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" "assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" "assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" "assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" "assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" "assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" "assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" "assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" "assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume main_~i~0#1 <= 0;main_~up~0#1 := 1;" [2025-03-17 19:53:11,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:53:11,540 INFO L85 PathProgramCache]: Analyzing trace with hash 1738077308, now seen corresponding path program 2 times [2025-03-17 19:53:11,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:53:11,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189725357] [2025-03-17 19:53:11,540 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:53:11,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:53:11,543 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 44 statements into 2 equivalence classes. [2025-03-17 19:53:11,547 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 44 of 44 statements. [2025-03-17 19:53:11,547 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 19:53:11,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:53:11,547 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:53:11,551 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-17 19:53:11,556 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-17 19:53:11,557 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:53:11,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:53:11,560 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:53:11,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:53:11,561 INFO L85 PathProgramCache]: Analyzing trace with hash -1417874489, now seen corresponding path program 3 times [2025-03-17 19:53:11,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:53:11,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225373001] [2025-03-17 19:53:11,561 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 19:53:11,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:53:11,567 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 48 statements into 12 equivalence classes. [2025-03-17 19:53:11,574 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) and asserted 48 of 48 statements. [2025-03-17 19:53:11,574 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2025-03-17 19:53:11,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:53:11,574 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:53:11,575 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-17 19:53:11,580 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-17 19:53:11,581 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:53:11,581 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:53:11,582 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:53:11,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:53:11,583 INFO L85 PathProgramCache]: Analyzing trace with hash 1895491138, now seen corresponding path program 2 times [2025-03-17 19:53:11,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:53:11,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275460357] [2025-03-17 19:53:11,583 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:53:11,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:53:11,590 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 92 statements into 2 equivalence classes. [2025-03-17 19:53:11,599 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 92 of 92 statements. [2025-03-17 19:53:11,599 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 19:53:11,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:53:11,660 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 587 proven. 3 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2025-03-17 19:53:11,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:53:11,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275460357] [2025-03-17 19:53:11,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275460357] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:53:11,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [565390782] [2025-03-17 19:53:11,661 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:53:11,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:53:11,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:53:11,664 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:53:11,665 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Waiting until timeout for monitored process [2025-03-17 19:53:11,685 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 92 statements into 2 equivalence classes. [2025-03-17 19:53:11,702 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 92 of 92 statements. [2025-03-17 19:53:11,703 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 19:53:11,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:53:11,703 INFO L256 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 19:53:11,705 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:53:11,718 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 587 proven. 3 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2025-03-17 19:53:11,718 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:53:11,743 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 587 proven. 3 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2025-03-17 19:53:11,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [565390782] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:53:11,744 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:53:11,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2025-03-17 19:53:11,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243893592] [2025-03-17 19:53:11,744 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:53:11,923 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 19:53:11,924 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 19:53:11,924 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 19:53:11,924 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 19:53:11,924 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-17 19:53:11,924 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:53:11,924 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 19:53:11,924 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 19:53:11,924 INFO L132 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq.c_Iteration12_Loop [2025-03-17 19:53:11,924 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 19:53:11,924 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 19:53:11,925 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:53:11,927 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:53:11,931 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:53:11,935 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:53:11,966 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 19:53:11,966 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-17 19:53:11,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:53:11,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:53:11,969 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:53:11,970 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Waiting until timeout for monitored process [2025-03-17 19:53:11,971 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 19:53:11,971 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:53:11,990 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 19:53:11,990 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_15=1} Honda state: {v_rep~unnamed0~0~true_15=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-17 19:53:11,995 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Ended with exit code 0 [2025-03-17 19:53:11,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:53:11,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:53:11,998 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:53:11,999 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Waiting until timeout for monitored process [2025-03-17 19:53:12,001 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 19:53:12,001 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:53:12,013 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 19:53:12,013 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~up~0#1=1} Honda state: {ULTIMATE.start_main_~up~0#1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-17 19:53:12,019 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Forceful destruction successful, exit code 0 [2025-03-17 19:53:12,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:53:12,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:53:12,023 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:53:12,024 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Waiting until timeout for monitored process [2025-03-17 19:53:12,025 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 19:53:12,025 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:53:12,042 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Forceful destruction successful, exit code 0 [2025-03-17 19:53:12,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:53:12,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:53:12,045 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:53:12,046 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Waiting until timeout for monitored process [2025-03-17 19:53:12,048 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-17 19:53:12,048 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:53:12,060 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-17 19:53:12,066 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Forceful destruction successful, exit code 0 [2025-03-17 19:53:12,067 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 19:53:12,067 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 19:53:12,067 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 19:53:12,067 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 19:53:12,067 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 19:53:12,067 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:53:12,067 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 19:53:12,067 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 19:53:12,067 INFO L132 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq.c_Iteration12_Loop [2025-03-17 19:53:12,067 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 19:53:12,067 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 19:53:12,068 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:53:12,072 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:53:12,076 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:53:12,079 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:53:12,120 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 19:53:12,120 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 19:53:12,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:53:12,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:53:12,122 INFO L229 MonitoredProcess]: Starting monitored process 58 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:53:12,124 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Waiting until timeout for monitored process [2025-03-17 19:53:12,125 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:53:12,136 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:53:12,136 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:53:12,136 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:53:12,136 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:53:12,139 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:53:12,139 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:53:12,141 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:53:12,147 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Forceful destruction successful, exit code 0 [2025-03-17 19:53:12,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:53:12,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:53:12,150 INFO L229 MonitoredProcess]: Starting monitored process 59 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:53:12,151 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Waiting until timeout for monitored process [2025-03-17 19:53:12,152 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:53:12,162 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:53:12,162 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:53:12,162 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:53:12,162 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:53:12,162 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:53:12,163 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:53:12,163 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:53:12,164 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:53:12,169 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Ended with exit code 0 [2025-03-17 19:53:12,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:53:12,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:53:12,171 INFO L229 MonitoredProcess]: Starting monitored process 60 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:53:12,172 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Waiting until timeout for monitored process [2025-03-17 19:53:12,173 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:53:12,183 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:53:12,183 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:53:12,183 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:53:12,183 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:53:12,183 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:53:12,184 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:53:12,184 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:53:12,185 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-17 19:53:12,187 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-17 19:53:12,187 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-03-17 19:53:12,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:53:12,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:53:12,189 INFO L229 MonitoredProcess]: Starting monitored process 61 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:53:12,190 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Waiting until timeout for monitored process [2025-03-17 19:53:12,190 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-17 19:53:12,190 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-17 19:53:12,190 INFO L474 LassoAnalysis]: Proved termination. [2025-03-17 19:53:12,191 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = 1*ULTIMATE.start_main_~i~0#1 Supporting invariants [] [2025-03-17 19:53:12,196 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Ended with exit code 0 [2025-03-17 19:53:12,197 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-17 19:53:12,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:53:12,211 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-17 19:53:12,219 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-17 19:53:12,219 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:53:12,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:53:12,219 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 19:53:12,220 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:53:12,267 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-17 19:53:12,275 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-17 19:53:12,275 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:53:12,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:53:12,276 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 19:53:12,277 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:53:12,345 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 74 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2025-03-17 19:53:12,345 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2025-03-17 19:53:12,346 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 214 states and 258 transitions. cyclomatic complexity: 49 Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:53:12,439 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 214 states and 258 transitions. cyclomatic complexity: 49. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 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 493 states and 601 transitions. Complement of second has 15 states. [2025-03-17 19:53:12,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 1 stem states 6 non-accepting loop states 1 accepting loop states [2025-03-17 19:53:12,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:53:12,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 36 transitions. [2025-03-17 19:53:12,440 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 36 transitions. Stem has 44 letters. Loop has 48 letters. [2025-03-17 19:53:12,441 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:53:12,441 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 36 transitions. Stem has 92 letters. Loop has 48 letters. [2025-03-17 19:53:12,442 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:53:12,442 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 36 transitions. Stem has 44 letters. Loop has 96 letters. [2025-03-17 19:53:12,443 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:53:12,443 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 493 states and 601 transitions. [2025-03-17 19:53:12,446 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 84 [2025-03-17 19:53:12,448 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 493 states to 439 states and 521 transitions. [2025-03-17 19:53:12,448 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 178 [2025-03-17 19:53:12,448 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 183 [2025-03-17 19:53:12,448 INFO L73 IsDeterministic]: Start isDeterministic. Operand 439 states and 521 transitions. [2025-03-17 19:53:12,448 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:53:12,448 INFO L218 hiAutomatonCegarLoop]: Abstraction has 439 states and 521 transitions. [2025-03-17 19:53:12,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states and 521 transitions. [2025-03-17 19:53:12,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 427. [2025-03-17 19:53:12,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 427 states, 427 states have (on average 1.189695550351288) internal successors, (508), 426 states have internal predecessors, (508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:53:12,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 508 transitions. [2025-03-17 19:53:12,455 INFO L240 hiAutomatonCegarLoop]: Abstraction has 427 states and 508 transitions. [2025-03-17 19:53:12,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:53:12,455 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 19:53:12,455 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2025-03-17 19:53:12,455 INFO L87 Difference]: Start difference. First operand 427 states and 508 transitions. Second operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 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-17 19:53:12,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:53:12,496 INFO L93 Difference]: Finished difference Result 268 states and 287 transitions. [2025-03-17 19:53:12,496 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 268 states and 287 transitions. [2025-03-17 19:53:12,497 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 80 [2025-03-17 19:53:12,498 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 268 states to 225 states and 243 transitions. [2025-03-17 19:53:12,501 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 136 [2025-03-17 19:53:12,501 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 136 [2025-03-17 19:53:12,501 INFO L73 IsDeterministic]: Start isDeterministic. Operand 225 states and 243 transitions. [2025-03-17 19:53:12,501 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:53:12,501 INFO L218 hiAutomatonCegarLoop]: Abstraction has 225 states and 243 transitions. [2025-03-17 19:53:12,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states and 243 transitions. [2025-03-17 19:53:12,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 211. [2025-03-17 19:53:12,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 211 states have (on average 1.080568720379147) internal successors, (228), 210 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:53:12,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 228 transitions. [2025-03-17 19:53:12,504 INFO L240 hiAutomatonCegarLoop]: Abstraction has 211 states and 228 transitions. [2025-03-17 19:53:12,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 19:53:12,505 INFO L432 stractBuchiCegarLoop]: Abstraction has 211 states and 228 transitions. [2025-03-17 19:53:12,505 INFO L338 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2025-03-17 19:53:12,506 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 211 states and 228 transitions. [2025-03-17 19:53:12,506 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 80 [2025-03-17 19:53:12,506 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:53:12,506 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:53:12,508 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [11, 10, 10, 10, 1, 1, 1] [2025-03-17 19:53:12,508 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [16, 15, 15, 10, 6, 1, 1] [2025-03-17 19:53:12,508 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume main_~i~0#1 >= 10;main_~up~0#1 := 0;" "assume !(main_~i~0#1 <= 0);" "assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" "assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" "assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" "assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" "assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" "assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" "assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" "assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" "assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" "assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume main_~i~0#1 <= 0;main_~up~0#1 := 1;" [2025-03-17 19:53:12,508 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" "assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" "assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" "assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" "assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" "assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume main_~i~0#1 >= 10;main_~up~0#1 := 0;" "assume !(main_~i~0#1 <= 0);" "assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" "assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" "assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" "assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" "assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" "assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" "assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" "assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" "assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" "assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume main_~i~0#1 <= 0;main_~up~0#1 := 1;" [2025-03-17 19:53:12,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:53:12,508 INFO L85 PathProgramCache]: Analyzing trace with hash 1738077308, now seen corresponding path program 3 times [2025-03-17 19:53:12,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:53:12,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465415621] [2025-03-17 19:53:12,508 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 19:53:12,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:53:12,513 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 44 statements into 11 equivalence classes. [2025-03-17 19:53:12,520 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 44 of 44 statements. [2025-03-17 19:53:12,521 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-03-17 19:53:12,521 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:53:12,521 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:53:12,522 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-17 19:53:12,524 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-17 19:53:12,524 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:53:12,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:53:12,526 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:53:12,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:53:12,526 INFO L85 PathProgramCache]: Analyzing trace with hash -2046573737, now seen corresponding path program 4 times [2025-03-17 19:53:12,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:53:12,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636115459] [2025-03-17 19:53:12,526 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 19:53:12,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:53:12,531 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 64 statements into 2 equivalence classes. [2025-03-17 19:53:12,534 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 64 of 64 statements. [2025-03-17 19:53:12,535 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 19:53:12,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:53:12,535 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:53:12,536 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-17 19:53:12,539 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-17 19:53:12,540 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:53:12,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:53:12,541 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:53:12,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:53:12,542 INFO L85 PathProgramCache]: Analyzing trace with hash 117137362, now seen corresponding path program 3 times [2025-03-17 19:53:12,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:53:12,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753898917] [2025-03-17 19:53:12,542 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 19:53:12,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:53:12,547 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 108 statements into 27 equivalence classes. [2025-03-17 19:53:12,554 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) and asserted 88 of 108 statements. [2025-03-17 19:53:12,554 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2025-03-17 19:53:12,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:53:12,597 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Ended with exit code 0 [2025-03-17 19:53:12,609 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Ended with exit code 0 [2025-03-17 19:53:12,661 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 923 proven. 55 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2025-03-17 19:53:12,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:53:12,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753898917] [2025-03-17 19:53:12,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753898917] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:53:12,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1699743616] [2025-03-17 19:53:12,661 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 19:53:12,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:53:12,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:53:12,663 INFO L229 MonitoredProcess]: Starting monitored process 62 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:53:12,665 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (62)] Waiting until timeout for monitored process [2025-03-17 19:53:12,683 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 108 statements into 27 equivalence classes. [2025-03-17 19:53:12,700 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) and asserted 88 of 108 statements. [2025-03-17 19:53:12,700 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2025-03-17 19:53:12,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:53:12,701 INFO L256 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 19:53:12,702 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:53:12,731 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 923 proven. 55 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2025-03-17 19:53:12,731 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:53:12,796 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 923 proven. 55 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2025-03-17 19:53:12,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1699743616] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:53:12,796 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:53:12,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 12 [2025-03-17 19:53:12,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873505930] [2025-03-17 19:53:12,797 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:53:13,028 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 19:53:13,028 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 19:53:13,028 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 19:53:13,028 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 19:53:13,028 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-17 19:53:13,028 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:53:13,028 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 19:53:13,029 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 19:53:13,029 INFO L132 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq.c_Iteration13_Loop [2025-03-17 19:53:13,029 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 19:53:13,029 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 19:53:13,029 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:53:13,033 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:53:13,035 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:53:13,038 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:53:13,066 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 19:53:13,066 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-17 19:53:13,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:53:13,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:53:13,068 INFO L229 MonitoredProcess]: Starting monitored process 63 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:53:13,069 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Waiting until timeout for monitored process [2025-03-17 19:53:13,070 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 19:53:13,070 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:53:13,085 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Forceful destruction successful, exit code 0 [2025-03-17 19:53:13,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:53:13,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:53:13,087 INFO L229 MonitoredProcess]: Starting monitored process 64 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:53:13,088 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Waiting until timeout for monitored process [2025-03-17 19:53:13,089 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-17 19:53:13,089 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:53:13,100 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-17 19:53:13,106 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Ended with exit code 0 [2025-03-17 19:53:13,106 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 19:53:13,106 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 19:53:13,106 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 19:53:13,106 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 19:53:13,106 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 19:53:13,106 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:53:13,106 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 19:53:13,106 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 19:53:13,106 INFO L132 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq.c_Iteration13_Loop [2025-03-17 19:53:13,106 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 19:53:13,106 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 19:53:13,107 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:53:13,110 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:53:13,112 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:53:13,115 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:53:13,140 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 19:53:13,141 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 19:53:13,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:53:13,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:53:13,142 INFO L229 MonitoredProcess]: Starting monitored process 65 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:53:13,143 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Waiting until timeout for monitored process [2025-03-17 19:53:13,144 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:53:13,153 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:53:13,154 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:53:13,154 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:53:13,154 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:53:13,154 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:53:13,154 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:53:13,154 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:53:13,156 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-17 19:53:13,157 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-17 19:53:13,157 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-03-17 19:53:13,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:53:13,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:53:13,159 INFO L229 MonitoredProcess]: Starting monitored process 66 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:53:13,160 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Waiting until timeout for monitored process [2025-03-17 19:53:13,161 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-17 19:53:13,161 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-17 19:53:13,161 INFO L474 LassoAnalysis]: Proved termination. [2025-03-17 19:53:13,161 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = 1*ULTIMATE.start_main_~i~0#1 Supporting invariants [] [2025-03-17 19:53:13,166 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Ended with exit code 0 [2025-03-17 19:53:13,167 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-17 19:53:13,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:53:13,180 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-17 19:53:13,186 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-17 19:53:13,187 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:53:13,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:53:13,187 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 19:53:13,187 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:53:13,226 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-17 19:53:13,235 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-17 19:53:13,235 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:53:13,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:53:13,236 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-17 19:53:13,236 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:53:13,337 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 290 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2025-03-17 19:53:13,337 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 8 loop predicates [2025-03-17 19:53:13,337 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 211 states and 228 transitions. cyclomatic complexity: 23 Second operand has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:53:13,562 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 211 states and 228 transitions. cyclomatic complexity: 23. Second operand has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 874 states and 927 transitions. Complement of second has 31 states. [2025-03-17 19:53:13,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 16 states 1 stem states 14 non-accepting loop states 1 accepting loop states [2025-03-17 19:53:13,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:53:13,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 72 transitions. [2025-03-17 19:53:13,565 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 72 transitions. Stem has 44 letters. Loop has 64 letters. [2025-03-17 19:53:13,566 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:53:13,566 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 72 transitions. Stem has 108 letters. Loop has 64 letters. [2025-03-17 19:53:13,566 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:53:13,566 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 72 transitions. Stem has 44 letters. Loop has 128 letters. [2025-03-17 19:53:13,567 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:53:13,567 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 874 states and 927 transitions. [2025-03-17 19:53:13,571 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 84 [2025-03-17 19:53:13,573 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 874 states to 660 states and 711 transitions. [2025-03-17 19:53:13,574 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 194 [2025-03-17 19:53:13,574 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 203 [2025-03-17 19:53:13,574 INFO L73 IsDeterministic]: Start isDeterministic. Operand 660 states and 711 transitions. [2025-03-17 19:53:13,574 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:53:13,574 INFO L218 hiAutomatonCegarLoop]: Abstraction has 660 states and 711 transitions. [2025-03-17 19:53:13,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 660 states and 711 transitions. [2025-03-17 19:53:13,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 660 to 640. [2025-03-17 19:53:13,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 640 states, 640 states have (on average 1.078125) internal successors, (690), 639 states have internal predecessors, (690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:53:13,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 640 states and 690 transitions. [2025-03-17 19:53:13,581 INFO L240 hiAutomatonCegarLoop]: Abstraction has 640 states and 690 transitions. [2025-03-17 19:53:13,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:53:13,581 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 19:53:13,582 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2025-03-17 19:53:13,582 INFO L87 Difference]: Start difference. First operand 640 states and 690 transitions. Second operand has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 12 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:53:13,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:53:13,654 INFO L93 Difference]: Finished difference Result 350 states and 363 transitions. [2025-03-17 19:53:13,654 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 350 states and 363 transitions. [2025-03-17 19:53:13,656 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 80 [2025-03-17 19:53:13,657 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 350 states to 280 states and 293 transitions. [2025-03-17 19:53:13,657 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 166 [2025-03-17 19:53:13,657 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 272 [2025-03-17 19:53:13,657 INFO L73 IsDeterministic]: Start isDeterministic. Operand 280 states and 293 transitions. [2025-03-17 19:53:13,657 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:53:13,657 INFO L218 hiAutomatonCegarLoop]: Abstraction has 280 states and 293 transitions. [2025-03-17 19:53:13,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states and 293 transitions. [2025-03-17 19:53:13,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 169. [2025-03-17 19:53:13,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 169 states have (on average 1.0769230769230769) internal successors, (182), 168 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:53:13,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 182 transitions. [2025-03-17 19:53:13,660 INFO L240 hiAutomatonCegarLoop]: Abstraction has 169 states and 182 transitions. [2025-03-17 19:53:13,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 19:53:13,660 INFO L432 stractBuchiCegarLoop]: Abstraction has 169 states and 182 transitions. [2025-03-17 19:53:13,660 INFO L338 stractBuchiCegarLoop]: ======== Iteration 14 ============ [2025-03-17 19:53:13,660 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 169 states and 182 transitions. [2025-03-17 19:53:13,661 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 80 [2025-03-17 19:53:13,661 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:53:13,661 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:53:13,661 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1] [2025-03-17 19:53:13,661 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [20, 19, 19, 10, 10, 1, 1] [2025-03-17 19:53:13,661 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume main_~i~0#1 >= 10;main_~up~0#1 := 0;" "assume !(main_~i~0#1 <= 0);" "assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" [2025-03-17 19:53:13,661 INFO L754 eck$LassoCheckResult]: Loop: "assume !(main_~i~0#1 <= 0);" "assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" "assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" "assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" "assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" "assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" "assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" "assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" "assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" "assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume main_~i~0#1 <= 0;main_~up~0#1 := 1;" "assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" "assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" "assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" "assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" "assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" "assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" "assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" "assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" "assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" "assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume main_~i~0#1 >= 10;main_~up~0#1 := 0;" "assume !(main_~i~0#1 <= 0);" "assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" [2025-03-17 19:53:13,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:53:13,662 INFO L85 PathProgramCache]: Analyzing trace with hash 458048162, now seen corresponding path program 1 times [2025-03-17 19:53:13,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:53:13,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704064063] [2025-03-17 19:53:13,662 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:53:13,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:53:13,664 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-17 19:53:13,665 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 19:53:13,665 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:53:13,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:53:13,665 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:53:13,665 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-17 19:53:13,666 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 19:53:13,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:53:13,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:53:13,666 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:53:13,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:53:13,667 INFO L85 PathProgramCache]: Analyzing trace with hash 864097627, now seen corresponding path program 5 times [2025-03-17 19:53:13,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:53:13,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081161372] [2025-03-17 19:53:13,668 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 19:53:13,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:53:13,671 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 80 statements into 20 equivalence classes. [2025-03-17 19:53:13,681 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 20 check-sat command(s) and asserted 80 of 80 statements. [2025-03-17 19:53:13,681 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 20 check-sat command(s) [2025-03-17 19:53:13,681 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:53:13,681 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:53:13,683 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-17 19:53:13,688 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-17 19:53:13,688 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:53:13,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:53:13,690 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:53:13,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:53:13,691 INFO L85 PathProgramCache]: Analyzing trace with hash -1589023236, now seen corresponding path program 4 times [2025-03-17 19:53:13,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:53:13,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721984539] [2025-03-17 19:53:13,692 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 19:53:13,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:53:13,694 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 87 statements into 2 equivalence classes. [2025-03-17 19:53:13,698 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 87 of 87 statements. [2025-03-17 19:53:13,698 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 19:53:13,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:53:13,698 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:53:13,699 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-17 19:53:13,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-17 19:53:13,703 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:53:13,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:53:13,704 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:53:14,018 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Forceful destruction successful, exit code 0 [2025-03-17 19:53:14,058 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-17 19:53:14,059 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 19:53:14,059 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:53:14,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:53:14,059 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:53:14,060 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-17 19:53:14,061 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 19:53:14,061 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:53:14,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:53:14,085 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 17.03 07:53:14 BoogieIcfgContainer [2025-03-17 19:53:14,085 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-03-17 19:53:14,085 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 19:53:14,085 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 19:53:14,086 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 19:53:14,086 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 07:53:07" (3/4) ... [2025-03-17 19:53:14,087 INFO L143 WitnessPrinter]: Generating witness for non-termination counterexample [2025-03-17 19:53:14,120 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-17 19:53:14,120 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 19:53:14,120 INFO L158 Benchmark]: Toolchain (without parser) took 6991.89ms. Allocated memory was 142.6MB in the beginning and 402.7MB in the end (delta: 260.0MB). Free memory was 112.7MB in the beginning and 349.3MB in the end (delta: -236.6MB). Peak memory consumption was 23.2MB. Max. memory is 16.1GB. [2025-03-17 19:53:14,121 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 201.3MB. Free memory is still 123.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 19:53:14,121 INFO L158 Benchmark]: CACSL2BoogieTranslator took 130.64ms. Allocated memory is still 142.6MB. Free memory was 112.7MB in the beginning and 102.7MB in the end (delta: 10.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 19:53:14,121 INFO L158 Benchmark]: Boogie Procedure Inliner took 17.12ms. Allocated memory is still 142.6MB. Free memory was 102.7MB in the beginning and 101.7MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 19:53:14,122 INFO L158 Benchmark]: Boogie Preprocessor took 15.35ms. Allocated memory is still 142.6MB. Free memory was 101.7MB in the beginning and 101.2MB in the end (delta: 540.5kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 19:53:14,122 INFO L158 Benchmark]: IcfgBuilder took 166.25ms. Allocated memory is still 142.6MB. Free memory was 100.7MB in the beginning and 91.5MB in the end (delta: 9.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 19:53:14,122 INFO L158 Benchmark]: BuchiAutomizer took 6623.46ms. Allocated memory was 142.6MB in the beginning and 402.7MB in the end (delta: 260.0MB). Free memory was 91.5MB in the beginning and 356.7MB in the end (delta: -265.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 19:53:14,123 INFO L158 Benchmark]: Witness Printer took 34.66ms. Allocated memory is still 402.7MB. Free memory was 356.7MB in the beginning and 349.3MB in the end (delta: 7.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 19:53:14,124 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.15ms. Allocated memory is still 201.3MB. Free memory is still 123.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 130.64ms. Allocated memory is still 142.6MB. Free memory was 112.7MB in the beginning and 102.7MB in the end (delta: 10.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 17.12ms. Allocated memory is still 142.6MB. Free memory was 102.7MB in the beginning and 101.7MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 15.35ms. Allocated memory is still 142.6MB. Free memory was 101.7MB in the beginning and 101.2MB in the end (delta: 540.5kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 166.25ms. Allocated memory is still 142.6MB. Free memory was 100.7MB in the beginning and 91.5MB in the end (delta: 9.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * BuchiAutomizer took 6623.46ms. Allocated memory was 142.6MB in the beginning and 402.7MB in the end (delta: 260.0MB). Free memory was 91.5MB in the beginning and 356.7MB in the end (delta: -265.2MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 34.66ms. Allocated memory is still 402.7MB. Free memory was 356.7MB in the beginning and 349.3MB in the end (delta: 7.4MB). Peak memory consumption was 8.4MB. 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 18 terminating modules (9 trivial, 8 deterministic, 1 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function i and consists of 4 locations. One deterministic module has affine ranking function i and consists of 4 locations. One deterministic module has affine ranking function (((long) -2 * i) + 1) and consists of 4 locations. One deterministic module has affine ranking function (((long) -2 * i) + 17) and consists of 4 locations. One deterministic module has affine ranking function i and consists of 4 locations. One deterministic module has affine ranking function ((long) -1 * i) and consists of 4 locations. One deterministic module has affine ranking function i and consists of 8 locations. One deterministic module has affine ranking function i and consists of 16 locations. One nondeterministic module has affine ranking function (((long) -2 * i) + 17) and consists of 4 locations. 9 modules have a trivial ranking function, the largest among these consists of 12 locations. The remainder module has 169 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.5s and 14 iterations. TraceHistogramMax:20. Analysis of lassos took 4.6s. Construction of modules took 0.4s. Büchi inclusion checks took 1.3s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 17. Automata minimization 0.1s AutomataMinimizationTime, 18 MinimizatonAttempts, 434 StatesRemovedByMinimization, 17 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 [8, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 380/744 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 247 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 236 mSDsluCounter, 132 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7 mSDsCounter, 110 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 800 IncrementalHoareTripleChecker+Invalid, 910 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 110 mSolverCounterUnsat, 125 mSDtfsCounter, 800 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI2 SFLT4 conc0 concLT4 SILN0 SILU0 SILI2 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital14 mio100 ax182 hnf100 lsp38 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq176 hnf90 smp100 dnf100 smp100 tf112 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 24ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 12 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 9 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.6s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - LassoShapedNonTerminationArgument [Line: 15]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L6] int i; [L7] int up; [L8] i = __VERIFIER_nondet_int() [L9] up = 0 VAL [up=0] [L11] COND TRUE 0 <= i && i <= 10 VAL [i=10, up=0] [L12] COND TRUE i >= 10 [L13] up = 0 VAL [i=10, up=0] [L15] COND FALSE !(i <= 0) VAL [i=10, up=0] [L18] COND FALSE !(up >= 1) [L21] i = i-1 VAL [i=9, up=0] [L11] COND TRUE 0 <= i && i <= 10 VAL [i=9, up=0] [L12] COND FALSE !(i >= 10) VAL [i=9, up=0] Loop: [L15] COND FALSE !(i <= 0) [L18] COND FALSE !(up >= 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND FALSE !(up >= 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND FALSE !(up >= 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND FALSE !(up >= 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND FALSE !(up >= 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND FALSE !(up >= 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND FALSE !(up >= 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND FALSE !(up >= 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND FALSE !(up >= 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND TRUE i <= 0 [L16] up = 1 [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND TRUE i >= 10 [L13] up = 0 [L15] COND FALSE !(i <= 0) [L18] COND FALSE !(up >= 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 15]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L6] int i; [L7] int up; [L8] i = __VERIFIER_nondet_int() [L9] up = 0 VAL [up=0] [L11] COND TRUE 0 <= i && i <= 10 VAL [i=10, up=0] [L12] COND TRUE i >= 10 [L13] up = 0 VAL [i=10, up=0] [L15] COND FALSE !(i <= 0) VAL [i=10, up=0] [L18] COND FALSE !(up >= 1) [L21] i = i-1 VAL [i=9, up=0] [L11] COND TRUE 0 <= i && i <= 10 VAL [i=9, up=0] [L12] COND FALSE !(i >= 10) VAL [i=9, up=0] Loop: [L15] COND FALSE !(i <= 0) [L18] COND FALSE !(up >= 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND FALSE !(up >= 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND FALSE !(up >= 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND FALSE !(up >= 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND FALSE !(up >= 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND FALSE !(up >= 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND FALSE !(up >= 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND FALSE !(up >= 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND FALSE !(up >= 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND TRUE i <= 0 [L16] up = 1 [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND TRUE i >= 10 [L13] up = 0 [L15] COND FALSE !(i <= 0) [L18] COND FALSE !(up >= 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2025-03-17 19:53:14,140 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (62)] Forceful destruction successful, exit code 0 [2025-03-17 19:53:14,341 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Ended with exit code 0 [2025-03-17 19:53:14,540 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Forceful destruction successful, exit code 0 [2025-03-17 19:53:14,741 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Forceful destruction successful, exit code 0 [2025-03-17 19:53:14,941 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Ended with exit code 0 [2025-03-17 19:53:15,141 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Ended with exit code 0 [2025-03-17 19:53:15,342 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, 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)