./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-restricted-15/UpAndDownIneq.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-restricted-15/UpAndDownIneq.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 7c4ca36c34c25cccb97ec2e65527d2a743b4e62b95f1f396c9f281ef44a01670 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 14:21:05,963 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 14:21:06,024 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2025-02-08 14:21:06,027 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 14:21:06,028 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 14:21:06,028 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2025-02-08 14:21:06,056 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 14:21:06,058 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 14:21:06,058 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 14:21:06,059 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 14:21:06,060 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 14:21:06,060 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 14:21:06,060 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 14:21:06,060 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 14:21:06,060 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-02-08 14:21:06,060 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-02-08 14:21:06,061 INFO L153 SettingsManager]: * Use old map elimination=false [2025-02-08 14:21:06,061 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-02-08 14:21:06,061 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-02-08 14:21:06,061 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-02-08 14:21:06,061 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 14:21:06,062 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-02-08 14:21:06,062 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 14:21:06,062 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 14:21:06,062 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-02-08 14:21:06,062 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-02-08 14:21:06,062 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-02-08 14:21:06,062 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 14:21:06,062 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 14:21:06,062 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-02-08 14:21:06,063 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 14:21:06,063 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 14:21:06,063 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 14:21:06,063 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 14:21:06,064 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 14:21:06,064 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 14:21:06,064 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-02-08 14:21:06,064 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7c4ca36c34c25cccb97ec2e65527d2a743b4e62b95f1f396c9f281ef44a01670 [2025-02-08 14:21:06,358 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 14:21:06,368 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 14:21:06,370 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 14:21:06,371 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 14:21:06,371 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 14:21:06,373 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-restricted-15/UpAndDownIneq.c [2025-02-08 14:21:07,715 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a6e248b07/cade0c0a2b174414b7f1d5a8d0aeef26/FLAGed8c86bf7 [2025-02-08 14:21:07,884 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 14:21:07,890 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/termination-restricted-15/UpAndDownIneq.c [2025-02-08 14:21:07,905 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a6e248b07/cade0c0a2b174414b7f1d5a8d0aeef26/FLAGed8c86bf7 [2025-02-08 14:21:07,948 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a6e248b07/cade0c0a2b174414b7f1d5a8d0aeef26 [2025-02-08 14:21:07,951 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 14:21:07,952 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 14:21:07,953 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 14:21:07,953 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 14:21:07,958 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 14:21:07,959 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 02:21:07" (1/1) ... [2025-02-08 14:21:07,960 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29775e27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:21:07, skipping insertion in model container [2025-02-08 14:21:07,960 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 02:21:07" (1/1) ... [2025-02-08 14:21:07,973 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 14:21:08,073 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 14:21:08,078 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 14:21:08,086 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 14:21:08,100 INFO L204 MainTranslator]: Completed translation [2025-02-08 14:21:08,101 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:21:08 WrapperNode [2025-02-08 14:21:08,101 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 14:21:08,102 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 14:21:08,102 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 14:21:08,102 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 14:21:08,108 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:21:08" (1/1) ... [2025-02-08 14:21:08,111 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:21:08" (1/1) ... [2025-02-08 14:21:08,125 INFO L138 Inliner]: procedures = 4, calls = 2, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 18 [2025-02-08 14:21:08,127 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 14:21:08,128 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 14:21:08,128 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 14:21:08,129 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 14:21:08,135 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:21:08" (1/1) ... [2025-02-08 14:21:08,136 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:21:08" (1/1) ... [2025-02-08 14:21:08,136 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:21:08" (1/1) ... [2025-02-08 14:21:08,142 INFO L175 MemorySlicer]: No memory access in input program. [2025-02-08 14:21:08,142 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:21:08" (1/1) ... [2025-02-08 14:21:08,143 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:21:08" (1/1) ... [2025-02-08 14:21:08,144 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:21:08" (1/1) ... [2025-02-08 14:21:08,144 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:21:08" (1/1) ... [2025-02-08 14:21:08,145 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:21:08" (1/1) ... [2025-02-08 14:21:08,145 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:21:08" (1/1) ... [2025-02-08 14:21:08,146 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 14:21:08,149 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 14:21:08,150 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 14:21:08,150 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 14:21:08,151 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:21:08" (1/1) ... [2025-02-08 14:21:08,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:21:08,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:21:08,190 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:21:08,195 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2025-02-08 14:21:08,223 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 14:21:08,223 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 14:21:08,273 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 14:21:08,275 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 14:21:08,354 INFO L? ?]: Removed 2 outVars from TransFormulas that were not future-live. [2025-02-08 14:21:08,357 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 14:21:08,366 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 14:21:08,367 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 14:21:08,367 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 02:21:08 BoogieIcfgContainer [2025-02-08 14:21:08,367 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 14:21:08,368 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-02-08 14:21:08,368 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-02-08 14:21:08,373 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-02-08 14:21:08,374 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-08 14:21:08,374 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 08.02 02:21:07" (1/3) ... [2025-02-08 14:21:08,376 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4ea4445c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 08.02 02:21:08, skipping insertion in model container [2025-02-08 14:21:08,376 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-08 14:21:08,377 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:21:08" (2/3) ... [2025-02-08 14:21:08,377 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4ea4445c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 08.02 02:21:08, skipping insertion in model container [2025-02-08 14:21:08,377 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-08 14:21:08,377 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 02:21:08" (3/3) ... [2025-02-08 14:21:08,379 INFO L363 chiAutomizerObserver]: Analyzing ICFG UpAndDownIneq.c [2025-02-08 14:21:08,428 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-02-08 14:21:08,428 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-02-08 14:21:08,428 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-02-08 14:21:08,428 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-02-08 14:21:08,428 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-02-08 14:21:08,429 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-02-08 14:21:08,429 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-02-08 14:21:08,429 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-02-08 14:21:08,433 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:21:08,444 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2025-02-08 14:21:08,444 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:21:08,444 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:21:08,448 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-02-08 14:21:08,448 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-02-08 14:21:08,449 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-02-08 14:21:08,449 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:21:08,449 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2025-02-08 14:21:08,450 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:21:08,450 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:21:08,450 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-02-08 14:21:08,450 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-02-08 14:21:08,456 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0;" [2025-02-08 14:21:08,457 INFO L754 eck$LassoCheckResult]: Loop: "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume main_~i~0#1 >= 10;main_~up~0#1 := 0;" "assume main_~i~0#1 <= 0;main_~up~0#1 := 1;" "assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1;" [2025-02-08 14:21:08,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:21:08,461 INFO L85 PathProgramCache]: Analyzing trace with hash 39, now seen corresponding path program 1 times [2025-02-08 14:21:08,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:21:08,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480420614] [2025-02-08 14:21:08,468 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:21:08,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:21:08,532 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-08 14:21:08,535 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-08 14:21:08,536 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:21:08,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:21:08,537 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:21:08,540 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-08 14:21:08,541 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-08 14:21:08,541 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:21:08,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:21:08,553 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:21:08,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:21:08,557 INFO L85 PathProgramCache]: Analyzing trace with hash 1136957, now seen corresponding path program 1 times [2025-02-08 14:21:08,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:21:08,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746688791] [2025-02-08 14:21:08,557 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:21:08,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:21:08,564 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 14:21:08,571 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 14:21:08,571 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:21:08,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:21:08,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:21:08,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:21:08,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746688791] [2025-02-08 14:21:08,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746688791] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:21:08,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:21:08,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 14:21:08,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667067973] [2025-02-08 14:21:08,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:21:08,652 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-02-08 14:21:08,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:21:08,672 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 14:21:08,672 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 14:21:08,674 INFO L87 Difference]: Start difference. First operand has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:21:08,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 14:21:08,720 INFO L93 Difference]: Finished difference Result 11 states and 16 transitions. [2025-02-08 14:21:08,721 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 16 transitions. [2025-02-08 14:21:08,722 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2025-02-08 14:21:08,726 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 9 states and 13 transitions. [2025-02-08 14:21:08,728 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2025-02-08 14:21:08,729 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2025-02-08 14:21:08,729 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 13 transitions. [2025-02-08 14:21:08,730 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-08 14:21:08,730 INFO L218 hiAutomatonCegarLoop]: Abstraction has 9 states and 13 transitions. [2025-02-08 14:21:08,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 13 transitions. [2025-02-08 14:21:08,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2025-02-08 14:21:08,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 8 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:21:08,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 13 transitions. [2025-02-08 14:21:08,748 INFO L240 hiAutomatonCegarLoop]: Abstraction has 9 states and 13 transitions. [2025-02-08 14:21:08,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 14:21:08,755 INFO L432 stractBuchiCegarLoop]: Abstraction has 9 states and 13 transitions. [2025-02-08 14:21:08,755 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-02-08 14:21:08,755 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 13 transitions. [2025-02-08 14:21:08,756 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2025-02-08 14:21:08,756 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:21:08,756 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:21:08,756 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-02-08 14:21:08,756 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-02-08 14:21:08,756 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0;" [2025-02-08 14:21:08,757 INFO L754 eck$LassoCheckResult]: Loop: "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume main_~i~0#1 >= 10;main_~up~0#1 := 0;" "assume !(main_~i~0#1 <= 0);" "assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1;" [2025-02-08 14:21:08,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:21:08,757 INFO L85 PathProgramCache]: Analyzing trace with hash 39, now seen corresponding path program 2 times [2025-02-08 14:21:08,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:21:08,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158123737] [2025-02-08 14:21:08,757 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 14:21:08,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:21:08,761 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1 statements into 1 equivalence classes. [2025-02-08 14:21:08,762 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-08 14:21:08,763 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 14:21:08,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:21:08,763 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:21:08,765 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-08 14:21:08,766 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-08 14:21:08,766 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:21:08,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:21:08,767 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:21:08,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:21:08,768 INFO L85 PathProgramCache]: Analyzing trace with hash 1136989, now seen corresponding path program 1 times [2025-02-08 14:21:08,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:21:08,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248227977] [2025-02-08 14:21:08,768 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:21:08,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:21:08,773 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 14:21:08,778 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 14:21:08,779 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:21:08,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:21:08,779 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:21:08,781 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 14:21:08,784 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 14:21:08,785 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:21:08,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:21:08,786 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:21:08,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:21:08,788 INFO L85 PathProgramCache]: Analyzing trace with hash 36230787, now seen corresponding path program 1 times [2025-02-08 14:21:08,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:21:08,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440263815] [2025-02-08 14:21:08,788 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:21:08,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:21:08,794 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 14:21:08,799 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 14:21:08,800 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:21:08,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:21:08,800 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:21:08,801 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 14:21:08,804 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 14:21:08,807 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:21:08,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:21:08,808 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:21:08,879 INFO L204 LassoAnalysis]: Preferences: [2025-02-08 14:21:08,879 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-08 14:21:08,879 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-08 14:21:08,880 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-08 14:21:08,880 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-08 14:21:08,880 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:21:08,880 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-08 14:21:08,880 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-08 14:21:08,880 INFO L132 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq.c_Iteration2_Loop [2025-02-08 14:21:08,880 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-08 14:21:08,880 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-08 14:21:08,894 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:21:08,906 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:21:08,912 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:21:08,918 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:21:08,998 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-08 14:21:08,998 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-08 14:21:09,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:21:09,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:21:09,004 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:21:09,006 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2025-02-08 14:21:09,006 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-08 14:21:09,007 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-08 14:21:09,025 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-02-08 14:21:09,025 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-02-08 14:21:09,032 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2025-02-08 14:21:09,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:21:09,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:21:09,035 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:21:09,037 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-02-08 14:21:09,038 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-08 14:21:09,038 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-08 14:21:09,060 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-02-08 14:21:09,060 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_1=1} Honda state: {v_rep~unnamed0~0~true_1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-02-08 14:21:09,066 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2025-02-08 14:21:09,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:21:09,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:21:09,069 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:21:09,071 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-02-08 14:21:09,073 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-08 14:21:09,073 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-08 14:21:09,092 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-02-08 14:21:09,092 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_1=0} Honda state: {v_rep~unnamed0~0~false_1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-02-08 14:21:09,099 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2025-02-08 14:21:09,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:21:09,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:21:09,102 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:21:09,103 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-02-08 14:21:09,105 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-08 14:21:09,105 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-08 14:21:09,123 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2025-02-08 14:21:09,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:21:09,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:21:09,126 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:21:09,127 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-02-08 14:21:09,128 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-08 14:21:09,128 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-08 14:21:09,149 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-08 14:21:09,156 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2025-02-08 14:21:09,156 INFO L204 LassoAnalysis]: Preferences: [2025-02-08 14:21:09,157 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-08 14:21:09,157 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-08 14:21:09,157 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-08 14:21:09,157 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-08 14:21:09,157 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:21:09,157 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-08 14:21:09,157 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-08 14:21:09,157 INFO L132 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq.c_Iteration2_Loop [2025-02-08 14:21:09,157 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-08 14:21:09,157 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-08 14:21:09,158 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:21:09,166 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:21:09,171 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:21:09,180 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:21:09,248 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-08 14:21:09,252 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-08 14:21:09,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:21:09,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:21:09,255 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:21:09,258 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-02-08 14:21:09,259 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-02-08 14:21:09,271 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:21:09,272 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:21:09,272 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:21:09,272 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:21:09,280 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:21:09,281 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:21:09,290 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:21:09,297 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2025-02-08 14:21:09,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:21:09,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:21:09,300 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:21:09,302 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-02-08 14:21:09,303 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-02-08 14:21:09,315 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:21:09,315 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:21:09,315 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:21:09,315 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:21:09,318 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:21:09,318 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:21:09,323 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:21:09,331 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2025-02-08 14:21:09,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:21:09,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:21:09,333 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:21:09,336 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-02-08 14:21:09,337 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-02-08 14:21:09,348 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:21:09,348 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:21:09,349 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:21:09,349 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:21:09,349 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:21:09,352 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:21:09,352 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:21:09,358 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-08 14:21:09,362 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-02-08 14:21:09,364 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-02-08 14:21:09,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:21:09,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:21:09,368 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:21:09,369 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-02-08 14:21:09,370 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-08 14:21:09,370 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-08 14:21:09,370 INFO L474 LassoAnalysis]: Proved termination. [2025-02-08 14:21:09,370 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-02-08 14:21:09,378 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2025-02-08 14:21:09,381 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-08 14:21:09,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:21:09,403 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-08 14:21:09,404 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-08 14:21:09,404 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:21:09,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:21:09,405 WARN L254 TraceCheckSpWp]: Trace formula consists of 4 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-08 14:21:09,406 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:21:09,412 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 14:21:09,414 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 14:21:09,414 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:21:09,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:21:09,414 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-08 14:21:09,415 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:21:09,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:21:09,441 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-02-08 14:21:09,442 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 9 states and 13 transitions. cyclomatic complexity: 5 Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:21:09,499 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 9 states and 13 transitions. cyclomatic complexity: 5. Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 24 states and 36 transitions. Complement of second has 7 states. [2025-02-08 14:21:09,500 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-02-08 14:21:09,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:21:09,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2025-02-08 14:21:09,506 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 1 letters. Loop has 4 letters. [2025-02-08 14:21:09,507 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:21:09,508 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 5 letters. Loop has 4 letters. [2025-02-08 14:21:09,509 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:21:09,509 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 1 letters. Loop has 8 letters. [2025-02-08 14:21:09,509 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:21:09,509 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 36 transitions. [2025-02-08 14:21:09,510 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2025-02-08 14:21:09,511 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 24 states and 36 transitions. [2025-02-08 14:21:09,512 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2025-02-08 14:21:09,512 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2025-02-08 14:21:09,513 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 36 transitions. [2025-02-08 14:21:09,513 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-08 14:21:09,513 INFO L218 hiAutomatonCegarLoop]: Abstraction has 24 states and 36 transitions. [2025-02-08 14:21:09,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 36 transitions. [2025-02-08 14:21:09,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2025-02-08 14:21:09,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.4782608695652173) internal successors, (34), 22 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:21:09,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 34 transitions. [2025-02-08 14:21:09,516 INFO L240 hiAutomatonCegarLoop]: Abstraction has 23 states and 34 transitions. [2025-02-08 14:21:09,516 INFO L432 stractBuchiCegarLoop]: Abstraction has 23 states and 34 transitions. [2025-02-08 14:21:09,516 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-02-08 14:21:09,516 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 34 transitions. [2025-02-08 14:21:09,517 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2025-02-08 14:21:09,518 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:21:09,518 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:21:09,518 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-02-08 14:21:09,518 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-02-08 14:21:09,519 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" [2025-02-08 14:21:09,519 INFO L754 eck$LassoCheckResult]: Loop: "assume !(main_~i~0#1 >= 10);" "assume main_~i~0#1 <= 0;main_~up~0#1 := 1;" "assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" [2025-02-08 14:21:09,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:21:09,520 INFO L85 PathProgramCache]: Analyzing trace with hash 1216, now seen corresponding path program 1 times [2025-02-08 14:21:09,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:21:09,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874974369] [2025-02-08 14:21:09,520 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:21:09,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:21:09,525 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-08 14:21:09,528 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-08 14:21:09,529 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:21:09,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:21:09,529 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:21:09,531 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-08 14:21:09,532 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-08 14:21:09,532 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:21:09,533 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:21:09,534 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:21:09,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:21:09,535 INFO L85 PathProgramCache]: Analyzing trace with hash 1105219, now seen corresponding path program 1 times [2025-02-08 14:21:09,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:21:09,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413851420] [2025-02-08 14:21:09,535 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:21:09,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:21:09,542 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 14:21:09,544 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 14:21:09,544 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:21:09,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:21:09,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:21:09,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:21:09,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413851420] [2025-02-08 14:21:09,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413851420] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:21:09,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:21:09,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 14:21:09,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190228002] [2025-02-08 14:21:09,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:21:09,558 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-02-08 14:21:09,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:21:09,558 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 14:21:09,558 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 14:21:09,558 INFO L87 Difference]: Start difference. First operand 23 states and 34 transitions. cyclomatic complexity: 14 Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:21:09,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 14:21:09,568 INFO L93 Difference]: Finished difference Result 29 states and 41 transitions. [2025-02-08 14:21:09,568 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 41 transitions. [2025-02-08 14:21:09,569 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 16 [2025-02-08 14:21:09,570 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 28 states and 40 transitions. [2025-02-08 14:21:09,570 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2025-02-08 14:21:09,570 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2025-02-08 14:21:09,570 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 40 transitions. [2025-02-08 14:21:09,570 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-08 14:21:09,570 INFO L218 hiAutomatonCegarLoop]: Abstraction has 28 states and 40 transitions. [2025-02-08 14:21:09,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 40 transitions. [2025-02-08 14:21:09,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2025-02-08 14:21:09,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 1.4444444444444444) internal successors, (39), 26 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:21:09,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 39 transitions. [2025-02-08 14:21:09,572 INFO L240 hiAutomatonCegarLoop]: Abstraction has 27 states and 39 transitions. [2025-02-08 14:21:09,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 14:21:09,573 INFO L432 stractBuchiCegarLoop]: Abstraction has 27 states and 39 transitions. [2025-02-08 14:21:09,573 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-02-08 14:21:09,574 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 39 transitions. [2025-02-08 14:21:09,574 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 16 [2025-02-08 14:21:09,574 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:21:09,574 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:21:09,574 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-02-08 14:21:09,574 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-02-08 14:21:09,574 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" [2025-02-08 14:21:09,574 INFO L754 eck$LassoCheckResult]: Loop: "assume !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" "assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" [2025-02-08 14:21:09,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:21:09,575 INFO L85 PathProgramCache]: Analyzing trace with hash 1216, now seen corresponding path program 2 times [2025-02-08 14:21:09,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:21:09,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854470593] [2025-02-08 14:21:09,575 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 14:21:09,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:21:09,578 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-02-08 14:21:09,579 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-08 14:21:09,579 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 14:21:09,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:21:09,579 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:21:09,580 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-08 14:21:09,581 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-08 14:21:09,581 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:21:09,581 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:21:09,581 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:21:09,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:21:09,582 INFO L85 PathProgramCache]: Analyzing trace with hash 1106180, now seen corresponding path program 1 times [2025-02-08 14:21:09,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:21:09,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983129020] [2025-02-08 14:21:09,582 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:21:09,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:21:09,604 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 14:21:09,605 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 14:21:09,605 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:21:09,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:21:09,605 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:21:09,611 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 14:21:09,617 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 14:21:09,618 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:21:09,618 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:21:09,618 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2025-02-08 14:21:09,619 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:21:09,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:21:09,620 INFO L85 PathProgramCache]: Analyzing trace with hash 1123184195, now seen corresponding path program 1 times [2025-02-08 14:21:09,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:21:09,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590424937] [2025-02-08 14:21:09,620 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:21:09,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:21:09,624 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 14:21:09,625 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 14:21:09,626 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:21:09,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:21:09,626 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:21:09,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 14:21:09,629 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 14:21:09,629 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:21:09,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:21:09,630 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:21:09,681 INFO L204 LassoAnalysis]: Preferences: [2025-02-08 14:21:09,681 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-08 14:21:09,681 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-08 14:21:09,681 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-08 14:21:09,681 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-08 14:21:09,681 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:21:09,682 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-08 14:21:09,682 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-08 14:21:09,682 INFO L132 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq.c_Iteration4_Loop [2025-02-08 14:21:09,682 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-08 14:21:09,682 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-08 14:21:09,683 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:21:09,687 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:21:09,695 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:21:09,699 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:21:09,743 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-08 14:21:09,743 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-08 14:21:09,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:21:09,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:21:09,746 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:21:09,748 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-02-08 14:21:09,748 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-08 14:21:09,749 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-08 14:21:09,770 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-02-08 14:21:09,771 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-02-08 14:21:09,777 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2025-02-08 14:21:09,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:21:09,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:21:09,780 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:21:09,781 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2025-02-08 14:21:09,781 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-08 14:21:09,782 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-08 14:21:09,800 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2025-02-08 14:21:09,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:21:09,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:21:09,803 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:21:09,805 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2025-02-08 14:21:09,805 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-08 14:21:09,805 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-08 14:21:09,834 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-08 14:21:09,838 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2025-02-08 14:21:09,839 INFO L204 LassoAnalysis]: Preferences: [2025-02-08 14:21:09,839 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-08 14:21:09,839 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-08 14:21:09,839 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-08 14:21:09,839 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-08 14:21:09,839 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:21:09,839 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-08 14:21:09,839 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-08 14:21:09,839 INFO L132 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq.c_Iteration4_Loop [2025-02-08 14:21:09,839 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-08 14:21:09,839 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-08 14:21:09,841 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:21:09,847 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:21:09,860 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:21:09,870 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:21:09,909 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-08 14:21:09,909 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-08 14:21:09,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:21:09,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:21:09,911 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:21:09,913 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2025-02-08 14:21:09,914 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-02-08 14:21:09,925 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:21:09,925 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:21:09,925 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:21:09,925 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:21:09,930 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:21:09,930 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:21:09,933 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:21:09,939 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2025-02-08 14:21:09,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:21:09,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:21:09,942 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:21:09,944 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2025-02-08 14:21:09,945 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-02-08 14:21:09,956 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:21:09,956 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:21:09,956 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:21:09,956 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:21:09,956 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:21:09,958 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:21:09,958 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:21:09,960 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-08 14:21:09,962 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2025-02-08 14:21:09,962 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-02-08 14:21:09,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:21:09,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:21:09,964 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:21:09,965 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2025-02-08 14:21:09,966 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-08 14:21:09,967 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-08 14:21:09,967 INFO L474 LassoAnalysis]: Proved termination. [2025-02-08 14:21:09,967 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-02-08 14:21:09,973 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2025-02-08 14:21:09,974 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-08 14:21:09,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:21:10,001 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-08 14:21:10,004 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-08 14:21:10,004 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:21:10,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:21:10,005 INFO L256 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-08 14:21:10,005 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:21:10,011 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 14:21:10,014 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 14:21:10,014 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:21:10,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:21:10,014 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-08 14:21:10,014 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:21:10,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:21:10,066 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-02-08 14:21:10,066 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 39 transitions. cyclomatic complexity: 15 Second operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:21:10,094 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 39 transitions. cyclomatic complexity: 15. Second operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 45 states and 68 transitions. Complement of second has 7 states. [2025-02-08 14:21:10,095 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-02-08 14:21:10,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:21:10,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2025-02-08 14:21:10,096 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 2 letters. Loop has 4 letters. [2025-02-08 14:21:10,096 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:21:10,096 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 6 letters. Loop has 4 letters. [2025-02-08 14:21:10,096 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:21:10,096 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 2 letters. Loop has 8 letters. [2025-02-08 14:21:10,097 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:21:10,097 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 68 transitions. [2025-02-08 14:21:10,098 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2025-02-08 14:21:10,102 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 37 states and 55 transitions. [2025-02-08 14:21:10,102 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2025-02-08 14:21:10,102 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2025-02-08 14:21:10,102 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 55 transitions. [2025-02-08 14:21:10,102 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-08 14:21:10,102 INFO L218 hiAutomatonCegarLoop]: Abstraction has 37 states and 55 transitions. [2025-02-08 14:21:10,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 55 transitions. [2025-02-08 14:21:10,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 30. [2025-02-08 14:21:10,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 29 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:21:10,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 44 transitions. [2025-02-08 14:21:10,104 INFO L240 hiAutomatonCegarLoop]: Abstraction has 30 states and 44 transitions. [2025-02-08 14:21:10,104 INFO L432 stractBuchiCegarLoop]: Abstraction has 30 states and 44 transitions. [2025-02-08 14:21:10,104 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-02-08 14:21:10,104 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 44 transitions. [2025-02-08 14:21:10,107 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2025-02-08 14:21:10,107 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:21:10,107 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:21:10,107 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-02-08 14:21:10,107 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-02-08 14:21:10,107 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" [2025-02-08 14:21:10,107 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~i~0#1 <= 0;main_~up~0#1 := 1;" "assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" [2025-02-08 14:21:10,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:21:10,108 INFO L85 PathProgramCache]: Analyzing trace with hash 37702, now seen corresponding path program 1 times [2025-02-08 14:21:10,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:21:10,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174154243] [2025-02-08 14:21:10,108 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:21:10,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:21:10,110 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 14:21:10,114 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 14:21:10,117 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:21:10,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:21:10,118 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:21:10,119 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 14:21:10,120 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 14:21:10,123 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:21:10,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:21:10,124 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:21:10,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:21:10,124 INFO L85 PathProgramCache]: Analyzing trace with hash 1014078, now seen corresponding path program 1 times [2025-02-08 14:21:10,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:21:10,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958374552] [2025-02-08 14:21:10,124 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:21:10,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:21:10,126 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 14:21:10,129 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 14:21:10,129 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:21:10,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:21:10,129 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:21:10,131 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 14:21:10,135 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 14:21:10,135 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:21:10,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:21:10,136 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:21:10,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:21:10,140 INFO L85 PathProgramCache]: Analyzing trace with hash 458940931, now seen corresponding path program 1 times [2025-02-08 14:21:10,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:21:10,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523454103] [2025-02-08 14:21:10,140 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:21:10,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:21:10,142 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 14:21:10,146 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 14:21:10,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:21:10,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:21:10,147 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:21:10,148 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 14:21:10,150 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 14:21:10,150 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:21:10,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:21:10,151 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:21:10,185 INFO L204 LassoAnalysis]: Preferences: [2025-02-08 14:21:10,185 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-08 14:21:10,185 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-08 14:21:10,185 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-08 14:21:10,185 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-08 14:21:10,185 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:21:10,185 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-08 14:21:10,186 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-08 14:21:10,186 INFO L132 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq.c_Iteration5_Loop [2025-02-08 14:21:10,186 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-08 14:21:10,186 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-08 14:21:10,186 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:21:10,202 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:21:10,204 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:21:10,207 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:21:10,244 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-08 14:21:10,244 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-08 14:21:10,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:21:10,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:21:10,249 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:21:10,265 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2025-02-08 14:21:10,265 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-08 14:21:10,266 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-08 14:21:10,284 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2025-02-08 14:21:10,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:21:10,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:21:10,285 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:21:10,286 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2025-02-08 14:21:10,288 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-08 14:21:10,288 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-08 14:21:10,310 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-08 14:21:10,314 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2025-02-08 14:21:10,314 INFO L204 LassoAnalysis]: Preferences: [2025-02-08 14:21:10,314 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-08 14:21:10,314 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-08 14:21:10,314 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-08 14:21:10,314 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-08 14:21:10,314 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:21:10,314 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-08 14:21:10,314 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-08 14:21:10,314 INFO L132 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq.c_Iteration5_Loop [2025-02-08 14:21:10,314 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-08 14:21:10,314 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-08 14:21:10,315 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:21:10,322 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:21:10,325 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:21:10,332 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:21:10,373 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-08 14:21:10,373 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-08 14:21:10,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:21:10,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:21:10,376 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:21:10,392 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2025-02-08 14:21:10,393 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-02-08 14:21:10,404 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:21:10,404 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:21:10,404 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:21:10,405 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:21:10,405 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:21:10,406 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:21:10,406 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:21:10,410 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-08 14:21:10,413 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-02-08 14:21:10,413 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-02-08 14:21:10,414 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:21:10,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:21:10,416 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:21:10,417 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2025-02-08 14:21:10,418 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-08 14:21:10,418 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-08 14:21:10,418 INFO L474 LassoAnalysis]: Proved termination. [2025-02-08 14:21:10,419 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = -2*ULTIMATE.start_main_~i~0#1 + 1 Supporting invariants [] [2025-02-08 14:21:10,424 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2025-02-08 14:21:10,425 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-08 14:21:10,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:21:10,451 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 14:21:10,453 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 14:21:10,453 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:21:10,453 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:21:10,453 INFO L256 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-08 14:21:10,453 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:21:10,467 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 14:21:10,469 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 14:21:10,469 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:21:10,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:21:10,470 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-08 14:21:10,470 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:21:10,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:21:10,513 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-02-08 14:21:10,513 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 30 states and 44 transitions. cyclomatic complexity: 17 Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:21:10,543 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 30 states and 44 transitions. cyclomatic complexity: 17. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 76 states and 108 transitions. Complement of second has 7 states. [2025-02-08 14:21:10,543 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-02-08 14:21:10,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:21:10,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 17 transitions. [2025-02-08 14:21:10,544 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 3 letters. Loop has 4 letters. [2025-02-08 14:21:10,544 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:21:10,544 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 7 letters. Loop has 4 letters. [2025-02-08 14:21:10,544 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:21:10,544 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 3 letters. Loop has 8 letters. [2025-02-08 14:21:10,544 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:21:10,545 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 76 states and 108 transitions. [2025-02-08 14:21:10,546 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 26 [2025-02-08 14:21:10,546 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 76 states to 68 states and 98 transitions. [2025-02-08 14:21:10,546 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 39 [2025-02-08 14:21:10,546 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2025-02-08 14:21:10,546 INFO L73 IsDeterministic]: Start isDeterministic. Operand 68 states and 98 transitions. [2025-02-08 14:21:10,547 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-08 14:21:10,547 INFO L218 hiAutomatonCegarLoop]: Abstraction has 68 states and 98 transitions. [2025-02-08 14:21:10,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states and 98 transitions. [2025-02-08 14:21:10,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 56. [2025-02-08 14:21:10,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 56 states have (on average 1.5) internal successors, (84), 55 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:21:10,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 84 transitions. [2025-02-08 14:21:10,550 INFO L240 hiAutomatonCegarLoop]: Abstraction has 56 states and 84 transitions. [2025-02-08 14:21:10,550 INFO L432 stractBuchiCegarLoop]: Abstraction has 56 states and 84 transitions. [2025-02-08 14:21:10,550 INFO L338 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-02-08 14:21:10,550 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 56 states and 84 transitions. [2025-02-08 14:21:10,550 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 22 [2025-02-08 14:21:10,550 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:21:10,550 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:21:10,551 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-02-08 14:21:10,551 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-02-08 14:21:10,551 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" [2025-02-08 14:21:10,551 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" [2025-02-08 14:21:10,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:21:10,551 INFO L85 PathProgramCache]: Analyzing trace with hash 1168766, now seen corresponding path program 1 times [2025-02-08 14:21:10,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:21:10,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113067376] [2025-02-08 14:21:10,551 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:21:10,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:21:10,557 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 14:21:10,558 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 14:21:10,558 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:21:10,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:21:10,558 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:21:10,558 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 14:21:10,559 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 14:21:10,560 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:21:10,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:21:10,561 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:21:10,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:21:10,561 INFO L85 PathProgramCache]: Analyzing trace with hash 960229, now seen corresponding path program 1 times [2025-02-08 14:21:10,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:21:10,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331107404] [2025-02-08 14:21:10,562 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:21:10,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:21:10,568 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 14:21:10,569 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 14:21:10,569 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:21:10,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:21:10,569 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:21:10,570 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 14:21:10,570 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 14:21:10,570 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:21:10,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:21:10,571 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:21:10,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:21:10,571 INFO L85 PathProgramCache]: Analyzing trace with hash 1343190498, now seen corresponding path program 1 times [2025-02-08 14:21:10,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:21:10,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035432193] [2025-02-08 14:21:10,571 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:21:10,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:21:10,577 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 14:21:10,578 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 14:21:10,578 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:21:10,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:21:10,592 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:21:10,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:21:10,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035432193] [2025-02-08 14:21:10,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035432193] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:21:10,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:21:10,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 14:21:10,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361206427] [2025-02-08 14:21:10,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:21:10,622 INFO L204 LassoAnalysis]: Preferences: [2025-02-08 14:21:10,622 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-08 14:21:10,622 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-08 14:21:10,622 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-08 14:21:10,622 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-08 14:21:10,622 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:21:10,622 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-08 14:21:10,622 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-08 14:21:10,622 INFO L132 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq.c_Iteration6_Loop [2025-02-08 14:21:10,622 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-08 14:21:10,622 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-08 14:21:10,623 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:21:10,625 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:21:10,629 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:21:10,640 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:21:10,668 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-08 14:21:10,668 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-08 14:21:10,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:21:10,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:21:10,670 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:21:10,672 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2025-02-08 14:21:10,673 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-08 14:21:10,673 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-08 14:21:10,691 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-02-08 14:21:10,691 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-02-08 14:21:10,697 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2025-02-08 14:21:10,697 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:21:10,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:21:10,699 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:21:10,701 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2025-02-08 14:21:10,702 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-08 14:21:10,702 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-08 14:21:10,719 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-02-08 14:21:10,719 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_7=1} Honda state: {v_rep~unnamed0~0~true_7=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-02-08 14:21:10,725 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2025-02-08 14:21:10,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:21:10,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:21:10,727 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:21:10,729 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2025-02-08 14:21:10,729 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-08 14:21:10,729 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-08 14:21:10,758 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2025-02-08 14:21:10,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:21:10,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:21:10,760 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:21:10,761 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2025-02-08 14:21:10,762 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-08 14:21:10,762 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-08 14:21:10,801 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-08 14:21:10,805 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2025-02-08 14:21:10,806 INFO L204 LassoAnalysis]: Preferences: [2025-02-08 14:21:10,806 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-08 14:21:10,806 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-08 14:21:10,806 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-08 14:21:10,806 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-08 14:21:10,806 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:21:10,806 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-08 14:21:10,806 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-08 14:21:10,806 INFO L132 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq.c_Iteration6_Loop [2025-02-08 14:21:10,806 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-08 14:21:10,806 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-08 14:21:10,807 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:21:10,810 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:21:10,812 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:21:10,823 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:21:10,868 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-08 14:21:10,868 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-08 14:21:10,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:21:10,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:21:10,871 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:21:10,872 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2025-02-08 14:21:10,873 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-02-08 14:21:10,885 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:21:10,885 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:21:10,885 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:21:10,885 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:21:10,885 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:21:10,886 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:21:10,886 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:21:10,887 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:21:10,894 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2025-02-08 14:21:10,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:21:10,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:21:10,897 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:21:10,898 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2025-02-08 14:21:10,899 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-02-08 14:21:10,911 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:21:10,911 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:21:10,911 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:21:10,911 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:21:10,913 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:21:10,913 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:21:10,918 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:21:10,926 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2025-02-08 14:21:10,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:21:10,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:21:10,928 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:21:10,931 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2025-02-08 14:21:10,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-02-08 14:21:10,944 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:21:10,944 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:21:10,944 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:21:10,944 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:21:10,944 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:21:10,947 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:21:10,947 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:21:10,951 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-08 14:21:10,953 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-02-08 14:21:10,953 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-02-08 14:21:10,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:21:10,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:21:10,956 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:21:10,957 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2025-02-08 14:21:10,958 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-08 14:21:10,958 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-08 14:21:10,958 INFO L474 LassoAnalysis]: Proved termination. [2025-02-08 14:21:10,958 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = -2*ULTIMATE.start_main_~i~0#1 + 17 Supporting invariants [] [2025-02-08 14:21:10,968 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2025-02-08 14:21:10,969 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-08 14:21:10,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:21:10,989 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 14:21:10,990 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 14:21:10,990 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:21:10,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:21:10,990 INFO L256 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-08 14:21:10,991 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:21:11,004 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 14:21:11,005 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 14:21:11,005 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:21:11,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:21:11,006 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-08 14:21:11,006 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:21:11,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:21:11,033 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-02-08 14:21:11,033 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 56 states and 84 transitions. cyclomatic complexity: 35 Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:21:11,053 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2025-02-08 14:21:11,059 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2025-02-08 14:21:11,065 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2025-02-08 14:21:11,160 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 56 states and 84 transitions. cyclomatic complexity: 35. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 155 states and 227 transitions. Complement of second has 7 states. [2025-02-08 14:21:11,160 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-02-08 14:21:11,161 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-02-08 14:21:11,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 22 transitions. [2025-02-08 14:21:11,161 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 4 letters. Loop has 4 letters. [2025-02-08 14:21:11,161 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:21:11,161 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 8 letters. Loop has 4 letters. [2025-02-08 14:21:11,161 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:21:11,161 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 4 letters. Loop has 8 letters. [2025-02-08 14:21:11,161 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:21:11,161 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 155 states and 227 transitions. [2025-02-08 14:21:11,164 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 43 [2025-02-08 14:21:11,165 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 155 states to 151 states and 219 transitions. [2025-02-08 14:21:11,165 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 69 [2025-02-08 14:21:11,166 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 78 [2025-02-08 14:21:11,166 INFO L73 IsDeterministic]: Start isDeterministic. Operand 151 states and 219 transitions. [2025-02-08 14:21:11,166 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-08 14:21:11,166 INFO L218 hiAutomatonCegarLoop]: Abstraction has 151 states and 219 transitions. [2025-02-08 14:21:11,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states and 219 transitions. [2025-02-08 14:21:11,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 125. [2025-02-08 14:21:11,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 125 states have (on average 1.512) internal successors, (189), 124 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:21:11,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 189 transitions. [2025-02-08 14:21:11,172 INFO L240 hiAutomatonCegarLoop]: Abstraction has 125 states and 189 transitions. [2025-02-08 14:21:11,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:21:11,172 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 14:21:11,173 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 14:21:11,173 INFO L87 Difference]: Start difference. First operand 125 states and 189 transitions. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:21:11,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 14:21:11,185 INFO L93 Difference]: Finished difference Result 97 states and 129 transitions. [2025-02-08 14:21:11,185 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 97 states and 129 transitions. [2025-02-08 14:21:11,186 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 22 [2025-02-08 14:21:11,187 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 97 states to 83 states and 115 transitions. [2025-02-08 14:21:11,187 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 39 [2025-02-08 14:21:11,187 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 39 [2025-02-08 14:21:11,187 INFO L73 IsDeterministic]: Start isDeterministic. Operand 83 states and 115 transitions. [2025-02-08 14:21:11,187 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-08 14:21:11,187 INFO L218 hiAutomatonCegarLoop]: Abstraction has 83 states and 115 transitions. [2025-02-08 14:21:11,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states and 115 transitions. [2025-02-08 14:21:11,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 78. [2025-02-08 14:21:11,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 78 states have (on average 1.4102564102564104) internal successors, (110), 77 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:21:11,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 110 transitions. [2025-02-08 14:21:11,192 INFO L240 hiAutomatonCegarLoop]: Abstraction has 78 states and 110 transitions. [2025-02-08 14:21:11,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 14:21:11,194 INFO L432 stractBuchiCegarLoop]: Abstraction has 78 states and 110 transitions. [2025-02-08 14:21:11,194 INFO L338 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-02-08 14:21:11,194 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 78 states and 110 transitions. [2025-02-08 14:21:11,194 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 21 [2025-02-08 14:21:11,194 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:21:11,194 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:21:11,195 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1] [2025-02-08 14:21:11,195 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-02-08 14:21:11,195 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume main_~i~0#1 <= 0;main_~up~0#1 := 1;" "assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume main_~i~0#1 >= 10;main_~up~0#1 := 0;" [2025-02-08 14:21:11,195 INFO L754 eck$LassoCheckResult]: Loop: "assume !(main_~i~0#1 <= 0);" "assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume main_~i~0#1 >= 10;main_~up~0#1 := 0;" [2025-02-08 14:21:11,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:21:11,195 INFO L85 PathProgramCache]: Analyzing trace with hash 458940930, now seen corresponding path program 1 times [2025-02-08 14:21:11,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:21:11,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066565348] [2025-02-08 14:21:11,195 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:21:11,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:21:11,198 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 14:21:11,199 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 14:21:11,200 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:21:11,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:21:11,226 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:21:11,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:21:11,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066565348] [2025-02-08 14:21:11,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066565348] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:21:11,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:21:11,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 14:21:11,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109211024] [2025-02-08 14:21:11,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:21:11,227 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-08 14:21:11,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:21:11,227 INFO L85 PathProgramCache]: Analyzing trace with hash 1044829, now seen corresponding path program 2 times [2025-02-08 14:21:11,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:21:11,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676091519] [2025-02-08 14:21:11,228 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 14:21:11,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:21:11,232 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 4 statements into 1 equivalence classes. [2025-02-08 14:21:11,234 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 14:21:11,234 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 14:21:11,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:21:11,234 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:21:11,235 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 14:21:11,237 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 14:21:11,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:21:11,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:21:11,238 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:21:11,268 INFO L204 LassoAnalysis]: Preferences: [2025-02-08 14:21:11,268 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-08 14:21:11,269 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-08 14:21:11,269 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-08 14:21:11,269 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-08 14:21:11,269 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:21:11,269 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-08 14:21:11,269 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-08 14:21:11,269 INFO L132 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq.c_Iteration7_Loop [2025-02-08 14:21:11,269 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-08 14:21:11,269 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-08 14:21:11,270 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:21:11,275 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:21:11,278 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:21:11,281 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:21:11,321 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-08 14:21:11,322 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-08 14:21:11,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:21:11,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:21:11,326 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:21:11,327 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2025-02-08 14:21:11,328 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-08 14:21:11,328 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-08 14:21:11,347 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2025-02-08 14:21:11,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:21:11,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:21:11,349 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:21:11,350 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2025-02-08 14:21:11,350 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-08 14:21:11,350 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-08 14:21:11,364 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-08 14:21:11,370 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2025-02-08 14:21:11,370 INFO L204 LassoAnalysis]: Preferences: [2025-02-08 14:21:11,370 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-08 14:21:11,370 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-08 14:21:11,370 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-08 14:21:11,370 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-08 14:21:11,370 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:21:11,370 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-08 14:21:11,370 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-08 14:21:11,370 INFO L132 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq.c_Iteration7_Loop [2025-02-08 14:21:11,370 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-08 14:21:11,370 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-08 14:21:11,371 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:21:11,374 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:21:11,379 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:21:11,382 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:21:11,422 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-08 14:21:11,422 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-08 14:21:11,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:21:11,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:21:11,427 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:21:11,428 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2025-02-08 14:21:11,429 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-02-08 14:21:11,441 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:21:11,441 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:21:11,441 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:21:11,441 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:21:11,446 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:21:11,446 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:21:11,449 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:21:11,460 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2025-02-08 14:21:11,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:21:11,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:21:11,462 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:21:11,464 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2025-02-08 14:21:11,464 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-02-08 14:21:11,475 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:21:11,475 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:21:11,476 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:21:11,476 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:21:11,476 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:21:11,476 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:21:11,476 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:21:11,478 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-08 14:21:11,480 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-02-08 14:21:11,480 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-02-08 14:21:11,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:21:11,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:21:11,482 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:21:11,484 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2025-02-08 14:21:11,484 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-08 14:21:11,484 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-08 14:21:11,484 INFO L474 LassoAnalysis]: Proved termination. [2025-02-08 14:21:11,484 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-02-08 14:21:11,491 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2025-02-08 14:21:11,492 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-08 14:21:11,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:21:11,504 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 14:21:11,509 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 14:21:11,509 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:21:11,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:21:11,509 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-08 14:21:11,509 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:21:11,526 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 14:21:11,527 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 14:21:11,527 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:21:11,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:21:11,528 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-08 14:21:11,528 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:21:11,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:21:11,544 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-02-08 14:21:11,544 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 78 states and 110 transitions. cyclomatic complexity: 43 Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:21:11,569 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 78 states and 110 transitions. cyclomatic complexity: 43. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 148 states and 199 transitions. Complement of second has 7 states. [2025-02-08 14:21:11,571 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-02-08 14:21:11,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:21:11,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2025-02-08 14:21:11,572 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 7 letters. Loop has 4 letters. [2025-02-08 14:21:11,572 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:21:11,573 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 11 letters. Loop has 4 letters. [2025-02-08 14:21:11,573 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:21:11,573 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 7 letters. Loop has 8 letters. [2025-02-08 14:21:11,573 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:21:11,573 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 148 states and 199 transitions. [2025-02-08 14:21:11,575 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 25 [2025-02-08 14:21:11,576 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 148 states to 121 states and 162 transitions. [2025-02-08 14:21:11,576 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 45 [2025-02-08 14:21:11,576 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 49 [2025-02-08 14:21:11,576 INFO L73 IsDeterministic]: Start isDeterministic. Operand 121 states and 162 transitions. [2025-02-08 14:21:11,576 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-08 14:21:11,576 INFO L218 hiAutomatonCegarLoop]: Abstraction has 121 states and 162 transitions. [2025-02-08 14:21:11,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states and 162 transitions. [2025-02-08 14:21:11,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 101. [2025-02-08 14:21:11,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 101 states have (on average 1.386138613861386) internal successors, (140), 100 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:21:11,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 140 transitions. [2025-02-08 14:21:11,581 INFO L240 hiAutomatonCegarLoop]: Abstraction has 101 states and 140 transitions. [2025-02-08 14:21:11,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:21:11,582 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:21:11,582 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 14:21:11,582 INFO L87 Difference]: Start difference. First operand 101 states and 140 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:21:11,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 14:21:11,612 INFO L93 Difference]: Finished difference Result 135 states and 179 transitions. [2025-02-08 14:21:11,612 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 135 states and 179 transitions. [2025-02-08 14:21:11,614 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 27 [2025-02-08 14:21:11,617 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 135 states to 128 states and 168 transitions. [2025-02-08 14:21:11,617 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 59 [2025-02-08 14:21:11,618 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 59 [2025-02-08 14:21:11,618 INFO L73 IsDeterministic]: Start isDeterministic. Operand 128 states and 168 transitions. [2025-02-08 14:21:11,618 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-08 14:21:11,618 INFO L218 hiAutomatonCegarLoop]: Abstraction has 128 states and 168 transitions. [2025-02-08 14:21:11,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states and 168 transitions. [2025-02-08 14:21:11,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 109. [2025-02-08 14:21:11,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 109 states have (on average 1.3027522935779816) internal successors, (142), 108 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:21:11,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 142 transitions. [2025-02-08 14:21:11,626 INFO L240 hiAutomatonCegarLoop]: Abstraction has 109 states and 142 transitions. [2025-02-08 14:21:11,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 14:21:11,627 INFO L432 stractBuchiCegarLoop]: Abstraction has 109 states and 142 transitions. [2025-02-08 14:21:11,627 INFO L338 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2025-02-08 14:21:11,627 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 109 states and 142 transitions. [2025-02-08 14:21:11,628 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 23 [2025-02-08 14:21:11,628 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:21:11,628 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:21:11,628 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1] [2025-02-08 14:21:11,628 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-02-08 14:21:11,629 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" "assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume main_~i~0#1 <= 0;main_~up~0#1 := 1;" [2025-02-08 14:21:11,629 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume main_~i~0#1 <= 0;main_~up~0#1 := 1;" [2025-02-08 14:21:11,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:21:11,629 INFO L85 PathProgramCache]: Analyzing trace with hash 1343220288, now seen corresponding path program 1 times [2025-02-08 14:21:11,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:21:11,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823400591] [2025-02-08 14:21:11,629 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:21:11,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:21:11,635 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 14:21:11,636 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 14:21:11,637 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:21:11,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:21:11,637 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:21:11,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 14:21:11,638 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 14:21:11,638 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:21:11,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:21:11,639 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:21:11,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:21:11,639 INFO L85 PathProgramCache]: Analyzing trace with hash 960228, now seen corresponding path program 2 times [2025-02-08 14:21:11,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:21:11,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860953867] [2025-02-08 14:21:11,640 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 14:21:11,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:21:11,641 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 4 statements into 1 equivalence classes. [2025-02-08 14:21:11,642 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 14:21:11,642 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 14:21:11,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:21:11,642 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:21:11,643 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 14:21:11,644 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 14:21:11,644 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:21:11,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:21:11,644 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:21:11,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:21:11,645 INFO L85 PathProgramCache]: Analyzing trace with hash -1785636445, now seen corresponding path program 1 times [2025-02-08 14:21:11,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:21:11,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586134753] [2025-02-08 14:21:11,645 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:21:11,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:21:11,647 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-08 14:21:11,649 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-08 14:21:11,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:21:11,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:21:11,671 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 14:21:11,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:21:11,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586134753] [2025-02-08 14:21:11,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586134753] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:21:11,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:21:11,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 14:21:11,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524597842] [2025-02-08 14:21:11,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:21:11,700 INFO L204 LassoAnalysis]: Preferences: [2025-02-08 14:21:11,700 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-08 14:21:11,700 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-08 14:21:11,700 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-08 14:21:11,700 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-08 14:21:11,700 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:21:11,700 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-08 14:21:11,700 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-08 14:21:11,700 INFO L132 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq.c_Iteration8_Loop [2025-02-08 14:21:11,700 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-08 14:21:11,700 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-08 14:21:11,700 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:21:11,706 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:21:11,708 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:21:11,712 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:21:11,753 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-08 14:21:11,753 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-08 14:21:11,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:21:11,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:21:11,755 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:21:11,757 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2025-02-08 14:21:11,757 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-08 14:21:11,758 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-08 14:21:11,775 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-02-08 14:21:11,775 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_11=1} Honda state: {v_rep~unnamed0~0~true_11=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-02-08 14:21:11,781 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Ended with exit code 0 [2025-02-08 14:21:11,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:21:11,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:21:11,783 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:21:11,785 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2025-02-08 14:21:11,786 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-08 14:21:11,786 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-08 14:21:11,803 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-02-08 14:21:11,804 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_11=0} Honda state: {v_rep~unnamed0~0~false_11=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-02-08 14:21:11,809 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Ended with exit code 0 [2025-02-08 14:21:11,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:21:11,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:21:11,811 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:21:11,813 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2025-02-08 14:21:11,813 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-08 14:21:11,813 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-08 14:21:11,827 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-02-08 14:21:11,827 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-02-08 14:21:11,833 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Ended with exit code 0 [2025-02-08 14:21:11,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:21:11,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:21:11,835 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:21:11,836 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2025-02-08 14:21:11,837 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-08 14:21:11,837 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-08 14:21:11,854 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Ended with exit code 0 [2025-02-08 14:21:11,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:21:11,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:21:11,856 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:21:11,858 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2025-02-08 14:21:11,858 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-08 14:21:11,858 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-08 14:21:11,878 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-08 14:21:11,882 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Ended with exit code 0 [2025-02-08 14:21:11,882 INFO L204 LassoAnalysis]: Preferences: [2025-02-08 14:21:11,882 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-08 14:21:11,882 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-08 14:21:11,882 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-08 14:21:11,882 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-08 14:21:11,883 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:21:11,883 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-08 14:21:11,883 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-08 14:21:11,883 INFO L132 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq.c_Iteration8_Loop [2025-02-08 14:21:11,883 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-08 14:21:11,883 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-08 14:21:11,883 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:21:11,886 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:21:11,889 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:21:11,893 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:21:11,925 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-08 14:21:11,925 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-08 14:21:11,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:21:11,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:21:11,927 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:21:11,928 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2025-02-08 14:21:11,929 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-02-08 14:21:11,938 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:21:11,939 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:21:11,939 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:21:11,939 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:21:11,941 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:21:11,941 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:21:11,944 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:21:11,950 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Ended with exit code 0 [2025-02-08 14:21:11,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:21:11,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:21:11,952 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:21:11,954 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2025-02-08 14:21:11,954 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-02-08 14:21:11,964 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:21:11,964 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:21:11,964 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:21:11,964 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:21:11,964 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:21:11,965 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:21:11,965 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:21:11,966 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:21:11,973 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Ended with exit code 0 [2025-02-08 14:21:11,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:21:11,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:21:11,975 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:21:11,976 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2025-02-08 14:21:11,978 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-02-08 14:21:11,987 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:21:11,987 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:21:11,988 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:21:11,988 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:21:11,988 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:21:11,988 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:21:11,988 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:21:11,990 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-08 14:21:11,992 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-02-08 14:21:11,992 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-02-08 14:21:11,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:21:11,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:21:11,994 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:21:11,996 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2025-02-08 14:21:11,997 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-08 14:21:11,997 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-08 14:21:11,997 INFO L474 LassoAnalysis]: Proved termination. [2025-02-08 14:21:11,997 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-02-08 14:21:12,003 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Ended with exit code 0 [2025-02-08 14:21:12,003 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-08 14:21:12,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:21:12,023 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 14:21:12,025 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 14:21:12,025 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:21:12,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:21:12,026 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-08 14:21:12,026 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:21:12,036 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 14:21:12,037 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 14:21:12,037 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:21:12,037 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:21:12,037 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-08 14:21:12,038 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:21:12,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:21:12,047 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-02-08 14:21:12,047 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 109 states and 142 transitions. cyclomatic complexity: 46 Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:21:12,072 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 109 states and 142 transitions. cyclomatic complexity: 46. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 215 states and 277 transitions. Complement of second has 7 states. [2025-02-08 14:21:12,077 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-02-08 14:21:12,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:21:12,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 21 transitions. [2025-02-08 14:21:12,078 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 8 letters. Loop has 4 letters. [2025-02-08 14:21:12,078 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:21:12,078 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 12 letters. Loop has 4 letters. [2025-02-08 14:21:12,078 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:21:12,078 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 8 letters. Loop has 8 letters. [2025-02-08 14:21:12,078 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:21:12,078 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 215 states and 277 transitions. [2025-02-08 14:21:12,079 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 32 [2025-02-08 14:21:12,082 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 215 states to 187 states and 239 transitions. [2025-02-08 14:21:12,082 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 69 [2025-02-08 14:21:12,082 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 74 [2025-02-08 14:21:12,082 INFO L73 IsDeterministic]: Start isDeterministic. Operand 187 states and 239 transitions. [2025-02-08 14:21:12,082 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-08 14:21:12,082 INFO L218 hiAutomatonCegarLoop]: Abstraction has 187 states and 239 transitions. [2025-02-08 14:21:12,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states and 239 transitions. [2025-02-08 14:21:12,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 167. [2025-02-08 14:21:12,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 167 states have (on average 1.3053892215568863) internal successors, (218), 166 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:21:12,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 218 transitions. [2025-02-08 14:21:12,086 INFO L240 hiAutomatonCegarLoop]: Abstraction has 167 states and 218 transitions. [2025-02-08 14:21:12,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:21:12,087 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:21:12,087 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 14:21:12,087 INFO L87 Difference]: Start difference. First operand 167 states and 218 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:21:12,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 14:21:12,103 INFO L93 Difference]: Finished difference Result 162 states and 201 transitions. [2025-02-08 14:21:12,103 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 162 states and 201 transitions. [2025-02-08 14:21:12,104 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 28 [2025-02-08 14:21:12,104 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 162 states to 110 states and 138 transitions. [2025-02-08 14:21:12,105 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 61 [2025-02-08 14:21:12,105 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 64 [2025-02-08 14:21:12,105 INFO L73 IsDeterministic]: Start isDeterministic. Operand 110 states and 138 transitions. [2025-02-08 14:21:12,105 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-08 14:21:12,105 INFO L218 hiAutomatonCegarLoop]: Abstraction has 110 states and 138 transitions. [2025-02-08 14:21:12,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states and 138 transitions. [2025-02-08 14:21:12,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 83. [2025-02-08 14:21:12,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 83 states have (on average 1.2409638554216869) internal successors, (103), 82 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:21:12,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 103 transitions. [2025-02-08 14:21:12,111 INFO L240 hiAutomatonCegarLoop]: Abstraction has 83 states and 103 transitions. [2025-02-08 14:21:12,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 14:21:12,115 INFO L432 stractBuchiCegarLoop]: Abstraction has 83 states and 103 transitions. [2025-02-08 14:21:12,115 INFO L338 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2025-02-08 14:21:12,115 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 83 states and 103 transitions. [2025-02-08 14:21:12,116 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 16 [2025-02-08 14:21:12,116 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:21:12,116 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:21:12,116 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1] [2025-02-08 14:21:12,116 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [3, 2, 2, 2, 1, 1, 1] [2025-02-08 14:21:12,116 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume main_~i~0#1 >= 10;main_~up~0#1 := 0;" "assume !(main_~i~0#1 <= 0);" "assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume main_~i~0#1 <= 0;main_~up~0#1 := 1;" [2025-02-08 14:21:12,116 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" "assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume main_~i~0#1 >= 10;main_~up~0#1 := 0;" "assume !(main_~i~0#1 <= 0);" "assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume main_~i~0#1 <= 0;main_~up~0#1 := 1;" [2025-02-08 14:21:12,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:21:12,116 INFO L85 PathProgramCache]: Analyzing trace with hash 1314591137, now seen corresponding path program 1 times [2025-02-08 14:21:12,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:21:12,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111615591] [2025-02-08 14:21:12,116 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:21:12,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:21:12,121 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 14:21:12,123 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 14:21:12,123 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:21:12,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:21:12,152 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:21:12,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:21:12,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111615591] [2025-02-08 14:21:12,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111615591] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:21:12,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [336790671] [2025-02-08 14:21:12,152 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:21:12,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:21:12,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:21:12,155 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 14:21:12,156 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Waiting until timeout for monitored process [2025-02-08 14:21:12,174 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 14:21:12,176 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 14:21:12,176 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:21:12,176 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:21:12,177 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 14:21:12,177 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:21:12,186 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:21:12,187 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 14:21:12,209 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:21:12,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [336790671] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 14:21:12,209 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 14:21:12,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2025-02-08 14:21:12,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326025160] [2025-02-08 14:21:12,210 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 14:21:12,210 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-08 14:21:12,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:21:12,211 INFO L85 PathProgramCache]: Analyzing trace with hash -164734356, now seen corresponding path program 1 times [2025-02-08 14:21:12,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:21:12,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938106302] [2025-02-08 14:21:12,211 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:21:12,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:21:12,213 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-08 14:21:12,214 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-08 14:21:12,214 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:21:12,214 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:21:12,245 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Ended with exit code 0 [2025-02-08 14:21:12,253 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2025-02-08 14:21:12,259 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-08 14:21:12,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:21:12,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938106302] [2025-02-08 14:21:12,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938106302] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:21:12,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [981007191] [2025-02-08 14:21:12,259 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:21:12,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:21:12,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:21:12,261 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 14:21:12,263 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Waiting until timeout for monitored process [2025-02-08 14:21:12,277 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-08 14:21:12,280 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-08 14:21:12,280 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:21:12,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:21:12,281 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 14:21:12,281 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:21:12,290 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-08 14:21:12,291 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 14:21:12,305 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-08 14:21:12,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [981007191] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 14:21:12,305 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 14:21:12,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2025-02-08 14:21:12,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149669320] [2025-02-08 14:21:12,305 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 14:21:12,305 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-02-08 14:21:12,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:21:12,306 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 14:21:12,306 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 14:21:12,306 INFO L87 Difference]: Start difference. First operand 83 states and 103 transitions. cyclomatic complexity: 28 Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:21:12,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 14:21:12,331 INFO L93 Difference]: Finished difference Result 123 states and 150 transitions. [2025-02-08 14:21:12,331 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 123 states and 150 transitions. [2025-02-08 14:21:12,332 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 30 [2025-02-08 14:21:12,333 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 123 states to 112 states and 136 transitions. [2025-02-08 14:21:12,333 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 54 [2025-02-08 14:21:12,333 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 54 [2025-02-08 14:21:12,333 INFO L73 IsDeterministic]: Start isDeterministic. Operand 112 states and 136 transitions. [2025-02-08 14:21:12,333 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-08 14:21:12,333 INFO L218 hiAutomatonCegarLoop]: Abstraction has 112 states and 136 transitions. [2025-02-08 14:21:12,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states and 136 transitions. [2025-02-08 14:21:12,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 91. [2025-02-08 14:21:12,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 91 states have (on average 1.2197802197802199) internal successors, (111), 90 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:21:12,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 111 transitions. [2025-02-08 14:21:12,340 INFO L240 hiAutomatonCegarLoop]: Abstraction has 91 states and 111 transitions. [2025-02-08 14:21:12,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 14:21:12,341 INFO L432 stractBuchiCegarLoop]: Abstraction has 91 states and 111 transitions. [2025-02-08 14:21:12,341 INFO L338 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2025-02-08 14:21:12,341 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 91 states and 111 transitions. [2025-02-08 14:21:12,341 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 28 [2025-02-08 14:21:12,341 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:21:12,341 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:21:12,341 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 1, 1, 1, 1, 1] [2025-02-08 14:21:12,341 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-02-08 14:21:12,342 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" "assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume main_~i~0#1 <= 0;main_~up~0#1 := 1;" "assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" [2025-02-08 14:21:12,342 INFO L754 eck$LassoCheckResult]: Loop: "assume !(main_~i~0#1 <= 0);" "assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" [2025-02-08 14:21:12,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:21:12,342 INFO L85 PathProgramCache]: Analyzing trace with hash -334695840, now seen corresponding path program 2 times [2025-02-08 14:21:12,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:21:12,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671986098] [2025-02-08 14:21:12,342 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 14:21:12,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:21:12,347 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes. [2025-02-08 14:21:12,348 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 14:21:12,348 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 14:21:12,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:21:12,348 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:21:12,349 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 14:21:12,350 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 14:21:12,350 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:21:12,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:21:12,351 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:21:12,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:21:12,351 INFO L85 PathProgramCache]: Analyzing trace with hash 1043869, now seen corresponding path program 2 times [2025-02-08 14:21:12,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:21:12,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306204134] [2025-02-08 14:21:12,352 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 14:21:12,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:21:12,353 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 4 statements into 1 equivalence classes. [2025-02-08 14:21:12,353 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 14:21:12,354 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 14:21:12,354 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:21:12,354 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:21:12,354 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 14:21:12,354 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 14:21:12,354 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:21:12,354 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:21:12,355 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:21:12,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:21:12,355 INFO L85 PathProgramCache]: Analyzing trace with hash 1569626236, now seen corresponding path program 3 times [2025-02-08 14:21:12,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:21:12,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327934471] [2025-02-08 14:21:12,355 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 14:21:12,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:21:12,358 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 15 statements into 4 equivalence classes. [2025-02-08 14:21:12,359 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 15 of 15 statements. [2025-02-08 14:21:12,359 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-02-08 14:21:12,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:21:12,359 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:21:12,360 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-08 14:21:12,361 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-08 14:21:12,361 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:21:12,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:21:12,362 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:21:12,389 INFO L204 LassoAnalysis]: Preferences: [2025-02-08 14:21:12,389 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-08 14:21:12,389 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-08 14:21:12,389 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-08 14:21:12,389 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-08 14:21:12,389 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:21:12,389 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-08 14:21:12,389 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-08 14:21:12,389 INFO L132 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq.c_Iteration10_Loop [2025-02-08 14:21:12,389 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-08 14:21:12,390 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-08 14:21:12,390 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:21:12,393 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:21:12,398 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:21:12,401 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:21:12,429 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-08 14:21:12,430 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-08 14:21:12,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:21:12,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:21:12,431 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:21:12,433 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2025-02-08 14:21:12,433 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-08 14:21:12,433 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-08 14:21:12,451 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-02-08 14:21:12,452 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_13=1} Honda state: {v_rep~unnamed0~0~true_13=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-02-08 14:21:12,457 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Ended with exit code 0 [2025-02-08 14:21:12,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:21:12,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:21:12,460 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:21:12,460 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2025-02-08 14:21:12,461 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-08 14:21:12,461 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-08 14:21:12,478 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Ended with exit code 0 [2025-02-08 14:21:12,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:21:12,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:21:12,481 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:21:12,482 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2025-02-08 14:21:12,483 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-08 14:21:12,483 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-08 14:21:12,509 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-08 14:21:12,513 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Ended with exit code 0 [2025-02-08 14:21:12,513 INFO L204 LassoAnalysis]: Preferences: [2025-02-08 14:21:12,513 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-08 14:21:12,513 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-08 14:21:12,513 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-08 14:21:12,513 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-08 14:21:12,513 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:21:12,513 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-08 14:21:12,513 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-08 14:21:12,514 INFO L132 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq.c_Iteration10_Loop [2025-02-08 14:21:12,514 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-08 14:21:12,514 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-08 14:21:12,514 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:21:12,517 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:21:12,522 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:21:12,525 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:21:12,560 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-08 14:21:12,560 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-08 14:21:12,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:21:12,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:21:12,563 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:21:12,564 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2025-02-08 14:21:12,565 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-02-08 14:21:12,575 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:21:12,576 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:21:12,576 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:21:12,576 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:21:12,577 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:21:12,577 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:21:12,581 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:21:12,588 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Ended with exit code 0 [2025-02-08 14:21:12,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:21:12,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:21:12,591 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:21:12,593 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2025-02-08 14:21:12,594 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-02-08 14:21:12,606 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:21:12,606 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:21:12,606 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:21:12,606 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:21:12,606 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:21:12,608 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:21:12,608 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:21:12,610 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-08 14:21:12,612 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-02-08 14:21:12,612 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-02-08 14:21:12,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:21:12,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:21:12,616 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:21:12,617 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2025-02-08 14:21:12,618 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-08 14:21:12,618 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-08 14:21:12,618 INFO L474 LassoAnalysis]: Proved termination. [2025-02-08 14:21:12,618 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = -2*ULTIMATE.start_main_~i~0#1 + 17 Supporting invariants [] [2025-02-08 14:21:12,625 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Ended with exit code 0 [2025-02-08 14:21:12,626 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-08 14:21:12,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:21:12,641 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 14:21:12,644 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 14:21:12,644 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:21:12,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:21:12,645 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-08 14:21:12,645 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:21:12,659 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 14:21:12,660 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 14:21:12,660 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:21:12,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:21:12,661 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-08 14:21:12,661 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:21:12,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:21:12,674 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-02-08 14:21:12,674 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 91 states and 111 transitions. cyclomatic complexity: 27 Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:21:12,703 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 91 states and 111 transitions. cyclomatic complexity: 27. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 131 states and 156 transitions. Complement of second has 7 states. [2025-02-08 14:21:12,703 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-02-08 14:21:12,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:21:12,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2025-02-08 14:21:12,704 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 11 letters. Loop has 4 letters. [2025-02-08 14:21:12,704 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:21:12,704 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-02-08 14:21:12,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:21:12,717 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 14:21:12,719 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 14:21:12,719 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:21:12,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:21:12,720 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-08 14:21:12,720 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:21:12,732 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 14:21:12,733 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 14:21:12,734 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:21:12,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:21:12,734 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-08 14:21:12,734 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:21:12,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:21:12,746 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2025-02-08 14:21:12,746 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 91 states and 111 transitions. cyclomatic complexity: 27 Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:21:12,782 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 91 states and 111 transitions. cyclomatic complexity: 27. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 131 states and 156 transitions. Complement of second has 7 states. [2025-02-08 14:21:12,783 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-02-08 14:21:12,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:21:12,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2025-02-08 14:21:12,783 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 11 letters. Loop has 4 letters. [2025-02-08 14:21:12,783 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:21:12,783 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-02-08 14:21:12,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:21:12,800 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 14:21:12,802 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 14:21:12,802 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:21:12,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:21:12,803 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-08 14:21:12,803 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:21:12,813 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 14:21:12,814 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 14:21:12,814 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:21:12,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:21:12,815 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-08 14:21:12,815 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:21:12,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:21:12,824 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-02-08 14:21:12,824 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 91 states and 111 transitions. cyclomatic complexity: 27 Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:21:12,856 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 91 states and 111 transitions. cyclomatic complexity: 27. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 152 states and 180 transitions. Complement of second has 8 states. [2025-02-08 14:21:12,858 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-02-08 14:21:12,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:21:12,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 21 transitions. [2025-02-08 14:21:12,859 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 11 letters. Loop has 4 letters. [2025-02-08 14:21:12,859 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:21:12,859 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 15 letters. Loop has 4 letters. [2025-02-08 14:21:12,859 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:21:12,859 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 11 letters. Loop has 8 letters. [2025-02-08 14:21:12,859 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:21:12,859 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 152 states and 180 transitions. [2025-02-08 14:21:12,860 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 34 [2025-02-08 14:21:12,861 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 152 states to 111 states and 133 transitions. [2025-02-08 14:21:12,861 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 37 [2025-02-08 14:21:12,861 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 44 [2025-02-08 14:21:12,861 INFO L73 IsDeterministic]: Start isDeterministic. Operand 111 states and 133 transitions. [2025-02-08 14:21:12,861 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-08 14:21:12,861 INFO L218 hiAutomatonCegarLoop]: Abstraction has 111 states and 133 transitions. [2025-02-08 14:21:12,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states and 133 transitions. [2025-02-08 14:21:12,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 78. [2025-02-08 14:21:12,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 78 states have (on average 1.2307692307692308) internal successors, (96), 77 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:21:12,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 96 transitions. [2025-02-08 14:21:12,866 INFO L240 hiAutomatonCegarLoop]: Abstraction has 78 states and 96 transitions. [2025-02-08 14:21:12,866 INFO L432 stractBuchiCegarLoop]: Abstraction has 78 states and 96 transitions. [2025-02-08 14:21:12,866 INFO L338 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2025-02-08 14:21:12,867 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 78 states and 96 transitions. [2025-02-08 14:21:12,867 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 24 [2025-02-08 14:21:12,867 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:21:12,867 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:21:12,867 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [6, 5, 5, 4, 1, 1, 1, 1] [2025-02-08 14:21:12,867 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [6, 5, 5, 4, 2, 1, 1] [2025-02-08 14:21:12,868 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume main_~i~0#1 >= 10;main_~up~0#1 := 0;" "assume !(main_~i~0#1 <= 0);" "assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" "assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" "assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" "assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume main_~i~0#1 <= 0;main_~up~0#1 := 1;" "assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" [2025-02-08 14:21:12,868 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume main_~i~0#1 >= 10;main_~up~0#1 := 0;" "assume !(main_~i~0#1 <= 0);" "assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" "assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" "assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" "assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume main_~i~0#1 <= 0;main_~up~0#1 := 1;" "assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" [2025-02-08 14:21:12,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:21:12,868 INFO L85 PathProgramCache]: Analyzing trace with hash 1105098702, now seen corresponding path program 1 times [2025-02-08 14:21:12,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:21:12,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031903135] [2025-02-08 14:21:12,868 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:21:12,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:21:12,870 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-08 14:21:12,873 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-08 14:21:12,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:21:12,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:21:12,951 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 27 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:21:12,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:21:12,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031903135] [2025-02-08 14:21:12,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031903135] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:21:12,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [60725242] [2025-02-08 14:21:12,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:21:12,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:21:12,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:21:12,953 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 14:21:12,954 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Waiting until timeout for monitored process [2025-02-08 14:21:12,971 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-08 14:21:12,976 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-08 14:21:12,976 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:21:12,976 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:21:12,977 INFO L256 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-08 14:21:12,978 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:21:13,009 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 27 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:21:13,009 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 14:21:13,080 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 27 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:21:13,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [60725242] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 14:21:13,080 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 14:21:13,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2025-02-08 14:21:13,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875846116] [2025-02-08 14:21:13,080 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 14:21:13,081 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-08 14:21:13,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:21:13,082 INFO L85 PathProgramCache]: Analyzing trace with hash 1574145973, now seen corresponding path program 2 times [2025-02-08 14:21:13,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:21:13,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360807680] [2025-02-08 14:21:13,082 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 14:21:13,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:21:13,084 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-02-08 14:21:13,088 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-02-08 14:21:13,089 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 14:21:13,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:21:13,154 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Forceful destruction successful, exit code 0 [2025-02-08 14:21:13,170 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 32 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:21:13,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:21:13,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360807680] [2025-02-08 14:21:13,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360807680] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:21:13,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1517236048] [2025-02-08 14:21:13,171 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 14:21:13,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:21:13,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:21:13,173 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 14:21:13,176 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Waiting until timeout for monitored process [2025-02-08 14:21:13,195 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-02-08 14:21:13,200 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-02-08 14:21:13,201 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 14:21:13,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:21:13,201 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-08 14:21:13,202 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:21:13,225 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 32 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:21:13,226 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 14:21:13,279 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 32 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:21:13,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1517236048] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 14:21:13,280 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 14:21:13,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2025-02-08 14:21:13,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413399903] [2025-02-08 14:21:13,280 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 14:21:13,280 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-02-08 14:21:13,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:21:13,281 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-08 14:21:13,281 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2025-02-08 14:21:13,281 INFO L87 Difference]: Start difference. First operand 78 states and 96 transitions. cyclomatic complexity: 24 Second operand has 12 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:21:13,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 14:21:13,353 INFO L93 Difference]: Finished difference Result 317 states and 376 transitions. [2025-02-08 14:21:13,353 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 317 states and 376 transitions. [2025-02-08 14:21:13,354 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 104 [2025-02-08 14:21:13,356 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 317 states to 299 states and 352 transitions. [2025-02-08 14:21:13,356 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 104 [2025-02-08 14:21:13,356 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 176 [2025-02-08 14:21:13,356 INFO L73 IsDeterministic]: Start isDeterministic. Operand 299 states and 352 transitions. [2025-02-08 14:21:13,356 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-08 14:21:13,357 INFO L218 hiAutomatonCegarLoop]: Abstraction has 299 states and 352 transitions. [2025-02-08 14:21:13,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states and 352 transitions. [2025-02-08 14:21:13,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 214. [2025-02-08 14:21:13,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 214 states have (on average 1.205607476635514) internal successors, (258), 213 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:21:13,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 258 transitions. [2025-02-08 14:21:13,360 INFO L240 hiAutomatonCegarLoop]: Abstraction has 214 states and 258 transitions. [2025-02-08 14:21:13,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-08 14:21:13,361 INFO L432 stractBuchiCegarLoop]: Abstraction has 214 states and 258 transitions. [2025-02-08 14:21:13,361 INFO L338 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2025-02-08 14:21:13,361 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 214 states and 258 transitions. [2025-02-08 14:21:13,362 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 80 [2025-02-08 14:21:13,362 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:21:13,362 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:21:13,363 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [11, 10, 10, 10, 1, 1, 1] [2025-02-08 14:21:13,363 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [12, 11, 11, 10, 2, 1, 1] [2025-02-08 14:21:13,363 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume main_~i~0#1 >= 10;main_~up~0#1 := 0;" "assume !(main_~i~0#1 <= 0);" "assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" "assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" "assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" "assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" "assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" "assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" "assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" "assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" "assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" "assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume main_~i~0#1 <= 0;main_~up~0#1 := 1;" [2025-02-08 14:21:13,364 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" "assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume main_~i~0#1 >= 10;main_~up~0#1 := 0;" "assume !(main_~i~0#1 <= 0);" "assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" "assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" "assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" "assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" "assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" "assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" "assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" "assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" "assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" "assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume main_~i~0#1 <= 0;main_~up~0#1 := 1;" [2025-02-08 14:21:13,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:21:13,364 INFO L85 PathProgramCache]: Analyzing trace with hash 1738077308, now seen corresponding path program 2 times [2025-02-08 14:21:13,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:21:13,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275588832] [2025-02-08 14:21:13,364 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 14:21:13,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:21:13,367 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 44 statements into 2 equivalence classes. [2025-02-08 14:21:13,371 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 44 of 44 statements. [2025-02-08 14:21:13,371 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 14:21:13,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:21:13,371 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:21:13,372 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-02-08 14:21:13,377 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-02-08 14:21:13,378 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:21:13,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:21:13,379 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:21:13,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:21:13,380 INFO L85 PathProgramCache]: Analyzing trace with hash -1417874489, now seen corresponding path program 3 times [2025-02-08 14:21:13,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:21:13,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788397827] [2025-02-08 14:21:13,380 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 14:21:13,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:21:13,387 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 48 statements into 12 equivalence classes. [2025-02-08 14:21:13,391 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) and asserted 48 of 48 statements. [2025-02-08 14:21:13,392 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2025-02-08 14:21:13,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:21:13,392 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:21:13,393 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-02-08 14:21:13,396 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-02-08 14:21:13,396 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:21:13,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:21:13,398 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:21:13,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:21:13,398 INFO L85 PathProgramCache]: Analyzing trace with hash 1895491138, now seen corresponding path program 2 times [2025-02-08 14:21:13,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:21:13,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995988535] [2025-02-08 14:21:13,399 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 14:21:13,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:21:13,403 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 92 statements into 2 equivalence classes. [2025-02-08 14:21:13,409 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 92 of 92 statements. [2025-02-08 14:21:13,409 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 14:21:13,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:21:13,462 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 587 proven. 3 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2025-02-08 14:21:13,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:21:13,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995988535] [2025-02-08 14:21:13,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995988535] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:21:13,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1605744057] [2025-02-08 14:21:13,463 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 14:21:13,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:21:13,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:21:13,467 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 14:21:13,468 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Waiting until timeout for monitored process [2025-02-08 14:21:13,489 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 92 statements into 2 equivalence classes. [2025-02-08 14:21:13,505 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 92 of 92 statements. [2025-02-08 14:21:13,505 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 14:21:13,505 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:21:13,506 INFO L256 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-08 14:21:13,508 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:21:13,520 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 587 proven. 3 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2025-02-08 14:21:13,520 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 14:21:13,551 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 587 proven. 3 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2025-02-08 14:21:13,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1605744057] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 14:21:13,551 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 14:21:13,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2025-02-08 14:21:13,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311161876] [2025-02-08 14:21:13,551 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 14:21:13,763 INFO L204 LassoAnalysis]: Preferences: [2025-02-08 14:21:13,764 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-08 14:21:13,764 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-08 14:21:13,764 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-08 14:21:13,764 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-08 14:21:13,764 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:21:13,764 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-08 14:21:13,764 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-08 14:21:13,764 INFO L132 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq.c_Iteration12_Loop [2025-02-08 14:21:13,764 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-08 14:21:13,764 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-08 14:21:13,765 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:21:13,768 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:21:13,772 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:21:13,776 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:21:13,815 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-08 14:21:13,816 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-08 14:21:13,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:21:13,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:21:13,819 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:21:13,820 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Waiting until timeout for monitored process [2025-02-08 14:21:13,821 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-08 14:21:13,821 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-08 14:21:13,840 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-02-08 14:21:13,840 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_15=1} Honda state: {v_rep~unnamed0~0~true_15=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-02-08 14:21:13,845 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Ended with exit code 0 [2025-02-08 14:21:13,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:21:13,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:21:13,847 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:21:13,848 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Waiting until timeout for monitored process [2025-02-08 14:21:13,849 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-08 14:21:13,849 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-08 14:21:13,859 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-02-08 14:21:13,860 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-02-08 14:21:13,866 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Ended with exit code 0 [2025-02-08 14:21:13,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:21:13,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:21:13,868 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:21:13,869 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Waiting until timeout for monitored process [2025-02-08 14:21:13,870 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-08 14:21:13,870 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-08 14:21:13,888 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Forceful destruction successful, exit code 0 [2025-02-08 14:21:13,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:21:13,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:21:13,890 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:21:13,892 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Waiting until timeout for monitored process [2025-02-08 14:21:13,893 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-08 14:21:13,893 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-08 14:21:13,905 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-08 14:21:13,912 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Forceful destruction successful, exit code 0 [2025-02-08 14:21:13,912 INFO L204 LassoAnalysis]: Preferences: [2025-02-08 14:21:13,912 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-08 14:21:13,912 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-08 14:21:13,912 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-08 14:21:13,912 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-08 14:21:13,912 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:21:13,912 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-08 14:21:13,912 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-08 14:21:13,912 INFO L132 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq.c_Iteration12_Loop [2025-02-08 14:21:13,912 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-08 14:21:13,912 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-08 14:21:13,913 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:21:13,918 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:21:13,921 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:21:13,926 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:21:13,962 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-08 14:21:13,962 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-08 14:21:13,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:21:13,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:21:13,965 INFO L229 MonitoredProcess]: Starting monitored process 58 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:21:13,966 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Waiting until timeout for monitored process [2025-02-08 14:21:13,966 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-02-08 14:21:13,977 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:21:13,977 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:21:13,977 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:21:13,977 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:21:13,979 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:21:13,979 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:21:13,981 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:21:13,987 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Ended with exit code 0 [2025-02-08 14:21:13,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:21:13,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:21:13,990 INFO L229 MonitoredProcess]: Starting monitored process 59 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:21:13,991 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Waiting until timeout for monitored process [2025-02-08 14:21:13,992 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-02-08 14:21:14,003 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:21:14,003 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:21:14,003 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:21:14,003 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:21:14,003 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:21:14,004 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:21:14,004 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:21:14,005 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:21:14,012 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Ended with exit code 0 [2025-02-08 14:21:14,013 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:21:14,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:21:14,014 INFO L229 MonitoredProcess]: Starting monitored process 60 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:21:14,016 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Waiting until timeout for monitored process [2025-02-08 14:21:14,016 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-02-08 14:21:14,026 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:21:14,027 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:21:14,027 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:21:14,027 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:21:14,027 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:21:14,027 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:21:14,027 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:21:14,033 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-08 14:21:14,036 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-02-08 14:21:14,036 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-02-08 14:21:14,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:21:14,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:21:14,041 INFO L229 MonitoredProcess]: Starting monitored process 61 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:21:14,044 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Waiting until timeout for monitored process [2025-02-08 14:21:14,044 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-08 14:21:14,044 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-08 14:21:14,044 INFO L474 LassoAnalysis]: Proved termination. [2025-02-08 14:21:14,044 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-02-08 14:21:14,051 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Ended with exit code 0 [2025-02-08 14:21:14,052 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-08 14:21:14,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:21:14,064 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-02-08 14:21:14,071 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-02-08 14:21:14,071 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:21:14,071 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:21:14,072 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-08 14:21:14,072 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:21:14,120 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-02-08 14:21:14,128 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-02-08 14:21:14,128 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:21:14,128 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:21:14,129 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-08 14:21:14,130 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:21:14,206 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 74 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2025-02-08 14:21:14,206 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2025-02-08 14:21:14,206 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 214 states and 258 transitions. cyclomatic complexity: 49 Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:21:14,296 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 214 states and 258 transitions. cyclomatic complexity: 49. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 493 states and 601 transitions. Complement of second has 15 states. [2025-02-08 14:21:14,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 1 stem states 6 non-accepting loop states 1 accepting loop states [2025-02-08 14:21:14,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:21:14,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 36 transitions. [2025-02-08 14:21:14,298 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 36 transitions. Stem has 44 letters. Loop has 48 letters. [2025-02-08 14:21:14,298 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:21:14,298 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 36 transitions. Stem has 92 letters. Loop has 48 letters. [2025-02-08 14:21:14,298 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:21:14,298 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 36 transitions. Stem has 44 letters. Loop has 96 letters. [2025-02-08 14:21:14,303 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:21:14,303 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 493 states and 601 transitions. [2025-02-08 14:21:14,306 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 84 [2025-02-08 14:21:14,308 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 493 states to 439 states and 521 transitions. [2025-02-08 14:21:14,308 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 178 [2025-02-08 14:21:14,308 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 183 [2025-02-08 14:21:14,308 INFO L73 IsDeterministic]: Start isDeterministic. Operand 439 states and 521 transitions. [2025-02-08 14:21:14,308 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-08 14:21:14,308 INFO L218 hiAutomatonCegarLoop]: Abstraction has 439 states and 521 transitions. [2025-02-08 14:21:14,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states and 521 transitions. [2025-02-08 14:21:14,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 427. [2025-02-08 14:21:14,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 427 states, 427 states have (on average 1.189695550351288) internal successors, (508), 426 states have internal predecessors, (508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:21:14,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 508 transitions. [2025-02-08 14:21:14,314 INFO L240 hiAutomatonCegarLoop]: Abstraction has 427 states and 508 transitions. [2025-02-08 14:21:14,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:21:14,314 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 14:21:14,315 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2025-02-08 14:21:14,315 INFO L87 Difference]: Start difference. First operand 427 states and 508 transitions. Second operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:21:14,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 14:21:14,369 INFO L93 Difference]: Finished difference Result 268 states and 287 transitions. [2025-02-08 14:21:14,369 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 268 states and 287 transitions. [2025-02-08 14:21:14,371 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 80 [2025-02-08 14:21:14,372 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 268 states to 225 states and 243 transitions. [2025-02-08 14:21:14,372 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 136 [2025-02-08 14:21:14,372 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 136 [2025-02-08 14:21:14,372 INFO L73 IsDeterministic]: Start isDeterministic. Operand 225 states and 243 transitions. [2025-02-08 14:21:14,372 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-08 14:21:14,372 INFO L218 hiAutomatonCegarLoop]: Abstraction has 225 states and 243 transitions. [2025-02-08 14:21:14,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states and 243 transitions. [2025-02-08 14:21:14,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 211. [2025-02-08 14:21:14,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 211 states have (on average 1.080568720379147) internal successors, (228), 210 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:21:14,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 228 transitions. [2025-02-08 14:21:14,375 INFO L240 hiAutomatonCegarLoop]: Abstraction has 211 states and 228 transitions. [2025-02-08 14:21:14,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 14:21:14,376 INFO L432 stractBuchiCegarLoop]: Abstraction has 211 states and 228 transitions. [2025-02-08 14:21:14,376 INFO L338 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2025-02-08 14:21:14,376 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 211 states and 228 transitions. [2025-02-08 14:21:14,377 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 80 [2025-02-08 14:21:14,377 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:21:14,377 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:21:14,377 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [11, 10, 10, 10, 1, 1, 1] [2025-02-08 14:21:14,377 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [16, 15, 15, 10, 6, 1, 1] [2025-02-08 14:21:14,378 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume main_~i~0#1 >= 10;main_~up~0#1 := 0;" "assume !(main_~i~0#1 <= 0);" "assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" "assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" "assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" "assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" "assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" "assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" "assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" "assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" "assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" "assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume main_~i~0#1 <= 0;main_~up~0#1 := 1;" [2025-02-08 14:21:14,378 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" "assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" "assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" "assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" "assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" "assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume main_~i~0#1 >= 10;main_~up~0#1 := 0;" "assume !(main_~i~0#1 <= 0);" "assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" "assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" "assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" "assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" "assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" "assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" "assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" "assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" "assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" "assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume main_~i~0#1 <= 0;main_~up~0#1 := 1;" [2025-02-08 14:21:14,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:21:14,378 INFO L85 PathProgramCache]: Analyzing trace with hash 1738077308, now seen corresponding path program 3 times [2025-02-08 14:21:14,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:21:14,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889236363] [2025-02-08 14:21:14,378 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 14:21:14,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:21:14,381 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 44 statements into 11 equivalence classes. [2025-02-08 14:21:14,384 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 44 of 44 statements. [2025-02-08 14:21:14,384 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-02-08 14:21:14,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:21:14,385 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:21:14,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-02-08 14:21:14,388 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-02-08 14:21:14,388 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:21:14,388 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:21:14,391 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:21:14,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:21:14,391 INFO L85 PathProgramCache]: Analyzing trace with hash -2046573737, now seen corresponding path program 4 times [2025-02-08 14:21:14,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:21:14,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503696104] [2025-02-08 14:21:14,391 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 14:21:14,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:21:14,395 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 64 statements into 2 equivalence classes. [2025-02-08 14:21:14,398 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 64 of 64 statements. [2025-02-08 14:21:14,398 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-08 14:21:14,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:21:14,399 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:21:14,400 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-02-08 14:21:14,403 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-02-08 14:21:14,403 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:21:14,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:21:14,405 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:21:14,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:21:14,407 INFO L85 PathProgramCache]: Analyzing trace with hash 117137362, now seen corresponding path program 3 times [2025-02-08 14:21:14,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:21:14,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276792913] [2025-02-08 14:21:14,408 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 14:21:14,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:21:14,411 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 108 statements into 27 equivalence classes. [2025-02-08 14:21:14,420 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) and asserted 88 of 108 statements. [2025-02-08 14:21:14,421 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2025-02-08 14:21:14,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:21:14,506 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Ended with exit code 0 [2025-02-08 14:21:14,565 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 923 proven. 55 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2025-02-08 14:21:14,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:21:14,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276792913] [2025-02-08 14:21:14,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276792913] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:21:14,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1570964422] [2025-02-08 14:21:14,565 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 14:21:14,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:21:14,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:21:14,568 INFO L229 MonitoredProcess]: Starting monitored process 62 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 14:21:14,572 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (62)] Waiting until timeout for monitored process [2025-02-08 14:21:14,594 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 108 statements into 27 equivalence classes. [2025-02-08 14:21:14,619 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) and asserted 88 of 108 statements. [2025-02-08 14:21:14,620 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2025-02-08 14:21:14,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:21:14,621 INFO L256 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-08 14:21:14,622 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:21:14,658 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 923 proven. 55 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2025-02-08 14:21:14,658 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 14:21:14,728 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 923 proven. 55 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2025-02-08 14:21:14,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1570964422] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 14:21:14,728 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 14:21:14,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 12 [2025-02-08 14:21:14,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304910431] [2025-02-08 14:21:14,728 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 14:21:14,982 INFO L204 LassoAnalysis]: Preferences: [2025-02-08 14:21:14,982 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-08 14:21:14,982 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-08 14:21:14,982 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-08 14:21:14,982 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-08 14:21:14,982 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:21:14,982 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-08 14:21:14,982 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-08 14:21:14,982 INFO L132 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq.c_Iteration13_Loop [2025-02-08 14:21:14,982 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-08 14:21:14,982 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-08 14:21:14,983 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:21:14,987 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:21:14,989 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:21:14,995 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:21:15,028 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-08 14:21:15,029 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-08 14:21:15,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:21:15,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:21:15,032 INFO L229 MonitoredProcess]: Starting monitored process 63 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:21:15,032 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Waiting until timeout for monitored process [2025-02-08 14:21:15,033 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-08 14:21:15,033 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-08 14:21:15,050 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Ended with exit code 0 [2025-02-08 14:21:15,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:21:15,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:21:15,052 INFO L229 MonitoredProcess]: Starting monitored process 64 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:21:15,053 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Waiting until timeout for monitored process [2025-02-08 14:21:15,054 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-08 14:21:15,054 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-08 14:21:15,066 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-08 14:21:15,074 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Ended with exit code 0 [2025-02-08 14:21:15,074 INFO L204 LassoAnalysis]: Preferences: [2025-02-08 14:21:15,074 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-08 14:21:15,074 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-08 14:21:15,074 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-08 14:21:15,074 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-08 14:21:15,074 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:21:15,074 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-08 14:21:15,074 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-08 14:21:15,074 INFO L132 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq.c_Iteration13_Loop [2025-02-08 14:21:15,074 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-08 14:21:15,074 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-08 14:21:15,075 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:21:15,079 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:21:15,083 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:21:15,087 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:21:15,117 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-08 14:21:15,117 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-08 14:21:15,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:21:15,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:21:15,119 INFO L229 MonitoredProcess]: Starting monitored process 65 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:21:15,121 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Waiting until timeout for monitored process [2025-02-08 14:21:15,122 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-02-08 14:21:15,132 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:21:15,132 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:21:15,132 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:21:15,132 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:21:15,132 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:21:15,133 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:21:15,133 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:21:15,134 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-08 14:21:15,137 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-02-08 14:21:15,137 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-02-08 14:21:15,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:21:15,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:21:15,140 INFO L229 MonitoredProcess]: Starting monitored process 66 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:21:15,140 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Waiting until timeout for monitored process [2025-02-08 14:21:15,142 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-08 14:21:15,142 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-08 14:21:15,142 INFO L474 LassoAnalysis]: Proved termination. [2025-02-08 14:21:15,142 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-02-08 14:21:15,148 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Ended with exit code 0 [2025-02-08 14:21:15,149 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-08 14:21:15,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:21:15,162 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-02-08 14:21:15,169 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-02-08 14:21:15,169 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:21:15,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:21:15,172 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-08 14:21:15,172 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:21:15,218 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-02-08 14:21:15,229 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-02-08 14:21:15,229 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:21:15,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:21:15,230 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-08 14:21:15,231 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:21:15,371 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 290 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2025-02-08 14:21:15,372 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 8 loop predicates [2025-02-08 14:21:15,372 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 211 states and 228 transitions. cyclomatic complexity: 23 Second operand has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:21:15,624 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 211 states and 228 transitions. cyclomatic complexity: 23. Second operand has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 874 states and 927 transitions. Complement of second has 31 states. [2025-02-08 14:21:15,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 16 states 1 stem states 14 non-accepting loop states 1 accepting loop states [2025-02-08 14:21:15,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:21:15,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 72 transitions. [2025-02-08 14:21:15,625 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 72 transitions. Stem has 44 letters. Loop has 64 letters. [2025-02-08 14:21:15,626 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:21:15,626 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 72 transitions. Stem has 108 letters. Loop has 64 letters. [2025-02-08 14:21:15,626 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:21:15,626 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 72 transitions. Stem has 44 letters. Loop has 128 letters. [2025-02-08 14:21:15,627 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:21:15,627 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 874 states and 927 transitions. [2025-02-08 14:21:15,631 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 84 [2025-02-08 14:21:15,633 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 874 states to 660 states and 711 transitions. [2025-02-08 14:21:15,634 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 194 [2025-02-08 14:21:15,634 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 203 [2025-02-08 14:21:15,634 INFO L73 IsDeterministic]: Start isDeterministic. Operand 660 states and 711 transitions. [2025-02-08 14:21:15,634 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-08 14:21:15,634 INFO L218 hiAutomatonCegarLoop]: Abstraction has 660 states and 711 transitions. [2025-02-08 14:21:15,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 660 states and 711 transitions. [2025-02-08 14:21:15,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 660 to 640. [2025-02-08 14:21:15,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 640 states, 640 states have (on average 1.078125) internal successors, (690), 639 states have internal predecessors, (690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:21:15,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 640 states and 690 transitions. [2025-02-08 14:21:15,642 INFO L240 hiAutomatonCegarLoop]: Abstraction has 640 states and 690 transitions. [2025-02-08 14:21:15,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:21:15,642 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-08 14:21:15,642 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2025-02-08 14:21:15,642 INFO L87 Difference]: Start difference. First operand 640 states and 690 transitions. Second operand has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 12 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:21:15,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 14:21:15,735 INFO L93 Difference]: Finished difference Result 350 states and 363 transitions. [2025-02-08 14:21:15,735 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 350 states and 363 transitions. [2025-02-08 14:21:15,737 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 80 [2025-02-08 14:21:15,738 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 350 states to 280 states and 293 transitions. [2025-02-08 14:21:15,738 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 166 [2025-02-08 14:21:15,739 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 272 [2025-02-08 14:21:15,739 INFO L73 IsDeterministic]: Start isDeterministic. Operand 280 states and 293 transitions. [2025-02-08 14:21:15,739 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-08 14:21:15,739 INFO L218 hiAutomatonCegarLoop]: Abstraction has 280 states and 293 transitions. [2025-02-08 14:21:15,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states and 293 transitions. [2025-02-08 14:21:15,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 169. [2025-02-08 14:21:15,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 169 states have (on average 1.0769230769230769) internal successors, (182), 168 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:21:15,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 182 transitions. [2025-02-08 14:21:15,742 INFO L240 hiAutomatonCegarLoop]: Abstraction has 169 states and 182 transitions. [2025-02-08 14:21:15,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-08 14:21:15,742 INFO L432 stractBuchiCegarLoop]: Abstraction has 169 states and 182 transitions. [2025-02-08 14:21:15,742 INFO L338 stractBuchiCegarLoop]: ======== Iteration 14 ============ [2025-02-08 14:21:15,742 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 169 states and 182 transitions. [2025-02-08 14:21:15,743 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 80 [2025-02-08 14:21:15,743 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:21:15,743 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:21:15,744 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1] [2025-02-08 14:21:15,744 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [20, 19, 19, 10, 10, 1, 1] [2025-02-08 14:21:15,744 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume main_~i~0#1 >= 10;main_~up~0#1 := 0;" "assume !(main_~i~0#1 <= 0);" "assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" [2025-02-08 14:21:15,744 INFO L754 eck$LassoCheckResult]: Loop: "assume !(main_~i~0#1 <= 0);" "assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" "assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" "assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" "assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" "assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" "assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" "assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" "assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" "assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume main_~i~0#1 <= 0;main_~up~0#1 := 1;" "assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" "assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" "assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" "assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" "assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" "assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" "assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" "assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" "assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" "assume !(main_~i~0#1 <= 0);" "assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume main_~i~0#1 >= 10;main_~up~0#1 := 0;" "assume !(main_~i~0#1 <= 0);" "assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(main_~i~0#1 >= 10);" [2025-02-08 14:21:15,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:21:15,745 INFO L85 PathProgramCache]: Analyzing trace with hash 458048162, now seen corresponding path program 1 times [2025-02-08 14:21:15,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:21:15,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637000550] [2025-02-08 14:21:15,745 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:21:15,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:21:15,747 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 14:21:15,748 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 14:21:15,748 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:21:15,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:21:15,748 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:21:15,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 14:21:15,749 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 14:21:15,749 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:21:15,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:21:15,750 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:21:15,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:21:15,750 INFO L85 PathProgramCache]: Analyzing trace with hash 864097627, now seen corresponding path program 5 times [2025-02-08 14:21:15,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:21:15,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387204771] [2025-02-08 14:21:15,750 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-08 14:21:15,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:21:15,754 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 80 statements into 20 equivalence classes. [2025-02-08 14:21:15,760 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 20 check-sat command(s) and asserted 80 of 80 statements. [2025-02-08 14:21:15,763 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 20 check-sat command(s) [2025-02-08 14:21:15,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:21:15,763 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:21:15,764 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-02-08 14:21:15,768 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-02-08 14:21:15,770 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:21:15,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:21:15,772 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:21:15,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:21:15,772 INFO L85 PathProgramCache]: Analyzing trace with hash -1589023236, now seen corresponding path program 4 times [2025-02-08 14:21:15,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:21:15,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763413167] [2025-02-08 14:21:15,772 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 14:21:15,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:21:15,775 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 87 statements into 2 equivalence classes. [2025-02-08 14:21:15,782 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 87 of 87 statements. [2025-02-08 14:21:15,782 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-08 14:21:15,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:21:15,782 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:21:15,784 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-02-08 14:21:15,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-02-08 14:21:15,791 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:21:15,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:21:15,793 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:21:15,898 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Ended with exit code 0 [2025-02-08 14:21:16,194 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 14:21:16,195 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 14:21:16,195 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:21:16,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:21:16,195 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:21:16,196 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 14:21:16,197 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 14:21:16,197 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:21:16,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:21:16,231 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 08.02 02:21:16 BoogieIcfgContainer [2025-02-08 14:21:16,231 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-02-08 14:21:16,232 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 14:21:16,232 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 14:21:16,232 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 14:21:16,236 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 02:21:08" (3/4) ... [2025-02-08 14:21:16,237 INFO L143 WitnessPrinter]: Generating witness for non-termination counterexample [2025-02-08 14:21:16,283 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 14:21:16,283 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 14:21:16,284 INFO L158 Benchmark]: Toolchain (without parser) took 8331.74ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 106.1MB in the beginning and 76.7MB in the end (delta: 29.4MB). Peak memory consumption was 62.0MB. Max. memory is 16.1GB. [2025-02-08 14:21:16,284 INFO L158 Benchmark]: CDTParser took 0.36ms. Allocated memory is still 192.9MB. Free memory is still 119.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 14:21:16,285 INFO L158 Benchmark]: CACSL2BoogieTranslator took 148.52ms. Allocated memory is still 142.6MB. Free memory was 106.1MB in the beginning and 96.3MB in the end (delta: 9.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 14:21:16,285 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.20ms. Allocated memory is still 142.6MB. Free memory was 96.3MB in the beginning and 95.4MB in the end (delta: 876.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 14:21:16,285 INFO L158 Benchmark]: Boogie Preprocessor took 17.93ms. Allocated memory is still 142.6MB. Free memory was 95.4MB in the beginning and 94.5MB in the end (delta: 907.7kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 14:21:16,286 INFO L158 Benchmark]: IcfgBuilder took 218.38ms. Allocated memory is still 142.6MB. Free memory was 94.5MB in the beginning and 85.2MB in the end (delta: 9.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 14:21:16,286 INFO L158 Benchmark]: BuchiAutomizer took 7863.14ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 85.2MB in the beginning and 81.5MB in the end (delta: 3.7MB). Peak memory consumption was 36.8MB. Max. memory is 16.1GB. [2025-02-08 14:21:16,286 INFO L158 Benchmark]: Witness Printer took 51.60ms. Allocated memory is still 176.2MB. Free memory was 81.5MB in the beginning and 76.7MB in the end (delta: 4.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 14:21:16,287 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.36ms. Allocated memory is still 192.9MB. Free memory is still 119.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 148.52ms. Allocated memory is still 142.6MB. Free memory was 106.1MB in the beginning and 96.3MB in the end (delta: 9.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.20ms. Allocated memory is still 142.6MB. Free memory was 96.3MB in the beginning and 95.4MB in the end (delta: 876.1kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 17.93ms. Allocated memory is still 142.6MB. Free memory was 95.4MB in the beginning and 94.5MB in the end (delta: 907.7kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 218.38ms. Allocated memory is still 142.6MB. Free memory was 94.5MB in the beginning and 85.2MB in the end (delta: 9.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * BuchiAutomizer took 7863.14ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 85.2MB in the beginning and 81.5MB in the end (delta: 3.7MB). Peak memory consumption was 36.8MB. Max. memory is 16.1GB. * Witness Printer took 51.60ms. Allocated memory is still 176.2MB. Free memory was 81.5MB in the beginning and 76.7MB in the end (delta: 4.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 18 terminating modules (9 trivial, 8 deterministic, 1 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function i and consists of 4 locations. One deterministic module has affine ranking function i and consists of 4 locations. One deterministic module has affine ranking function (((long) -2 * i) + 1) and consists of 4 locations. One deterministic module has affine ranking function (((long) -2 * i) + 17) and consists of 4 locations. One deterministic module has affine ranking function i and consists of 4 locations. One deterministic module has affine ranking function ((long) -1 * i) and consists of 4 locations. One deterministic module has affine ranking function i and consists of 8 locations. One deterministic module has affine ranking function i and consists of 16 locations. One nondeterministic module has affine ranking function (((long) -2 * i) + 17) and consists of 4 locations. 9 modules have a trivial ranking function, the largest among these consists of 12 locations. The remainder module has 169 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 7.7s and 14 iterations. TraceHistogramMax:20. Analysis of lassos took 5.4s. Construction of modules took 0.5s. Büchi inclusion checks took 1.6s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 17. Automata minimization 0.1s AutomataMinimizationTime, 18 MinimizatonAttempts, 434 StatesRemovedByMinimization, 17 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [8, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 380/744 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 247 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 236 mSDsluCounter, 132 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7 mSDsCounter, 110 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 800 IncrementalHoareTripleChecker+Invalid, 910 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 110 mSolverCounterUnsat, 125 mSDtfsCounter, 800 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI2 SFLT4 conc0 concLT4 SILN0 SILU0 SILI2 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital14 mio100 ax182 hnf100 lsp38 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq176 hnf90 smp100 dnf100 smp100 tf112 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 37ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 12 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 9 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.7s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - LassoShapedNonTerminationArgument [Line: 15]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L6] int i; [L7] int up; [L8] i = __VERIFIER_nondet_int() [L9] up = 0 VAL [up=0] [L11] COND TRUE 0 <= i && i <= 10 VAL [i=10, up=0] [L12] COND TRUE i >= 10 [L13] up = 0 VAL [i=10, up=0] [L15] COND FALSE !(i <= 0) VAL [i=10, up=0] [L18] COND FALSE !(up >= 1) [L21] i = i-1 VAL [i=9, up=0] [L11] COND TRUE 0 <= i && i <= 10 VAL [i=9, up=0] [L12] COND FALSE !(i >= 10) VAL [i=9, up=0] Loop: [L15] COND FALSE !(i <= 0) [L18] COND FALSE !(up >= 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND FALSE !(up >= 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND FALSE !(up >= 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND FALSE !(up >= 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND FALSE !(up >= 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND FALSE !(up >= 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND FALSE !(up >= 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND FALSE !(up >= 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND FALSE !(up >= 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND TRUE i <= 0 [L16] up = 1 [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND TRUE i >= 10 [L13] up = 0 [L15] COND FALSE !(i <= 0) [L18] COND FALSE !(up >= 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 15]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L6] int i; [L7] int up; [L8] i = __VERIFIER_nondet_int() [L9] up = 0 VAL [up=0] [L11] COND TRUE 0 <= i && i <= 10 VAL [i=10, up=0] [L12] COND TRUE i >= 10 [L13] up = 0 VAL [i=10, up=0] [L15] COND FALSE !(i <= 0) VAL [i=10, up=0] [L18] COND FALSE !(up >= 1) [L21] i = i-1 VAL [i=9, up=0] [L11] COND TRUE 0 <= i && i <= 10 VAL [i=9, up=0] [L12] COND FALSE !(i >= 10) VAL [i=9, up=0] Loop: [L15] COND FALSE !(i <= 0) [L18] COND FALSE !(up >= 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND FALSE !(up >= 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND FALSE !(up >= 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND FALSE !(up >= 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND FALSE !(up >= 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND FALSE !(up >= 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND FALSE !(up >= 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND FALSE !(up >= 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND FALSE !(up >= 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND TRUE i <= 0 [L16] up = 1 [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND TRUE i >= 10 [L13] up = 0 [L15] COND FALSE !(i <= 0) [L18] COND FALSE !(up >= 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2025-02-08 14:21:16,307 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (62)] Ended with exit code 0 [2025-02-08 14:21:16,507 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Forceful destruction successful, exit code 0 [2025-02-08 14:21:16,710 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Ended with exit code 0 [2025-02-08 14:21:16,912 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Ended with exit code 0 [2025-02-08 14:21:17,112 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Ended with exit code 0 [2025-02-08 14:21:17,312 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Ended with exit code 0 [2025-02-08 14:21:17,513 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM)