./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 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-restricted-15/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-?-798a7b3-m [2025-03-04 15:36:16,022 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 15:36:16,076 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2025-03-04 15:36:16,079 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 15:36:16,080 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 15:36:16,080 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2025-03-04 15:36:16,099 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 15:36:16,100 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 15:36:16,100 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 15:36:16,100 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 15:36:16,101 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 15:36:16,101 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 15:36:16,101 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 15:36:16,101 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 15:36:16,101 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-03-04 15:36:16,101 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-03-04 15:36:16,101 INFO L153 SettingsManager]: * Use old map elimination=false [2025-03-04 15:36:16,101 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-03-04 15:36:16,101 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-03-04 15:36:16,101 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-03-04 15:36:16,101 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 15:36:16,101 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-03-04 15:36:16,101 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 15:36:16,102 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 15:36:16,102 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-03-04 15:36:16,102 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-03-04 15:36:16,102 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-03-04 15:36:16,102 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 15:36:16,102 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 15:36:16,102 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-03-04 15:36:16,102 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 15:36:16,102 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 15:36:16,102 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 15:36:16,102 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 15:36:16,102 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 15:36:16,102 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 15:36:16,102 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-03-04 15:36:16,102 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-04 15:36:16,330 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 15:36:16,336 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 15:36:16,337 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 15:36:16,338 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 15:36:16,338 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 15:36:16,339 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-04 15:36:17,478 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb43bbdca/0d077d1bcc3b450faf34a5a9fa1da520/FLAG2bf1ea321 [2025-03-04 15:36:17,668 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 15:36:17,669 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-restricted-15/Narrowing.c [2025-03-04 15:36:17,674 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb43bbdca/0d077d1bcc3b450faf34a5a9fa1da520/FLAG2bf1ea321 [2025-03-04 15:36:18,057 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb43bbdca/0d077d1bcc3b450faf34a5a9fa1da520 [2025-03-04 15:36:18,059 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 15:36:18,060 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 15:36:18,063 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 15:36:18,063 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 15:36:18,066 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 15:36:18,066 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:36:18" (1/1) ... [2025-03-04 15:36:18,067 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e065841 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:36:18, skipping insertion in model container [2025-03-04 15:36:18,067 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:36:18" (1/1) ... [2025-03-04 15:36:18,075 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 15:36:18,159 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:36:18,162 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 15:36:18,170 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:36:18,178 INFO L204 MainTranslator]: Completed translation [2025-03-04 15:36:18,179 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:36:18 WrapperNode [2025-03-04 15:36:18,179 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 15:36:18,179 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 15:36:18,179 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 15:36:18,179 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 15:36:18,184 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:36:18" (1/1) ... [2025-03-04 15:36:18,186 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:36:18" (1/1) ... [2025-03-04 15:36:18,194 INFO L138 Inliner]: procedures = 4, calls = 2, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 23 [2025-03-04 15:36:18,194 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 15:36:18,195 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 15:36:18,195 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 15:36:18,195 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 15:36:18,199 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:36:18" (1/1) ... [2025-03-04 15:36:18,199 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:36:18" (1/1) ... [2025-03-04 15:36:18,200 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:36:18" (1/1) ... [2025-03-04 15:36:18,203 INFO L175 MemorySlicer]: No memory access in input program. [2025-03-04 15:36:18,203 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:36:18" (1/1) ... [2025-03-04 15:36:18,203 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:36:18" (1/1) ... [2025-03-04 15:36:18,204 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:36:18" (1/1) ... [2025-03-04 15:36:18,204 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:36:18" (1/1) ... [2025-03-04 15:36:18,205 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:36:18" (1/1) ... [2025-03-04 15:36:18,205 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:36:18" (1/1) ... [2025-03-04 15:36:18,206 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 15:36:18,206 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 15:36:18,206 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 15:36:18,206 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 15:36:18,207 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:36:18" (1/1) ... [2025-03-04 15:36:18,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:18,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:18,231 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:36:18,235 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2025-03-04 15:36:18,249 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 15:36:18,249 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 15:36:18,291 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 15:36:18,292 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 15:36:18,371 INFO L? ?]: Removed 4 outVars from TransFormulas that were not future-live. [2025-03-04 15:36:18,371 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 15:36:18,377 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 15:36:18,379 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 15:36:18,379 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:36:18 BoogieIcfgContainer [2025-03-04 15:36:18,379 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 15:36:18,380 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-03-04 15:36:18,380 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-03-04 15:36:18,384 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-03-04 15:36:18,385 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-04 15:36:18,385 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 04.03 03:36:18" (1/3) ... [2025-03-04 15:36:18,386 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2e206881 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 04.03 03:36:18, skipping insertion in model container [2025-03-04 15:36:18,386 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-04 15:36:18,386 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:36:18" (2/3) ... [2025-03-04 15:36:18,386 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2e206881 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 04.03 03:36:18, skipping insertion in model container [2025-03-04 15:36:18,387 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-04 15:36:18,387 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:36:18" (3/3) ... [2025-03-04 15:36:18,388 INFO L363 chiAutomizerObserver]: Analyzing ICFG Narrowing.c [2025-03-04 15:36:18,429 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-03-04 15:36:18,430 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-03-04 15:36:18,430 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-03-04 15:36:18,430 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-03-04 15:36:18,430 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-03-04 15:36:18,431 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-03-04 15:36:18,431 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-03-04 15:36:18,431 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-03-04 15:36:18,435 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 11 states, 10 states have (on average 1.6) internal successors, (16), 10 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:36:18,446 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2025-03-04 15:36:18,446 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:36:18,446 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:36:18,450 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-03-04 15:36:18,450 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2025-03-04 15:36:18,451 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-03-04 15:36:18,451 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 11 states, 10 states have (on average 1.6) internal successors, (16), 10 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:36:18,452 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2025-03-04 15:36:18,452 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:36:18,453 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:36:18,453 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-03-04 15:36:18,453 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2025-03-04 15:36:18,459 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-04 15:36:18,459 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-04 15:36:18,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:36:18,466 INFO L85 PathProgramCache]: Analyzing trace with hash 1440, now seen corresponding path program 1 times [2025-03-04 15:36:18,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:36:18,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141954228] [2025-03-04 15:36:18,473 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:36:18,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:36:18,526 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:36:18,529 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:36:18,530 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:18,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:36:18,531 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:36:18,532 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:36:18,534 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:36:18,535 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:18,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:36:18,546 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:36:18,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:36:18,549 INFO L85 PathProgramCache]: Analyzing trace with hash 1270116379, now seen corresponding path program 1 times [2025-03-04 15:36:18,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:36:18,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285394579] [2025-03-04 15:36:18,549 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:36:18,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:36:18,556 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:36:18,566 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:36:18,566 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:18,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:18,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:36:18,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:36:18,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285394579] [2025-03-04 15:36:18,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285394579] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:36:18,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:36:18,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:36:18,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76508492] [2025-03-04 15:36:18,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:36:18,630 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-04 15:36:18,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:36:18,648 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:36:18,649 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:36:18,650 INFO L87 Difference]: Start difference. First operand has 11 states, 10 states have (on average 1.6) internal successors, (16), 10 states have internal predecessors, (16), 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-04 15:36:18,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:36:18,671 INFO L93 Difference]: Finished difference Result 18 states and 28 transitions. [2025-03-04 15:36:18,672 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 28 transitions. [2025-03-04 15:36:18,673 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2025-03-04 15:36:18,676 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 14 states and 23 transitions. [2025-03-04 15:36:18,677 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2025-03-04 15:36:18,677 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2025-03-04 15:36:18,677 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 23 transitions. [2025-03-04 15:36:18,678 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-04 15:36:18,678 INFO L218 hiAutomatonCegarLoop]: Abstraction has 14 states and 23 transitions. [2025-03-04 15:36:18,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 23 transitions. [2025-03-04 15:36:18,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2025-03-04 15:36:18,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 13 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:36:18,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 23 transitions. [2025-03-04 15:36:18,693 INFO L240 hiAutomatonCegarLoop]: Abstraction has 14 states and 23 transitions. [2025-03-04 15:36:18,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:36:18,697 INFO L432 stractBuchiCegarLoop]: Abstraction has 14 states and 23 transitions. [2025-03-04 15:36:18,697 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-03-04 15:36:18,697 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 23 transitions. [2025-03-04 15:36:18,698 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2025-03-04 15:36:18,698 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:36:18,698 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:36:18,698 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-03-04 15:36:18,698 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2025-03-04 15:36:18,698 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-04 15:36:18,698 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;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-04 15:36:18,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:36:18,699 INFO L85 PathProgramCache]: Analyzing trace with hash 1440, now seen corresponding path program 2 times [2025-03-04 15:36:18,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:36:18,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592712011] [2025-03-04 15:36:18,699 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:36:18,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:36:18,702 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:36:18,703 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:36:18,703 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:36:18,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:36:18,703 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:36:18,704 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:36:18,705 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:36:18,705 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:18,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:36:18,706 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:36:18,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:36:18,706 INFO L85 PathProgramCache]: Analyzing trace with hash 1271040861, now seen corresponding path program 1 times [2025-03-04 15:36:18,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:36:18,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491301454] [2025-03-04 15:36:18,706 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:36:18,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:36:18,709 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:36:18,712 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:36:18,712 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:18,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:18,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:36:18,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:36:18,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491301454] [2025-03-04 15:36:18,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491301454] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:36:18,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:36:18,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:36:18,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578745793] [2025-03-04 15:36:18,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:36:18,741 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-04 15:36:18,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:36:18,741 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:36:18,741 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:36:18,742 INFO L87 Difference]: Start difference. First operand 14 states and 23 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-04 15:36:18,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:36:18,783 INFO L93 Difference]: Finished difference Result 38 states and 61 transitions. [2025-03-04 15:36:18,783 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 61 transitions. [2025-03-04 15:36:18,784 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 36 [2025-03-04 15:36:18,785 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 38 states and 61 transitions. [2025-03-04 15:36:18,785 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 38 [2025-03-04 15:36:18,785 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38 [2025-03-04 15:36:18,786 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 61 transitions. [2025-03-04 15:36:18,786 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-04 15:36:18,786 INFO L218 hiAutomatonCegarLoop]: Abstraction has 38 states and 61 transitions. [2025-03-04 15:36:18,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 61 transitions. [2025-03-04 15:36:18,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2025-03-04 15:36:18,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 38 states have (on average 1.605263157894737) internal successors, (61), 37 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:36:18,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 61 transitions. [2025-03-04 15:36:18,789 INFO L240 hiAutomatonCegarLoop]: Abstraction has 38 states and 61 transitions. [2025-03-04 15:36:18,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:36:18,789 INFO L432 stractBuchiCegarLoop]: Abstraction has 38 states and 61 transitions. [2025-03-04 15:36:18,790 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-03-04 15:36:18,790 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 61 transitions. [2025-03-04 15:36:18,790 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 36 [2025-03-04 15:36:18,790 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:36:18,790 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:36:18,791 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-03-04 15:36:18,791 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2025-03-04 15:36:18,791 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-04 15:36:18,791 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);" "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);" [2025-03-04 15:36:18,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:36:18,792 INFO L85 PathProgramCache]: Analyzing trace with hash 1440, now seen corresponding path program 3 times [2025-03-04 15:36:18,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:36:18,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322926385] [2025-03-04 15:36:18,792 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 15:36:18,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:36:18,795 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:36:18,795 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:36:18,796 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 15:36:18,796 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:36:18,796 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:36:18,796 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:36:18,797 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:36:18,797 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:18,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:36:18,798 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:36:18,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:36:18,798 INFO L85 PathProgramCache]: Analyzing trace with hash 1270146171, now seen corresponding path program 1 times [2025-03-04 15:36:18,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:36:18,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067133359] [2025-03-04 15:36:18,798 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:36:18,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:36:18,802 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:36:18,803 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:36:18,803 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:18,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:18,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:36:18,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:36:18,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067133359] [2025-03-04 15:36:18,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067133359] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:36:18,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:36:18,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:36:18,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143748190] [2025-03-04 15:36:18,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:36:18,819 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-04 15:36:18,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:36:18,820 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:36:18,820 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:36:18,820 INFO L87 Difference]: Start difference. First operand 38 states and 61 transitions. cyclomatic complexity: 24 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-04 15:36:18,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:36:18,830 INFO L93 Difference]: Finished difference Result 38 states and 58 transitions. [2025-03-04 15:36:18,830 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 58 transitions. [2025-03-04 15:36:18,831 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 36 [2025-03-04 15:36:18,832 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 38 states and 58 transitions. [2025-03-04 15:36:18,832 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 38 [2025-03-04 15:36:18,832 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38 [2025-03-04 15:36:18,832 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 58 transitions. [2025-03-04 15:36:18,832 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-04 15:36:18,832 INFO L218 hiAutomatonCegarLoop]: Abstraction has 38 states and 58 transitions. [2025-03-04 15:36:18,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 58 transitions. [2025-03-04 15:36:18,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 32. [2025-03-04 15:36:18,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 1.53125) internal successors, (49), 31 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:36:18,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 49 transitions. [2025-03-04 15:36:18,835 INFO L240 hiAutomatonCegarLoop]: Abstraction has 32 states and 49 transitions. [2025-03-04 15:36:18,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:36:18,836 INFO L432 stractBuchiCegarLoop]: Abstraction has 32 states and 49 transitions. [2025-03-04 15:36:18,836 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-03-04 15:36:18,836 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 49 transitions. [2025-03-04 15:36:18,836 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 30 [2025-03-04 15:36:18,837 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:36:18,837 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:36:18,837 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-03-04 15:36:18,837 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2025-03-04 15:36:18,837 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-04 15:36:18,837 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-04 15:36:18,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:36:18,838 INFO L85 PathProgramCache]: Analyzing trace with hash 1440, now seen corresponding path program 4 times [2025-03-04 15:36:18,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:36:18,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244475433] [2025-03-04 15:36:18,838 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 15:36:18,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:36:18,841 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 2 statements into 2 equivalence classes. [2025-03-04 15:36:18,842 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:36:18,842 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 15:36:18,842 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:36:18,842 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:36:18,843 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:36:18,843 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:36:18,843 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:18,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:36:18,844 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:36:18,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:36:18,848 INFO L85 PathProgramCache]: Analyzing trace with hash 1271070653, now seen corresponding path program 1 times [2025-03-04 15:36:18,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:36:18,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552108699] [2025-03-04 15:36:18,848 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:36:18,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:36:18,851 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:36:18,853 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:36:18,853 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:18,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:36:18,854 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:36:18,854 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:36:18,856 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:36:18,856 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:18,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:36:18,857 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:36:18,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:36:18,857 INFO L85 PathProgramCache]: Analyzing trace with hash -1511386596, now seen corresponding path program 1 times [2025-03-04 15:36:18,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:36:18,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941747956] [2025-03-04 15:36:18,858 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:36:18,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:36:18,860 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 15:36:18,862 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 15:36:18,862 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:18,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:36:18,862 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:36:18,863 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 15:36:18,865 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 15:36:18,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:18,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:36:18,866 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:36:18,953 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:36:18,954 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:36:18,954 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:36:18,955 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:36:18,955 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-04 15:36:18,955 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:18,955 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:36:18,955 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:36:18,955 INFO L132 ssoRankerPreferences]: Filename of dumped script: Narrowing.c_Iteration4_Loop [2025-03-04 15:36:18,958 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:36:18,958 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:36:18,968 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:18,985 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:18,988 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:18,991 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:19,059 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:36:19,059 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-04 15:36:19,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:19,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:19,063 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:36:19,064 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2025-03-04 15:36:19,065 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:36:19,065 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:36:19,083 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2025-03-04 15:36:19,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:19,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:19,085 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:36:19,087 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-03-04 15:36:19,088 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-04 15:36:19,088 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:36:19,112 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-04 15:36:19,116 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2025-03-04 15:36:19,116 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:36:19,116 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:36:19,116 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:36:19,116 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:36:19,116 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 15:36:19,116 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:19,116 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:36:19,116 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:36:19,116 INFO L132 ssoRankerPreferences]: Filename of dumped script: Narrowing.c_Iteration4_Loop [2025-03-04 15:36:19,116 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:36:19,116 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:36:19,118 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:19,130 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:19,133 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:19,137 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:19,195 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:36:19,198 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 15:36:19,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:19,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:19,201 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:36:19,202 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-03-04 15:36:19,204 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:36:19,214 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:36:19,215 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:36:19,215 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:36:19,215 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:36:19,215 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:36:19,219 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:36:19,219 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:36:19,221 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 15:36:19,226 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-04 15:36:19,229 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-03-04 15:36:19,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:19,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:19,233 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:36:19,244 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 15:36:19,245 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-04 15:36:19,245 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 15:36:19,247 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = 1*ULTIMATE.start_main_~i~0#1 Supporting invariants [] [2025-03-04 15:36:19,250 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-03-04 15:36:19,254 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2025-03-04 15:36:19,257 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-04 15:36:19,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:36:19,288 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:36:19,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:36:19,289 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:19,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:19,290 INFO L256 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 15:36:19,290 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:36:19,300 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:36:19,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:36:19,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:19,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:19,303 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 15:36:19,303 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:36:19,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:36:19,354 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-04 15:36:19,355 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 32 states and 49 transitions. cyclomatic complexity: 18 Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:36:19,407 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 32 states and 49 transitions. cyclomatic complexity: 18. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 100 states and 152 transitions. Complement of second has 7 states. [2025-03-04 15:36:19,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-03-04 15:36:19,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:36:19,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2025-03-04 15:36:19,412 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 2 letters. Loop has 6 letters. [2025-03-04 15:36:19,415 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:36:19,415 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 8 letters. Loop has 6 letters. [2025-03-04 15:36:19,415 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:36:19,415 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 2 letters. Loop has 12 letters. [2025-03-04 15:36:19,415 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:36:19,415 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 100 states and 152 transitions. [2025-03-04 15:36:19,417 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 60 [2025-03-04 15:36:19,418 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 100 states to 100 states and 152 transitions. [2025-03-04 15:36:19,418 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 63 [2025-03-04 15:36:19,421 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 66 [2025-03-04 15:36:19,421 INFO L73 IsDeterministic]: Start isDeterministic. Operand 100 states and 152 transitions. [2025-03-04 15:36:19,421 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:36:19,421 INFO L218 hiAutomatonCegarLoop]: Abstraction has 100 states and 152 transitions. [2025-03-04 15:36:19,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states and 152 transitions. [2025-03-04 15:36:19,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 89. [2025-03-04 15:36:19,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 89 states have (on average 1.550561797752809) internal successors, (138), 88 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:36:19,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 138 transitions. [2025-03-04 15:36:19,429 INFO L240 hiAutomatonCegarLoop]: Abstraction has 89 states and 138 transitions. [2025-03-04 15:36:19,429 INFO L432 stractBuchiCegarLoop]: Abstraction has 89 states and 138 transitions. [2025-03-04 15:36:19,429 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-03-04 15:36:19,429 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 89 states and 138 transitions. [2025-03-04 15:36:19,430 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 54 [2025-03-04 15:36:19,430 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:36:19,430 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:36:19,430 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-03-04 15:36:19,430 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2025-03-04 15:36:19,430 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-04 15:36:19,431 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-04 15:36:19,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:36:19,431 INFO L85 PathProgramCache]: Analyzing trace with hash 44653, now seen corresponding path program 1 times [2025-03-04 15:36:19,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:36:19,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935458874] [2025-03-04 15:36:19,431 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:36:19,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:36:19,434 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:36:19,434 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:36:19,435 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:19,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:36:19,435 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:36:19,435 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:36:19,436 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:36:19,436 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:19,436 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:36:19,437 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:36:19,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:36:19,437 INFO L85 PathProgramCache]: Analyzing trace with hash 1240532934, now seen corresponding path program 1 times [2025-03-04 15:36:19,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:36:19,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009824141] [2025-03-04 15:36:19,437 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:36:19,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:36:19,439 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:36:19,440 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:36:19,440 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:19,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:36:19,440 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:36:19,441 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:36:19,442 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:36:19,442 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:19,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:36:19,443 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:36:19,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:36:19,443 INFO L85 PathProgramCache]: Analyzing trace with hash 391656754, now seen corresponding path program 1 times [2025-03-04 15:36:19,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:36:19,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911687258] [2025-03-04 15:36:19,443 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:36:19,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:36:19,446 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 15:36:19,447 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 15:36:19,447 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:19,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:19,460 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:36:19,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:36:19,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911687258] [2025-03-04 15:36:19,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911687258] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:36:19,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:36:19,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:36:19,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446556986] [2025-03-04 15:36:19,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:36:19,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:36:19,502 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:36:19,502 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:36:19,502 INFO L87 Difference]: Start difference. First operand 89 states and 138 transitions. cyclomatic complexity: 54 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-04 15:36:19,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:36:19,516 INFO L93 Difference]: Finished difference Result 77 states and 112 transitions. [2025-03-04 15:36:19,516 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 77 states and 112 transitions. [2025-03-04 15:36:19,517 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 38 [2025-03-04 15:36:19,520 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 77 states to 71 states and 102 transitions. [2025-03-04 15:36:19,520 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 45 [2025-03-04 15:36:19,521 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 45 [2025-03-04 15:36:19,521 INFO L73 IsDeterministic]: Start isDeterministic. Operand 71 states and 102 transitions. [2025-03-04 15:36:19,521 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:36:19,521 INFO L218 hiAutomatonCegarLoop]: Abstraction has 71 states and 102 transitions. [2025-03-04 15:36:19,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states and 102 transitions. [2025-03-04 15:36:19,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 65. [2025-03-04 15:36:19,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 65 states have (on average 1.4461538461538461) internal successors, (94), 64 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:36:19,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 94 transitions. [2025-03-04 15:36:19,527 INFO L240 hiAutomatonCegarLoop]: Abstraction has 65 states and 94 transitions. [2025-03-04 15:36:19,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:36:19,529 INFO L432 stractBuchiCegarLoop]: Abstraction has 65 states and 94 transitions. [2025-03-04 15:36:19,529 INFO L338 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-03-04 15:36:19,529 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 65 states and 94 transitions. [2025-03-04 15:36:19,530 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 35 [2025-03-04 15:36:19,530 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:36:19,530 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:36:19,530 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-03-04 15:36:19,530 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2025-03-04 15:36:19,530 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-04 15:36:19,530 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-04 15:36:19,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:36:19,531 INFO L85 PathProgramCache]: Analyzing trace with hash 1384254, now seen corresponding path program 1 times [2025-03-04 15:36:19,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:36:19,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031797271] [2025-03-04 15:36:19,531 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:36:19,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:36:19,536 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 15:36:19,540 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 15:36:19,540 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:19,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:36:19,540 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:36:19,541 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 15:36:19,542 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 15:36:19,544 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:19,545 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:36:19,545 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:36:19,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:36:19,546 INFO L85 PathProgramCache]: Analyzing trace with hash 1181366363, now seen corresponding path program 1 times [2025-03-04 15:36:19,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:36:19,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456913112] [2025-03-04 15:36:19,546 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:36:19,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:36:19,552 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:36:19,553 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:36:19,553 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:19,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:36:19,553 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:36:19,554 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:36:19,559 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:36:19,559 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:19,559 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:36:19,560 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:36:19,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:36:19,560 INFO L85 PathProgramCache]: Analyzing trace with hash -1631046184, now seen corresponding path program 1 times [2025-03-04 15:36:19,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:36:19,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627676967] [2025-03-04 15:36:19,561 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:36:19,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:36:19,563 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 15:36:19,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 15:36:19,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:19,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:19,585 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:36:19,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:36:19,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627676967] [2025-03-04 15:36:19,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1627676967] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:36:19,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:36:19,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:36:19,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860864421] [2025-03-04 15:36:19,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:36:19,637 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:36:19,637 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:36:19,637 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:36:19,637 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:36:19,637 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-04 15:36:19,637 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:19,637 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:36:19,637 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:36:19,637 INFO L132 ssoRankerPreferences]: Filename of dumped script: Narrowing.c_Iteration6_Loop [2025-03-04 15:36:19,637 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:36:19,637 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:36:19,638 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:19,641 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:19,646 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:19,648 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:19,654 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:19,740 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:36:19,740 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-04 15:36:19,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:19,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:19,742 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:36:19,743 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-03-04 15:36:19,745 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:36:19,745 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:36:19,762 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 15:36:19,763 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-04 15:36:19,769 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2025-03-04 15:36:19,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:19,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:19,771 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:36:19,773 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-03-04 15:36:19,775 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:36:19,775 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:36:19,793 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 15:36:19,793 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-04 15:36:19,799 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2025-03-04 15:36:19,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:19,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:19,801 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:36:19,805 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-03-04 15:36:19,806 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:36:19,806 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:36:19,823 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 15:36:19,824 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-04 15:36:19,829 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2025-03-04 15:36:19,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:19,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:19,831 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:36:19,832 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-03-04 15:36:19,832 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:36:19,832 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:36:19,855 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-04 15:36:19,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:19,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:19,857 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:36:19,857 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-03-04 15:36:19,858 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-04 15:36:19,858 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:36:19,884 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-04 15:36:19,888 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2025-03-04 15:36:19,888 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:36:19,888 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:36:19,888 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:36:19,888 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:36:19,888 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 15:36:19,888 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:19,888 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:36:19,888 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:36:19,888 INFO L132 ssoRankerPreferences]: Filename of dumped script: Narrowing.c_Iteration6_Loop [2025-03-04 15:36:19,888 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:36:19,888 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:36:19,889 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:19,892 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:19,897 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:19,902 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:19,905 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:19,985 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:36:19,985 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 15:36:19,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:19,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:19,987 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:36:19,989 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-03-04 15:36:19,989 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:36:19,999 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:36:19,999 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:36:19,999 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:36:19,999 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:36:20,002 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:36:20,002 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:36:20,005 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:36:20,011 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2025-03-04 15:36:20,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:20,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:20,013 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-04 15:36:20,013 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-04 15:36:20,015 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:36:20,026 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:36:20,026 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:36:20,026 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:36:20,026 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-03-04 15:36:20,026 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:36:20,027 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2025-03-04 15:36:20,027 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:36:20,028 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:36:20,034 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2025-03-04 15:36:20,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:20,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:20,036 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-04 15:36:20,037 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-04 15:36:20,038 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:36:20,049 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:36:20,049 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:36:20,049 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:36:20,049 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-03-04 15:36:20,049 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:36:20,050 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2025-03-04 15:36:20,050 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:36:20,052 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:36:20,057 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2025-03-04 15:36:20,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:20,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:20,059 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-04 15:36:20,059 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-04 15:36:20,060 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:36:20,070 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:36:20,071 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:36:20,071 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:36:20,071 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:36:20,076 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:36:20,076 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:36:20,081 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:36:20,086 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-04 15:36:20,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:20,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:20,088 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-04 15:36:20,089 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-04 15:36:20,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-04 15:36:20,099 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:36:20,099 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:36:20,100 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:36:20,100 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:36:20,100 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:36:20,100 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:36:20,100 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:36:20,101 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:36:20,106 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-04 15:36:20,106 INFO L451 LassoAnalysis]: Using template '2-nested'. [2025-03-04 15:36:20,107 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:20,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:20,108 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-04 15:36:20,109 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-04 15:36:20,110 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:36:20,120 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:36:20,120 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:36:20,120 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:36:20,120 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-03-04 15:36:20,122 INFO L401 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2025-03-04 15:36:20,122 INFO L402 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2025-03-04 15:36:20,125 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:36:20,131 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-04 15:36:20,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:20,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:20,133 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-04 15:36:20,135 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-04 15:36:20,136 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:36:20,145 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:36:20,146 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:36:20,146 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:36:20,146 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-03-04 15:36:20,146 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-03-04 15:36:20,147 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:36:20,147 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:36:20,149 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:36:20,155 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2025-03-04 15:36:20,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:20,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:20,158 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-04 15:36:20,159 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-04 15:36:20,160 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:36:20,170 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:36:20,170 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:36:20,170 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:36:20,170 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-03-04 15:36:20,171 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-03-04 15:36:20,172 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:36:20,172 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:36:20,175 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:36:20,181 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-04 15:36:20,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:20,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:20,183 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-04 15:36:20,185 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-04 15:36:20,187 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:36:20,197 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:36:20,197 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:36:20,197 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:36:20,197 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-03-04 15:36:20,199 INFO L401 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2025-03-04 15:36:20,199 INFO L402 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2025-03-04 15:36:20,202 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:36:20,207 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-04 15:36:20,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:20,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:20,209 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-04 15:36:20,210 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-04 15:36:20,211 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:36:20,221 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:36:20,221 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:36:20,221 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:36:20,221 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:36:20,221 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-03-04 15:36:20,222 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2025-03-04 15:36:20,222 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:36:20,223 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:36:20,228 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-04 15:36:20,229 INFO L451 LassoAnalysis]: Using template '3-nested'. [2025-03-04 15:36:20,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:20,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:20,231 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-04 15:36:20,232 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-04 15:36:20,233 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:36:20,244 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:36:20,244 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:36:20,244 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:36:20,244 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-03-04 15:36:20,246 INFO L401 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2025-03-04 15:36:20,246 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-03-04 15:36:20,250 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:36:20,256 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-04 15:36:20,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:20,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:20,258 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-04 15:36:20,258 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-04 15:36:20,261 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:36:20,272 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:36:20,272 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:36:20,272 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:36:20,272 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-03-04 15:36:20,272 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-03-04 15:36:20,274 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2025-03-04 15:36:20,274 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:36:20,277 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:36:20,284 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2025-03-04 15:36:20,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:20,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:20,286 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-04 15:36:20,286 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-04 15:36:20,287 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:36:20,297 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:36:20,298 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:36:20,298 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:36:20,298 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-03-04 15:36:20,298 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-03-04 15:36:20,303 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2025-03-04 15:36:20,303 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:36:20,306 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:36:20,311 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2025-03-04 15:36:20,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:20,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:20,313 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-04 15:36:20,314 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-04 15:36:20,315 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:36:20,325 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:36:20,325 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:36:20,325 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:36:20,325 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-03-04 15:36:20,328 INFO L401 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2025-03-04 15:36:20,328 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-03-04 15:36:20,332 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:36:20,338 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-04 15:36:20,338 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:20,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:20,340 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-04 15:36:20,341 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-04 15:36:20,342 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:36:20,351 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:36:20,351 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:36:20,352 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:36:20,352 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:36:20,352 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-03-04 15:36:20,352 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2025-03-04 15:36:20,352 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:36:20,354 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:36:20,359 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-04 15:36:20,359 INFO L451 LassoAnalysis]: Using template '4-nested'. [2025-03-04 15:36:20,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:20,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:20,361 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-04 15:36:20,362 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-04 15:36:20,363 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:36:20,372 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:36:20,373 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:36:20,373 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:36:20,373 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2025-03-04 15:36:20,375 INFO L401 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2025-03-04 15:36:20,375 INFO L402 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2025-03-04 15:36:20,379 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:36:20,386 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-04 15:36:20,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:20,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:20,388 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-04 15:36:20,389 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-04 15:36:20,391 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:36:20,402 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:36:20,402 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:36:20,402 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:36:20,402 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-03-04 15:36:20,402 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2025-03-04 15:36:20,404 INFO L401 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2025-03-04 15:36:20,404 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:36:20,406 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:36:20,412 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-04 15:36:20,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:20,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:20,415 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-04 15:36:20,416 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-04 15:36:20,417 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:36:20,428 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:36:20,429 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:36:20,429 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:36:20,429 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-03-04 15:36:20,429 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2025-03-04 15:36:20,431 INFO L401 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2025-03-04 15:36:20,431 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:36:20,450 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2025-03-04 15:36:20,450 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:36:20,457 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2025-03-04 15:36:20,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:20,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:20,459 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-04 15:36:20,461 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-04 15:36:20,461 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:36:20,472 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:36:20,473 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:36:20,473 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:36:20,473 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2025-03-04 15:36:20,481 INFO L401 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2025-03-04 15:36:20,481 INFO L402 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2025-03-04 15:36:20,490 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:36:20,496 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-04 15:36:20,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:20,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:20,499 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-04 15:36:20,502 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-04 15:36:20,502 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:36:20,512 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:36:20,512 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:36:20,513 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:36:20,513 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:36:20,513 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2025-03-04 15:36:20,514 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2025-03-04 15:36:20,514 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:36:20,517 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:36:20,522 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-04 15:36:20,522 INFO L451 LassoAnalysis]: Using template '2-phase'. [2025-03-04 15:36:20,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:20,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:20,524 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-04 15:36:20,526 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-04 15:36:20,526 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:36:20,536 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-03-04 15:36:20,536 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2025-03-04 15:36:20,537 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:36:20,537 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:36:20,537 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-03-04 15:36:20,538 INFO L401 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2025-03-04 15:36:20,538 INFO L402 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2025-03-04 15:36:20,542 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:36:20,548 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-04 15:36:20,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:20,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:20,550 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-04 15:36:20,551 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-04 15:36:20,552 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:36:20,562 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-03-04 15:36:20,563 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2025-03-04 15:36:20,563 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:36:20,563 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:36:20,563 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-03-04 15:36:20,563 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-03-04 15:36:20,564 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:36:20,564 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:36:20,568 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:36:20,573 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-04 15:36:20,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:20,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:20,575 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-04 15:36:20,577 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-04 15:36:20,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-04 15:36:20,588 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-03-04 15:36:20,588 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2025-03-04 15:36:20,588 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:36:20,588 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:36:20,588 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-03-04 15:36:20,588 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-03-04 15:36:20,589 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:36:20,589 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:36:20,594 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:36:20,599 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2025-03-04 15:36:20,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:20,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:20,602 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-04 15:36:20,605 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-04 15:36:20,605 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:36:20,615 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-03-04 15:36:20,616 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2025-03-04 15:36:20,616 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:36:20,616 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:36:20,616 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-03-04 15:36:20,617 INFO L401 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2025-03-04 15:36:20,617 INFO L402 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2025-03-04 15:36:20,621 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:36:20,628 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Ended with exit code 0 [2025-03-04 15:36:20,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:20,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:20,631 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-04 15:36:20,632 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-04 15:36:20,633 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:36:20,644 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-03-04 15:36:20,644 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2025-03-04 15:36:20,644 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:36:20,644 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:36:20,644 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:36:20,644 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-03-04 15:36:20,646 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2025-03-04 15:36:20,646 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:36:20,648 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:36:20,654 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-04 15:36:20,655 INFO L451 LassoAnalysis]: Using template '3-phase'. [2025-03-04 15:36:20,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:20,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:20,657 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-04 15:36:20,659 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-04 15:36:20,660 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:36:20,671 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-03-04 15:36:20,672 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2025-03-04 15:36:20,672 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:36:20,672 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:36:20,672 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-03-04 15:36:20,674 INFO L401 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2025-03-04 15:36:20,674 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-03-04 15:36:20,679 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:36:20,685 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-04 15:36:20,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:20,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:20,687 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-04 15:36:20,688 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-04 15:36:20,691 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:36:20,702 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-03-04 15:36:20,702 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2025-03-04 15:36:20,702 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:36:20,702 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:36:20,702 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-03-04 15:36:20,702 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-03-04 15:36:20,704 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2025-03-04 15:36:20,704 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:36:20,709 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:36:20,716 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2025-03-04 15:36:20,716 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:20,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:20,741 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-04 15:36:20,742 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-04 15:36:20,742 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:36:20,753 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-03-04 15:36:20,753 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2025-03-04 15:36:20,753 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:36:20,753 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:36:20,753 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-03-04 15:36:20,753 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-03-04 15:36:20,755 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2025-03-04 15:36:20,755 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:36:20,762 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:36:20,772 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-04 15:36:20,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:20,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:20,774 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-04 15:36:20,776 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-04 15:36:20,776 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:36:20,787 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-03-04 15:36:20,787 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2025-03-04 15:36:20,787 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:36:20,787 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:36:20,787 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-03-04 15:36:20,789 INFO L401 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2025-03-04 15:36:20,789 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-03-04 15:36:20,795 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:36:20,801 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-04 15:36:20,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:20,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:20,803 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-04 15:36:20,803 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-04 15:36:20,806 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:36:20,817 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-03-04 15:36:20,817 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2025-03-04 15:36:20,817 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:36:20,817 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:36:20,817 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:36:20,817 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-03-04 15:36:20,818 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2025-03-04 15:36:20,818 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:36:20,822 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:36:20,829 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Ended with exit code 0 [2025-03-04 15:36:20,829 INFO L451 LassoAnalysis]: Using template '4-phase'. [2025-03-04 15:36:20,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:20,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:20,832 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-04 15:36:20,833 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-04 15:36:20,833 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:36:20,843 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-03-04 15:36:20,844 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2025-03-04 15:36:20,844 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:36:20,844 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:36:20,844 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2025-03-04 15:36:20,846 INFO L401 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2025-03-04 15:36:20,846 INFO L402 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2025-03-04 15:36:20,853 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:36:20,861 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Ended with exit code 0 [2025-03-04 15:36:20,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:20,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:20,863 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-04 15:36:20,865 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-04 15:36:20,868 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:36:20,879 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-03-04 15:36:20,879 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2025-03-04 15:36:20,879 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:36:20,879 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:36:20,879 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-03-04 15:36:20,879 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2025-03-04 15:36:20,882 INFO L401 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2025-03-04 15:36:20,882 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:36:20,889 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:36:20,895 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-04 15:36:20,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:20,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:20,898 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-04 15:36:20,900 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-04 15:36:20,901 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:36:20,911 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-03-04 15:36:20,911 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2025-03-04 15:36:20,911 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:36:20,912 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:36:20,912 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-03-04 15:36:20,912 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2025-03-04 15:36:20,915 INFO L401 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2025-03-04 15:36:20,915 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:36:20,924 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:36:20,934 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Forceful destruction successful, exit code 0 [2025-03-04 15:36:20,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:20,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:20,936 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-04 15:36:20,940 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-04 15:36:20,941 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:36:20,953 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-03-04 15:36:20,953 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2025-03-04 15:36:20,953 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:36:20,953 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:36:20,953 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2025-03-04 15:36:20,958 INFO L401 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2025-03-04 15:36:20,958 INFO L402 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2025-03-04 15:36:20,966 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:36:20,976 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Ended with exit code 0 [2025-03-04 15:36:20,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:20,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:20,978 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-04 15:36:20,980 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-04 15:36:20,981 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:36:20,993 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-03-04 15:36:20,993 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2025-03-04 15:36:20,993 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:36:20,993 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:36:20,993 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:36:20,993 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2025-03-04 15:36:20,995 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2025-03-04 15:36:20,995 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:36:20,999 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:36:21,005 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Forceful destruction successful, exit code 0 [2025-03-04 15:36:21,006 INFO L451 LassoAnalysis]: Using template '2-lex'. [2025-03-04 15:36:21,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:21,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:21,008 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-04 15:36:21,009 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-04 15:36:21,011 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:36:21,022 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-03-04 15:36:21,022 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2025-03-04 15:36:21,022 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:36:21,022 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:36:21,022 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-03-04 15:36:21,025 INFO L401 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2025-03-04 15:36:21,025 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-03-04 15:36:21,030 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:36:21,038 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Ended with exit code 0 [2025-03-04 15:36:21,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:21,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:21,041 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-04 15:36:21,043 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-04 15:36:21,044 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:36:21,055 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-03-04 15:36:21,055 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2025-03-04 15:36:21,055 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:36:21,055 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:36:21,055 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-03-04 15:36:21,055 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-03-04 15:36:21,056 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2025-03-04 15:36:21,056 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:36:21,061 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:36:21,068 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-04 15:36:21,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:21,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:21,070 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-04 15:36:21,071 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-04 15:36:21,072 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:36:21,082 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-03-04 15:36:21,082 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2025-03-04 15:36:21,082 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:36:21,082 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:36:21,082 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-03-04 15:36:21,082 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-03-04 15:36:21,083 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2025-03-04 15:36:21,084 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:36:21,088 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:36:21,094 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Ended with exit code 0 [2025-03-04 15:36:21,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:21,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:21,096 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-04 15:36:21,097 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-04 15:36:21,099 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:36:21,109 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-03-04 15:36:21,109 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2025-03-04 15:36:21,109 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:36:21,109 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:36:21,109 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-03-04 15:36:21,111 INFO L401 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2025-03-04 15:36:21,111 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-03-04 15:36:21,115 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:36:21,121 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Ended with exit code 0 [2025-03-04 15:36:21,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:21,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:21,123 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-04 15:36:21,124 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-04 15:36:21,126 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:36:21,136 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-03-04 15:36:21,137 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2025-03-04 15:36:21,137 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:36:21,137 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:36:21,137 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:36:21,137 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-03-04 15:36:21,137 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2025-03-04 15:36:21,138 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:36:21,141 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:36:21,147 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Ended with exit code 0 [2025-03-04 15:36:21,148 INFO L451 LassoAnalysis]: Using template '3-lex'. [2025-03-04 15:36:21,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:21,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:21,149 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-04 15:36:21,150 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-04 15:36:21,151 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:36:21,161 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-03-04 15:36:21,161 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2025-03-04 15:36:21,161 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:36:21,161 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:36:21,161 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2025-03-04 15:36:21,169 INFO L401 nArgumentSynthesizer]: We have 18 Motzkin's Theorem applications. [2025-03-04 15:36:21,169 INFO L402 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2025-03-04 15:36:21,177 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:36:21,183 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Ended with exit code 0 [2025-03-04 15:36:21,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:21,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:21,185 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-04 15:36:21,186 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-04 15:36:21,187 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:36:21,196 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-03-04 15:36:21,196 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2025-03-04 15:36:21,196 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:36:21,196 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:36:21,196 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-03-04 15:36:21,196 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2025-03-04 15:36:21,199 INFO L401 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2025-03-04 15:36:21,199 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:36:21,203 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:36:21,209 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-04 15:36:21,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:21,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:21,211 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-04 15:36:21,211 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-04 15:36:21,213 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:36:21,223 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-03-04 15:36:21,223 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2025-03-04 15:36:21,223 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:36:21,223 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:36:21,223 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-03-04 15:36:21,223 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2025-03-04 15:36:21,225 INFO L401 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2025-03-04 15:36:21,225 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:36:21,234 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:36:21,240 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-04 15:36:21,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:21,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:21,242 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-04 15:36:21,244 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-04 15:36:21,244 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:36:21,255 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-03-04 15:36:21,255 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2025-03-04 15:36:21,255 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:36:21,255 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:36:21,255 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2025-03-04 15:36:21,257 INFO L401 nArgumentSynthesizer]: We have 18 Motzkin's Theorem applications. [2025-03-04 15:36:21,257 INFO L402 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2025-03-04 15:36:21,263 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:36:21,270 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Ended with exit code 0 [2025-03-04 15:36:21,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:21,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:21,272 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-04 15:36:21,273 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-04 15:36:21,274 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:36:21,285 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-03-04 15:36:21,285 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2025-03-04 15:36:21,285 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:36:21,285 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:36:21,285 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:36:21,285 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2025-03-04 15:36:21,286 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:36:21,287 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:36:21,289 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:36:21,294 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-04 15:36:21,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:36:21,294 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:36:21,295 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:36:21,295 INFO L87 Difference]: Start difference. First operand 65 states and 94 transitions. cyclomatic complexity: 33 Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:36:21,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:36:21,301 INFO L93 Difference]: Finished difference Result 49 states and 66 transitions. [2025-03-04 15:36:21,301 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 66 transitions. [2025-03-04 15:36:21,302 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2025-03-04 15:36:21,302 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 47 states and 64 transitions. [2025-03-04 15:36:21,302 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 34 [2025-03-04 15:36:21,302 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 34 [2025-03-04 15:36:21,302 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 64 transitions. [2025-03-04 15:36:21,302 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:36:21,302 INFO L218 hiAutomatonCegarLoop]: Abstraction has 47 states and 64 transitions. [2025-03-04 15:36:21,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states and 64 transitions. [2025-03-04 15:36:21,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 42. [2025-03-04 15:36:21,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 42 states have (on average 1.380952380952381) internal successors, (58), 41 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:36:21,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 58 transitions. [2025-03-04 15:36:21,304 INFO L240 hiAutomatonCegarLoop]: Abstraction has 42 states and 58 transitions. [2025-03-04 15:36:21,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:36:21,309 INFO L432 stractBuchiCegarLoop]: Abstraction has 42 states and 58 transitions. [2025-03-04 15:36:21,309 INFO L338 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-03-04 15:36:21,309 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 58 transitions. [2025-03-04 15:36:21,310 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2025-03-04 15:36:21,310 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:36:21,310 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:36:21,310 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-03-04 15:36:21,310 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2025-03-04 15:36:21,310 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-04 15:36:21,310 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-04 15:36:21,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:36:21,310 INFO L85 PathProgramCache]: Analyzing trace with hash 42911884, now seen corresponding path program 1 times [2025-03-04 15:36:21,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:36:21,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918770718] [2025-03-04 15:36:21,310 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:36:21,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:36:21,312 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 15:36:21,313 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 15:36:21,313 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:21,313 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:36:21,314 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:36:21,314 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 15:36:21,315 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 15:36:21,315 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:21,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:36:21,315 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:36:21,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:36:21,316 INFO L85 PathProgramCache]: Analyzing trace with hash 1093580872, now seen corresponding path program 1 times [2025-03-04 15:36:21,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:36:21,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301935326] [2025-03-04 15:36:21,316 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:36:21,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:36:21,317 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:36:21,318 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:36:21,318 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:21,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:36:21,318 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:36:21,319 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:36:21,320 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:36:21,320 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:21,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:36:21,320 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:36:21,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:36:21,321 INFO L85 PathProgramCache]: Analyzing trace with hash 948546707, now seen corresponding path program 1 times [2025-03-04 15:36:21,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:36:21,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972584427] [2025-03-04 15:36:21,321 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:36:21,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:36:21,324 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 15:36:21,326 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 15:36:21,330 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:21,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:21,366 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:36:21,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:36:21,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972584427] [2025-03-04 15:36:21,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972584427] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:36:21,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:36:21,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 15:36:21,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137108637] [2025-03-04 15:36:21,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:36:21,409 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:36:21,409 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:36:21,409 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:36:21,409 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:36:21,409 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-04 15:36:21,409 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:21,409 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:36:21,409 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:36:21,409 INFO L132 ssoRankerPreferences]: Filename of dumped script: Narrowing.c_Iteration7_Loop [2025-03-04 15:36:21,409 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:36:21,409 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:36:21,410 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:21,413 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:21,417 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:21,421 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:21,423 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:21,482 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:36:21,482 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-04 15:36:21,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:21,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:21,484 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-04 15:36:21,486 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-04 15:36:21,487 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:36:21,487 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:36:21,504 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 15:36:21,504 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-04 15:36:21,509 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-04 15:36:21,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:21,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:21,511 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-04 15:36:21,512 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-04 15:36:21,513 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:36:21,513 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:36:21,523 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 15:36:21,523 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-04 15:36:21,528 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-04 15:36:21,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:21,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:21,530 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-04 15:36:21,531 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-04 15:36:21,532 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:36:21,532 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:36:21,547 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Ended with exit code 0 [2025-03-04 15:36:21,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:21,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:21,550 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-04 15:36:21,552 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-04 15:36:21,553 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-04 15:36:21,553 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:36:21,573 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-04 15:36:21,577 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-04 15:36:21,577 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:36:21,577 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:36:21,577 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:36:21,577 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:36:21,578 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 15:36:21,578 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:21,578 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:36:21,578 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:36:21,578 INFO L132 ssoRankerPreferences]: Filename of dumped script: Narrowing.c_Iteration7_Loop [2025-03-04 15:36:21,578 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:36:21,578 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:36:21,578 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:21,584 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:21,586 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:21,592 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:21,597 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:21,652 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:36:21,652 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 15:36:21,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:21,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:21,656 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-04 15:36:21,657 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-04 15:36:21,658 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:36:21,668 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:36:21,668 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:36:21,669 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:36:21,669 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:36:21,669 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:36:21,669 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:36:21,669 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:36:21,671 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:36:21,676 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-04 15:36:21,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:21,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:21,679 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-04 15:36:21,680 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-04 15:36:21,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-04 15:36:21,691 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:36:21,691 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:36:21,691 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:36:21,691 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:36:21,692 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:36:21,692 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:36:21,694 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:36:21,700 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-04 15:36:21,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:21,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:21,702 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-04 15:36:21,704 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-04 15:36:21,705 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:36:21,715 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:36:21,715 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:36:21,715 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:36:21,715 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:36:21,715 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:36:21,715 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:36:21,715 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:36:21,717 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 15:36:21,719 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-04 15:36:21,719 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-03-04 15:36:21,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:21,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:21,721 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-04 15:36:21,723 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-04 15:36:21,723 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 15:36:21,723 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-04 15:36:21,723 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 15:36:21,723 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = -1*ULTIMATE.start_main_~i~0#1 Supporting invariants [] [2025-03-04 15:36:21,729 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Ended with exit code 0 [2025-03-04 15:36:21,731 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-04 15:36:21,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:36:21,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 15:36:21,746 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 15:36:21,746 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:21,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:21,746 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 15:36:21,746 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:36:21,758 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:36:21,762 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:36:21,762 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:21,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:21,763 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 15:36:21,763 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:36:21,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:36:21,790 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-04 15:36:21,790 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 42 states and 58 transitions. cyclomatic complexity: 18 Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:36:21,833 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 42 states and 58 transitions. cyclomatic complexity: 18. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 115 states and 154 transitions. Complement of second has 7 states. [2025-03-04 15:36:21,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-03-04 15:36:21,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:36:21,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 33 transitions. [2025-03-04 15:36:21,834 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 33 transitions. Stem has 5 letters. Loop has 6 letters. [2025-03-04 15:36:21,834 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:36:21,834 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 33 transitions. Stem has 11 letters. Loop has 6 letters. [2025-03-04 15:36:21,834 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:36:21,834 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 33 transitions. Stem has 5 letters. Loop has 12 letters. [2025-03-04 15:36:21,835 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:36:21,835 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 115 states and 154 transitions. [2025-03-04 15:36:21,835 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 42 [2025-03-04 15:36:21,836 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 115 states to 109 states and 145 transitions. [2025-03-04 15:36:21,836 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 63 [2025-03-04 15:36:21,836 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 68 [2025-03-04 15:36:21,836 INFO L73 IsDeterministic]: Start isDeterministic. Operand 109 states and 145 transitions. [2025-03-04 15:36:21,837 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:36:21,837 INFO L218 hiAutomatonCegarLoop]: Abstraction has 109 states and 145 transitions. [2025-03-04 15:36:21,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states and 145 transitions. [2025-03-04 15:36:21,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 94. [2025-03-04 15:36:21,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 94 states have (on average 1.372340425531915) internal successors, (129), 93 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:36:21,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 129 transitions. [2025-03-04 15:36:21,840 INFO L240 hiAutomatonCegarLoop]: Abstraction has 94 states and 129 transitions. [2025-03-04 15:36:21,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:36:21,840 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:36:21,840 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:36:21,841 INFO L87 Difference]: Start difference. First operand 94 states and 129 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:36:21,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:36:21,866 INFO L93 Difference]: Finished difference Result 112 states and 143 transitions. [2025-03-04 15:36:21,866 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 112 states and 143 transitions. [2025-03-04 15:36:21,867 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 50 [2025-03-04 15:36:21,867 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 112 states to 93 states and 119 transitions. [2025-03-04 15:36:21,867 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 68 [2025-03-04 15:36:21,867 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 68 [2025-03-04 15:36:21,867 INFO L73 IsDeterministic]: Start isDeterministic. Operand 93 states and 119 transitions. [2025-03-04 15:36:21,868 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:36:21,868 INFO L218 hiAutomatonCegarLoop]: Abstraction has 93 states and 119 transitions. [2025-03-04 15:36:21,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states and 119 transitions. [2025-03-04 15:36:21,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 42. [2025-03-04 15:36:21,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 42 states have (on average 1.3333333333333333) internal successors, (56), 41 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:36:21,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 56 transitions. [2025-03-04 15:36:21,869 INFO L240 hiAutomatonCegarLoop]: Abstraction has 42 states and 56 transitions. [2025-03-04 15:36:21,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:36:21,874 INFO L432 stractBuchiCegarLoop]: Abstraction has 42 states and 56 transitions. [2025-03-04 15:36:21,874 INFO L338 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2025-03-04 15:36:21,874 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 56 transitions. [2025-03-04 15:36:21,875 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2025-03-04 15:36:21,875 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:36:21,875 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:36:21,875 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-03-04 15:36:21,875 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2025-03-04 15:36:21,875 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-04 15:36:21,875 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-04 15:36:21,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:36:21,875 INFO L85 PathProgramCache]: Analyzing trace with hash 42911884, now seen corresponding path program 2 times [2025-03-04 15:36:21,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:36:21,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852166761] [2025-03-04 15:36:21,876 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:36:21,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:36:21,877 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 5 statements into 1 equivalence classes. [2025-03-04 15:36:21,878 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 15:36:21,878 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:36:21,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:36:21,878 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:36:21,879 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 15:36:21,879 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 15:36:21,879 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:21,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:36:21,880 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:36:21,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:36:21,880 INFO L85 PathProgramCache]: Analyzing trace with hash 1093580903, now seen corresponding path program 1 times [2025-03-04 15:36:21,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:36:21,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915205750] [2025-03-04 15:36:21,880 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:36:21,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:36:21,882 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:36:21,882 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:36:21,882 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:21,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:36:21,882 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:36:21,883 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:36:21,883 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:36:21,883 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:21,884 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:36:21,884 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:36:21,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:36:21,884 INFO L85 PathProgramCache]: Analyzing trace with hash 948546738, now seen corresponding path program 1 times [2025-03-04 15:36:21,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:36:21,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145625381] [2025-03-04 15:36:21,884 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:36:21,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:36:21,886 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 15:36:21,887 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 15:36:21,887 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:21,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:36:21,887 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:36:21,887 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 15:36:21,888 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 15:36:21,888 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:21,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:36:21,892 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:36:21,937 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:36:21,937 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:36:21,937 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:36:21,937 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:36:21,937 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-04 15:36:21,937 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:21,937 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:36:21,937 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:36:21,937 INFO L132 ssoRankerPreferences]: Filename of dumped script: Narrowing.c_Iteration8_Loop [2025-03-04 15:36:21,937 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:36:21,937 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:36:21,938 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:21,952 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:21,955 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:21,961 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:22,039 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:36:22,039 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-04 15:36:22,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:22,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:22,041 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-04 15:36:22,042 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-04 15:36:22,043 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:36:22,043 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:36:22,059 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-04 15:36:22,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:22,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:22,061 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-04 15:36:22,062 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-04 15:36:22,063 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-04 15:36:22,063 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:36:22,230 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-04 15:36:22,237 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-04 15:36:22,237 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:36:22,237 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:36:22,237 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:36:22,237 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:36:22,237 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 15:36:22,237 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:22,237 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:36:22,237 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:36:22,237 INFO L132 ssoRankerPreferences]: Filename of dumped script: Narrowing.c_Iteration8_Loop [2025-03-04 15:36:22,237 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:36:22,237 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:36:22,239 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:22,249 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:22,251 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:22,256 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:22,330 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:36:22,330 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 15:36:22,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:22,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:22,332 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-04 15:36:22,333 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-04 15:36:22,334 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:36:22,346 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:36:22,346 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:36:22,346 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:36:22,346 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-03-04 15:36:22,346 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:36:22,348 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2025-03-04 15:36:22,348 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:36:22,352 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 15:36:22,359 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-03-04 15:36:22,359 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-03-04 15:36:22,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:22,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:22,363 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-04 15:36:22,364 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-04 15:36:22,365 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 15:36:22,365 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-04 15:36:22,365 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 15:36:22,365 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-04 15:36:22,378 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-04 15:36:22,383 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-04 15:36:22,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:36:22,398 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 15:36:22,399 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 15:36:22,400 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:22,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:22,400 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 15:36:22,400 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:36:22,406 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:36:22,408 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:36:22,408 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:22,408 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:22,408 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 15:36:22,409 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:36:22,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:36:22,441 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-04 15:36:22,441 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 42 states and 56 transitions. cyclomatic complexity: 16 Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:36:22,472 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 42 states and 56 transitions. cyclomatic complexity: 16. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 91 states and 116 transitions. Complement of second has 7 states. [2025-03-04 15:36:22,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-03-04 15:36:22,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:36:22,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 23 transitions. [2025-03-04 15:36:22,475 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 5 letters. Loop has 6 letters. [2025-03-04 15:36:22,475 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:36:22,475 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 11 letters. Loop has 6 letters. [2025-03-04 15:36:22,475 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:36:22,475 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 5 letters. Loop has 12 letters. [2025-03-04 15:36:22,475 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:36:22,475 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 91 states and 116 transitions. [2025-03-04 15:36:22,476 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2025-03-04 15:36:22,476 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 91 states to 78 states and 99 transitions. [2025-03-04 15:36:22,478 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2025-03-04 15:36:22,478 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 45 [2025-03-04 15:36:22,478 INFO L73 IsDeterministic]: Start isDeterministic. Operand 78 states and 99 transitions. [2025-03-04 15:36:22,478 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:36:22,478 INFO L218 hiAutomatonCegarLoop]: Abstraction has 78 states and 99 transitions. [2025-03-04 15:36:22,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states and 99 transitions. [2025-03-04 15:36:22,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 72. [2025-03-04 15:36:22,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 72 states have (on average 1.2916666666666667) internal successors, (93), 71 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:36:22,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 93 transitions. [2025-03-04 15:36:22,484 INFO L240 hiAutomatonCegarLoop]: Abstraction has 72 states and 93 transitions. [2025-03-04 15:36:22,484 INFO L432 stractBuchiCegarLoop]: Abstraction has 72 states and 93 transitions. [2025-03-04 15:36:22,484 INFO L338 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2025-03-04 15:36:22,484 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 72 states and 93 transitions. [2025-03-04 15:36:22,484 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2025-03-04 15:36:22,484 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:36:22,484 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:36:22,485 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:36:22,485 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2025-03-04 15:36:22,485 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-04 15:36:22,485 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-04 15:36:22,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:36:22,485 INFO L85 PathProgramCache]: Analyzing trace with hash 948516946, now seen corresponding path program 1 times [2025-03-04 15:36:22,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:36:22,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251025871] [2025-03-04 15:36:22,485 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:36:22,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:36:22,491 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 15:36:22,493 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 15:36:22,493 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:22,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:22,525 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:36:22,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:36:22,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251025871] [2025-03-04 15:36:22,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251025871] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:36:22,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:36:22,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 15:36:22,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761523782] [2025-03-04 15:36:22,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:36:22,525 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-04 15:36:22,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:36:22,526 INFO L85 PathProgramCache]: Analyzing trace with hash 1121286532, now seen corresponding path program 1 times [2025-03-04 15:36:22,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:36:22,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618203417] [2025-03-04 15:36:22,526 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:36:22,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:36:22,528 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:36:22,530 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:36:22,530 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:22,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:36:22,531 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:36:22,531 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:36:22,532 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:36:22,532 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:22,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:36:22,533 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:36:22,570 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Ended with exit code 0 [2025-03-04 15:36:22,577 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-04 15:36:22,590 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:36:22,590 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:36:22,590 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:36:22,590 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:36:22,590 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-04 15:36:22,590 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:22,590 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:36:22,590 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:36:22,590 INFO L132 ssoRankerPreferences]: Filename of dumped script: Narrowing.c_Iteration9_Loop [2025-03-04 15:36:22,590 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:36:22,590 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:36:22,591 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:22,595 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:22,597 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:22,599 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:22,647 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:36:22,647 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-04 15:36:22,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:22,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:22,649 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-04 15:36:22,651 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-04 15:36:22,652 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:36:22,652 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:36:22,662 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 15:36:22,663 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-04 15:36:22,668 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Forceful destruction successful, exit code 0 [2025-03-04 15:36:22,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:22,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:22,671 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-04 15:36:22,673 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-04 15:36:22,673 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:36:22,673 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:36:22,690 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 15:36:22,690 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-04 15:36:22,696 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-04 15:36:22,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:22,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:22,698 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-04 15:36:22,698 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-04 15:36:22,700 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:36:22,700 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:36:22,716 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 15:36:22,716 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-04 15:36:22,722 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-04 15:36:22,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:22,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:22,724 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-04 15:36:22,724 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-04 15:36:22,725 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:36:22,725 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:36:22,741 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-04 15:36:22,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:22,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:22,743 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-04 15:36:22,744 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-04 15:36:22,745 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-04 15:36:22,745 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:36:22,840 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-04 15:36:22,845 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-04 15:36:22,846 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:36:22,846 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:36:22,846 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:36:22,846 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:36:22,846 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 15:36:22,846 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:22,846 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:36:22,846 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:36:22,846 INFO L132 ssoRankerPreferences]: Filename of dumped script: Narrowing.c_Iteration9_Loop [2025-03-04 15:36:22,846 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:36:22,846 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:36:22,847 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:22,850 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:22,852 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:22,854 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:22,902 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:36:22,902 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 15:36:22,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:22,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:22,906 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-04 15:36:22,907 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-04 15:36:22,908 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:36:22,918 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:36:22,918 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:36:22,918 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:36:22,918 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:36:22,918 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:36:22,919 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:36:22,919 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:36:22,920 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:36:22,926 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-04 15:36:22,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:22,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:22,928 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-04 15:36:22,929 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-04 15:36:22,932 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:36:22,942 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:36:22,942 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:36:22,942 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:36:22,942 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:36:22,943 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:36:22,943 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:36:22,945 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:36:22,952 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-04 15:36:22,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:22,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:22,954 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-04 15:36:22,955 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-04 15:36:22,957 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:36:22,967 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:36:22,968 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:36:22,968 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:36:22,968 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:36:22,969 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:36:22,969 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:36:22,971 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:36:22,976 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-04 15:36:22,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:22,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:22,978 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-04 15:36:22,979 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-04 15:36:22,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-04 15:36:22,990 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:36:22,990 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:36:22,990 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:36:22,990 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:36:22,990 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:36:22,990 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:36:22,990 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:36:22,992 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 15:36:22,994 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-04 15:36:22,994 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-03-04 15:36:22,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:22,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:22,996 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-04 15:36:22,997 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-04 15:36:22,998 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 15:36:22,998 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-04 15:36:22,998 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 15:36:22,998 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = 1*ULTIMATE.start_main_~i~0#1 Supporting invariants [] [2025-03-04 15:36:23,003 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Ended with exit code 0 [2025-03-04 15:36:23,004 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-04 15:36:23,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:36:23,021 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 15:36:23,024 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 15:36:23,024 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:23,024 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:23,025 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 15:36:23,025 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:36:23,036 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:36:23,037 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:36:23,038 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:23,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:23,038 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 15:36:23,038 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:36:23,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:36:23,059 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-04 15:36:23,059 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 72 states and 93 transitions. cyclomatic complexity: 26 Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:36:23,084 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 72 states and 93 transitions. cyclomatic complexity: 26. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 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 161 states and 214 transitions. Complement of second has 7 states. [2025-03-04 15:36:23,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-03-04 15:36:23,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:36:23,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 23 transitions. [2025-03-04 15:36:23,085 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 11 letters. Loop has 6 letters. [2025-03-04 15:36:23,086 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:36:23,086 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 17 letters. Loop has 6 letters. [2025-03-04 15:36:23,086 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:36:23,086 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 11 letters. Loop has 12 letters. [2025-03-04 15:36:23,086 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:36:23,086 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 161 states and 214 transitions. [2025-03-04 15:36:23,088 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 35 [2025-03-04 15:36:23,089 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 161 states to 127 states and 165 transitions. [2025-03-04 15:36:23,089 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 57 [2025-03-04 15:36:23,089 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 65 [2025-03-04 15:36:23,089 INFO L73 IsDeterministic]: Start isDeterministic. Operand 127 states and 165 transitions. [2025-03-04 15:36:23,089 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:36:23,089 INFO L218 hiAutomatonCegarLoop]: Abstraction has 127 states and 165 transitions. [2025-03-04 15:36:23,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states and 165 transitions. [2025-03-04 15:36:23,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 118. [2025-03-04 15:36:23,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 118 states have (on average 1.3220338983050848) internal successors, (156), 117 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:36:23,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 156 transitions. [2025-03-04 15:36:23,092 INFO L240 hiAutomatonCegarLoop]: Abstraction has 118 states and 156 transitions. [2025-03-04 15:36:23,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:36:23,096 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 15:36:23,096 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 15:36:23,096 INFO L87 Difference]: Start difference. First operand 118 states and 156 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:36:23,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:36:23,139 INFO L93 Difference]: Finished difference Result 223 states and 284 transitions. [2025-03-04 15:36:23,139 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 223 states and 284 transitions. [2025-03-04 15:36:23,141 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 80 [2025-03-04 15:36:23,141 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 223 states to 218 states and 276 transitions. [2025-03-04 15:36:23,141 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 124 [2025-03-04 15:36:23,142 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 124 [2025-03-04 15:36:23,142 INFO L73 IsDeterministic]: Start isDeterministic. Operand 218 states and 276 transitions. [2025-03-04 15:36:23,142 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:36:23,142 INFO L218 hiAutomatonCegarLoop]: Abstraction has 218 states and 276 transitions. [2025-03-04 15:36:23,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states and 276 transitions. [2025-03-04 15:36:23,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 209. [2025-03-04 15:36:23,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 209 states have (on average 1.277511961722488) internal successors, (267), 208 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:36:23,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 267 transitions. [2025-03-04 15:36:23,146 INFO L240 hiAutomatonCegarLoop]: Abstraction has 209 states and 267 transitions. [2025-03-04 15:36:23,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 15:36:23,146 INFO L432 stractBuchiCegarLoop]: Abstraction has 209 states and 267 transitions. [2025-03-04 15:36:23,146 INFO L338 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2025-03-04 15:36:23,146 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 209 states and 267 transitions. [2025-03-04 15:36:23,147 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 78 [2025-03-04 15:36:23,147 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:36:23,147 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:36:23,148 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:36:23,148 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2025-03-04 15:36:23,148 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-04 15:36:23,148 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-04 15:36:23,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:36:23,148 INFO L85 PathProgramCache]: Analyzing trace with hash -1575934415, now seen corresponding path program 1 times [2025-03-04 15:36:23,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:36:23,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915315800] [2025-03-04 15:36:23,149 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:36:23,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:36:23,150 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 15:36:23,151 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 15:36:23,152 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:23,152 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:23,175 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-04 15:36:23,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:36:23,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915315800] [2025-03-04 15:36:23,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915315800] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:36:23,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [859649173] [2025-03-04 15:36:23,175 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:36:23,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:36:23,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:23,177 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-04 15:36:23,177 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-04 15:36:23,193 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 15:36:23,195 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 15:36:23,195 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:23,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:23,195 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 15:36:23,196 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:36:23,206 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-04 15:36:23,207 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:36:23,224 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-04 15:36:23,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [859649173] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:36:23,224 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:36:23,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2025-03-04 15:36:23,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946978566] [2025-03-04 15:36:23,225 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:36:23,225 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-04 15:36:23,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:36:23,225 INFO L85 PathProgramCache]: Analyzing trace with hash 1093580903, now seen corresponding path program 2 times [2025-03-04 15:36:23,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:36:23,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613729240] [2025-03-04 15:36:23,225 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:36:23,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:36:23,227 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:36:23,228 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:36:23,228 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:36:23,228 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:36:23,228 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:36:23,229 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:36:23,229 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:36:23,229 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:23,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:36:23,230 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:36:23,267 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:36:23,268 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:36:23,268 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:36:23,268 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:36:23,268 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-04 15:36:23,268 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:23,268 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:36:23,268 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:36:23,268 INFO L132 ssoRankerPreferences]: Filename of dumped script: Narrowing.c_Iteration10_Loop [2025-03-04 15:36:23,268 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:36:23,268 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:36:23,269 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:23,278 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:23,280 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:23,282 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:23,359 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:36:23,359 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-04 15:36:23,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:23,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:23,361 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-04 15:36:23,362 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-04 15:36:23,363 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:36:23,363 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:36:23,384 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Ended with exit code 0 [2025-03-04 15:36:23,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:23,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:23,386 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-04 15:36:23,386 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-04 15:36:23,387 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-04 15:36:23,387 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:36:23,518 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-04 15:36:23,524 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-04 15:36:23,524 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:36:23,524 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:36:23,524 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:36:23,524 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:36:23,524 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 15:36:23,524 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:23,524 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:36:23,524 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:36:23,524 INFO L132 ssoRankerPreferences]: Filename of dumped script: Narrowing.c_Iteration10_Loop [2025-03-04 15:36:23,524 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:36:23,524 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:36:23,525 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:23,532 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:23,534 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:23,537 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:23,604 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:36:23,604 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 15:36:23,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:23,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:23,606 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-04 15:36:23,606 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-04 15:36:23,607 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:36:23,617 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:36:23,617 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:36:23,617 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:36:23,617 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-03-04 15:36:23,617 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:36:23,618 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2025-03-04 15:36:23,618 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:36:23,621 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 15:36:23,623 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-03-04 15:36:23,623 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-03-04 15:36:23,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:23,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:23,625 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-04 15:36:23,626 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-04 15:36:23,626 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 15:36:23,626 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-04 15:36:23,626 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 15:36:23,626 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~range~0#1, ULTIMATE.start_main_~i~0#1) = 1*ULTIMATE.start_main_~range~0#1 - 1*ULTIMATE.start_main_~i~0#1 Supporting invariants [] [2025-03-04 15:36:23,631 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-04 15:36:23,632 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-04 15:36:23,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:36:23,649 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 15:36:23,651 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 15:36:23,651 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:23,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:23,651 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 15:36:23,652 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:36:23,660 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:36:23,661 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:36:23,661 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:23,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:23,662 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 15:36:23,662 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:36:23,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:36:23,689 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-04 15:36:23,689 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 209 states and 267 transitions. cyclomatic complexity: 73 Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:36:23,714 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 209 states and 267 transitions. cyclomatic complexity: 73. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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 255 states and 317 transitions. Complement of second has 7 states. [2025-03-04 15:36:23,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-03-04 15:36:23,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:36:23,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 23 transitions. [2025-03-04 15:36:23,715 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 11 letters. Loop has 6 letters. [2025-03-04 15:36:23,715 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:36:23,715 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-04 15:36:23,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:36:23,728 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 15:36:23,730 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 15:36:23,730 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:23,730 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:23,730 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 15:36:23,730 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:36:23,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:36:23,747 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:36:23,747 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:23,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:23,747 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 15:36:23,747 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:36:23,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:36:23,780 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-04 15:36:23,780 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 209 states and 267 transitions. cyclomatic complexity: 73 Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:36:23,782 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-04 15:36:23,789 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Forceful destruction successful, exit code 0 [2025-03-04 15:36:23,820 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 209 states and 267 transitions. cyclomatic complexity: 73. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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 369 states and 449 transitions. Complement of second has 9 states. [2025-03-04 15:36:23,820 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-04 15:36:23,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:36:23,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 30 transitions. [2025-03-04 15:36:23,821 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 30 transitions. Stem has 11 letters. Loop has 6 letters. [2025-03-04 15:36:23,821 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:36:23,821 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-04 15:36:23,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:36:23,835 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 15:36:23,837 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 15:36:23,837 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:23,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:23,837 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 15:36:23,837 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:36:23,847 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:36:23,848 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:36:23,848 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:23,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:23,848 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 15:36:23,848 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:36:23,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:36:23,875 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-04 15:36:23,876 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 209 states and 267 transitions. cyclomatic complexity: 73 Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:36:23,896 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 209 states and 267 transitions. cyclomatic complexity: 73. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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 320 states and 401 transitions. Complement of second has 8 states. [2025-03-04 15:36:23,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-03-04 15:36:23,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:36:23,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2025-03-04 15:36:23,897 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 11 letters. Loop has 6 letters. [2025-03-04 15:36:23,899 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:36:23,899 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 17 letters. Loop has 6 letters. [2025-03-04 15:36:23,899 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:36:23,899 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 11 letters. Loop has 12 letters. [2025-03-04 15:36:23,899 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:36:23,899 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 320 states and 401 transitions. [2025-03-04 15:36:23,901 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 76 [2025-03-04 15:36:23,902 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 320 states to 237 states and 299 transitions. [2025-03-04 15:36:23,902 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 69 [2025-03-04 15:36:23,902 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 84 [2025-03-04 15:36:23,902 INFO L73 IsDeterministic]: Start isDeterministic. Operand 237 states and 299 transitions. [2025-03-04 15:36:23,902 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:36:23,902 INFO L218 hiAutomatonCegarLoop]: Abstraction has 237 states and 299 transitions. [2025-03-04 15:36:23,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states and 299 transitions. [2025-03-04 15:36:23,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 175. [2025-03-04 15:36:23,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 175 states have (on average 1.3085714285714285) internal successors, (229), 174 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:36:23,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 229 transitions. [2025-03-04 15:36:23,909 INFO L240 hiAutomatonCegarLoop]: Abstraction has 175 states and 229 transitions. [2025-03-04 15:36:23,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:36:23,909 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 15:36:23,909 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 15:36:23,909 INFO L87 Difference]: Start difference. First operand 175 states and 229 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:36:23,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:36:23,969 INFO L93 Difference]: Finished difference Result 387 states and 490 transitions. [2025-03-04 15:36:23,969 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 387 states and 490 transitions. [2025-03-04 15:36:23,971 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 86 [2025-03-04 15:36:23,975 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 387 states to 371 states and 472 transitions. [2025-03-04 15:36:23,975 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 123 [2025-03-04 15:36:23,975 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 123 [2025-03-04 15:36:23,975 INFO L73 IsDeterministic]: Start isDeterministic. Operand 371 states and 472 transitions. [2025-03-04 15:36:23,975 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:36:23,975 INFO L218 hiAutomatonCegarLoop]: Abstraction has 371 states and 472 transitions. [2025-03-04 15:36:23,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states and 472 transitions. [2025-03-04 15:36:23,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 305. [2025-03-04 15:36:23,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 305 states have (on average 1.2819672131147541) internal successors, (391), 304 states have internal predecessors, (391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:36:23,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 391 transitions. [2025-03-04 15:36:23,979 INFO L240 hiAutomatonCegarLoop]: Abstraction has 305 states and 391 transitions. [2025-03-04 15:36:23,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 15:36:23,981 INFO L432 stractBuchiCegarLoop]: Abstraction has 305 states and 391 transitions. [2025-03-04 15:36:23,981 INFO L338 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2025-03-04 15:36:23,981 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 305 states and 391 transitions. [2025-03-04 15:36:23,982 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 83 [2025-03-04 15:36:23,982 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:36:23,982 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:36:23,983 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2025-03-04 15:36:23,983 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [4, 4, 3, 3, 2, 2, 2, 2, 1, 1] [2025-03-04 15:36:23,983 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-04 15:36:23,983 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-04 15:36:23,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:36:23,984 INFO L85 PathProgramCache]: Analyzing trace with hash -297785385, now seen corresponding path program 1 times [2025-03-04 15:36:23,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:36:23,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124100459] [2025-03-04 15:36:23,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:36:23,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:36:23,986 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 15:36:23,988 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 15:36:23,988 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:23,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:24,035 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-04 15:36:24,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:36:24,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124100459] [2025-03-04 15:36:24,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124100459] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:36:24,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1124105407] [2025-03-04 15:36:24,036 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:36:24,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:36:24,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:24,039 INFO L229 MonitoredProcess]: Starting monitored process 83 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:36:24,040 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (83)] Waiting until timeout for monitored process [2025-03-04 15:36:24,057 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 15:36:24,061 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 15:36:24,061 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:24,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:24,061 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 15:36:24,062 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:36:24,081 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-04 15:36:24,082 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:36:24,118 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-04 15:36:24,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1124105407] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:36:24,118 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:36:24,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-03-04 15:36:24,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864784557] [2025-03-04 15:36:24,118 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:36:24,118 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-04 15:36:24,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:36:24,118 INFO L85 PathProgramCache]: Analyzing trace with hash 865140173, now seen corresponding path program 1 times [2025-03-04 15:36:24,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:36:24,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163616104] [2025-03-04 15:36:24,119 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:36:24,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:36:24,120 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 15:36:24,122 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 15:36:24,123 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:24,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:24,269 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-04 15:36:24,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:36:24,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163616104] [2025-03-04 15:36:24,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163616104] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:36:24,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [627037862] [2025-03-04 15:36:24,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:36:24,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:36:24,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:24,271 INFO L229 MonitoredProcess]: Starting monitored process 84 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:36:24,273 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (84)] Waiting until timeout for monitored process [2025-03-04 15:36:24,288 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 15:36:24,293 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 15:36:24,293 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:24,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:24,294 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 15:36:24,294 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:36:24,332 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-04 15:36:24,332 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:36:24,351 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-04 15:36:24,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [627037862] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:36:24,352 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:36:24,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 6] total 14 [2025-03-04 15:36:24,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933070896] [2025-03-04 15:36:24,352 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:36:24,352 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-04 15:36:24,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:36:24,352 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 15:36:24,352 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-03-04 15:36:24,352 INFO L87 Difference]: Start difference. First operand 305 states and 391 transitions. cyclomatic complexity: 104 Second operand has 10 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 10 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:36:24,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:36:24,560 INFO L93 Difference]: Finished difference Result 945 states and 1181 transitions. [2025-03-04 15:36:24,560 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 945 states and 1181 transitions. [2025-03-04 15:36:24,564 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 274 [2025-03-04 15:36:24,568 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 945 states to 911 states and 1144 transitions. [2025-03-04 15:36:24,568 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 336 [2025-03-04 15:36:24,568 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 336 [2025-03-04 15:36:24,568 INFO L73 IsDeterministic]: Start isDeterministic. Operand 911 states and 1144 transitions. [2025-03-04 15:36:24,568 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:36:24,568 INFO L218 hiAutomatonCegarLoop]: Abstraction has 911 states and 1144 transitions. [2025-03-04 15:36:24,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 911 states and 1144 transitions. [2025-03-04 15:36:24,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 911 to 549. [2025-03-04 15:36:24,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 549 states, 549 states have (on average 1.2805100182149363) internal successors, (703), 548 states have internal predecessors, (703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:36:24,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 703 transitions. [2025-03-04 15:36:24,576 INFO L240 hiAutomatonCegarLoop]: Abstraction has 549 states and 703 transitions. [2025-03-04 15:36:24,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-04 15:36:24,577 INFO L432 stractBuchiCegarLoop]: Abstraction has 549 states and 703 transitions. [2025-03-04 15:36:24,577 INFO L338 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2025-03-04 15:36:24,577 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 549 states and 703 transitions. [2025-03-04 15:36:24,579 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 177 [2025-03-04 15:36:24,579 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:36:24,579 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:36:24,580 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [6, 5, 5, 5, 3, 3, 3, 2, 1, 1, 1] [2025-03-04 15:36:24,580 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:36:24,580 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-04 15:36:24,580 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-04 15:36:24,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:36:24,581 INFO L85 PathProgramCache]: Analyzing trace with hash -442875361, now seen corresponding path program 1 times [2025-03-04 15:36:24,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:36:24,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003626881] [2025-03-04 15:36:24,581 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:36:24,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:36:24,584 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-04 15:36:24,586 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-04 15:36:24,586 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:24,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:24,617 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-04 15:36:24,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:36:24,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003626881] [2025-03-04 15:36:24,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003626881] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:36:24,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:36:24,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 15:36:24,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915212279] [2025-03-04 15:36:24,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:36:24,618 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-04 15:36:24,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:36:24,618 INFO L85 PathProgramCache]: Analyzing trace with hash -1024486901, now seen corresponding path program 2 times [2025-03-04 15:36:24,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:36:24,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913256433] [2025-03-04 15:36:24,618 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:36:24,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:36:24,620 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 12 statements into 2 equivalence classes. [2025-03-04 15:36:24,621 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 15:36:24,621 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 15:36:24,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:36:24,621 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:36:24,621 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 15:36:24,622 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 15:36:24,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:24,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:36:24,623 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:36:24,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:36:24,663 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:36:24,663 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:36:24,663 INFO L87 Difference]: Start difference. First operand 549 states and 703 transitions. cyclomatic complexity: 174 Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:36:24,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:36:24,685 INFO L93 Difference]: Finished difference Result 537 states and 632 transitions. [2025-03-04 15:36:24,685 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 537 states and 632 transitions. [2025-03-04 15:36:24,688 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 177 [2025-03-04 15:36:24,691 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 537 states to 524 states and 614 transitions. [2025-03-04 15:36:24,691 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 179 [2025-03-04 15:36:24,691 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 179 [2025-03-04 15:36:24,691 INFO L73 IsDeterministic]: Start isDeterministic. Operand 524 states and 614 transitions. [2025-03-04 15:36:24,691 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:36:24,691 INFO L218 hiAutomatonCegarLoop]: Abstraction has 524 states and 614 transitions. [2025-03-04 15:36:24,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states and 614 transitions. [2025-03-04 15:36:24,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 508. [2025-03-04 15:36:24,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 508 states, 508 states have (on average 1.1771653543307086) internal successors, (598), 507 states have internal predecessors, (598), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:36:24,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 598 transitions. [2025-03-04 15:36:24,699 INFO L240 hiAutomatonCegarLoop]: Abstraction has 508 states and 598 transitions. [2025-03-04 15:36:24,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:36:24,699 INFO L432 stractBuchiCegarLoop]: Abstraction has 508 states and 598 transitions. [2025-03-04 15:36:24,699 INFO L338 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2025-03-04 15:36:24,699 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 508 states and 598 transitions. [2025-03-04 15:36:24,701 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 176 [2025-03-04 15:36:24,701 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:36:24,701 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:36:24,702 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [7, 6, 6, 6, 5, 3, 3, 1, 1, 1, 1] [2025-03-04 15:36:24,702 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:36:24,702 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-04 15:36:24,702 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-04 15:36:24,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:36:24,702 INFO L85 PathProgramCache]: Analyzing trace with hash 788320580, now seen corresponding path program 2 times [2025-03-04 15:36:24,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:36:24,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080383986] [2025-03-04 15:36:24,702 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:36:24,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:36:24,705 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 40 statements into 2 equivalence classes. [2025-03-04 15:36:24,708 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-03-04 15:36:24,708 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 15:36:24,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:24,780 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-04 15:36:24,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:36:24,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080383986] [2025-03-04 15:36:24,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080383986] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:36:24,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [232696962] [2025-03-04 15:36:24,781 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:36:24,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:36:24,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:24,783 INFO L229 MonitoredProcess]: Starting monitored process 85 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:36:24,784 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (85)] Waiting until timeout for monitored process [2025-03-04 15:36:24,801 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 40 statements into 2 equivalence classes. [2025-03-04 15:36:24,809 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-03-04 15:36:24,809 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 15:36:24,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:24,810 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 15:36:24,810 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:36:24,883 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-04 15:36:24,883 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 15:36:24,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [232696962] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:36:24,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 15:36:24,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 14 [2025-03-04 15:36:24,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148385451] [2025-03-04 15:36:24,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:36:24,883 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-04 15:36:24,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:36:24,884 INFO L85 PathProgramCache]: Analyzing trace with hash 696746167, now seen corresponding path program 3 times [2025-03-04 15:36:24,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:36:24,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701858522] [2025-03-04 15:36:24,884 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 15:36:24,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:36:24,886 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 12 statements into 2 equivalence classes. [2025-03-04 15:36:24,888 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 15:36:24,888 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 15:36:24,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:36:24,889 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:36:24,889 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 15:36:24,890 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 15:36:24,890 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:24,890 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:36:24,891 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:36:24,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:36:24,930 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 15:36:24,930 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2025-03-04 15:36:24,930 INFO L87 Difference]: Start difference. First operand 508 states and 598 transitions. cyclomatic complexity: 110 Second operand has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:36:24,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:36:24,969 INFO L93 Difference]: Finished difference Result 654 states and 718 transitions. [2025-03-04 15:36:24,969 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 654 states and 718 transitions. [2025-03-04 15:36:24,971 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 149 [2025-03-04 15:36:24,973 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 654 states to 647 states and 711 transitions. [2025-03-04 15:36:24,973 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 183 [2025-03-04 15:36:24,974 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 183 [2025-03-04 15:36:24,974 INFO L73 IsDeterministic]: Start isDeterministic. Operand 647 states and 711 transitions. [2025-03-04 15:36:24,974 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:36:24,974 INFO L218 hiAutomatonCegarLoop]: Abstraction has 647 states and 711 transitions. [2025-03-04 15:36:24,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 647 states and 711 transitions. [2025-03-04 15:36:24,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 647 to 528. [2025-03-04 15:36:24,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 528 states, 528 states have (on average 1.115530303030303) internal successors, (589), 527 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:36:24,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 589 transitions. [2025-03-04 15:36:24,979 INFO L240 hiAutomatonCegarLoop]: Abstraction has 528 states and 589 transitions. [2025-03-04 15:36:24,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 15:36:24,980 INFO L432 stractBuchiCegarLoop]: Abstraction has 528 states and 589 transitions. [2025-03-04 15:36:24,980 INFO L338 stractBuchiCegarLoop]: ======== Iteration 14 ============ [2025-03-04 15:36:24,980 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 528 states and 589 transitions. [2025-03-04 15:36:24,982 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 142 [2025-03-04 15:36:24,982 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:36:24,982 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:36:24,983 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [7, 6, 6, 6, 5, 5, 1, 1, 1, 1, 1] [2025-03-04 15:36:24,983 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:36:24,983 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-04 15:36:24,983 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-04 15:36:24,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:36:24,983 INFO L85 PathProgramCache]: Analyzing trace with hash -930582142, now seen corresponding path program 3 times [2025-03-04 15:36:24,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:36:24,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595045774] [2025-03-04 15:36:24,983 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 15:36:24,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:36:24,985 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 40 statements into 7 equivalence classes. [2025-03-04 15:36:24,988 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 34 of 40 statements. [2025-03-04 15:36:24,988 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-03-04 15:36:24,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:25,048 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-04 15:36:25,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:36:25,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595045774] [2025-03-04 15:36:25,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595045774] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:36:25,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1852058292] [2025-03-04 15:36:25,049 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 15:36:25,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:36:25,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:25,052 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-04 15:36:25,054 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-04 15:36:25,069 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 40 statements into 7 equivalence classes. [2025-03-04 15:36:25,078 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 34 of 40 statements. [2025-03-04 15:36:25,079 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-03-04 15:36:25,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:25,079 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 15:36:25,080 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:36:25,132 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-04 15:36:25,132 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:36:25,215 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-04 15:36:25,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1852058292] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:36:25,215 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:36:25,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2025-03-04 15:36:25,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873650945] [2025-03-04 15:36:25,215 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:36:25,215 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-04 15:36:25,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:36:25,216 INFO L85 PathProgramCache]: Analyzing trace with hash 696746167, now seen corresponding path program 4 times [2025-03-04 15:36:25,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:36:25,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550704074] [2025-03-04 15:36:25,216 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 15:36:25,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:36:25,217 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 12 statements into 2 equivalence classes. [2025-03-04 15:36:25,219 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 15:36:25,219 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 15:36:25,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:36:25,219 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:36:25,219 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 15:36:25,220 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 15:36:25,220 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:25,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:36:25,220 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:36:25,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:36:25,262 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-04 15:36:25,262 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2025-03-04 15:36:25,262 INFO L87 Difference]: Start difference. First operand 528 states and 589 transitions. cyclomatic complexity: 83 Second operand has 16 states, 15 states have (on average 5.6) internal successors, (84), 16 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:36:25,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:36:25,727 INFO L93 Difference]: Finished difference Result 2579 states and 2728 transitions. [2025-03-04 15:36:25,727 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2579 states and 2728 transitions. [2025-03-04 15:36:25,749 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 382 [2025-03-04 15:36:25,757 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2579 states to 2419 states and 2568 transitions. [2025-03-04 15:36:25,757 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 790 [2025-03-04 15:36:25,758 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 790 [2025-03-04 15:36:25,758 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2419 states and 2568 transitions. [2025-03-04 15:36:25,758 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:36:25,758 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2419 states and 2568 transitions. [2025-03-04 15:36:25,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2419 states and 2568 transitions. [2025-03-04 15:36:25,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2419 to 1966. [2025-03-04 15:36:25,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1966 states, 1966 states have (on average 1.0712105798575788) internal successors, (2106), 1965 states have internal predecessors, (2106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:36:25,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1966 states to 1966 states and 2106 transitions. [2025-03-04 15:36:25,776 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1966 states and 2106 transitions. [2025-03-04 15:36:25,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2025-03-04 15:36:25,777 INFO L432 stractBuchiCegarLoop]: Abstraction has 1966 states and 2106 transitions. [2025-03-04 15:36:25,777 INFO L338 stractBuchiCegarLoop]: ======== Iteration 15 ============ [2025-03-04 15:36:25,777 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1966 states and 2106 transitions. [2025-03-04 15:36:25,783 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 274 [2025-03-04 15:36:25,783 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:36:25,783 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:36:25,784 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [13, 12, 12, 12, 11, 11, 1, 1, 1, 1, 1] [2025-03-04 15:36:25,784 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:36:25,784 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-04 15:36:25,784 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-04 15:36:25,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:36:25,785 INFO L85 PathProgramCache]: Analyzing trace with hash -2076807644, now seen corresponding path program 4 times [2025-03-04 15:36:25,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:36:25,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675987889] [2025-03-04 15:36:25,785 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 15:36:25,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:36:25,788 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 76 statements into 2 equivalence classes. [2025-03-04 15:36:25,798 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 76 of 76 statements. [2025-03-04 15:36:25,798 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 15:36:25,798 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:25,976 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-04 15:36:25,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:36:25,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675987889] [2025-03-04 15:36:25,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675987889] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:36:25,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [785516566] [2025-03-04 15:36:25,977 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 15:36:25,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:36:25,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:25,979 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-04 15:36:25,979 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-04 15:36:25,996 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 76 statements into 2 equivalence classes. [2025-03-04 15:36:26,016 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 76 of 76 statements. [2025-03-04 15:36:26,016 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 15:36:26,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:26,017 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-04 15:36:26,018 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:36:26,126 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-04 15:36:26,126 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:36:26,346 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-04 15:36:26,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [785516566] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:36:26,346 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:36:26,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 23 [2025-03-04 15:36:26,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572742464] [2025-03-04 15:36:26,346 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:36:26,346 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-04 15:36:26,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:36:26,347 INFO L85 PathProgramCache]: Analyzing trace with hash 696746167, now seen corresponding path program 5 times [2025-03-04 15:36:26,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:36:26,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662129241] [2025-03-04 15:36:26,347 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 15:36:26,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:36:26,349 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 12 statements into 2 equivalence classes. [2025-03-04 15:36:26,350 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 15:36:26,350 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 15:36:26,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:36:26,350 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:36:26,351 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 15:36:26,351 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 15:36:26,351 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:26,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:36:26,352 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:36:26,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:36:26,392 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-04 15:36:26,392 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2025-03-04 15:36:26,392 INFO L87 Difference]: Start difference. First operand 1966 states and 2106 transitions. cyclomatic complexity: 191 Second operand has 24 states, 23 states have (on average 5.391304347826087) internal successors, (124), 24 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:36:27,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:36:27,075 INFO L93 Difference]: Finished difference Result 9799 states and 10275 transitions. [2025-03-04 15:36:27,076 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9799 states and 10275 transitions. [2025-03-04 15:36:27,128 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 1755 [2025-03-04 15:36:27,163 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9799 states to 9523 states and 9999 transitions. [2025-03-04 15:36:27,163 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3891 [2025-03-04 15:36:27,166 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3891 [2025-03-04 15:36:27,166 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9523 states and 9999 transitions. [2025-03-04 15:36:27,167 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:36:27,167 INFO L218 hiAutomatonCegarLoop]: Abstraction has 9523 states and 9999 transitions. [2025-03-04 15:36:27,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9523 states and 9999 transitions. [2025-03-04 15:36:27,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9523 to 3790. [2025-03-04 15:36:27,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3790 states, 3790 states have (on average 1.05910290237467) internal successors, (4014), 3789 states have internal predecessors, (4014), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:36:27,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3790 states to 3790 states and 4014 transitions. [2025-03-04 15:36:27,228 INFO L240 hiAutomatonCegarLoop]: Abstraction has 3790 states and 4014 transitions. [2025-03-04 15:36:27,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2025-03-04 15:36:27,228 INFO L432 stractBuchiCegarLoop]: Abstraction has 3790 states and 4014 transitions. [2025-03-04 15:36:27,228 INFO L338 stractBuchiCegarLoop]: ======== Iteration 16 ============ [2025-03-04 15:36:27,228 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3790 states and 4014 transitions. [2025-03-04 15:36:27,235 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 748 [2025-03-04 15:36:27,235 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:36:27,235 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:36:27,235 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [21, 20, 20, 20, 19, 19, 1, 1, 1, 1, 1] [2025-03-04 15:36:27,235 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:36:27,236 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-04 15:36:27,236 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-04 15:36:27,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:36:27,236 INFO L85 PathProgramCache]: Analyzing trace with hash -396693252, now seen corresponding path program 5 times [2025-03-04 15:36:27,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:36:27,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900409720] [2025-03-04 15:36:27,236 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 15:36:27,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:36:27,240 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 124 statements into 21 equivalence classes. [2025-03-04 15:36:27,269 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 21 check-sat command(s) and asserted 124 of 124 statements. [2025-03-04 15:36:27,270 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 21 check-sat command(s) [2025-03-04 15:36:27,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:36:27,270 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:36:27,273 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-04 15:36:27,280 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-04 15:36:27,284 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:27,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:36:27,288 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:36:27,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:36:27,289 INFO L85 PathProgramCache]: Analyzing trace with hash 696746167, now seen corresponding path program 6 times [2025-03-04 15:36:27,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:36:27,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565973229] [2025-03-04 15:36:27,289 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 15:36:27,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:36:27,291 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 12 statements into 2 equivalence classes. [2025-03-04 15:36:27,293 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 15:36:27,293 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-03-04 15:36:27,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:36:27,293 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:36:27,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 15:36:27,295 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 15:36:27,295 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:27,295 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:36:27,295 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:36:27,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:36:27,296 INFO L85 PathProgramCache]: Analyzing trace with hash 192008498, now seen corresponding path program 1 times [2025-03-04 15:36:27,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:36:27,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513413139] [2025-03-04 15:36:27,296 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:36:27,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:36:27,299 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-04 15:36:27,307 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-04 15:36:27,307 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:27,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:36:27,307 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:36:27,309 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-04 15:36:27,315 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-04 15:36:27,316 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:27,316 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:36:27,319 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:36:28,053 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-04 15:36:28,063 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-04 15:36:28,063 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:28,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:36:28,063 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:36:28,067 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-04 15:36:28,077 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-04 15:36:28,077 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:28,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:36:28,138 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 04.03 03:36:28 BoogieIcfgContainer [2025-03-04 15:36:28,139 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-03-04 15:36:28,139 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 15:36:28,139 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 15:36:28,139 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 15:36:28,140 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:36:18" (3/4) ... [2025-03-04 15:36:28,141 INFO L143 WitnessPrinter]: Generating witness for non-termination counterexample [2025-03-04 15:36:28,194 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-04 15:36:28,194 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 15:36:28,195 INFO L158 Benchmark]: Toolchain (without parser) took 10135.41ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 112.7MB in the beginning and 78.7MB in the end (delta: 34.0MB). Peak memory consumption was 61.8MB. Max. memory is 16.1GB. [2025-03-04 15:36:28,195 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 201.3MB. Free memory is still 123.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 15:36:28,195 INFO L158 Benchmark]: CACSL2BoogieTranslator took 116.55ms. Allocated memory is still 142.6MB. Free memory was 112.7MB in the beginning and 102.6MB in the end (delta: 10.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 15:36:28,196 INFO L158 Benchmark]: Boogie Procedure Inliner took 14.93ms. Allocated memory is still 142.6MB. Free memory was 102.6MB in the beginning and 101.6MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 15:36:28,196 INFO L158 Benchmark]: Boogie Preprocessor took 11.00ms. Allocated memory is still 142.6MB. Free memory was 101.6MB in the beginning and 101.0MB in the end (delta: 528.0kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 15:36:28,196 INFO L158 Benchmark]: IcfgBuilder took 173.32ms. Allocated memory is still 142.6MB. Free memory was 101.0MB in the beginning and 91.4MB in the end (delta: 9.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 15:36:28,196 INFO L158 Benchmark]: BuchiAutomizer took 9758.59ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 90.9MB in the beginning and 85.2MB in the end (delta: 5.7MB). Peak memory consumption was 45.0MB. Max. memory is 16.1GB. [2025-03-04 15:36:28,196 INFO L158 Benchmark]: Witness Printer took 55.38ms. Allocated memory is still 176.2MB. Free memory was 85.2MB in the beginning and 78.7MB in the end (delta: 6.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 15:36:28,197 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.16ms. Allocated memory is still 201.3MB. Free memory is still 123.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 116.55ms. Allocated memory is still 142.6MB. Free memory was 112.7MB in the beginning and 102.6MB in the end (delta: 10.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 14.93ms. Allocated memory is still 142.6MB. Free memory was 102.6MB in the beginning and 101.6MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 11.00ms. Allocated memory is still 142.6MB. Free memory was 101.6MB in the beginning and 101.0MB in the end (delta: 528.0kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 173.32ms. Allocated memory is still 142.6MB. Free memory was 101.0MB in the beginning and 91.4MB in the end (delta: 9.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * BuchiAutomizer took 9758.59ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 90.9MB in the beginning and 85.2MB in the end (delta: 5.7MB). Peak memory consumption was 45.0MB. Max. memory is 16.1GB. * Witness Printer took 55.38ms. Allocated memory is still 176.2MB. Free memory was 85.2MB in the beginning and 78.7MB in the end (delta: 6.5MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 18 terminating modules (13 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. 13 modules have a trivial ranking function, the largest among these consists of 24 locations. The remainder module has 3790 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 9.6s and 16 iterations. TraceHistogramMax:21. Analysis of lassos took 6.8s. Construction of modules took 0.6s. Büchi inclusion checks took 2.0s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 15. Automata minimization 0.2s AutomataMinimizationTime, 18 MinimizatonAttempts, 6929 StatesRemovedByMinimization, 16 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, 792 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 785 mSDsluCounter, 501 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 281 mSDsCounter, 148 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1127 IncrementalHoareTripleChecker+Invalid, 1275 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 148 mSolverCounterUnsat, 220 mSDtfsCounter, 1127 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI3 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: 28ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 6 MotzkinApplications: 18 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 8 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 6 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.7s 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-04 15:36:28,216 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-04 15:36:28,413 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (86)] Forceful destruction successful, exit code 0 [2025-03-04 15:36:28,613 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (85)] Ended with exit code 0 [2025-03-04 15:36:28,813 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (84)] Ended with exit code 0 [2025-03-04 15:36:29,013 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (83)] Ended with exit code 0 [2025-03-04 15:36:29,215 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-04 15:36:29,415 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)