./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-restricted-15/Narrowing.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/Narrowing.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 65d96571ae692dc892a607d17412b050d92bd8365fc1d6c09a627f6750d6e1ac --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 19:52:45,183 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 19:52:45,234 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2025-03-17 19:52:45,236 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 19:52:45,236 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 19:52:45,237 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2025-03-17 19:52:45,266 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 19:52:45,266 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 19:52:45,266 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 19:52:45,267 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 19:52:45,267 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 19:52:45,267 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 19:52:45,268 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 19:52:45,268 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 19:52:45,269 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-03-17 19:52:45,269 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-03-17 19:52:45,269 INFO L153 SettingsManager]: * Use old map elimination=false [2025-03-17 19:52:45,269 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-03-17 19:52:45,269 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-03-17 19:52:45,269 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-03-17 19:52:45,269 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 19:52:45,269 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-03-17 19:52:45,269 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 19:52:45,269 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 19:52:45,269 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-03-17 19:52:45,270 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-03-17 19:52:45,270 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-03-17 19:52:45,270 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 19:52:45,270 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 19:52:45,270 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-03-17 19:52:45,270 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 19:52:45,270 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 19:52:45,270 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 19:52:45,271 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 19:52:45,271 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 19:52:45,271 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 19:52:45,271 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-03-17 19:52:45,271 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 -> 65d96571ae692dc892a607d17412b050d92bd8365fc1d6c09a627f6750d6e1ac [2025-03-17 19:52:45,481 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 19:52:45,488 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 19:52:45,490 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 19:52:45,491 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 19:52:45,491 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 19:52:45,492 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-restricted-15/Narrowing.c [2025-03-17 19:52:46,631 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/978e4c697/debc1355933e47259e81626247c6f327/FLAG4fb5001d5 [2025-03-17 19:52:46,899 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 19:52:46,900 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-restricted-15/Narrowing.c [2025-03-17 19:52:46,910 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/978e4c697/debc1355933e47259e81626247c6f327/FLAG4fb5001d5 [2025-03-17 19:52:47,201 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/978e4c697/debc1355933e47259e81626247c6f327 [2025-03-17 19:52:47,204 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 19:52:47,206 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 19:52:47,208 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 19:52:47,208 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 19:52:47,211 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 19:52:47,212 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 07:52:47" (1/1) ... [2025-03-17 19:52:47,213 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68fad818 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:52:47, skipping insertion in model container [2025-03-17 19:52:47,214 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 07:52:47" (1/1) ... [2025-03-17 19:52:47,225 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 19:52:47,334 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 19:52:47,338 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 19:52:47,348 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 19:52:47,357 INFO L204 MainTranslator]: Completed translation [2025-03-17 19:52:47,358 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:52:47 WrapperNode [2025-03-17 19:52:47,358 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 19:52:47,359 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 19:52:47,359 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 19:52:47,359 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 19:52:47,363 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:52:47" (1/1) ... [2025-03-17 19:52:47,366 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:52:47" (1/1) ... [2025-03-17 19:52:47,375 INFO L138 Inliner]: procedures = 4, calls = 2, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 23 [2025-03-17 19:52:47,375 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 19:52:47,376 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 19:52:47,376 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 19:52:47,376 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 19:52:47,381 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:52:47" (1/1) ... [2025-03-17 19:52:47,381 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:52:47" (1/1) ... [2025-03-17 19:52:47,381 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:52:47" (1/1) ... [2025-03-17 19:52:47,385 INFO L175 MemorySlicer]: No memory access in input program. [2025-03-17 19:52:47,385 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:52:47" (1/1) ... [2025-03-17 19:52:47,385 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:52:47" (1/1) ... [2025-03-17 19:52:47,387 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:52:47" (1/1) ... [2025-03-17 19:52:47,387 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:52:47" (1/1) ... [2025-03-17 19:52:47,387 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:52:47" (1/1) ... [2025-03-17 19:52:47,388 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:52:47" (1/1) ... [2025-03-17 19:52:47,388 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 19:52:47,389 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 19:52:47,389 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 19:52:47,389 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 19:52:47,391 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:52:47" (1/1) ... [2025-03-17 19:52:47,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:47,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:47,426 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:52:47,432 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2025-03-17 19:52:47,448 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 19:52:47,448 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 19:52:47,501 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 19:52:47,502 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 19:52:47,564 INFO L? ?]: Removed 2 outVars from TransFormulas that were not future-live. [2025-03-17 19:52:47,564 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 19:52:47,571 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 19:52:47,571 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 19:52:47,572 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 07:52:47 BoogieIcfgContainer [2025-03-17 19:52:47,572 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 19:52:47,572 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-03-17 19:52:47,572 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-03-17 19:52:47,576 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-03-17 19:52:47,577 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-17 19:52:47,577 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 17.03 07:52:47" (1/3) ... [2025-03-17 19:52:47,577 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1fc0fec9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.03 07:52:47, skipping insertion in model container [2025-03-17 19:52:47,578 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-17 19:52:47,578 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:52:47" (2/3) ... [2025-03-17 19:52:47,578 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1fc0fec9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.03 07:52:47, skipping insertion in model container [2025-03-17 19:52:47,578 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-17 19:52:47,578 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 07:52:47" (3/3) ... [2025-03-17 19:52:47,579 INFO L363 chiAutomizerObserver]: Analyzing ICFG Narrowing.c [2025-03-17 19:52:47,613 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-03-17 19:52:47,614 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-03-17 19:52:47,614 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-03-17 19:52:47,614 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-03-17 19:52:47,614 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-03-17 19:52:47,614 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-03-17 19:52:47,615 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-03-17 19:52:47,615 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-03-17 19:52:47,619 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 9 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:52:47,628 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2025-03-17 19:52:47,628 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:52:47,628 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:52:47,631 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-03-17 19:52:47,631 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2025-03-17 19:52:47,631 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-03-17 19:52:47,632 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 9 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:52:47,633 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2025-03-17 19:52:47,633 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:52:47,633 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:52:47,633 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-03-17 19:52:47,633 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2025-03-17 19:52:47,638 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_~range~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~range~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_~range~0#1 := 20;main_~up~0#1 := 0;" [2025-03-17 19:52:47,638 INFO L754 eck$LassoCheckResult]: Loop: "assume 0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1;" "assume 0 == main_~i~0#1;main_~up~0#1 := 1;" "assume main_~i~0#1 == main_~range~0#1;main_~up~0#1 := 0;" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1;" [2025-03-17 19:52:47,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:47,643 INFO L85 PathProgramCache]: Analyzing trace with hash 43, now seen corresponding path program 1 times [2025-03-17 19:52:47,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:52:47,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466811102] [2025-03-17 19:52:47,648 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:52:47,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:52:47,692 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-17 19:52:47,694 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-17 19:52:47,694 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:47,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:52:47,694 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:52:47,697 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-17 19:52:47,697 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-17 19:52:47,697 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:47,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:52:47,707 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:52:47,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:47,710 INFO L85 PathProgramCache]: Analyzing trace with hash 1210949467, now seen corresponding path program 1 times [2025-03-17 19:52:47,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:52:47,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487655720] [2025-03-17 19:52:47,710 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:52:47,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:52:47,718 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 19:52:47,730 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 19:52:47,730 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:47,730 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:47,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:52:47,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:52:47,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487655720] [2025-03-17 19:52:47,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487655720] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:52:47,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:52:47,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 19:52:47,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328837468] [2025-03-17 19:52:47,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:52:47,803 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-17 19:52:47,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:52:47,825 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 19:52:47,826 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 19:52:47,828 INFO L87 Difference]: Start difference. First operand has 9 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:52:47,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:52:47,854 INFO L93 Difference]: Finished difference Result 15 states and 25 transitions. [2025-03-17 19:52:47,855 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 25 transitions. [2025-03-17 19:52:47,856 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2025-03-17 19:52:47,860 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 13 states and 22 transitions. [2025-03-17 19:52:47,861 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2025-03-17 19:52:47,861 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2025-03-17 19:52:47,862 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 22 transitions. [2025-03-17 19:52:47,862 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-17 19:52:47,862 INFO L218 hiAutomatonCegarLoop]: Abstraction has 13 states and 22 transitions. [2025-03-17 19:52:47,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 22 transitions. [2025-03-17 19:52:47,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2025-03-17 19:52:47,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 12 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:52:47,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 22 transitions. [2025-03-17 19:52:47,878 INFO L240 hiAutomatonCegarLoop]: Abstraction has 13 states and 22 transitions. [2025-03-17 19:52:47,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 19:52:47,881 INFO L432 stractBuchiCegarLoop]: Abstraction has 13 states and 22 transitions. [2025-03-17 19:52:47,881 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-03-17 19:52:47,881 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 22 transitions. [2025-03-17 19:52:47,881 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2025-03-17 19:52:47,881 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:52:47,881 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:52:47,881 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-03-17 19:52:47,881 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2025-03-17 19:52:47,882 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_~range~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~range~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_~range~0#1 := 20;main_~up~0#1 := 0;" [2025-03-17 19:52:47,882 INFO L754 eck$LassoCheckResult]: Loop: "assume 0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1;" "assume 0 == main_~i~0#1;main_~up~0#1 := 1;" "assume main_~i~0#1 == main_~range~0#1;main_~up~0#1 := 0;" "assume !(1 == main_~up~0#1);" "assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1;" [2025-03-17 19:52:47,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:47,882 INFO L85 PathProgramCache]: Analyzing trace with hash 43, now seen corresponding path program 2 times [2025-03-17 19:52:47,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:52:47,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566478820] [2025-03-17 19:52:47,882 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:52:47,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:52:47,886 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1 statements into 1 equivalence classes. [2025-03-17 19:52:47,886 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-17 19:52:47,887 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 19:52:47,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:52:47,887 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:52:47,887 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-17 19:52:47,888 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-17 19:52:47,888 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:47,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:52:47,889 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:52:47,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:47,889 INFO L85 PathProgramCache]: Analyzing trace with hash 1210950428, now seen corresponding path program 1 times [2025-03-17 19:52:47,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:52:47,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514365264] [2025-03-17 19:52:47,890 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:52:47,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:52:47,895 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 19:52:47,900 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 19:52:47,900 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:47,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:47,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:52:47,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:52:47,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514365264] [2025-03-17 19:52:47,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514365264] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:52:47,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:52:47,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 19:52:47,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912721825] [2025-03-17 19:52:47,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:52:47,945 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-17 19:52:47,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:52:47,946 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 19:52:47,946 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 19:52:47,946 INFO L87 Difference]: Start difference. First operand 13 states and 22 transitions. cyclomatic complexity: 10 Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:52:48,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:52:48,009 INFO L93 Difference]: Finished difference Result 37 states and 60 transitions. [2025-03-17 19:52:48,009 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 60 transitions. [2025-03-17 19:52:48,010 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 36 [2025-03-17 19:52:48,011 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 37 states and 60 transitions. [2025-03-17 19:52:48,011 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 37 [2025-03-17 19:52:48,011 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 37 [2025-03-17 19:52:48,011 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 60 transitions. [2025-03-17 19:52:48,011 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-17 19:52:48,012 INFO L218 hiAutomatonCegarLoop]: Abstraction has 37 states and 60 transitions. [2025-03-17 19:52:48,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 60 transitions. [2025-03-17 19:52:48,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2025-03-17 19:52:48,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 37 states have (on average 1.6216216216216217) internal successors, (60), 36 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:52:48,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 60 transitions. [2025-03-17 19:52:48,014 INFO L240 hiAutomatonCegarLoop]: Abstraction has 37 states and 60 transitions. [2025-03-17 19:52:48,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 19:52:48,015 INFO L432 stractBuchiCegarLoop]: Abstraction has 37 states and 60 transitions. [2025-03-17 19:52:48,015 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-03-17 19:52:48,015 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states and 60 transitions. [2025-03-17 19:52:48,016 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 36 [2025-03-17 19:52:48,016 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:52:48,016 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:52:48,016 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-03-17 19:52:48,016 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2025-03-17 19:52:48,016 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_~range~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~range~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_~range~0#1 := 20;main_~up~0#1 := 0;" [2025-03-17 19:52:48,017 INFO L754 eck$LassoCheckResult]: Loop: "assume 0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1;" "assume !(0 == main_~i~0#1);" "assume !(main_~i~0#1 == main_~range~0#1);" "assume !(1 == main_~up~0#1);" "assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1;" "assume !(main_~i~0#1 == main_~range~0#1 - 2);" [2025-03-17 19:52:48,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:48,017 INFO L85 PathProgramCache]: Analyzing trace with hash 43, now seen corresponding path program 3 times [2025-03-17 19:52:48,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:52:48,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890263090] [2025-03-17 19:52:48,017 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 19:52:48,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:52:48,021 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 1 statements into 1 equivalence classes. [2025-03-17 19:52:48,021 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-17 19:52:48,021 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-17 19:52:48,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:52:48,021 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:52:48,022 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-17 19:52:48,023 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-17 19:52:48,023 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:48,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:52:48,023 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:52:48,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:48,024 INFO L85 PathProgramCache]: Analyzing trace with hash 1211903741, now seen corresponding path program 1 times [2025-03-17 19:52:48,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:52:48,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545432365] [2025-03-17 19:52:48,024 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:52:48,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:52:48,026 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 19:52:48,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 19:52:48,030 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:48,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:52:48,030 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:52:48,031 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 19:52:48,034 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 19:52:48,034 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:48,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:52:48,036 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:52:48,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:48,037 INFO L85 PathProgramCache]: Analyzing trace with hash -167647321, now seen corresponding path program 1 times [2025-03-17 19:52:48,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:52:48,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883177098] [2025-03-17 19:52:48,037 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:52:48,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:52:48,042 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-17 19:52:48,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 19:52:48,050 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:48,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:52:48,051 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:52:48,052 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-17 19:52:48,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 19:52:48,055 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:48,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:52:48,056 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:52:48,139 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 19:52:48,139 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 19:52:48,139 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 19:52:48,140 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 19:52:48,140 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-17 19:52:48,140 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:48,140 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 19:52:48,140 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 19:52:48,140 INFO L132 ssoRankerPreferences]: Filename of dumped script: Narrowing.c_Iteration3_Loop [2025-03-17 19:52:48,140 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 19:52:48,140 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 19:52:48,151 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:48,168 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:48,171 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:48,174 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:48,242 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 19:52:48,243 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-17 19:52:48,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:48,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:48,246 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:52:48,247 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2025-03-17 19:52:48,248 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 19:52:48,248 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:52:48,270 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2025-03-17 19:52:48,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:48,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:48,272 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:52:48,272 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-03-17 19:52:48,273 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-17 19:52:48,273 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:52:48,300 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-17 19:52:48,304 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:52:48,305 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 19:52:48,305 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 19:52:48,305 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 19:52:48,305 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 19:52:48,305 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 19:52:48,305 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:48,305 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 19:52:48,305 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 19:52:48,305 INFO L132 ssoRankerPreferences]: Filename of dumped script: Narrowing.c_Iteration3_Loop [2025-03-17 19:52:48,305 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 19:52:48,305 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 19:52:48,307 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:48,320 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:48,323 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:48,326 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:48,396 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 19:52:48,399 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 19:52:48,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:48,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:48,403 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:52:48,409 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-03-17 19:52:48,410 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:52:48,421 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:52:48,421 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:52:48,422 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:52:48,422 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:52:48,422 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:52:48,427 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:52:48,429 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:52:48,433 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-17 19:52:48,438 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-17 19:52:48,442 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-03-17 19:52:48,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:48,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:48,448 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:52:48,451 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-03-17 19:52:48,452 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-17 19:52:48,452 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-17 19:52:48,453 INFO L474 LassoAnalysis]: Proved termination. [2025-03-17 19:52:48,453 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = 1*ULTIMATE.start_main_~i~0#1 Supporting invariants [] [2025-03-17 19:52:48,462 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2025-03-17 19:52:48,464 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-17 19:52:48,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:48,491 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-17 19:52:48,492 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-17 19:52:48,492 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:48,492 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:48,493 INFO L256 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 19:52:48,493 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:52:48,498 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 19:52:48,499 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 19:52:48,499 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:48,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:48,500 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 19:52:48,500 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:52:48,550 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:52:48,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:52:48,579 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:52:48,580 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 37 states and 60 transitions. cyclomatic complexity: 24 Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:52:48,635 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 37 states and 60 transitions. cyclomatic complexity: 24. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 117 states and 183 transitions. Complement of second has 7 states. [2025-03-17 19:52:48,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-03-17 19:52:48,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:52:48,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2025-03-17 19:52:48,639 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 1 letters. Loop has 6 letters. [2025-03-17 19:52:48,641 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:52:48,641 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 7 letters. Loop has 6 letters. [2025-03-17 19:52:48,642 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:52:48,642 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 1 letters. Loop has 12 letters. [2025-03-17 19:52:48,642 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:52:48,643 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 117 states and 183 transitions. [2025-03-17 19:52:48,645 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 72 [2025-03-17 19:52:48,649 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 117 states to 117 states and 183 transitions. [2025-03-17 19:52:48,650 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 74 [2025-03-17 19:52:48,650 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 77 [2025-03-17 19:52:48,650 INFO L73 IsDeterministic]: Start isDeterministic. Operand 117 states and 183 transitions. [2025-03-17 19:52:48,650 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:52:48,650 INFO L218 hiAutomatonCegarLoop]: Abstraction has 117 states and 183 transitions. [2025-03-17 19:52:48,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states and 183 transitions. [2025-03-17 19:52:48,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 82. [2025-03-17 19:52:48,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 82 states have (on average 1.6097560975609757) internal successors, (132), 81 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:52:48,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 132 transitions. [2025-03-17 19:52:48,657 INFO L240 hiAutomatonCegarLoop]: Abstraction has 82 states and 132 transitions. [2025-03-17 19:52:48,657 INFO L432 stractBuchiCegarLoop]: Abstraction has 82 states and 132 transitions. [2025-03-17 19:52:48,657 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-03-17 19:52:48,657 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 82 states and 132 transitions. [2025-03-17 19:52:48,658 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 60 [2025-03-17 19:52:48,658 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:52:48,658 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:52:48,658 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-03-17 19:52:48,658 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2025-03-17 19:52:48,658 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_~range~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~range~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_~range~0#1 := 20;main_~up~0#1 := 0;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1;" [2025-03-17 19:52:48,658 INFO L754 eck$LassoCheckResult]: Loop: "assume !(0 == main_~i~0#1);" "assume !(main_~i~0#1 == main_~range~0#1);" "assume !(1 == main_~up~0#1);" "assume !(0 == main_~up~0#1);" "assume !(main_~i~0#1 == main_~range~0#1 - 2);" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1;" [2025-03-17 19:52:48,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:48,658 INFO L85 PathProgramCache]: Analyzing trace with hash 1344, now seen corresponding path program 1 times [2025-03-17 19:52:48,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:52:48,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456913112] [2025-03-17 19:52:48,659 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:52:48,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:52:48,660 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 19:52:48,661 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 19:52:48,661 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:48,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:52:48,661 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:52:48,662 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 19:52:48,662 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 19:52:48,662 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:48,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:52:48,663 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:52:48,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:48,663 INFO L85 PathProgramCache]: Analyzing trace with hash 1181366022, now seen corresponding path program 1 times [2025-03-17 19:52:48,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:52:48,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627676967] [2025-03-17 19:52:48,663 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:52:48,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:52:48,665 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 19:52:48,666 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 19:52:48,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:48,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:52:48,666 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:52:48,667 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 19:52:48,668 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 19:52:48,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:48,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:52:48,668 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:52:48,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:48,669 INFO L85 PathProgramCache]: Analyzing trace with hash -902098683, now seen corresponding path program 1 times [2025-03-17 19:52:48,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:52:48,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112707790] [2025-03-17 19:52:48,669 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:52:48,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:52:48,671 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-17 19:52:48,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-17 19:52:48,672 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:48,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:48,694 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:52:48,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:52:48,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112707790] [2025-03-17 19:52:48,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112707790] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:52:48,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:52:48,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 19:52:48,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633897905] [2025-03-17 19:52:48,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:52:48,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:52:48,731 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 19:52:48,731 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 19:52:48,731 INFO L87 Difference]: Start difference. First operand 82 states and 132 transitions. cyclomatic complexity: 55 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:52:48,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:52:48,740 INFO L93 Difference]: Finished difference Result 82 states and 125 transitions. [2025-03-17 19:52:48,740 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 82 states and 125 transitions. [2025-03-17 19:52:48,742 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 44 [2025-03-17 19:52:48,743 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 82 states to 76 states and 115 transitions. [2025-03-17 19:52:48,743 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 50 [2025-03-17 19:52:48,743 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 50 [2025-03-17 19:52:48,743 INFO L73 IsDeterministic]: Start isDeterministic. Operand 76 states and 115 transitions. [2025-03-17 19:52:48,743 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:52:48,743 INFO L218 hiAutomatonCegarLoop]: Abstraction has 76 states and 115 transitions. [2025-03-17 19:52:48,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states and 115 transitions. [2025-03-17 19:52:48,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 70. [2025-03-17 19:52:48,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 70 states have (on average 1.5285714285714285) internal successors, (107), 69 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:52:48,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 107 transitions. [2025-03-17 19:52:48,747 INFO L240 hiAutomatonCegarLoop]: Abstraction has 70 states and 107 transitions. [2025-03-17 19:52:48,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 19:52:48,748 INFO L432 stractBuchiCegarLoop]: Abstraction has 70 states and 107 transitions. [2025-03-17 19:52:48,748 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-03-17 19:52:48,748 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 70 states and 107 transitions. [2025-03-17 19:52:48,749 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 41 [2025-03-17 19:52:48,749 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:52:48,749 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:52:48,749 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-03-17 19:52:48,749 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2025-03-17 19:52:48,749 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_~range~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~range~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_~range~0#1 := 20;main_~up~0#1 := 0;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1;" "assume 0 == main_~i~0#1;main_~up~0#1 := 1;" [2025-03-17 19:52:48,749 INFO L754 eck$LassoCheckResult]: Loop: "assume !(main_~i~0#1 == main_~range~0#1);" "assume !(1 == main_~up~0#1);" "assume !(0 == main_~up~0#1);" "assume !(main_~i~0#1 == main_~range~0#1 - 2);" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1;" "assume 0 == main_~i~0#1;main_~up~0#1 := 1;" [2025-03-17 19:52:48,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:48,750 INFO L85 PathProgramCache]: Analyzing trace with hash 41673, now seen corresponding path program 1 times [2025-03-17 19:52:48,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:52:48,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975548607] [2025-03-17 19:52:48,750 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:52:48,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:52:48,752 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 19:52:48,753 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 19:52:48,753 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:48,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:52:48,754 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:52:48,754 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 19:52:48,755 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 19:52:48,755 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:48,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:52:48,756 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:52:48,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:48,756 INFO L85 PathProgramCache]: Analyzing trace with hash 1122199451, now seen corresponding path program 1 times [2025-03-17 19:52:48,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:52:48,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359456983] [2025-03-17 19:52:48,756 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:52:48,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:52:48,759 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 19:52:48,761 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 19:52:48,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:48,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:52:48,761 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:52:48,762 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 19:52:48,764 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 19:52:48,764 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:48,764 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:52:48,765 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:52:48,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:48,765 INFO L85 PathProgramCache]: Analyzing trace with hash 1212208227, now seen corresponding path program 1 times [2025-03-17 19:52:48,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:52:48,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079387243] [2025-03-17 19:52:48,766 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:52:48,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:52:48,769 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-17 19:52:48,770 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-17 19:52:48,771 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:48,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:48,781 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:52:48,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:52:48,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079387243] [2025-03-17 19:52:48,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079387243] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:52:48,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:52:48,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 19:52:48,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661785166] [2025-03-17 19:52:48,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:52:48,828 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 19:52:48,829 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 19:52:48,829 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 19:52:48,829 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 19:52:48,829 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-17 19:52:48,829 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:48,829 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 19:52:48,829 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 19:52:48,829 INFO L132 ssoRankerPreferences]: Filename of dumped script: Narrowing.c_Iteration5_Loop [2025-03-17 19:52:48,829 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 19:52:48,829 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 19:52:48,829 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:48,832 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:48,838 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:48,840 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:48,846 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:48,927 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 19:52:48,928 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-17 19:52:48,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:48,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:48,930 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:52:48,931 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-03-17 19:52:48,932 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 19:52:48,932 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:52:48,951 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 19:52:48,952 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_3=0} Honda state: {v_rep~unnamed0~0~false_3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-17 19:52:48,958 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2025-03-17 19:52:48,958 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:48,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:48,960 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:52:48,961 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-03-17 19:52:48,963 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 19:52:48,963 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:52:48,983 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 19:52:48,983 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~range~0#1=1} Honda state: {ULTIMATE.start_main_~range~0#1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-17 19:52:48,988 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:52:48,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:48,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:48,990 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:52:48,991 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-03-17 19:52:48,992 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 19:52:48,992 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:52:49,009 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 19:52:49,009 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_3=1} Honda state: {v_rep~unnamed0~0~true_3=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-17 19:52:49,015 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2025-03-17 19:52:49,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:49,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:49,017 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:52:49,017 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-03-17 19:52:49,018 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 19:52:49,018 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:52:49,041 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:52:49,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:49,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:49,043 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:52:49,044 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-03-17 19:52:49,045 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-17 19:52:49,045 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:52:49,072 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-17 19:52:49,076 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2025-03-17 19:52:49,077 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 19:52:49,078 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 19:52:49,078 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 19:52:49,078 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 19:52:49,078 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 19:52:49,078 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:49,078 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 19:52:49,078 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 19:52:49,078 INFO L132 ssoRankerPreferences]: Filename of dumped script: Narrowing.c_Iteration5_Loop [2025-03-17 19:52:49,078 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 19:52:49,078 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 19:52:49,079 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:49,082 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:49,087 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:49,092 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:49,094 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:49,178 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 19:52:49,178 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 19:52:49,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:49,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:49,181 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:52:49,182 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-03-17 19:52:49,183 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:52:49,193 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:52:49,193 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:52:49,193 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:52:49,194 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:52:49,196 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:52:49,197 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:52:49,199 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:52:49,205 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2025-03-17 19:52:49,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:49,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:49,207 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:52:49,208 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2025-03-17 19:52:49,210 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:52:49,219 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:52:49,220 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:52:49,220 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:52:49,220 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-03-17 19:52:49,220 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:52:49,220 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2025-03-17 19:52:49,220 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:52:49,222 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:52:49,227 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2025-03-17 19:52:49,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:49,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:49,229 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:52:49,230 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2025-03-17 19:52:49,231 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:52:49,240 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:52:49,241 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:52:49,241 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:52:49,241 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-03-17 19:52:49,241 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:52:49,242 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2025-03-17 19:52:49,242 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:52:49,244 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:52:49,250 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2025-03-17 19:52:49,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:49,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:49,252 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:52:49,252 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2025-03-17 19:52:49,253 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:52:49,263 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:52:49,263 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:52:49,263 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:52:49,263 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:52:49,264 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:52:49,265 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:52:49,269 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:52:49,277 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2025-03-17 19:52:49,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:49,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:49,279 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:52:49,280 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2025-03-17 19:52:49,283 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:52:49,293 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:52:49,293 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:52:49,293 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:52:49,293 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:52:49,293 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:52:49,294 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:52:49,294 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:52:49,295 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:52:49,300 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:52:49,301 INFO L451 LassoAnalysis]: Using template '2-nested'. [2025-03-17 19:52:49,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:49,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:49,303 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:52:49,304 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2025-03-17 19:52:49,304 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:52:49,314 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:52:49,315 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:52:49,315 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:52:49,315 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-03-17 19:52:49,316 INFO L401 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2025-03-17 19:52:49,316 INFO L402 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2025-03-17 19:52:49,320 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:52:49,325 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:52:49,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:49,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:49,327 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:52:49,328 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2025-03-17 19:52:49,329 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:52:49,338 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:52:49,338 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:52:49,339 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:52:49,339 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-03-17 19:52:49,339 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-03-17 19:52:49,340 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:52:49,340 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:52:49,344 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:52:49,350 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2025-03-17 19:52:49,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:49,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:49,378 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:52:49,379 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:52:49,379 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2025-03-17 19:52:49,389 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:52:49,389 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:52:49,389 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:52:49,389 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-03-17 19:52:49,389 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-03-17 19:52:49,390 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:52:49,390 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:52:49,393 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:52:49,399 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2025-03-17 19:52:49,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:49,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:49,401 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:52:49,403 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2025-03-17 19:52:49,404 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:52:49,414 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:52:49,414 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:52:49,414 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:52:49,414 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-03-17 19:52:49,420 INFO L401 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2025-03-17 19:52:49,420 INFO L402 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2025-03-17 19:52:49,424 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:52:49,429 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2025-03-17 19:52:49,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:49,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:49,431 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:52:49,432 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2025-03-17 19:52:49,432 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:52:49,442 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:52:49,442 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:52:49,442 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:52:49,442 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:52:49,442 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-03-17 19:52:49,442 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2025-03-17 19:52:49,442 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:52:49,444 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:52:49,449 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2025-03-17 19:52:49,449 INFO L451 LassoAnalysis]: Using template '3-nested'. [2025-03-17 19:52:49,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:49,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:49,451 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:52:49,453 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2025-03-17 19:52:49,454 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:52:49,463 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:52:49,464 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:52:49,464 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:52:49,464 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-03-17 19:52:49,466 INFO L401 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2025-03-17 19:52:49,466 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-03-17 19:52:49,470 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:52:49,476 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2025-03-17 19:52:49,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:49,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:49,478 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:52:49,479 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2025-03-17 19:52:49,480 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:52:49,490 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:52:49,490 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:52:49,490 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:52:49,490 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-03-17 19:52:49,490 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-03-17 19:52:49,492 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2025-03-17 19:52:49,492 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:52:49,494 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:52:49,499 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2025-03-17 19:52:49,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:49,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:49,502 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:52:49,503 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2025-03-17 19:52:49,504 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:52:49,514 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:52:49,514 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:52:49,514 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:52:49,514 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-03-17 19:52:49,514 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-03-17 19:52:49,516 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2025-03-17 19:52:49,516 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:52:49,519 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:52:49,525 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2025-03-17 19:52:49,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:49,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:49,527 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:52:49,529 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2025-03-17 19:52:49,529 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:52:49,539 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:52:49,539 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:52:49,539 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:52:49,539 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-03-17 19:52:49,541 INFO L401 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2025-03-17 19:52:49,542 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-03-17 19:52:49,546 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:52:49,551 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2025-03-17 19:52:49,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:49,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:49,553 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:52:49,554 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2025-03-17 19:52:49,556 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:52:49,566 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:52:49,566 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:52:49,566 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:52:49,566 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:52:49,566 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-03-17 19:52:49,567 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2025-03-17 19:52:49,567 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:52:49,569 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:52:49,574 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:52:49,574 INFO L451 LassoAnalysis]: Using template '4-nested'. [2025-03-17 19:52:49,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:49,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:49,576 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:52:49,577 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2025-03-17 19:52:49,578 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:52:49,587 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:52:49,588 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:52:49,588 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:52:49,588 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2025-03-17 19:52:49,590 INFO L401 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2025-03-17 19:52:49,590 INFO L402 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2025-03-17 19:52:49,595 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:52:49,601 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2025-03-17 19:52:49,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:49,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:49,603 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:52:49,605 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2025-03-17 19:52:49,606 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:52:49,616 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:52:49,616 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:52:49,617 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:52:49,617 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-03-17 19:52:49,617 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2025-03-17 19:52:49,618 INFO L401 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2025-03-17 19:52:49,618 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:52:49,623 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:52:49,629 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2025-03-17 19:52:49,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:49,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:49,631 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:52:49,633 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2025-03-17 19:52:49,634 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:52:49,644 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:52:49,645 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:52:49,645 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:52:49,645 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-03-17 19:52:49,645 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2025-03-17 19:52:49,647 INFO L401 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2025-03-17 19:52:49,647 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:52:49,650 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:52:49,656 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2025-03-17 19:52:49,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:49,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:49,660 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:52:49,661 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2025-03-17 19:52:49,662 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:52:49,672 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:52:49,672 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:52:49,672 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:52:49,673 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2025-03-17 19:52:49,675 INFO L401 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2025-03-17 19:52:49,675 INFO L402 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2025-03-17 19:52:49,681 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:52:49,687 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2025-03-17 19:52:49,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:49,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:49,690 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:52:49,692 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:52:49,693 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:52:49,703 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:52:49,705 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:52:49,705 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:52:49,705 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:52:49,705 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2025-03-17 19:52:49,707 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2025-03-17 19:52:49,707 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:52:49,729 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:52:49,735 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:52:49,736 INFO L451 LassoAnalysis]: Using template '2-phase'. [2025-03-17 19:52:49,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:49,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:49,739 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:52:49,740 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2025-03-17 19:52:49,741 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:52:49,752 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-03-17 19:52:49,752 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2025-03-17 19:52:49,753 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:52:49,753 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:52:49,753 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-03-17 19:52:49,754 INFO L401 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2025-03-17 19:52:49,754 INFO L402 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2025-03-17 19:52:49,758 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:52:49,764 ERROR L418 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Exception during sending of exit command (exit): Broken pipe [2025-03-17 19:52:49,764 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2025-03-17 19:52:49,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:49,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:49,766 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:52:49,768 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2025-03-17 19:52:49,770 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:52:49,780 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-03-17 19:52:49,781 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2025-03-17 19:52:49,781 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:52:49,781 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:52:49,781 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-03-17 19:52:49,781 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-03-17 19:52:49,783 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:52:49,783 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:52:49,788 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:52:49,794 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2025-03-17 19:52:49,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:49,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:49,796 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:52:49,798 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2025-03-17 19:52:49,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:52:49,809 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-03-17 19:52:49,809 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2025-03-17 19:52:49,809 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:52:49,809 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:52:49,810 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-03-17 19:52:49,810 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-03-17 19:52:49,812 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:52:49,812 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:52:49,817 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:52:49,822 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2025-03-17 19:52:49,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:49,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:49,824 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:52:49,825 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2025-03-17 19:52:49,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:52:49,836 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-03-17 19:52:49,836 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2025-03-17 19:52:49,836 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:52:49,836 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:52:49,836 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-03-17 19:52:49,838 INFO L401 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2025-03-17 19:52:49,838 INFO L402 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2025-03-17 19:52:49,842 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:52:49,848 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2025-03-17 19:52:49,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:49,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:49,850 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:52:49,852 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:52:49,853 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:52:49,867 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-03-17 19:52:49,868 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2025-03-17 19:52:49,868 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:52:49,868 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:52:49,868 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:52:49,868 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-03-17 19:52:49,869 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2025-03-17 19:52:49,869 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:52:49,897 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:52:49,904 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2025-03-17 19:52:49,904 INFO L451 LassoAnalysis]: Using template '3-phase'. [2025-03-17 19:52:49,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:49,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:49,906 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:52:49,908 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:52:49,909 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:52:49,920 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-03-17 19:52:49,920 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2025-03-17 19:52:49,920 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:52:49,920 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:52:49,920 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-03-17 19:52:49,925 INFO L401 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2025-03-17 19:52:49,926 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-03-17 19:52:49,941 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:52:49,946 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Ended with exit code 0 [2025-03-17 19:52:49,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:49,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:49,948 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:52:49,949 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:52:49,950 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:52:49,960 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-03-17 19:52:49,961 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2025-03-17 19:52:49,961 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:52:49,961 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:52:49,961 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-03-17 19:52:49,961 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-03-17 19:52:49,963 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2025-03-17 19:52:49,963 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:52:49,968 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:52:49,974 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Ended with exit code 0 [2025-03-17 19:52:49,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:49,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:49,976 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:52:49,978 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:52:49,980 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:52:49,990 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-03-17 19:52:49,990 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2025-03-17 19:52:49,990 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:52:49,990 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:52:49,990 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-03-17 19:52:49,990 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-03-17 19:52:49,993 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2025-03-17 19:52:49,993 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:52:49,999 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:52:50,007 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Ended with exit code 0 [2025-03-17 19:52:50,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:50,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:50,082 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:52:50,089 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:52:50,090 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:52:50,106 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-03-17 19:52:50,106 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2025-03-17 19:52:50,106 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:52:50,106 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:52:50,106 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-03-17 19:52:50,112 INFO L401 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2025-03-17 19:52:50,112 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-03-17 19:52:50,117 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:52:50,123 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:52:50,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:50,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:50,126 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:52:50,127 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2025-03-17 19:52:50,135 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:52:50,146 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-03-17 19:52:50,146 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2025-03-17 19:52:50,146 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:52:50,147 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:52:50,147 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:52:50,147 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-03-17 19:52:50,148 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2025-03-17 19:52:50,148 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:52:50,150 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:52:50,167 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Forceful destruction successful, exit code 0 [2025-03-17 19:52:50,168 INFO L451 LassoAnalysis]: Using template '4-phase'. [2025-03-17 19:52:50,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:50,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:50,169 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:52:50,170 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2025-03-17 19:52:50,172 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:52:50,183 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-03-17 19:52:50,183 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2025-03-17 19:52:50,184 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:52:50,184 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:52:50,184 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2025-03-17 19:52:50,186 INFO L401 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2025-03-17 19:52:50,186 INFO L402 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2025-03-17 19:52:50,193 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:52:50,199 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:52:50,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:50,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:50,201 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:52:50,202 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2025-03-17 19:52:50,203 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:52:50,259 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-03-17 19:52:50,259 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2025-03-17 19:52:50,259 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:52:50,259 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:52:50,260 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-03-17 19:52:50,260 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2025-03-17 19:52:50,261 INFO L401 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2025-03-17 19:52:50,261 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:52:50,278 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:52:50,285 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Ended with exit code 0 [2025-03-17 19:52:50,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:50,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:50,300 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:52:50,301 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2025-03-17 19:52:50,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:52:50,314 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-03-17 19:52:50,314 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2025-03-17 19:52:50,314 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:52:50,314 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:52:50,314 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-03-17 19:52:50,314 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2025-03-17 19:52:50,317 INFO L401 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2025-03-17 19:52:50,317 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:52:50,330 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:52:50,337 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Ended with exit code 0 [2025-03-17 19:52:50,338 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:50,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:50,340 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:52:50,343 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2025-03-17 19:52:50,344 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:52:50,355 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-03-17 19:52:50,355 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2025-03-17 19:52:50,355 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:52:50,355 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:52:50,355 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2025-03-17 19:52:50,361 INFO L401 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2025-03-17 19:52:50,361 INFO L402 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2025-03-17 19:52:50,370 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:52:50,377 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Forceful destruction successful, exit code 0 [2025-03-17 19:52:50,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:50,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:50,380 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:52:50,381 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2025-03-17 19:52:50,384 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:52:50,395 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-03-17 19:52:50,396 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2025-03-17 19:52:50,396 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:52:50,396 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:52:50,396 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:52:50,396 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2025-03-17 19:52:50,399 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2025-03-17 19:52:50,399 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:52:50,439 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:52:50,449 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Ended with exit code 0 [2025-03-17 19:52:50,450 INFO L451 LassoAnalysis]: Using template '2-lex'. [2025-03-17 19:52:50,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:50,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:50,463 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:52:50,469 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:52:50,469 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:52:50,480 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-03-17 19:52:50,481 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2025-03-17 19:52:50,481 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:52:50,481 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:52:50,481 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-03-17 19:52:50,488 INFO L401 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2025-03-17 19:52:50,488 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-03-17 19:52:50,493 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:52:50,499 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Forceful destruction successful, exit code 0 [2025-03-17 19:52:50,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:50,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:50,502 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:52:50,505 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:52:50,505 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:52:50,515 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-03-17 19:52:50,516 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2025-03-17 19:52:50,516 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:52:50,516 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:52:50,516 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-03-17 19:52:50,516 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-03-17 19:52:50,517 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2025-03-17 19:52:50,517 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:52:50,520 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:52:50,527 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Forceful destruction successful, exit code 0 [2025-03-17 19:52:50,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:50,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:50,530 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:52:50,531 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:52:50,533 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:52:50,544 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-03-17 19:52:50,544 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2025-03-17 19:52:50,544 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:52:50,544 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:52:50,544 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-03-17 19:52:50,544 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-03-17 19:52:50,546 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2025-03-17 19:52:50,546 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:52:50,551 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:52:50,567 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Forceful destruction successful, exit code 0 [2025-03-17 19:52:50,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:50,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:50,569 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:52:50,571 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:52:50,573 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:52:50,583 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-03-17 19:52:50,584 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2025-03-17 19:52:50,584 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:52:50,584 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:52:50,584 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-03-17 19:52:50,587 INFO L401 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2025-03-17 19:52:50,587 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-03-17 19:52:50,597 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:52:50,605 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Forceful destruction successful, exit code 0 [2025-03-17 19:52:50,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:50,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:50,608 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:52:50,610 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:52:50,611 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:52:50,622 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-03-17 19:52:50,622 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2025-03-17 19:52:50,622 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:52:50,622 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:52:50,622 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:52:50,622 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-03-17 19:52:50,623 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2025-03-17 19:52:50,623 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:52:50,669 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:52:50,675 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Forceful destruction successful, exit code 0 [2025-03-17 19:52:50,676 INFO L451 LassoAnalysis]: Using template '3-lex'. [2025-03-17 19:52:50,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:50,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:50,678 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:52:50,680 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2025-03-17 19:52:50,681 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:52:50,692 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-03-17 19:52:50,692 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2025-03-17 19:52:50,693 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:52:50,693 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:52:50,693 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2025-03-17 19:52:50,700 INFO L401 nArgumentSynthesizer]: We have 18 Motzkin's Theorem applications. [2025-03-17 19:52:50,700 INFO L402 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2025-03-17 19:52:50,741 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:52:50,843 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Forceful destruction successful, exit code 0 [2025-03-17 19:52:50,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:50,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:50,848 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:52:50,855 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2025-03-17 19:52:50,858 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:52:50,868 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-03-17 19:52:50,868 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2025-03-17 19:52:50,868 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:52:50,869 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:52:50,869 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-03-17 19:52:50,869 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2025-03-17 19:52:50,870 INFO L401 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2025-03-17 19:52:50,870 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:52:50,885 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:52:50,921 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Ended with exit code 0 [2025-03-17 19:52:50,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:50,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:50,926 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:52:50,927 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2025-03-17 19:52:50,928 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:52:50,939 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-03-17 19:52:50,939 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2025-03-17 19:52:50,939 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:52:50,939 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:52:50,939 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-03-17 19:52:50,940 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2025-03-17 19:52:50,947 INFO L401 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2025-03-17 19:52:50,947 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:52:50,981 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:52:50,988 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Ended with exit code 0 [2025-03-17 19:52:50,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:50,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:50,990 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:52:50,991 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:52:50,993 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:52:51,003 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-03-17 19:52:51,004 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2025-03-17 19:52:51,004 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:52:51,004 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:52:51,004 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2025-03-17 19:52:51,009 INFO L401 nArgumentSynthesizer]: We have 18 Motzkin's Theorem applications. [2025-03-17 19:52:51,009 INFO L402 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2025-03-17 19:52:51,037 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:52:51,044 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Forceful destruction successful, exit code 0 [2025-03-17 19:52:51,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:51,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:51,062 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:52:51,074 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:52:51,075 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:52:51,087 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-03-17 19:52:51,088 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2025-03-17 19:52:51,088 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:52:51,088 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:52:51,088 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:52:51,088 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2025-03-17 19:52:51,089 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:52:51,089 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:52:51,092 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:52:51,108 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:52:51,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:52:51,109 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 19:52:51,109 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 19:52:51,110 INFO L87 Difference]: Start difference. First operand 70 states and 107 transitions. cyclomatic complexity: 41 Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:52:51,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:52:51,132 INFO L93 Difference]: Finished difference Result 52 states and 71 transitions. [2025-03-17 19:52:51,133 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 52 states and 71 transitions. [2025-03-17 19:52:51,133 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 27 [2025-03-17 19:52:51,137 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 52 states to 50 states and 69 transitions. [2025-03-17 19:52:51,137 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 37 [2025-03-17 19:52:51,137 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 37 [2025-03-17 19:52:51,137 INFO L73 IsDeterministic]: Start isDeterministic. Operand 50 states and 69 transitions. [2025-03-17 19:52:51,137 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:52:51,137 INFO L218 hiAutomatonCegarLoop]: Abstraction has 50 states and 69 transitions. [2025-03-17 19:52:51,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states and 69 transitions. [2025-03-17 19:52:51,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 41. [2025-03-17 19:52:51,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 41 states have (on average 1.3902439024390243) internal successors, (57), 40 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:52:51,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 57 transitions. [2025-03-17 19:52:51,139 INFO L240 hiAutomatonCegarLoop]: Abstraction has 41 states and 57 transitions. [2025-03-17 19:52:51,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 19:52:51,143 INFO L432 stractBuchiCegarLoop]: Abstraction has 41 states and 57 transitions. [2025-03-17 19:52:51,143 INFO L338 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-03-17 19:52:51,143 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 57 transitions. [2025-03-17 19:52:51,144 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2025-03-17 19:52:51,144 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:52:51,144 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:52:51,144 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-03-17 19:52:51,144 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2025-03-17 19:52:51,144 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_~range~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~range~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_~range~0#1 := 20;main_~up~0#1 := 0;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1;" "assume 0 == main_~i~0#1;main_~up~0#1 := 1;" "assume !(main_~i~0#1 == main_~range~0#1);" [2025-03-17 19:52:51,144 INFO L754 eck$LassoCheckResult]: Loop: "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume !(0 == main_~up~0#1);" "assume !(main_~i~0#1 == main_~range~0#1 - 2);" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1;" "assume 0 == main_~i~0#1;main_~up~0#1 := 1;" "assume !(main_~i~0#1 == main_~range~0#1);" [2025-03-17 19:52:51,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:51,144 INFO L85 PathProgramCache]: Analyzing trace with hash 1291871, now seen corresponding path program 1 times [2025-03-17 19:52:51,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:52:51,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125916271] [2025-03-17 19:52:51,144 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:52:51,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:52:51,147 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 19:52:51,148 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 19:52:51,148 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:51,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:52:51,149 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:52:51,149 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 19:52:51,150 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 19:52:51,150 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:51,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:52:51,150 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:52:51,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:51,151 INFO L85 PathProgramCache]: Analyzing trace with hash 1034413960, now seen corresponding path program 1 times [2025-03-17 19:52:51,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:52:51,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535844705] [2025-03-17 19:52:51,151 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:52:51,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:52:51,152 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 19:52:51,154 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 19:52:51,154 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:51,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:52:51,154 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:52:51,154 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 19:52:51,155 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 19:52:51,155 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:51,156 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:52:51,156 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:52:51,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:51,156 INFO L85 PathProgramCache]: Analyzing trace with hash -1104879770, now seen corresponding path program 1 times [2025-03-17 19:52:51,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:52:51,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983229608] [2025-03-17 19:52:51,157 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:52:51,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:52:51,158 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-17 19:52:51,160 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-17 19:52:51,160 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:51,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:51,272 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:52:51,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:52:51,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983229608] [2025-03-17 19:52:51,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983229608] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:52:51,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:52:51,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 19:52:51,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869607431] [2025-03-17 19:52:51,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:52:51,330 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 19:52:51,330 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 19:52:51,330 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 19:52:51,330 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 19:52:51,330 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-17 19:52:51,333 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:51,333 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 19:52:51,333 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 19:52:51,333 INFO L132 ssoRankerPreferences]: Filename of dumped script: Narrowing.c_Iteration6_Loop [2025-03-17 19:52:51,333 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 19:52:51,333 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 19:52:51,334 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:51,338 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:51,343 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:51,349 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:51,351 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:51,415 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 19:52:51,415 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-17 19:52:51,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:51,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:51,417 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:52:51,419 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:52:51,420 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 19:52:51,420 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:52:51,448 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 19:52:51,448 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_5=1} Honda state: {v_rep~unnamed0~0~true_5=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-17 19:52:51,454 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Ended with exit code 0 [2025-03-17 19:52:51,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:51,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:51,457 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:52:51,458 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:52:51,460 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 19:52:51,460 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:52:51,477 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 19:52:51,478 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~up~0#1=1} Honda state: {ULTIMATE.start_main_~up~0#1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-17 19:52:51,483 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:52:51,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:51,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:51,485 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:52:51,487 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:52:51,488 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 19:52:51,488 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:52:51,505 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:52:51,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:51,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:51,510 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:52:51,512 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:52:51,513 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-17 19:52:51,513 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:52:51,534 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-17 19:52:51,539 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:52:51,539 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 19:52:51,539 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 19:52:51,539 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 19:52:51,539 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 19:52:51,539 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 19:52:51,539 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:51,539 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 19:52:51,539 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 19:52:51,540 INFO L132 ssoRankerPreferences]: Filename of dumped script: Narrowing.c_Iteration6_Loop [2025-03-17 19:52:51,540 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 19:52:51,540 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 19:52:51,544 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:51,552 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:51,558 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:51,564 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:51,570 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:51,684 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 19:52:51,685 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 19:52:51,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:51,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:51,687 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:52:51,689 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:52:51,689 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:52:51,700 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:52:51,700 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:52:51,700 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:52:51,700 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:52:51,700 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:52:51,701 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:52:51,701 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:52:51,749 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:52:51,756 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Forceful destruction successful, exit code 0 [2025-03-17 19:52:51,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:51,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:51,758 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:52:51,760 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:52:51,761 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:52:51,771 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:52:51,771 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:52:51,771 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:52:51,771 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:52:51,772 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:52:51,772 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:52:51,777 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:52:51,783 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Forceful destruction successful, exit code 0 [2025-03-17 19:52:51,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:51,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:51,786 INFO L229 MonitoredProcess]: Starting monitored process 62 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:52:51,787 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Waiting until timeout for monitored process [2025-03-17 19:52:51,788 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:52:51,798 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:52:51,798 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:52:51,798 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:52:51,798 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:52:51,798 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:52:51,799 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:52:51,799 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:52:51,800 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-17 19:52:51,802 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-17 19:52:51,802 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-03-17 19:52:51,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:51,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:51,805 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:52:51,807 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:52:51,808 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-17 19:52:51,808 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-17 19:52:51,808 INFO L474 LassoAnalysis]: Proved termination. [2025-03-17 19:52:51,808 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = -1*ULTIMATE.start_main_~i~0#1 Supporting invariants [] [2025-03-17 19:52:51,815 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Forceful destruction successful, exit code 0 [2025-03-17 19:52:51,820 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-17 19:52:51,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:51,851 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 19:52:51,853 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 19:52:51,853 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:51,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:51,853 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 19:52:51,854 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:52:51,862 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 19:52:51,870 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 19:52:51,870 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:51,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:51,870 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 19:52:51,870 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:52:51,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:52:51,896 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:52:51,896 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 41 states and 57 transitions. cyclomatic complexity: 18 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:52:51,944 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 41 states and 57 transitions. cyclomatic complexity: 18. 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 114 states and 153 transitions. Complement of second has 7 states. [2025-03-17 19:52:51,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-03-17 19:52:51,945 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:52:51,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 32 transitions. [2025-03-17 19:52:51,946 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 32 transitions. Stem has 4 letters. Loop has 6 letters. [2025-03-17 19:52:51,946 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:52:51,946 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 32 transitions. Stem has 10 letters. Loop has 6 letters. [2025-03-17 19:52:51,946 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:52:51,946 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 32 transitions. Stem has 4 letters. Loop has 12 letters. [2025-03-17 19:52:51,946 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:52:51,946 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 114 states and 153 transitions. [2025-03-17 19:52:51,947 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 42 [2025-03-17 19:52:51,951 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 114 states to 108 states and 144 transitions. [2025-03-17 19:52:51,951 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 62 [2025-03-17 19:52:51,951 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 67 [2025-03-17 19:52:51,951 INFO L73 IsDeterministic]: Start isDeterministic. Operand 108 states and 144 transitions. [2025-03-17 19:52:51,951 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:52:51,951 INFO L218 hiAutomatonCegarLoop]: Abstraction has 108 states and 144 transitions. [2025-03-17 19:52:51,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states and 144 transitions. [2025-03-17 19:52:51,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 93. [2025-03-17 19:52:51,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 93 states have (on average 1.3763440860215055) internal successors, (128), 92 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:52:51,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 128 transitions. [2025-03-17 19:52:51,955 INFO L240 hiAutomatonCegarLoop]: Abstraction has 93 states and 128 transitions. [2025-03-17 19:52:51,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:52:51,955 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 19:52:51,955 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 19:52:51,955 INFO L87 Difference]: Start difference. First operand 93 states and 128 transitions. 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:52:51,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:52:51,989 INFO L93 Difference]: Finished difference Result 111 states and 142 transitions. [2025-03-17 19:52:51,989 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 111 states and 142 transitions. [2025-03-17 19:52:51,991 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 50 [2025-03-17 19:52:51,992 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 111 states to 92 states and 118 transitions. [2025-03-17 19:52:51,992 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 67 [2025-03-17 19:52:51,993 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 67 [2025-03-17 19:52:51,993 INFO L73 IsDeterministic]: Start isDeterministic. Operand 92 states and 118 transitions. [2025-03-17 19:52:51,993 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:52:51,994 INFO L218 hiAutomatonCegarLoop]: Abstraction has 92 states and 118 transitions. [2025-03-17 19:52:51,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states and 118 transitions. [2025-03-17 19:52:51,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 41. [2025-03-17 19:52:51,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 41 states have (on average 1.3414634146341464) internal successors, (55), 40 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:52:51,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 55 transitions. [2025-03-17 19:52:51,998 INFO L240 hiAutomatonCegarLoop]: Abstraction has 41 states and 55 transitions. [2025-03-17 19:52:51,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 19:52:51,998 INFO L432 stractBuchiCegarLoop]: Abstraction has 41 states and 55 transitions. [2025-03-17 19:52:51,999 INFO L338 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-03-17 19:52:51,999 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 55 transitions. [2025-03-17 19:52:51,999 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2025-03-17 19:52:51,999 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:52:51,999 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:52:51,999 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-03-17 19:52:51,999 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2025-03-17 19:52:51,999 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_~range~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~range~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_~range~0#1 := 20;main_~up~0#1 := 0;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1;" "assume 0 == main_~i~0#1;main_~up~0#1 := 1;" "assume !(main_~i~0#1 == main_~range~0#1);" [2025-03-17 19:52:52,000 INFO L754 eck$LassoCheckResult]: Loop: "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume !(0 == main_~up~0#1);" "assume !(main_~i~0#1 == main_~range~0#1 - 2);" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1;" "assume !(0 == main_~i~0#1);" "assume !(main_~i~0#1 == main_~range~0#1);" [2025-03-17 19:52:52,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:52,000 INFO L85 PathProgramCache]: Analyzing trace with hash 1291871, now seen corresponding path program 2 times [2025-03-17 19:52:52,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:52:52,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688888859] [2025-03-17 19:52:52,000 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:52:52,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:52:52,002 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 4 statements into 1 equivalence classes. [2025-03-17 19:52:52,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:52:52,003 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 19:52:52,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:52:52,003 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:52:52,003 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 19:52:52,004 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 19:52:52,004 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:52,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:52:52,004 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:52:52,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:52,005 INFO L85 PathProgramCache]: Analyzing trace with hash 1034413991, now seen corresponding path program 1 times [2025-03-17 19:52:52,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:52:52,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069898438] [2025-03-17 19:52:52,005 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:52:52,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:52:52,006 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 19:52:52,007 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 19:52:52,007 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:52,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:52:52,007 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:52:52,008 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 19:52:52,009 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 19:52:52,009 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:52,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:52:52,009 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:52:52,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:52,010 INFO L85 PathProgramCache]: Analyzing trace with hash -1104879739, now seen corresponding path program 1 times [2025-03-17 19:52:52,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:52:52,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833221777] [2025-03-17 19:52:52,010 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:52:52,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:52:52,011 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-17 19:52:52,012 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-17 19:52:52,012 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:52,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:52:52,013 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:52:52,013 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-17 19:52:52,014 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-17 19:52:52,014 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:52,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:52:52,015 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:52:52,076 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 19:52:52,076 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 19:52:52,076 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 19:52:52,076 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 19:52:52,076 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-17 19:52:52,076 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:52,076 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 19:52:52,076 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 19:52:52,076 INFO L132 ssoRankerPreferences]: Filename of dumped script: Narrowing.c_Iteration7_Loop [2025-03-17 19:52:52,076 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 19:52:52,076 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 19:52:52,077 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:52,086 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:52,088 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:52,091 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:52,165 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 19:52:52,165 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-17 19:52:52,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:52,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:52,167 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:52:52,168 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:52:52,168 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 19:52:52,168 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:52:52,184 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:52:52,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:52,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:52,186 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:52:52,187 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:52:52,188 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-17 19:52:52,188 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:52:52,338 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-17 19:52:52,344 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:52:52,344 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 19:52:52,344 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 19:52:52,344 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 19:52:52,344 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 19:52:52,344 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 19:52:52,344 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:52,344 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 19:52:52,344 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 19:52:52,345 INFO L132 ssoRankerPreferences]: Filename of dumped script: Narrowing.c_Iteration7_Loop [2025-03-17 19:52:52,345 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 19:52:52,345 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 19:52:52,345 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:52,353 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:52,355 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:52,356 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:52,456 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 19:52:52,456 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 19:52:52,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:52,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:52,458 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:52:52,461 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:52:52,462 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:52:52,472 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:52:52,473 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:52:52,473 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:52:52,473 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-03-17 19:52:52,473 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:52:52,474 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2025-03-17 19:52:52,474 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:52:52,477 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-17 19:52:52,482 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-03-17 19:52:52,482 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-03-17 19:52:52,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:52,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:52,484 INFO L229 MonitoredProcess]: Starting monitored process 67 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:52:52,485 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Waiting until timeout for monitored process [2025-03-17 19:52:52,486 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-17 19:52:52,486 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-17 19:52:52,487 INFO L474 LassoAnalysis]: Proved termination. [2025-03-17 19:52:52,487 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1, ULTIMATE.start_main_~range~0#1) = -1*ULTIMATE.start_main_~i~0#1 + 1*ULTIMATE.start_main_~range~0#1 Supporting invariants [] [2025-03-17 19:52:52,492 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:52:52,494 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-17 19:52:52,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:52,508 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 19:52:52,510 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 19:52:52,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:52,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:52,510 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 19:52:52,510 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:52:52,517 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 19:52:52,518 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 19:52:52,518 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:52,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:52,518 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 19:52:52,519 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:52:52,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:52:52,548 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:52:52,548 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 41 states and 55 transitions. cyclomatic complexity: 16 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:52:52,586 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 41 states and 55 transitions. cyclomatic complexity: 16. 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 90 states and 115 transitions. Complement of second has 7 states. [2025-03-17 19:52:52,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-03-17 19:52:52,588 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:52:52,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 22 transitions. [2025-03-17 19:52:52,588 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 4 letters. Loop has 6 letters. [2025-03-17 19:52:52,589 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:52:52,589 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 10 letters. Loop has 6 letters. [2025-03-17 19:52:52,589 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:52:52,589 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 4 letters. Loop has 12 letters. [2025-03-17 19:52:52,589 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:52:52,589 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 90 states and 115 transitions. [2025-03-17 19:52:52,593 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2025-03-17 19:52:52,593 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 90 states to 77 states and 98 transitions. [2025-03-17 19:52:52,593 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 41 [2025-03-17 19:52:52,593 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 44 [2025-03-17 19:52:52,593 INFO L73 IsDeterministic]: Start isDeterministic. Operand 77 states and 98 transitions. [2025-03-17 19:52:52,593 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:52:52,593 INFO L218 hiAutomatonCegarLoop]: Abstraction has 77 states and 98 transitions. [2025-03-17 19:52:52,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states and 98 transitions. [2025-03-17 19:52:52,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 71. [2025-03-17 19:52:52,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 71 states have (on average 1.295774647887324) internal successors, (92), 70 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:52:52,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 92 transitions. [2025-03-17 19:52:52,599 INFO L240 hiAutomatonCegarLoop]: Abstraction has 71 states and 92 transitions. [2025-03-17 19:52:52,599 INFO L432 stractBuchiCegarLoop]: Abstraction has 71 states and 92 transitions. [2025-03-17 19:52:52,599 INFO L338 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2025-03-17 19:52:52,599 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 71 states and 92 transitions. [2025-03-17 19:52:52,599 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2025-03-17 19:52:52,599 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:52:52,599 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:52:52,600 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:52:52,600 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2025-03-17 19:52:52,600 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_~range~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~range~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_~range~0#1 := 20;main_~up~0#1 := 0;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1;" "assume 0 == main_~i~0#1;main_~up~0#1 := 1;" "assume !(main_~i~0#1 == main_~range~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume !(0 == main_~up~0#1);" "assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1;" "assume !(0 == main_~i~0#1);" "assume main_~i~0#1 == main_~range~0#1;main_~up~0#1 := 0;" [2025-03-17 19:52:52,600 INFO L754 eck$LassoCheckResult]: Loop: "assume !(1 == main_~up~0#1);" "assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1;" "assume !(main_~i~0#1 == main_~range~0#1 - 2);" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1;" "assume !(0 == main_~i~0#1);" "assume main_~i~0#1 == main_~range~0#1;main_~up~0#1 := 0;" [2025-03-17 19:52:52,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:52,600 INFO L85 PathProgramCache]: Analyzing trace with hash -1104909531, now seen corresponding path program 1 times [2025-03-17 19:52:52,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:52:52,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629825738] [2025-03-17 19:52:52,600 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:52:52,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:52:52,602 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-17 19:52:52,604 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-17 19:52:52,604 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:52,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:52,632 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:52:52,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:52:52,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629825738] [2025-03-17 19:52:52,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629825738] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:52:52,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:52:52,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 19:52:52,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17157656] [2025-03-17 19:52:52,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:52:52,633 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-17 19:52:52,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:52,633 INFO L85 PathProgramCache]: Analyzing trace with hash 1062119620, now seen corresponding path program 1 times [2025-03-17 19:52:52,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:52:52,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015179638] [2025-03-17 19:52:52,633 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:52:52,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:52:52,635 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 19:52:52,637 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 19:52:52,637 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:52,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:52:52,637 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:52:52,638 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 19:52:52,639 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 19:52:52,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:52,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:52:52,640 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:52:52,679 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 19:52:52,679 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 19:52:52,679 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 19:52:52,679 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 19:52:52,679 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-17 19:52:52,679 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:52,679 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 19:52:52,679 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 19:52:52,679 INFO L132 ssoRankerPreferences]: Filename of dumped script: Narrowing.c_Iteration8_Loop [2025-03-17 19:52:52,679 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 19:52:52,679 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 19:52:52,679 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:52,682 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:52,684 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:52,686 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:52,724 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 19:52:52,724 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-17 19:52:52,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:52,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:52,725 INFO L229 MonitoredProcess]: Starting monitored process 68 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:52:52,726 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Waiting until timeout for monitored process [2025-03-17 19:52:52,727 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 19:52:52,727 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:52:52,738 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 19:52:52,738 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~up~0#1=0} Honda state: {ULTIMATE.start_main_~up~0#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-17 19:52:52,744 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Ended with exit code 0 [2025-03-17 19:52:52,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:52,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:52,746 INFO L229 MonitoredProcess]: Starting monitored process 69 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:52:52,747 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Waiting until timeout for monitored process [2025-03-17 19:52:52,748 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 19:52:52,748 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:52:52,764 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 19:52:52,765 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_9=1} Honda state: {v_rep~unnamed0~0~true_9=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-17 19:52:52,770 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Forceful destruction successful, exit code 0 [2025-03-17 19:52:52,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:52,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:52,772 INFO L229 MonitoredProcess]: Starting monitored process 70 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:52:52,773 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Waiting until timeout for monitored process [2025-03-17 19:52:52,773 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 19:52:52,774 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:52:52,790 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 19:52:52,790 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_9=0} Honda state: {v_rep~unnamed0~0~false_9=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-17 19:52:52,795 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Ended with exit code 0 [2025-03-17 19:52:52,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:52,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:52,797 INFO L229 MonitoredProcess]: Starting monitored process 71 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:52:52,798 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Waiting until timeout for monitored process [2025-03-17 19:52:52,799 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 19:52:52,799 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:52:52,814 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Ended with exit code 0 [2025-03-17 19:52:52,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:52,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:52,816 INFO L229 MonitoredProcess]: Starting monitored process 72 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:52:52,817 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Waiting until timeout for monitored process [2025-03-17 19:52:52,818 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-17 19:52:52,818 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:52:52,907 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-17 19:52:52,911 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Ended with exit code 0 [2025-03-17 19:52:52,912 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 19:52:52,912 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 19:52:52,912 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 19:52:52,912 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 19:52:52,912 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 19:52:52,912 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:52,912 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 19:52:52,912 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 19:52:52,912 INFO L132 ssoRankerPreferences]: Filename of dumped script: Narrowing.c_Iteration8_Loop [2025-03-17 19:52:52,912 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 19:52:52,912 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 19:52:52,913 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:52,920 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:52,922 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:52,923 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:52,967 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 19:52:52,967 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 19:52:52,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:52,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:52,969 INFO L229 MonitoredProcess]: Starting monitored process 73 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:52:52,971 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Waiting until timeout for monitored process [2025-03-17 19:52:52,972 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:52:52,982 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:52:52,982 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:52:52,982 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:52:52,982 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:52:52,982 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:52:52,983 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:52:52,983 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:52:52,984 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:52:52,990 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Forceful destruction successful, exit code 0 [2025-03-17 19:52:52,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:52,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:53,010 INFO L229 MonitoredProcess]: Starting monitored process 74 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:52:53,026 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:52:53,035 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Waiting until timeout for monitored process [2025-03-17 19:52:53,050 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:52:53,051 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:52:53,051 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:52:53,051 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:52:53,053 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:52:53,053 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:52:53,058 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:52:53,059 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:52:53,066 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Forceful destruction successful, exit code 0 [2025-03-17 19:52:53,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:53,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:53,068 INFO L229 MonitoredProcess]: Starting monitored process 75 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:52:53,070 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Waiting until timeout for monitored process [2025-03-17 19:52:53,074 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:52:53,075 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Forceful destruction successful, exit code 0 [2025-03-17 19:52:53,084 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:52:53,084 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:52:53,084 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:52:53,084 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:52:53,085 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:52:53,085 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:52:53,091 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:52:53,097 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Forceful destruction successful, exit code 0 [2025-03-17 19:52:53,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:53,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:53,100 INFO L229 MonitoredProcess]: Starting monitored process 76 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:52:53,101 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Waiting until timeout for monitored process [2025-03-17 19:52:53,103 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:52:53,113 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:52:53,113 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:52:53,113 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:52:53,113 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:52:53,113 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:52:53,114 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:52:53,114 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:52:53,115 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-17 19:52:53,117 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-17 19:52:53,117 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-03-17 19:52:53,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:53,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:53,119 INFO L229 MonitoredProcess]: Starting monitored process 77 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:52:53,120 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Waiting until timeout for monitored process [2025-03-17 19:52:53,121 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-17 19:52:53,121 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-17 19:52:53,121 INFO L474 LassoAnalysis]: Proved termination. [2025-03-17 19:52:53,121 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = 1*ULTIMATE.start_main_~i~0#1 Supporting invariants [] [2025-03-17 19:52:53,126 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Forceful destruction successful, exit code 0 [2025-03-17 19:52:53,127 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-17 19:52:53,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:53,139 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-17 19:52:53,141 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-17 19:52:53,141 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:53,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:53,141 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 19:52:53,142 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:52:53,190 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 19:52:53,192 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 19:52:53,192 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:53,192 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:53,192 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 19:52:53,193 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:52:53,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:52:53,234 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:52:53,235 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 71 states and 92 transitions. cyclomatic complexity: 26 Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:52:53,281 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 71 states and 92 transitions. cyclomatic complexity: 26. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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 160 states and 213 transitions. Complement of second has 7 states. [2025-03-17 19:52:53,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-03-17 19:52:53,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:52:53,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 22 transitions. [2025-03-17 19:52:53,283 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 10 letters. Loop has 6 letters. [2025-03-17 19:52:53,283 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:52:53,283 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 16 letters. Loop has 6 letters. [2025-03-17 19:52:53,283 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:52:53,283 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 10 letters. Loop has 12 letters. [2025-03-17 19:52:53,283 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:52:53,283 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 160 states and 213 transitions. [2025-03-17 19:52:53,284 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 35 [2025-03-17 19:52:53,285 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 160 states to 126 states and 164 transitions. [2025-03-17 19:52:53,285 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 56 [2025-03-17 19:52:53,285 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 64 [2025-03-17 19:52:53,285 INFO L73 IsDeterministic]: Start isDeterministic. Operand 126 states and 164 transitions. [2025-03-17 19:52:53,285 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:52:53,285 INFO L218 hiAutomatonCegarLoop]: Abstraction has 126 states and 164 transitions. [2025-03-17 19:52:53,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states and 164 transitions. [2025-03-17 19:52:53,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 117. [2025-03-17 19:52:53,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 117 states have (on average 1.3247863247863247) internal successors, (155), 116 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:52:53,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 155 transitions. [2025-03-17 19:52:53,288 INFO L240 hiAutomatonCegarLoop]: Abstraction has 117 states and 155 transitions. [2025-03-17 19:52:53,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:52:53,289 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 19:52:53,289 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 19:52:53,289 INFO L87 Difference]: Start difference. First operand 117 states and 155 transitions. Second operand has 5 states, 5 states have (on average 2.0) 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:52:53,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:52:53,342 INFO L93 Difference]: Finished difference Result 222 states and 283 transitions. [2025-03-17 19:52:53,342 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 222 states and 283 transitions. [2025-03-17 19:52:53,343 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 80 [2025-03-17 19:52:53,349 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 222 states to 217 states and 275 transitions. [2025-03-17 19:52:53,349 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 123 [2025-03-17 19:52:53,349 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 123 [2025-03-17 19:52:53,349 INFO L73 IsDeterministic]: Start isDeterministic. Operand 217 states and 275 transitions. [2025-03-17 19:52:53,349 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:52:53,349 INFO L218 hiAutomatonCegarLoop]: Abstraction has 217 states and 275 transitions. [2025-03-17 19:52:53,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states and 275 transitions. [2025-03-17 19:52:53,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 208. [2025-03-17 19:52:53,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 208 states have (on average 1.2788461538461537) internal successors, (266), 207 states have internal predecessors, (266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:52:53,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 266 transitions. [2025-03-17 19:52:53,363 INFO L240 hiAutomatonCegarLoop]: Abstraction has 208 states and 266 transitions. [2025-03-17 19:52:53,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 19:52:53,367 INFO L432 stractBuchiCegarLoop]: Abstraction has 208 states and 266 transitions. [2025-03-17 19:52:53,367 INFO L338 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2025-03-17 19:52:53,367 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 208 states and 266 transitions. [2025-03-17 19:52:53,368 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 78 [2025-03-17 19:52:53,369 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:52:53,369 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:52:53,369 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1] [2025-03-17 19:52:53,369 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2025-03-17 19:52:53,370 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_~range~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~range~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_~range~0#1 := 20;main_~up~0#1 := 0;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1;" "assume !(0 == main_~i~0#1);" "assume !(main_~i~0#1 == main_~range~0#1);" "assume !(1 == main_~up~0#1);" "assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1;" "assume 0 == main_~i~0#1;main_~up~0#1 := 1;" "assume !(main_~i~0#1 == main_~range~0#1);" [2025-03-17 19:52:53,370 INFO L754 eck$LassoCheckResult]: Loop: "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume !(0 == main_~up~0#1);" "assume !(main_~i~0#1 == main_~range~0#1 - 2);" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1;" "assume !(0 == main_~i~0#1);" "assume !(main_~i~0#1 == main_~range~0#1);" [2025-03-17 19:52:53,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:53,370 INFO L85 PathProgramCache]: Analyzing trace with hash 665606404, now seen corresponding path program 1 times [2025-03-17 19:52:53,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:52:53,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054419301] [2025-03-17 19:52:53,370 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:52:53,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:52:53,373 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-17 19:52:53,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-17 19:52:53,388 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:53,388 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:53,444 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:52:53,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:52:53,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054419301] [2025-03-17 19:52:53,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054419301] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:52:53,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [595526031] [2025-03-17 19:52:53,445 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:52:53,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:52:53,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:53,447 INFO L229 MonitoredProcess]: Starting monitored process 78 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:52:53,448 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (78)] Waiting until timeout for monitored process [2025-03-17 19:52:53,462 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-17 19:52:53,464 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-17 19:52:53,464 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:53,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:53,464 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 19:52:53,465 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:52:53,480 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:52:53,480 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:52:53,501 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:52:53,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [595526031] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:52:53,502 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:52:53,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2025-03-17 19:52:53,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492684742] [2025-03-17 19:52:53,502 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:52:53,502 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-17 19:52:53,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:53,502 INFO L85 PathProgramCache]: Analyzing trace with hash 1034413991, now seen corresponding path program 2 times [2025-03-17 19:52:53,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:52:53,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186085285] [2025-03-17 19:52:53,503 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:52:53,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:52:53,504 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 6 statements into 1 equivalence classes. [2025-03-17 19:52:53,505 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 19:52:53,505 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 19:52:53,505 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:52:53,506 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:52:53,506 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 19:52:53,507 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 19:52:53,507 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:53,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:52:53,508 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:52:53,541 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 19:52:53,541 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 19:52:53,541 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 19:52:53,541 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 19:52:53,541 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-17 19:52:53,541 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:53,541 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 19:52:53,541 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 19:52:53,541 INFO L132 ssoRankerPreferences]: Filename of dumped script: Narrowing.c_Iteration9_Loop [2025-03-17 19:52:53,541 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 19:52:53,541 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 19:52:53,541 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:53,543 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:53,544 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:53,551 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:53,620 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 19:52:53,620 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-17 19:52:53,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:53,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:53,622 INFO L229 MonitoredProcess]: Starting monitored process 79 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:52:53,623 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Waiting until timeout for monitored process [2025-03-17 19:52:53,624 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 19:52:53,624 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:52:53,641 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 19:52:53,642 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:52:53,647 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Forceful destruction successful, exit code 0 [2025-03-17 19:52:53,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:53,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:53,649 INFO L229 MonitoredProcess]: Starting monitored process 80 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:52:53,650 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Waiting until timeout for monitored process [2025-03-17 19:52:53,651 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 19:52:53,651 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:52:53,668 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 19:52:53,668 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:52:53,673 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Ended with exit code 0 [2025-03-17 19:52:53,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:53,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:53,675 INFO L229 MonitoredProcess]: Starting monitored process 81 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:52:53,675 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Waiting until timeout for monitored process [2025-03-17 19:52:53,676 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 19:52:53,676 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:52:53,694 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Ended with exit code 0 [2025-03-17 19:52:53,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:53,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:53,696 INFO L229 MonitoredProcess]: Starting monitored process 82 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:52:53,696 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Waiting until timeout for monitored process [2025-03-17 19:52:53,697 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-17 19:52:53,697 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:52:53,839 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-17 19:52:53,847 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Ended with exit code 0 [2025-03-17 19:52:53,847 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 19:52:53,847 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 19:52:53,847 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 19:52:53,847 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 19:52:53,847 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 19:52:53,847 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:53,847 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 19:52:53,847 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 19:52:53,847 INFO L132 ssoRankerPreferences]: Filename of dumped script: Narrowing.c_Iteration9_Loop [2025-03-17 19:52:53,847 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 19:52:53,847 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 19:52:53,848 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:53,850 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:53,857 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:53,858 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:53,944 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 19:52:53,944 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 19:52:53,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:53,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:53,946 INFO L229 MonitoredProcess]: Starting monitored process 83 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:52:53,947 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Waiting until timeout for monitored process [2025-03-17 19:52:53,948 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:52:53,958 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:52:53,958 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:52:53,958 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:52:53,958 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:52:53,959 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:52:53,959 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:52:53,961 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:52:53,967 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Ended with exit code 0 [2025-03-17 19:52:53,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:53,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:53,969 INFO L229 MonitoredProcess]: Starting monitored process 84 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:52:53,970 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Waiting until timeout for monitored process [2025-03-17 19:52:53,970 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:52:53,980 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:52:53,980 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:52:53,980 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:52:53,980 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-03-17 19:52:53,980 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:52:53,981 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2025-03-17 19:52:53,981 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:52:53,983 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-17 19:52:53,986 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-17 19:52:53,986 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-03-17 19:52:53,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:53,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:53,988 INFO L229 MonitoredProcess]: Starting monitored process 85 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:52:53,990 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Waiting until timeout for monitored process [2025-03-17 19:52:53,990 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-17 19:52:53,990 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-17 19:52:53,990 INFO L474 LassoAnalysis]: Proved termination. [2025-03-17 19:52:53,990 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1, ULTIMATE.start_main_~range~0#1) = -1*ULTIMATE.start_main_~i~0#1 + 1*ULTIMATE.start_main_~range~0#1 Supporting invariants [] [2025-03-17 19:52:53,996 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Ended with exit code 0 [2025-03-17 19:52:53,996 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-17 19:52:54,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:54,012 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-17 19:52:54,014 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-17 19:52:54,014 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:54,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:54,015 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 19:52:54,015 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:52:54,026 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 19:52:54,027 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 19:52:54,027 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:54,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:54,028 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 19:52:54,028 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:52:54,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:52:54,058 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:52:54,058 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 208 states and 266 transitions. cyclomatic complexity: 73 Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:52:54,082 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 208 states and 266 transitions. cyclomatic complexity: 73. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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 254 states and 316 transitions. Complement of second has 7 states. [2025-03-17 19:52:54,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-03-17 19:52:54,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:52:54,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 22 transitions. [2025-03-17 19:52:54,084 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 10 letters. Loop has 6 letters. [2025-03-17 19:52:54,084 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:52:54,084 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-17 19:52:54,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:54,096 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-17 19:52:54,099 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-17 19:52:54,099 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:54,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:54,099 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 19:52:54,100 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:52:54,112 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 19:52:54,113 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 19:52:54,113 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:54,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:54,114 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 19:52:54,114 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:52:54,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:52:54,135 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 3 loop predicates [2025-03-17 19:52:54,135 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 208 states and 266 transitions. cyclomatic complexity: 73 Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:52:54,182 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 208 states and 266 transitions. cyclomatic complexity: 73. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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 368 states and 448 transitions. Complement of second has 9 states. [2025-03-17 19:52:54,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2025-03-17 19:52:54,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:52:54,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 29 transitions. [2025-03-17 19:52:54,183 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 29 transitions. Stem has 10 letters. Loop has 6 letters. [2025-03-17 19:52:54,183 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:52:54,183 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-17 19:52:54,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:54,193 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-17 19:52:54,195 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-17 19:52:54,195 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:54,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:54,195 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 19:52:54,195 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:52:54,205 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 19:52:54,207 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 19:52:54,207 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:54,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:54,207 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 19:52:54,207 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:52:54,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:52:54,231 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 3 loop predicates [2025-03-17 19:52:54,231 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 208 states and 266 transitions. cyclomatic complexity: 73 Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:52:54,251 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 208 states and 266 transitions. cyclomatic complexity: 73. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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 319 states and 400 transitions. Complement of second has 8 states. [2025-03-17 19:52:54,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-03-17 19:52:54,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:52:54,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 26 transitions. [2025-03-17 19:52:54,252 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 26 transitions. Stem has 10 letters. Loop has 6 letters. [2025-03-17 19:52:54,252 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:52:54,252 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 26 transitions. Stem has 16 letters. Loop has 6 letters. [2025-03-17 19:52:54,252 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:52:54,252 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 26 transitions. Stem has 10 letters. Loop has 12 letters. [2025-03-17 19:52:54,252 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:52:54,252 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 319 states and 400 transitions. [2025-03-17 19:52:54,254 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 76 [2025-03-17 19:52:54,255 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 319 states to 236 states and 298 transitions. [2025-03-17 19:52:54,255 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 68 [2025-03-17 19:52:54,255 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 83 [2025-03-17 19:52:54,255 INFO L73 IsDeterministic]: Start isDeterministic. Operand 236 states and 298 transitions. [2025-03-17 19:52:54,255 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:52:54,255 INFO L218 hiAutomatonCegarLoop]: Abstraction has 236 states and 298 transitions. [2025-03-17 19:52:54,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states and 298 transitions. [2025-03-17 19:52:54,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 174. [2025-03-17 19:52:54,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 174 states have (on average 1.3103448275862069) internal successors, (228), 173 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:52:54,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 228 transitions. [2025-03-17 19:52:54,258 INFO L240 hiAutomatonCegarLoop]: Abstraction has 174 states and 228 transitions. [2025-03-17 19:52:54,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:52:54,258 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 19:52:54,258 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 19:52:54,259 INFO L87 Difference]: Start difference. First operand 174 states and 228 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) 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:52:54,283 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Ended with exit code 0 [2025-03-17 19:52:54,288 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Forceful destruction successful, exit code 0 [2025-03-17 19:52:54,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:52:54,336 INFO L93 Difference]: Finished difference Result 386 states and 489 transitions. [2025-03-17 19:52:54,336 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 386 states and 489 transitions. [2025-03-17 19:52:54,338 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 86 [2025-03-17 19:52:54,340 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 386 states to 370 states and 471 transitions. [2025-03-17 19:52:54,340 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 122 [2025-03-17 19:52:54,340 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 122 [2025-03-17 19:52:54,340 INFO L73 IsDeterministic]: Start isDeterministic. Operand 370 states and 471 transitions. [2025-03-17 19:52:54,340 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:52:54,340 INFO L218 hiAutomatonCegarLoop]: Abstraction has 370 states and 471 transitions. [2025-03-17 19:52:54,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states and 471 transitions. [2025-03-17 19:52:54,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 304. [2025-03-17 19:52:54,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 304 states have (on average 1.2828947368421053) internal successors, (390), 303 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:52:54,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 390 transitions. [2025-03-17 19:52:54,344 INFO L240 hiAutomatonCegarLoop]: Abstraction has 304 states and 390 transitions. [2025-03-17 19:52:54,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 19:52:54,345 INFO L432 stractBuchiCegarLoop]: Abstraction has 304 states and 390 transitions. [2025-03-17 19:52:54,345 INFO L338 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2025-03-17 19:52:54,345 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 304 states and 390 transitions. [2025-03-17 19:52:54,346 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 83 [2025-03-17 19:52:54,346 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:52:54,346 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:52:54,346 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 1, 1, 1, 1] [2025-03-17 19:52:54,346 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [4, 4, 3, 3, 2, 2, 2, 2, 1, 1] [2025-03-17 19:52:54,346 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_~range~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~range~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_~range~0#1 := 20;main_~up~0#1 := 0;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1;" "assume !(0 == main_~i~0#1);" "assume main_~i~0#1 == main_~range~0#1;main_~up~0#1 := 0;" "assume !(1 == main_~up~0#1);" "assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1;" "assume !(main_~i~0#1 == main_~range~0#1 - 2);" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1;" "assume !(0 == main_~i~0#1);" "assume !(main_~i~0#1 == main_~range~0#1);" "assume !(1 == main_~up~0#1);" "assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1;" "assume !(main_~i~0#1 == main_~range~0#1 - 2);" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1;" "assume 0 == main_~i~0#1;main_~up~0#1 := 1;" [2025-03-17 19:52:54,346 INFO L754 eck$LassoCheckResult]: Loop: "assume !(main_~i~0#1 == main_~range~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume !(0 == main_~up~0#1);" "assume !(main_~i~0#1 == main_~range~0#1 - 2);" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1;" "assume !(0 == main_~i~0#1);" "assume !(main_~i~0#1 == main_~range~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume !(0 == main_~up~0#1);" "assume !(main_~i~0#1 == main_~range~0#1 - 2);" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1;" "assume !(0 == main_~i~0#1);" "assume main_~i~0#1 == main_~range~0#1;main_~up~0#1 := 0;" "assume !(1 == main_~up~0#1);" "assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1;" "assume !(main_~i~0#1 == main_~range~0#1 - 2);" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1;" "assume !(0 == main_~i~0#1);" "assume !(main_~i~0#1 == main_~range~0#1);" "assume !(1 == main_~up~0#1);" "assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1;" "assume !(main_~i~0#1 == main_~range~0#1 - 2);" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1;" "assume 0 == main_~i~0#1;main_~up~0#1 := 1;" [2025-03-17 19:52:54,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:54,346 INFO L85 PathProgramCache]: Analyzing trace with hash 1808114018, now seen corresponding path program 1 times [2025-03-17 19:52:54,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:52:54,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182367783] [2025-03-17 19:52:54,347 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:52:54,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:52:54,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-17 19:52:54,349 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-17 19:52:54,350 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:54,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:54,390 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:52:54,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:52:54,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182367783] [2025-03-17 19:52:54,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1182367783] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:52:54,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [97231352] [2025-03-17 19:52:54,390 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:52:54,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:52:54,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:54,392 INFO L229 MonitoredProcess]: Starting monitored process 86 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:52:54,394 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (86)] Waiting until timeout for monitored process [2025-03-17 19:52:54,408 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-17 19:52:54,411 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-17 19:52:54,411 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:54,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:54,411 INFO L256 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 19:52:54,411 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:52:54,427 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:52:54,427 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:52:54,464 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:52:54,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [97231352] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:52:54,465 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:52:54,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2025-03-17 19:52:54,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943444143] [2025-03-17 19:52:54,465 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:52:54,466 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-17 19:52:54,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:54,467 INFO L85 PathProgramCache]: Analyzing trace with hash 1289951949, now seen corresponding path program 1 times [2025-03-17 19:52:54,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:52:54,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191252024] [2025-03-17 19:52:54,467 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:52:54,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:52:54,469 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-17 19:52:54,472 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-17 19:52:54,473 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:54,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:54,586 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 22 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 19:52:54,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:52:54,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191252024] [2025-03-17 19:52:54,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191252024] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:52:54,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [158192613] [2025-03-17 19:52:54,586 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:52:54,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:52:54,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:54,588 INFO L229 MonitoredProcess]: Starting monitored process 87 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:52:54,589 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (87)] Waiting until timeout for monitored process [2025-03-17 19:52:54,603 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-17 19:52:54,608 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-17 19:52:54,608 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:54,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:54,608 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-17 19:52:54,608 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:52:54,645 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 28 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-17 19:52:54,645 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:52:54,668 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 28 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-17 19:52:54,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [158192613] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:52:54,668 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:52:54,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 6] total 14 [2025-03-17 19:52:54,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383206737] [2025-03-17 19:52:54,669 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:52:54,669 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-17 19:52:54,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:52:54,669 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 19:52:54,669 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-03-17 19:52:54,669 INFO L87 Difference]: Start difference. First operand 304 states and 390 transitions. cyclomatic complexity: 104 Second operand has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:52:54,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:52:54,856 INFO L93 Difference]: Finished difference Result 944 states and 1180 transitions. [2025-03-17 19:52:54,856 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 944 states and 1180 transitions. [2025-03-17 19:52:54,861 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 274 [2025-03-17 19:52:54,864 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 944 states to 910 states and 1143 transitions. [2025-03-17 19:52:54,864 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 335 [2025-03-17 19:52:54,864 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 335 [2025-03-17 19:52:54,864 INFO L73 IsDeterministic]: Start isDeterministic. Operand 910 states and 1143 transitions. [2025-03-17 19:52:54,864 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:52:54,864 INFO L218 hiAutomatonCegarLoop]: Abstraction has 910 states and 1143 transitions. [2025-03-17 19:52:54,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 910 states and 1143 transitions. [2025-03-17 19:52:54,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 910 to 548. [2025-03-17 19:52:54,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 548 states, 548 states have (on average 1.281021897810219) internal successors, (702), 547 states have internal predecessors, (702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:52:54,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 548 states and 702 transitions. [2025-03-17 19:52:54,872 INFO L240 hiAutomatonCegarLoop]: Abstraction has 548 states and 702 transitions. [2025-03-17 19:52:54,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-17 19:52:54,873 INFO L432 stractBuchiCegarLoop]: Abstraction has 548 states and 702 transitions. [2025-03-17 19:52:54,873 INFO L338 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2025-03-17 19:52:54,873 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 548 states and 702 transitions. [2025-03-17 19:52:54,875 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 177 [2025-03-17 19:52:54,875 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:52:54,875 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:52:54,876 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [6, 5, 5, 5, 3, 3, 3, 2, 1, 1] [2025-03-17 19:52:54,876 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:52:54,876 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_~range~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~range~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_~range~0#1 := 20;main_~up~0#1 := 0;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1;" "assume !(0 == main_~i~0#1);" "assume !(main_~i~0#1 == main_~range~0#1);" "assume !(1 == main_~up~0#1);" "assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1;" "assume !(0 == main_~i~0#1);" "assume main_~i~0#1 == main_~range~0#1;main_~up~0#1 := 0;" "assume !(1 == main_~up~0#1);" "assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1;" "assume !(main_~i~0#1 == main_~range~0#1 - 2);" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1;" "assume !(0 == main_~i~0#1);" "assume main_~i~0#1 == main_~range~0#1;main_~up~0#1 := 0;" "assume !(1 == main_~up~0#1);" "assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1;" "assume !(main_~i~0#1 == main_~range~0#1 - 2);" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1;" "assume !(0 == main_~i~0#1);" "assume !(main_~i~0#1 == main_~range~0#1);" "assume !(1 == main_~up~0#1);" "assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1;" "assume !(0 == main_~i~0#1);" "assume main_~i~0#1 == main_~range~0#1;main_~up~0#1 := 0;" "assume !(1 == main_~up~0#1);" "assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1;" "assume !(main_~i~0#1 == main_~range~0#1 - 2);" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1;" "assume 0 == main_~i~0#1;main_~up~0#1 := 1;" "assume !(main_~i~0#1 == main_~range~0#1);" [2025-03-17 19:52:54,876 INFO L754 eck$LassoCheckResult]: Loop: "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume !(0 == main_~up~0#1);" "assume !(main_~i~0#1 == main_~range~0#1 - 2);" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1;" "assume !(0 == main_~i~0#1);" "assume main_~i~0#1 == main_~range~0#1;main_~up~0#1 := 0;" "assume !(1 == main_~up~0#1);" "assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1;" "assume !(main_~i~0#1 == main_~range~0#1 - 2);" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1;" "assume 0 == main_~i~0#1;main_~up~0#1 := 1;" "assume !(main_~i~0#1 == main_~range~0#1);" [2025-03-17 19:52:54,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:54,876 INFO L85 PathProgramCache]: Analyzing trace with hash -2040461070, now seen corresponding path program 1 times [2025-03-17 19:52:54,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:52:54,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939638601] [2025-03-17 19:52:54,877 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:52:54,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:52:54,879 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-17 19:52:54,881 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-17 19:52:54,881 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:54,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:54,901 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-17 19:52:54,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:52:54,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939638601] [2025-03-17 19:52:54,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939638601] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:52:54,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:52:54,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 19:52:54,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707353140] [2025-03-17 19:52:54,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:52:54,902 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-17 19:52:54,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:54,902 INFO L85 PathProgramCache]: Analyzing trace with hash 999391371, now seen corresponding path program 2 times [2025-03-17 19:52:54,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:52:54,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467484996] [2025-03-17 19:52:54,902 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:52:54,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:52:54,912 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 12 statements into 2 equivalence classes. [2025-03-17 19:52:54,913 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 12 of 12 statements. [2025-03-17 19:52:54,914 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 19:52:54,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:52:54,914 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:52:54,914 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-17 19:52:54,915 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-17 19:52:54,915 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:54,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:52:54,916 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:52:54,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:52:54,962 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 19:52:54,962 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 19:52:54,962 INFO L87 Difference]: Start difference. First operand 548 states and 702 transitions. cyclomatic complexity: 174 Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:52:54,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:52:54,981 INFO L93 Difference]: Finished difference Result 536 states and 631 transitions. [2025-03-17 19:52:54,981 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 536 states and 631 transitions. [2025-03-17 19:52:54,983 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 177 [2025-03-17 19:52:54,985 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 536 states to 523 states and 613 transitions. [2025-03-17 19:52:54,985 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 178 [2025-03-17 19:52:54,985 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 178 [2025-03-17 19:52:54,985 INFO L73 IsDeterministic]: Start isDeterministic. Operand 523 states and 613 transitions. [2025-03-17 19:52:54,985 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:52:54,985 INFO L218 hiAutomatonCegarLoop]: Abstraction has 523 states and 613 transitions. [2025-03-17 19:52:54,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states and 613 transitions. [2025-03-17 19:52:54,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 507. [2025-03-17 19:52:54,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 507 states, 507 states have (on average 1.1775147928994083) internal successors, (597), 506 states have internal predecessors, (597), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:52:54,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 597 transitions. [2025-03-17 19:52:54,991 INFO L240 hiAutomatonCegarLoop]: Abstraction has 507 states and 597 transitions. [2025-03-17 19:52:54,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 19:52:54,992 INFO L432 stractBuchiCegarLoop]: Abstraction has 507 states and 597 transitions. [2025-03-17 19:52:54,992 INFO L338 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2025-03-17 19:52:54,992 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 507 states and 597 transitions. [2025-03-17 19:52:54,994 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 176 [2025-03-17 19:52:54,994 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:52:54,994 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:52:54,994 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [7, 6, 6, 6, 5, 3, 3, 1, 1, 1] [2025-03-17 19:52:54,994 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:52:54,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_~range~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~range~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_~range~0#1 := 20;main_~up~0#1 := 0;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1;" "assume !(0 == main_~i~0#1);" "assume main_~i~0#1 == main_~range~0#1;main_~up~0#1 := 0;" "assume !(1 == main_~up~0#1);" "assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1;" "assume !(main_~i~0#1 == main_~range~0#1 - 2);" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1;" "assume !(0 == main_~i~0#1);" "assume !(main_~i~0#1 == main_~range~0#1);" "assume !(1 == main_~up~0#1);" "assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1;" "assume !(0 == main_~i~0#1);" "assume !(main_~i~0#1 == main_~range~0#1);" "assume !(1 == main_~up~0#1);" "assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1;" "assume !(main_~i~0#1 == main_~range~0#1 - 2);" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1;" "assume !(0 == main_~i~0#1);" "assume !(main_~i~0#1 == main_~range~0#1);" "assume !(1 == main_~up~0#1);" "assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1;" "assume !(main_~i~0#1 == main_~range~0#1 - 2);" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1;" "assume !(0 == main_~i~0#1);" "assume !(main_~i~0#1 == main_~range~0#1);" "assume !(1 == main_~up~0#1);" "assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1;" "assume !(0 == main_~i~0#1);" "assume !(main_~i~0#1 == main_~range~0#1);" "assume !(1 == main_~up~0#1);" "assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1;" "assume 0 == main_~i~0#1;main_~up~0#1 := 1;" [2025-03-17 19:52:54,994 INFO L754 eck$LassoCheckResult]: Loop: "assume !(main_~i~0#1 == main_~range~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume !(0 == main_~up~0#1);" "assume !(main_~i~0#1 == main_~range~0#1 - 2);" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1;" "assume !(0 == main_~i~0#1);" "assume main_~i~0#1 == main_~range~0#1;main_~up~0#1 := 0;" "assume !(1 == main_~up~0#1);" "assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1;" "assume !(main_~i~0#1 == main_~range~0#1 - 2);" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1;" "assume 0 == main_~i~0#1;main_~up~0#1 := 1;" [2025-03-17 19:52:54,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:54,995 INFO L85 PathProgramCache]: Analyzing trace with hash 1634940623, now seen corresponding path program 2 times [2025-03-17 19:52:54,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:52:54,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919559904] [2025-03-17 19:52:54,995 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:52:54,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:52:54,998 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 39 statements into 2 equivalence classes. [2025-03-17 19:52:55,000 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 39 of 39 statements. [2025-03-17 19:52:55,000 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 19:52:55,000 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:55,069 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 86 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-17 19:52:55,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:52:55,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919559904] [2025-03-17 19:52:55,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919559904] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:52:55,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [961981539] [2025-03-17 19:52:55,069 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:52:55,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:52:55,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:55,071 INFO L229 MonitoredProcess]: Starting monitored process 88 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:52:55,072 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (88)] Waiting until timeout for monitored process [2025-03-17 19:52:55,088 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 39 statements into 2 equivalence classes. [2025-03-17 19:52:55,094 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 39 of 39 statements. [2025-03-17 19:52:55,095 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 19:52:55,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:55,095 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 19:52:55,096 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:52:55,164 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-17 19:52:55,165 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 19:52:55,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [961981539] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:52:55,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 19:52:55,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 14 [2025-03-17 19:52:55,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952652769] [2025-03-17 19:52:55,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:52:55,165 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-17 19:52:55,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:55,166 INFO L85 PathProgramCache]: Analyzing trace with hash -1574342857, now seen corresponding path program 3 times [2025-03-17 19:52:55,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:52:55,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119108153] [2025-03-17 19:52:55,166 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 19:52:55,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:52:55,167 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 12 statements into 2 equivalence classes. [2025-03-17 19:52:55,170 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 12 of 12 statements. [2025-03-17 19:52:55,170 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-17 19:52:55,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:52:55,170 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:52:55,170 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-17 19:52:55,171 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-17 19:52:55,171 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:55,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:52:55,172 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:52:55,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:52:55,210 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 19:52:55,210 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2025-03-17 19:52:55,211 INFO L87 Difference]: Start difference. First operand 507 states and 597 transitions. cyclomatic complexity: 110 Second operand has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:52:55,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:52:55,247 INFO L93 Difference]: Finished difference Result 653 states and 717 transitions. [2025-03-17 19:52:55,247 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 653 states and 717 transitions. [2025-03-17 19:52:55,250 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 149 [2025-03-17 19:52:55,252 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 653 states to 646 states and 710 transitions. [2025-03-17 19:52:55,252 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 182 [2025-03-17 19:52:55,252 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 182 [2025-03-17 19:52:55,252 INFO L73 IsDeterministic]: Start isDeterministic. Operand 646 states and 710 transitions. [2025-03-17 19:52:55,253 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:52:55,253 INFO L218 hiAutomatonCegarLoop]: Abstraction has 646 states and 710 transitions. [2025-03-17 19:52:55,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 646 states and 710 transitions. [2025-03-17 19:52:55,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 646 to 527. [2025-03-17 19:52:55,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 527 states, 527 states have (on average 1.1157495256166983) internal successors, (588), 526 states have internal predecessors, (588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:52:55,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 588 transitions. [2025-03-17 19:52:55,258 INFO L240 hiAutomatonCegarLoop]: Abstraction has 527 states and 588 transitions. [2025-03-17 19:52:55,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 19:52:55,262 INFO L432 stractBuchiCegarLoop]: Abstraction has 527 states and 588 transitions. [2025-03-17 19:52:55,262 INFO L338 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2025-03-17 19:52:55,262 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 527 states and 588 transitions. [2025-03-17 19:52:55,264 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 142 [2025-03-17 19:52:55,264 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:52:55,264 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:52:55,264 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [7, 6, 6, 6, 5, 5, 1, 1, 1, 1] [2025-03-17 19:52:55,264 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:52:55,265 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_~range~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~range~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_~range~0#1 := 20;main_~up~0#1 := 0;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1;" "assume !(0 == main_~i~0#1);" "assume main_~i~0#1 == main_~range~0#1;main_~up~0#1 := 0;" "assume !(1 == main_~up~0#1);" "assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1;" "assume !(main_~i~0#1 == main_~range~0#1 - 2);" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1;" "assume !(0 == main_~i~0#1);" "assume !(main_~i~0#1 == main_~range~0#1);" "assume !(1 == main_~up~0#1);" "assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1;" "assume !(0 == main_~i~0#1);" "assume !(main_~i~0#1 == main_~range~0#1);" "assume !(1 == main_~up~0#1);" "assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1;" "assume !(0 == main_~i~0#1);" "assume !(main_~i~0#1 == main_~range~0#1);" "assume !(1 == main_~up~0#1);" "assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1;" "assume !(0 == main_~i~0#1);" "assume !(main_~i~0#1 == main_~range~0#1);" "assume !(1 == main_~up~0#1);" "assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1;" "assume !(0 == main_~i~0#1);" "assume !(main_~i~0#1 == main_~range~0#1);" "assume !(1 == main_~up~0#1);" "assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1;" "assume 0 == main_~i~0#1;main_~up~0#1 := 1;" [2025-03-17 19:52:55,265 INFO L754 eck$LassoCheckResult]: Loop: "assume !(main_~i~0#1 == main_~range~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume !(0 == main_~up~0#1);" "assume !(main_~i~0#1 == main_~range~0#1 - 2);" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1;" "assume !(0 == main_~i~0#1);" "assume main_~i~0#1 == main_~range~0#1;main_~up~0#1 := 0;" "assume !(1 == main_~up~0#1);" "assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1;" "assume !(main_~i~0#1 == main_~range~0#1 - 2);" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1;" "assume 0 == main_~i~0#1;main_~up~0#1 := 1;" [2025-03-17 19:52:55,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:55,265 INFO L85 PathProgramCache]: Analyzing trace with hash -83962099, now seen corresponding path program 3 times [2025-03-17 19:52:55,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:52:55,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638077743] [2025-03-17 19:52:55,265 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 19:52:55,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:52:55,267 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 39 statements into 7 equivalence classes. [2025-03-17 19:52:55,270 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 33 of 39 statements. [2025-03-17 19:52:55,270 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-03-17 19:52:55,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:55,323 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-17 19:52:55,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:52:55,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638077743] [2025-03-17 19:52:55,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638077743] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:52:55,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [541219162] [2025-03-17 19:52:55,324 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 19:52:55,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:52:55,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:55,327 INFO L229 MonitoredProcess]: Starting monitored process 89 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:52:55,328 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (89)] Waiting until timeout for monitored process [2025-03-17 19:52:55,345 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 39 statements into 7 equivalence classes. [2025-03-17 19:52:55,353 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 33 of 39 statements. [2025-03-17 19:52:55,353 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-03-17 19:52:55,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:55,353 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-17 19:52:55,354 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:52:55,403 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-17 19:52:55,403 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:52:55,485 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-17 19:52:55,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [541219162] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:52:55,485 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:52:55,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2025-03-17 19:52:55,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256298778] [2025-03-17 19:52:55,485 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:52:55,486 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-17 19:52:55,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:55,486 INFO L85 PathProgramCache]: Analyzing trace with hash -1574342857, now seen corresponding path program 4 times [2025-03-17 19:52:55,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:52:55,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027651477] [2025-03-17 19:52:55,486 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 19:52:55,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:52:55,488 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 12 statements into 2 equivalence classes. [2025-03-17 19:52:55,489 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 12 of 12 statements. [2025-03-17 19:52:55,489 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 19:52:55,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:52:55,489 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:52:55,489 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-17 19:52:55,490 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-17 19:52:55,490 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:55,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:52:55,491 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:52:55,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:52:55,534 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-17 19:52:55,534 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2025-03-17 19:52:55,534 INFO L87 Difference]: Start difference. First operand 527 states and 588 transitions. cyclomatic complexity: 83 Second operand has 16 states, 15 states have (on average 5.533333333333333) internal successors, (83), 15 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:52:55,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:52:55,980 INFO L93 Difference]: Finished difference Result 2578 states and 2727 transitions. [2025-03-17 19:52:55,980 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2578 states and 2727 transitions. [2025-03-17 19:52:55,990 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 382 [2025-03-17 19:52:55,996 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2578 states to 2418 states and 2567 transitions. [2025-03-17 19:52:55,997 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 789 [2025-03-17 19:52:55,997 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 789 [2025-03-17 19:52:55,997 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2418 states and 2567 transitions. [2025-03-17 19:52:55,997 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:52:55,997 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2418 states and 2567 transitions. [2025-03-17 19:52:55,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2418 states and 2567 transitions. [2025-03-17 19:52:56,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2418 to 1965. [2025-03-17 19:52:56,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1965 states, 1965 states have (on average 1.0712468193384224) internal successors, (2105), 1964 states have internal predecessors, (2105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:52:56,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1965 states to 1965 states and 2105 transitions. [2025-03-17 19:52:56,016 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1965 states and 2105 transitions. [2025-03-17 19:52:56,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2025-03-17 19:52:56,019 INFO L432 stractBuchiCegarLoop]: Abstraction has 1965 states and 2105 transitions. [2025-03-17 19:52:56,019 INFO L338 stractBuchiCegarLoop]: ======== Iteration 14 ============ [2025-03-17 19:52:56,019 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1965 states and 2105 transitions. [2025-03-17 19:52:56,025 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 274 [2025-03-17 19:52:56,025 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:52:56,025 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:52:56,026 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [13, 12, 12, 12, 11, 11, 1, 1, 1, 1] [2025-03-17 19:52:56,026 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:52:56,026 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_~range~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~range~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_~range~0#1 := 20;main_~up~0#1 := 0;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1;" "assume !(0 == main_~i~0#1);" "assume main_~i~0#1 == main_~range~0#1;main_~up~0#1 := 0;" "assume !(1 == main_~up~0#1);" "assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1;" "assume !(main_~i~0#1 == main_~range~0#1 - 2);" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1;" "assume !(0 == main_~i~0#1);" "assume !(main_~i~0#1 == main_~range~0#1);" "assume !(1 == main_~up~0#1);" "assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1;" "assume !(0 == main_~i~0#1);" "assume !(main_~i~0#1 == main_~range~0#1);" "assume !(1 == main_~up~0#1);" "assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1;" "assume !(0 == main_~i~0#1);" "assume !(main_~i~0#1 == main_~range~0#1);" "assume !(1 == main_~up~0#1);" "assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1;" "assume !(0 == main_~i~0#1);" "assume !(main_~i~0#1 == main_~range~0#1);" "assume !(1 == main_~up~0#1);" "assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1;" "assume !(0 == main_~i~0#1);" "assume !(main_~i~0#1 == main_~range~0#1);" "assume !(1 == main_~up~0#1);" "assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1;" "assume !(0 == main_~i~0#1);" "assume !(main_~i~0#1 == main_~range~0#1);" "assume !(1 == main_~up~0#1);" "assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1;" "assume !(0 == main_~i~0#1);" "assume !(main_~i~0#1 == main_~range~0#1);" "assume !(1 == main_~up~0#1);" "assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1;" "assume !(0 == main_~i~0#1);" "assume !(main_~i~0#1 == main_~range~0#1);" "assume !(1 == main_~up~0#1);" "assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1;" "assume !(0 == main_~i~0#1);" "assume !(main_~i~0#1 == main_~range~0#1);" "assume !(1 == main_~up~0#1);" "assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1;" "assume !(0 == main_~i~0#1);" "assume !(main_~i~0#1 == main_~range~0#1);" "assume !(1 == main_~up~0#1);" "assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1;" "assume !(0 == main_~i~0#1);" "assume !(main_~i~0#1 == main_~range~0#1);" "assume !(1 == main_~up~0#1);" "assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1;" "assume 0 == main_~i~0#1;main_~up~0#1 := 1;" [2025-03-17 19:52:56,026 INFO L754 eck$LassoCheckResult]: Loop: "assume !(main_~i~0#1 == main_~range~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume !(0 == main_~up~0#1);" "assume !(main_~i~0#1 == main_~range~0#1 - 2);" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1;" "assume !(0 == main_~i~0#1);" "assume main_~i~0#1 == main_~range~0#1;main_~up~0#1 := 0;" "assume !(1 == main_~up~0#1);" "assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1;" "assume !(main_~i~0#1 == main_~range~0#1 - 2);" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1;" "assume 0 == main_~i~0#1;main_~up~0#1 := 1;" [2025-03-17 19:52:56,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:56,027 INFO L85 PathProgramCache]: Analyzing trace with hash 351188399, now seen corresponding path program 4 times [2025-03-17 19:52:56,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:52:56,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617622197] [2025-03-17 19:52:56,027 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 19:52:56,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:52:56,041 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 75 statements into 2 equivalence classes. [2025-03-17 19:52:56,050 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 75 of 75 statements. [2025-03-17 19:52:56,052 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 19:52:56,052 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:56,270 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:52:56,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:52:56,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617622197] [2025-03-17 19:52:56,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617622197] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:52:56,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [262797514] [2025-03-17 19:52:56,270 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 19:52:56,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:52:56,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:56,293 INFO L229 MonitoredProcess]: Starting monitored process 90 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:52:56,294 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (90)] Waiting until timeout for monitored process [2025-03-17 19:52:56,324 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 75 statements into 2 equivalence classes. [2025-03-17 19:52:56,338 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 75 of 75 statements. [2025-03-17 19:52:56,338 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 19:52:56,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:56,339 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-17 19:52:56,340 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:52:56,629 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:52:56,629 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:52:57,092 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:52:57,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [262797514] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:52:57,093 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:52:57,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 22 [2025-03-17 19:52:57,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097716338] [2025-03-17 19:52:57,093 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:52:57,093 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-17 19:52:57,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:57,095 INFO L85 PathProgramCache]: Analyzing trace with hash -1574342857, now seen corresponding path program 5 times [2025-03-17 19:52:57,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:52:57,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025987761] [2025-03-17 19:52:57,095 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 19:52:57,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:52:57,098 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 12 statements into 2 equivalence classes. [2025-03-17 19:52:57,099 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 12 of 12 statements. [2025-03-17 19:52:57,099 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 19:52:57,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:52:57,099 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:52:57,101 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-17 19:52:57,102 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-17 19:52:57,102 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:57,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:52:57,103 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:52:57,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:52:57,155 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-17 19:52:57,155 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2025-03-17 19:52:57,155 INFO L87 Difference]: Start difference. First operand 1965 states and 2105 transitions. cyclomatic complexity: 191 Second operand has 24 states, 23 states have (on average 5.3478260869565215) internal successors, (123), 23 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:52:58,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:52:58,038 INFO L93 Difference]: Finished difference Result 9798 states and 10274 transitions. [2025-03-17 19:52:58,038 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9798 states and 10274 transitions. [2025-03-17 19:52:58,100 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 1755 [2025-03-17 19:52:58,145 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9798 states to 9522 states and 9998 transitions. [2025-03-17 19:52:58,146 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3890 [2025-03-17 19:52:58,148 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3890 [2025-03-17 19:52:58,148 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9522 states and 9998 transitions. [2025-03-17 19:52:58,148 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:52:58,148 INFO L218 hiAutomatonCegarLoop]: Abstraction has 9522 states and 9998 transitions. [2025-03-17 19:52:58,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9522 states and 9998 transitions. [2025-03-17 19:52:58,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9522 to 3789. [2025-03-17 19:52:58,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3789 states, 3789 states have (on average 1.0591185009237265) internal successors, (4013), 3788 states have internal predecessors, (4013), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:52:58,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3789 states to 3789 states and 4013 transitions. [2025-03-17 19:52:58,238 INFO L240 hiAutomatonCegarLoop]: Abstraction has 3789 states and 4013 transitions. [2025-03-17 19:52:58,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2025-03-17 19:52:58,239 INFO L432 stractBuchiCegarLoop]: Abstraction has 3789 states and 4013 transitions. [2025-03-17 19:52:58,239 INFO L338 stractBuchiCegarLoop]: ======== Iteration 15 ============ [2025-03-17 19:52:58,239 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3789 states and 4013 transitions. [2025-03-17 19:52:58,252 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 748 [2025-03-17 19:52:58,252 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:52:58,252 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:52:58,254 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [21, 20, 20, 20, 19, 19, 1, 1, 1, 1] [2025-03-17 19:52:58,254 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:52:58,254 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_~range~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~range~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_~range~0#1 := 20;main_~up~0#1 := 0;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1;" "assume !(0 == main_~i~0#1);" "assume main_~i~0#1 == main_~range~0#1;main_~up~0#1 := 0;" "assume !(1 == main_~up~0#1);" "assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1;" "assume !(main_~i~0#1 == main_~range~0#1 - 2);" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1;" "assume !(0 == main_~i~0#1);" "assume !(main_~i~0#1 == main_~range~0#1);" "assume !(1 == main_~up~0#1);" "assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1;" "assume !(0 == main_~i~0#1);" "assume !(main_~i~0#1 == main_~range~0#1);" "assume !(1 == main_~up~0#1);" "assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1;" "assume !(0 == main_~i~0#1);" "assume !(main_~i~0#1 == main_~range~0#1);" "assume !(1 == main_~up~0#1);" "assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1;" "assume !(0 == main_~i~0#1);" "assume !(main_~i~0#1 == main_~range~0#1);" "assume !(1 == main_~up~0#1);" "assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1;" "assume !(0 == main_~i~0#1);" "assume !(main_~i~0#1 == main_~range~0#1);" "assume !(1 == main_~up~0#1);" "assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1;" "assume !(0 == main_~i~0#1);" "assume !(main_~i~0#1 == main_~range~0#1);" "assume !(1 == main_~up~0#1);" "assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1;" "assume !(0 == main_~i~0#1);" "assume !(main_~i~0#1 == main_~range~0#1);" "assume !(1 == main_~up~0#1);" "assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1;" "assume !(0 == main_~i~0#1);" "assume !(main_~i~0#1 == main_~range~0#1);" "assume !(1 == main_~up~0#1);" "assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1;" "assume !(0 == main_~i~0#1);" "assume !(main_~i~0#1 == main_~range~0#1);" "assume !(1 == main_~up~0#1);" "assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1;" "assume !(0 == main_~i~0#1);" "assume !(main_~i~0#1 == main_~range~0#1);" "assume !(1 == main_~up~0#1);" "assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1;" "assume !(0 == main_~i~0#1);" "assume !(main_~i~0#1 == main_~range~0#1);" "assume !(1 == main_~up~0#1);" "assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1;" "assume !(0 == main_~i~0#1);" "assume !(main_~i~0#1 == main_~range~0#1);" "assume !(1 == main_~up~0#1);" "assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1;" "assume !(0 == main_~i~0#1);" "assume !(main_~i~0#1 == main_~range~0#1);" "assume !(1 == main_~up~0#1);" "assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1;" "assume !(0 == main_~i~0#1);" "assume !(main_~i~0#1 == main_~range~0#1);" "assume !(1 == main_~up~0#1);" "assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1;" "assume !(0 == main_~i~0#1);" "assume !(main_~i~0#1 == main_~range~0#1);" "assume !(1 == main_~up~0#1);" "assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1;" "assume !(0 == main_~i~0#1);" "assume !(main_~i~0#1 == main_~range~0#1);" "assume !(1 == main_~up~0#1);" "assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1;" "assume !(0 == main_~i~0#1);" "assume !(main_~i~0#1 == main_~range~0#1);" "assume !(1 == main_~up~0#1);" "assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1;" "assume !(0 == main_~i~0#1);" "assume !(main_~i~0#1 == main_~range~0#1);" "assume !(1 == main_~up~0#1);" "assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1;" "assume !(0 == main_~i~0#1);" "assume !(main_~i~0#1 == main_~range~0#1);" "assume !(1 == main_~up~0#1);" "assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1;" "assume 0 == main_~i~0#1;main_~up~0#1 := 1;" [2025-03-17 19:52:58,254 INFO L754 eck$LassoCheckResult]: Loop: "assume !(main_~i~0#1 == main_~range~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume !(0 == main_~up~0#1);" "assume !(main_~i~0#1 == main_~range~0#1 - 2);" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1;" "assume !(0 == main_~i~0#1);" "assume main_~i~0#1 == main_~range~0#1;main_~up~0#1 := 0;" "assume !(1 == main_~up~0#1);" "assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1;" "assume !(main_~i~0#1 == main_~range~0#1 - 2);" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1;" "assume 0 == main_~i~0#1;main_~up~0#1 := 1;" [2025-03-17 19:52:58,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:58,254 INFO L85 PathProgramCache]: Analyzing trace with hash 1742540935, now seen corresponding path program 5 times [2025-03-17 19:52:58,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:52:58,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227990917] [2025-03-17 19:52:58,255 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 19:52:58,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:52:58,259 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 123 statements into 21 equivalence classes. [2025-03-17 19:52:58,271 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 21 check-sat command(s) and asserted 123 of 123 statements. [2025-03-17 19:52:58,271 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 21 check-sat command(s) [2025-03-17 19:52:58,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:52:58,272 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:52:58,274 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-17 19:52:58,283 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-17 19:52:58,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:58,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:52:58,286 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:52:58,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:58,286 INFO L85 PathProgramCache]: Analyzing trace with hash -1574342857, now seen corresponding path program 6 times [2025-03-17 19:52:58,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:52:58,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691605215] [2025-03-17 19:52:58,286 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-17 19:52:58,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:52:58,288 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 12 statements into 2 equivalence classes. [2025-03-17 19:52:58,290 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 12 of 12 statements. [2025-03-17 19:52:58,290 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-03-17 19:52:58,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:52:58,290 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:52:58,290 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-17 19:52:58,291 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-17 19:52:58,291 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:58,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:52:58,292 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:52:58,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:58,292 INFO L85 PathProgramCache]: Analyzing trace with hash 797173437, now seen corresponding path program 1 times [2025-03-17 19:52:58,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:52:58,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160273240] [2025-03-17 19:52:58,292 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:52:58,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:52:58,296 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-17 19:52:58,305 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-17 19:52:58,305 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:58,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:52:58,306 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:52:58,308 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-17 19:52:58,318 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-17 19:52:58,318 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:58,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:52:58,343 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:52:59,291 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-17 19:52:59,303 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-17 19:52:59,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:59,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:52:59,303 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:52:59,307 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-17 19:52:59,317 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-17 19:52:59,317 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:59,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:52:59,414 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 17.03 07:52:59 BoogieIcfgContainer [2025-03-17 19:52:59,414 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-03-17 19:52:59,415 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 19:52:59,415 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 19:52:59,415 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 19:52:59,415 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 07:52:47" (3/4) ... [2025-03-17 19:52:59,421 INFO L143 WitnessPrinter]: Generating witness for non-termination counterexample [2025-03-17 19:52:59,473 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-17 19:52:59,473 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 19:52:59,474 INFO L158 Benchmark]: Toolchain (without parser) took 12267.58ms. Allocated memory was 142.6MB in the beginning and 192.9MB in the end (delta: 50.3MB). Free memory was 111.5MB in the beginning and 111.1MB in the end (delta: 476.4kB). Peak memory consumption was 45.8MB. Max. memory is 16.1GB. [2025-03-17 19:52:59,474 INFO L158 Benchmark]: CDTParser took 0.64ms. Allocated memory is still 201.3MB. Free memory is still 126.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 19:52:59,474 INFO L158 Benchmark]: CACSL2BoogieTranslator took 150.65ms. Allocated memory is still 142.6MB. Free memory was 111.5MB in the beginning and 101.8MB in the end (delta: 9.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 19:52:59,474 INFO L158 Benchmark]: Boogie Procedure Inliner took 16.48ms. Allocated memory is still 142.6MB. Free memory was 101.8MB in the beginning and 100.6MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 19:52:59,474 INFO L158 Benchmark]: Boogie Preprocessor took 12.80ms. Allocated memory is still 142.6MB. Free memory was 100.6MB in the beginning and 99.9MB in the end (delta: 696.5kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 19:52:59,474 INFO L158 Benchmark]: IcfgBuilder took 182.96ms. Allocated memory is still 142.6MB. Free memory was 99.9MB in the beginning and 90.1MB in the end (delta: 9.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 19:52:59,475 INFO L158 Benchmark]: BuchiAutomizer took 11841.60ms. Allocated memory was 142.6MB in the beginning and 192.9MB in the end (delta: 50.3MB). Free memory was 90.1MB in the beginning and 117.5MB in the end (delta: -27.4MB). Peak memory consumption was 29.0MB. Max. memory is 16.1GB. [2025-03-17 19:52:59,475 INFO L158 Benchmark]: Witness Printer took 58.31ms. Allocated memory is still 192.9MB. Free memory was 117.5MB in the beginning and 111.1MB in the end (delta: 6.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 19:52:59,476 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.64ms. Allocated memory is still 201.3MB. Free memory is still 126.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 150.65ms. Allocated memory is still 142.6MB. Free memory was 111.5MB in the beginning and 101.8MB in the end (delta: 9.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 16.48ms. Allocated memory is still 142.6MB. Free memory was 101.8MB in the beginning and 100.6MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 12.80ms. Allocated memory is still 142.6MB. Free memory was 100.6MB in the beginning and 99.9MB in the end (delta: 696.5kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 182.96ms. Allocated memory is still 142.6MB. Free memory was 99.9MB in the beginning and 90.1MB in the end (delta: 9.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * BuchiAutomizer took 11841.60ms. Allocated memory was 142.6MB in the beginning and 192.9MB in the end (delta: 50.3MB). Free memory was 90.1MB in the beginning and 117.5MB in the end (delta: -27.4MB). Peak memory consumption was 29.0MB. Max. memory is 16.1GB. * Witness Printer took 58.31ms. Allocated memory is still 192.9MB. Free memory was 117.5MB in the beginning and 111.1MB in the end (delta: 6.4MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 17 terminating modules (12 trivial, 4 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 ((long) -1 * i) and consists of 4 locations. One deterministic module has affine ranking function (((long) -1 * i) + range) and consists of 4 locations. One deterministic module has affine ranking function i and consists of 4 locations. One nondeterministic module has affine ranking function (((long) -1 * i) + range) and consists of 4 locations. 12 modules have a trivial ranking function, the largest among these consists of 24 locations. The remainder module has 3789 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 11.7s and 15 iterations. TraceHistogramMax:21. Analysis of lassos took 8.5s. Construction of modules took 0.7s. Büchi inclusion checks took 2.3s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 15. Automata minimization 0.2s AutomataMinimizationTime, 17 MinimizatonAttempts, 6951 StatesRemovedByMinimization, 15 NontrivialMinimizations. Non-live state removal took 0.1s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [4, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 765 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 758 mSDsluCounter, 422 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 238 mSDsCounter, 141 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1144 IncrementalHoareTripleChecker+Invalid, 1285 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 141 mSolverCounterUnsat, 184 mSDtfsCounter, 1144 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI2 SFLT2 conc2 concLT1 SILN4 SILU0 SILI1 SILT2 lasso0 LassoPreprocessingBenchmarks: Lassos: inital27 mio100 ax143 hnf100 lsp51 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq176 hnf97 smp72 dnf138 smp87 tf108 neg100 sie114 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 3 Time: 64ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 6 MotzkinApplications: 18 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 10 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 6 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.8s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - LassoShapedNonTerminationArgument [Line: 17]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L6] int i; [L7] int range; [L8] int up; [L9] i = __VERIFIER_nondet_int() [L10] range = 20 [L11] up = 0 VAL [range=20, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=20, range=20, up=0] [L14] COND FALSE !(i == 0) VAL [i=20, range=20, up=0] [L17] COND TRUE i == range [L18] up = 0 VAL [i=20, range=20, up=0] [L20] COND FALSE !(up == 1) VAL [i=20, range=20, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=19, range=20, up=0] [L26] COND FALSE !(i == range-2) VAL [i=19, range=20, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=19, range=20, up=0] [L14] COND FALSE !(i == 0) VAL [i=19, range=20, up=0] [L17] COND FALSE !(i == range) VAL [i=19, range=20, up=0] [L20] COND FALSE !(up == 1) VAL [i=19, range=20, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=18, range=20, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=18, range=19, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=18, range=19, up=0] [L14] COND FALSE !(i == 0) VAL [i=18, range=19, up=0] [L17] COND FALSE !(i == range) VAL [i=18, range=19, up=0] [L20] COND FALSE !(up == 1) VAL [i=18, range=19, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=17, range=19, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=17, range=18, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=17, range=18, up=0] [L14] COND FALSE !(i == 0) VAL [i=17, range=18, up=0] [L17] COND FALSE !(i == range) VAL [i=17, range=18, up=0] [L20] COND FALSE !(up == 1) VAL [i=17, range=18, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=16, range=18, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=16, range=17, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=16, range=17, up=0] [L14] COND FALSE !(i == 0) VAL [i=16, range=17, up=0] [L17] COND FALSE !(i == range) VAL [i=16, range=17, up=0] [L20] COND FALSE !(up == 1) VAL [i=16, range=17, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=15, range=17, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=15, range=16, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=15, range=16, up=0] [L14] COND FALSE !(i == 0) VAL [i=15, range=16, up=0] [L17] COND FALSE !(i == range) VAL [i=15, range=16, up=0] [L20] COND FALSE !(up == 1) VAL [i=15, range=16, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=14, range=16, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=14, range=15, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=14, range=15, up=0] [L14] COND FALSE !(i == 0) VAL [i=14, range=15, up=0] [L17] COND FALSE !(i == range) VAL [i=14, range=15, up=0] [L20] COND FALSE !(up == 1) VAL [i=14, range=15, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=13, range=15, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=13, range=14, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=13, range=14, up=0] [L14] COND FALSE !(i == 0) VAL [i=13, range=14, up=0] [L17] COND FALSE !(i == range) VAL [i=13, range=14, up=0] [L20] COND FALSE !(up == 1) VAL [i=13, range=14, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=12, range=14, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=12, range=13, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=12, range=13, up=0] [L14] COND FALSE !(i == 0) VAL [i=12, range=13, up=0] [L17] COND FALSE !(i == range) VAL [i=12, range=13, up=0] [L20] COND FALSE !(up == 1) VAL [i=12, range=13, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=11, range=13, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=11, range=12, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=11, range=12, up=0] [L14] COND FALSE !(i == 0) VAL [i=11, range=12, up=0] [L17] COND FALSE !(i == range) VAL [i=11, range=12, up=0] [L20] COND FALSE !(up == 1) VAL [i=11, range=12, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=10, range=12, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=10, range=11, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=10, range=11, up=0] [L14] COND FALSE !(i == 0) VAL [i=10, range=11, up=0] [L17] COND FALSE !(i == range) VAL [i=10, range=11, up=0] [L20] COND FALSE !(up == 1) VAL [i=10, range=11, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=9, range=11, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=9, range=10, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=9, range=10, up=0] [L14] COND FALSE !(i == 0) VAL [i=9, range=10, up=0] [L17] COND FALSE !(i == range) VAL [i=9, range=10, up=0] [L20] COND FALSE !(up == 1) VAL [i=9, range=10, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=8, range=10, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=8, range=9, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=8, range=9, up=0] [L14] COND FALSE !(i == 0) VAL [i=8, range=9, up=0] [L17] COND FALSE !(i == range) VAL [i=8, range=9, up=0] [L20] COND FALSE !(up == 1) VAL [i=8, range=9, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=7, range=9, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=7, range=8, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=7, range=8, up=0] [L14] COND FALSE !(i == 0) VAL [i=7, range=8, up=0] [L17] COND FALSE !(i == range) VAL [i=7, range=8, up=0] [L20] COND FALSE !(up == 1) VAL [i=7, range=8, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=6, range=8, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=6, range=7, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=6, range=7, up=0] [L14] COND FALSE !(i == 0) VAL [i=6, range=7, up=0] [L17] COND FALSE !(i == range) VAL [i=6, range=7, up=0] [L20] COND FALSE !(up == 1) VAL [i=6, range=7, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=5, range=7, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=5, range=6, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=5, range=6, up=0] [L14] COND FALSE !(i == 0) VAL [i=5, range=6, up=0] [L17] COND FALSE !(i == range) VAL [i=5, range=6, up=0] [L20] COND FALSE !(up == 1) VAL [i=5, range=6, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=4, range=6, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=4, range=5, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=4, range=5, up=0] [L14] COND FALSE !(i == 0) VAL [i=4, range=5, up=0] [L17] COND FALSE !(i == range) VAL [i=4, range=5, up=0] [L20] COND FALSE !(up == 1) VAL [i=4, range=5, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=3, range=5, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=3, range=4, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=3, range=4, up=0] [L14] COND FALSE !(i == 0) VAL [i=3, range=4, up=0] [L17] COND FALSE !(i == range) VAL [i=3, range=4, up=0] [L20] COND FALSE !(up == 1) VAL [i=3, range=4, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=2, range=4, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=2, range=3, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=2, range=3, up=0] [L14] COND FALSE !(i == 0) VAL [i=2, range=3, up=0] [L17] COND FALSE !(i == range) VAL [i=2, range=3, up=0] [L20] COND FALSE !(up == 1) VAL [i=2, range=3, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=1, range=3, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=1, range=2, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=1, range=2, up=0] [L14] COND FALSE !(i == 0) VAL [i=1, range=2, up=0] [L17] COND FALSE !(i == range) VAL [i=1, range=2, up=0] [L20] COND FALSE !(up == 1) VAL [i=1, range=2, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=0, range=2, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=0, range=1, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=0, range=1, up=0] [L14] COND TRUE i == 0 [L15] up = 1 VAL [i=0, range=1, up=1] Loop: [L17] COND FALSE !(i == range) [L20] COND TRUE up == 1 [L21] i = i+1 [L23] COND FALSE !(up == 0) [L26] COND FALSE !(i == range-2) [L13] COND TRUE 0 <= i && i <= range [L14] COND FALSE !(i == 0) [L17] COND TRUE i == range [L18] up = 0 [L20] COND FALSE !(up == 1) [L23] COND TRUE up == 0 [L24] i = i-1 [L26] COND FALSE !(i == range-2) [L13] COND TRUE 0 <= i && i <= range [L14] COND TRUE i == 0 [L15] up = 1 End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 17]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L6] int i; [L7] int range; [L8] int up; [L9] i = __VERIFIER_nondet_int() [L10] range = 20 [L11] up = 0 VAL [range=20, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=20, range=20, up=0] [L14] COND FALSE !(i == 0) VAL [i=20, range=20, up=0] [L17] COND TRUE i == range [L18] up = 0 VAL [i=20, range=20, up=0] [L20] COND FALSE !(up == 1) VAL [i=20, range=20, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=19, range=20, up=0] [L26] COND FALSE !(i == range-2) VAL [i=19, range=20, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=19, range=20, up=0] [L14] COND FALSE !(i == 0) VAL [i=19, range=20, up=0] [L17] COND FALSE !(i == range) VAL [i=19, range=20, up=0] [L20] COND FALSE !(up == 1) VAL [i=19, range=20, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=18, range=20, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=18, range=19, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=18, range=19, up=0] [L14] COND FALSE !(i == 0) VAL [i=18, range=19, up=0] [L17] COND FALSE !(i == range) VAL [i=18, range=19, up=0] [L20] COND FALSE !(up == 1) VAL [i=18, range=19, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=17, range=19, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=17, range=18, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=17, range=18, up=0] [L14] COND FALSE !(i == 0) VAL [i=17, range=18, up=0] [L17] COND FALSE !(i == range) VAL [i=17, range=18, up=0] [L20] COND FALSE !(up == 1) VAL [i=17, range=18, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=16, range=18, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=16, range=17, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=16, range=17, up=0] [L14] COND FALSE !(i == 0) VAL [i=16, range=17, up=0] [L17] COND FALSE !(i == range) VAL [i=16, range=17, up=0] [L20] COND FALSE !(up == 1) VAL [i=16, range=17, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=15, range=17, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=15, range=16, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=15, range=16, up=0] [L14] COND FALSE !(i == 0) VAL [i=15, range=16, up=0] [L17] COND FALSE !(i == range) VAL [i=15, range=16, up=0] [L20] COND FALSE !(up == 1) VAL [i=15, range=16, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=14, range=16, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=14, range=15, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=14, range=15, up=0] [L14] COND FALSE !(i == 0) VAL [i=14, range=15, up=0] [L17] COND FALSE !(i == range) VAL [i=14, range=15, up=0] [L20] COND FALSE !(up == 1) VAL [i=14, range=15, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=13, range=15, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=13, range=14, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=13, range=14, up=0] [L14] COND FALSE !(i == 0) VAL [i=13, range=14, up=0] [L17] COND FALSE !(i == range) VAL [i=13, range=14, up=0] [L20] COND FALSE !(up == 1) VAL [i=13, range=14, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=12, range=14, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=12, range=13, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=12, range=13, up=0] [L14] COND FALSE !(i == 0) VAL [i=12, range=13, up=0] [L17] COND FALSE !(i == range) VAL [i=12, range=13, up=0] [L20] COND FALSE !(up == 1) VAL [i=12, range=13, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=11, range=13, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=11, range=12, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=11, range=12, up=0] [L14] COND FALSE !(i == 0) VAL [i=11, range=12, up=0] [L17] COND FALSE !(i == range) VAL [i=11, range=12, up=0] [L20] COND FALSE !(up == 1) VAL [i=11, range=12, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=10, range=12, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=10, range=11, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=10, range=11, up=0] [L14] COND FALSE !(i == 0) VAL [i=10, range=11, up=0] [L17] COND FALSE !(i == range) VAL [i=10, range=11, up=0] [L20] COND FALSE !(up == 1) VAL [i=10, range=11, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=9, range=11, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=9, range=10, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=9, range=10, up=0] [L14] COND FALSE !(i == 0) VAL [i=9, range=10, up=0] [L17] COND FALSE !(i == range) VAL [i=9, range=10, up=0] [L20] COND FALSE !(up == 1) VAL [i=9, range=10, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=8, range=10, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=8, range=9, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=8, range=9, up=0] [L14] COND FALSE !(i == 0) VAL [i=8, range=9, up=0] [L17] COND FALSE !(i == range) VAL [i=8, range=9, up=0] [L20] COND FALSE !(up == 1) VAL [i=8, range=9, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=7, range=9, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=7, range=8, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=7, range=8, up=0] [L14] COND FALSE !(i == 0) VAL [i=7, range=8, up=0] [L17] COND FALSE !(i == range) VAL [i=7, range=8, up=0] [L20] COND FALSE !(up == 1) VAL [i=7, range=8, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=6, range=8, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=6, range=7, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=6, range=7, up=0] [L14] COND FALSE !(i == 0) VAL [i=6, range=7, up=0] [L17] COND FALSE !(i == range) VAL [i=6, range=7, up=0] [L20] COND FALSE !(up == 1) VAL [i=6, range=7, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=5, range=7, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=5, range=6, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=5, range=6, up=0] [L14] COND FALSE !(i == 0) VAL [i=5, range=6, up=0] [L17] COND FALSE !(i == range) VAL [i=5, range=6, up=0] [L20] COND FALSE !(up == 1) VAL [i=5, range=6, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=4, range=6, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=4, range=5, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=4, range=5, up=0] [L14] COND FALSE !(i == 0) VAL [i=4, range=5, up=0] [L17] COND FALSE !(i == range) VAL [i=4, range=5, up=0] [L20] COND FALSE !(up == 1) VAL [i=4, range=5, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=3, range=5, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=3, range=4, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=3, range=4, up=0] [L14] COND FALSE !(i == 0) VAL [i=3, range=4, up=0] [L17] COND FALSE !(i == range) VAL [i=3, range=4, up=0] [L20] COND FALSE !(up == 1) VAL [i=3, range=4, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=2, range=4, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=2, range=3, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=2, range=3, up=0] [L14] COND FALSE !(i == 0) VAL [i=2, range=3, up=0] [L17] COND FALSE !(i == range) VAL [i=2, range=3, up=0] [L20] COND FALSE !(up == 1) VAL [i=2, range=3, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=1, range=3, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=1, range=2, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=1, range=2, up=0] [L14] COND FALSE !(i == 0) VAL [i=1, range=2, up=0] [L17] COND FALSE !(i == range) VAL [i=1, range=2, up=0] [L20] COND FALSE !(up == 1) VAL [i=1, range=2, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=0, range=2, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=0, range=1, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=0, range=1, up=0] [L14] COND TRUE i == 0 [L15] up = 1 VAL [i=0, range=1, up=1] Loop: [L17] COND FALSE !(i == range) [L20] COND TRUE up == 1 [L21] i = i+1 [L23] COND FALSE !(up == 0) [L26] COND FALSE !(i == range-2) [L13] COND TRUE 0 <= i && i <= range [L14] COND FALSE !(i == 0) [L17] COND TRUE i == range [L18] up = 0 [L20] COND FALSE !(up == 1) [L23] COND TRUE up == 0 [L24] i = i-1 [L26] COND FALSE !(i == range-2) [L13] COND TRUE 0 <= i && i <= range [L14] COND TRUE i == 0 [L15] up = 1 End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2025-03-17 19:52:59,494 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (90)] Ended with exit code 0 [2025-03-17 19:52:59,691 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (89)] Forceful destruction successful, exit code 0 [2025-03-17 19:52:59,891 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (88)] Ended with exit code 0 [2025-03-17 19:53:00,091 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (87)] Ended with exit code 0 [2025-03-17 19:53:00,292 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (86)] Ended with exit code 0 [2025-03-17 19:53:00,492 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (78)] Ended with exit code 0 [2025-03-17 19:53:00,693 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM)