./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/loop-invgen/heapsort.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/loop-invgen/heapsort.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8e7c8e5dc2a9e8f11b25d1bb9948f05f37b9553e3dc9f8bd8213088dea43cb37 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 07:18:40,818 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 07:18:40,870 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2025-03-09 07:18:40,875 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 07:18:40,875 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 07:18:40,875 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2025-03-09 07:18:40,898 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 07:18:40,898 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 07:18:40,899 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 07:18:40,899 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 07:18:40,899 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 07:18:40,899 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 07:18:40,899 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 07:18:40,899 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 07:18:40,899 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-03-09 07:18:40,899 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-03-09 07:18:40,899 INFO L153 SettingsManager]: * Use old map elimination=false [2025-03-09 07:18:40,899 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-03-09 07:18:40,900 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-03-09 07:18:40,901 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-03-09 07:18:40,901 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 07:18:40,901 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-03-09 07:18:40,901 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 07:18:40,901 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 07:18:40,901 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 07:18:40,901 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 07:18:40,901 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-03-09 07:18:40,901 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-03-09 07:18:40,901 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-03-09 07:18:40,901 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 07:18:40,902 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 07:18:40,902 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-09 07:18:40,902 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-03-09 07:18:40,902 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 07:18:40,902 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 07:18:40,902 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 07:18:40,902 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 07:18:40,902 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 07:18:40,902 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 07:18:40,903 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-03-09 07:18:40,903 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8e7c8e5dc2a9e8f11b25d1bb9948f05f37b9553e3dc9f8bd8213088dea43cb37 [2025-03-09 07:18:41,121 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 07:18:41,129 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 07:18:41,130 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 07:18:41,132 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 07:18:41,132 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 07:18:41,133 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-invgen/heapsort.i [2025-03-09 07:18:42,186 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/516b92f2a/d9a46d3c8e414f25bffe917feab8faa2/FLAG6a565232c [2025-03-09 07:18:42,391 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 07:18:42,392 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/heapsort.i [2025-03-09 07:18:42,396 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/516b92f2a/d9a46d3c8e414f25bffe917feab8faa2/FLAG6a565232c [2025-03-09 07:18:42,758 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/516b92f2a/d9a46d3c8e414f25bffe917feab8faa2 [2025-03-09 07:18:42,759 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 07:18:42,760 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 07:18:42,762 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 07:18:42,762 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 07:18:42,765 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 07:18:42,765 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 07:18:42" (1/1) ... [2025-03-09 07:18:42,766 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@cf0269b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:18:42, skipping insertion in model container [2025-03-09 07:18:42,766 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 07:18:42" (1/1) ... [2025-03-09 07:18:42,775 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 07:18:42,872 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 07:18:42,878 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 07:18:42,895 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 07:18:42,906 INFO L204 MainTranslator]: Completed translation [2025-03-09 07:18:42,907 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:18:42 WrapperNode [2025-03-09 07:18:42,907 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 07:18:42,908 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 07:18:42,908 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 07:18:42,908 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 07:18:42,912 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:18:42" (1/1) ... [2025-03-09 07:18:42,917 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:18:42" (1/1) ... [2025-03-09 07:18:42,931 INFO L138 Inliner]: procedures = 16, calls = 21, calls flagged for inlining = 17, calls inlined = 30, statements flattened = 181 [2025-03-09 07:18:42,931 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 07:18:42,932 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 07:18:42,932 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 07:18:42,932 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 07:18:42,937 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:18:42" (1/1) ... [2025-03-09 07:18:42,937 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:18:42" (1/1) ... [2025-03-09 07:18:42,938 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:18:42" (1/1) ... [2025-03-09 07:18:42,946 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-09 07:18:42,946 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:18:42" (1/1) ... [2025-03-09 07:18:42,946 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:18:42" (1/1) ... [2025-03-09 07:18:42,948 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:18:42" (1/1) ... [2025-03-09 07:18:42,949 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:18:42" (1/1) ... [2025-03-09 07:18:42,950 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:18:42" (1/1) ... [2025-03-09 07:18:42,950 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:18:42" (1/1) ... [2025-03-09 07:18:42,952 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 07:18:42,953 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 07:18:42,953 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 07:18:42,953 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 07:18:42,954 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:18:42" (1/1) ... [2025-03-09 07:18:42,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:18:42,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:18:42,978 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:18:42,980 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2025-03-09 07:18:42,997 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 07:18:42,997 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 07:18:42,997 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 07:18:42,997 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 07:18:43,041 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 07:18:43,042 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 07:18:43,233 INFO L? ?]: Removed 55 outVars from TransFormulas that were not future-live. [2025-03-09 07:18:43,234 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 07:18:43,241 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 07:18:43,242 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 07:18:43,242 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 07:18:43 BoogieIcfgContainer [2025-03-09 07:18:43,242 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 07:18:43,243 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-03-09 07:18:43,243 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-03-09 07:18:43,246 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-03-09 07:18:43,246 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-09 07:18:43,247 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 09.03 07:18:42" (1/3) ... [2025-03-09 07:18:43,247 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5a497621 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.03 07:18:43, skipping insertion in model container [2025-03-09 07:18:43,247 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-09 07:18:43,247 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:18:42" (2/3) ... [2025-03-09 07:18:43,247 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5a497621 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.03 07:18:43, skipping insertion in model container [2025-03-09 07:18:43,247 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-09 07:18:43,247 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 07:18:43" (3/3) ... [2025-03-09 07:18:43,248 INFO L363 chiAutomizerObserver]: Analyzing ICFG heapsort.i [2025-03-09 07:18:43,275 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-03-09 07:18:43,275 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-03-09 07:18:43,275 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-03-09 07:18:43,275 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-03-09 07:18:43,276 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-03-09 07:18:43,276 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-03-09 07:18:43,276 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-03-09 07:18:43,276 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-03-09 07:18:43,279 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 84 states, 83 states have (on average 1.4337349397590362) internal successors, (119), 83 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 07:18:43,289 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 77 [2025-03-09 07:18:43,289 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 07:18:43,289 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 07:18:43,294 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-03-09 07:18:43,294 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-09 07:18:43,294 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-03-09 07:18:43,294 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 84 states, 83 states have (on average 1.4337349397590362) internal successors, (119), 83 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 07:18:43,298 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 77 [2025-03-09 07:18:43,298 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 07:18:43,298 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 07:18:43,299 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-03-09 07:18:43,299 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-09 07:18:43,304 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;main_#in~argc#1, main_#in~argv#1.base, main_#in~argv#1.offset := #in~argc#1, #in~argv#1.base, #in~argv#1.offset;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post2#1, main_#t~post3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post6#1, main_#t~post7#1, main_~argc#1, main_~n~0#1, main_~l~0#1, main_~r~0#1, main_~i~0#1, main_~j~0#1;main_~argc#1 := main_#in~argc#1;havoc main_~n~0#1;havoc main_~l~0#1;havoc main_~r~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet1#1;main_~n~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;" "assume !!(1 <= main_~n~0#1 && main_~n~0#1 <= 1000000);main_~l~0#1 := 1 + (if main_~n~0#1 < 0 && 0 != main_~n~0#1 % 2 then 1 + main_~n~0#1 / 2 else main_~n~0#1 / 2);main_~r~0#1 := main_~n~0#1;" "assume !(main_~l~0#1 > 1);main_#t~post3#1 := main_~r~0#1;main_~r~0#1 := main_#t~post3#1 - 1;havoc main_#t~post3#1;" [2025-03-09 07:18:43,304 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~r~0#1 > 1;main_~i~0#1 := main_~l~0#1;main_~j~0#1 := 2 * main_~l~0#1;" "assume !(main_~j~0#1 <= main_~r~0#1);" "assume main_~l~0#1 > 1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 1 <= main_~l~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~l~0#1 <= main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post6#1 := main_~l~0#1;main_~l~0#1 := main_#t~post6#1 - 1;havoc main_#t~post6#1;" [2025-03-09 07:18:43,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:18:43,308 INFO L85 PathProgramCache]: Analyzing trace with hash 5139899, now seen corresponding path program 1 times [2025-03-09 07:18:43,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:18:43,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938710016] [2025-03-09 07:18:43,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:18:43,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:18:43,365 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-09 07:18:43,380 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-09 07:18:43,381 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:18:43,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:18:43,381 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:18:43,384 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-09 07:18:43,392 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-09 07:18:43,392 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:18:43,393 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:18:43,402 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:18:43,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:18:43,404 INFO L85 PathProgramCache]: Analyzing trace with hash -1261806587, now seen corresponding path program 1 times [2025-03-09 07:18:43,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:18:43,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982619330] [2025-03-09 07:18:43,404 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:18:43,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:18:43,408 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 07:18:43,413 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 07:18:43,415 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:18:43,415 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:18:43,415 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:18:43,417 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 07:18:43,425 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 07:18:43,425 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:18:43,425 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:18:43,427 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:18:43,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:18:43,428 INFO L85 PathProgramCache]: Analyzing trace with hash -1166939893, now seen corresponding path program 1 times [2025-03-09 07:18:43,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:18:43,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281236603] [2025-03-09 07:18:43,428 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:18:43,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:18:43,435 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-09 07:18:43,443 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-09 07:18:43,447 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:18:43,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:18:43,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 07:18:43,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 07:18:43,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281236603] [2025-03-09 07:18:43,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281236603] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 07:18:43,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 07:18:43,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 07:18:43,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47588759] [2025-03-09 07:18:43,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 07:18:43,617 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 07:18:43,617 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 07:18:43,617 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 07:18:43,617 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 07:18:43,617 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-09 07:18:43,617 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:18:43,618 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 07:18:43,618 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 07:18:43,618 INFO L132 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration1_Loop [2025-03-09 07:18:43,618 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 07:18:43,618 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 07:18:43,625 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:18:43,638 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:18:43,640 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:18:43,642 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:18:43,644 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:18:43,684 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 07:18:43,684 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-09 07:18:43,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:18:43,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:18:43,688 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:18:43,690 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2025-03-09 07:18:43,691 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 07:18:43,691 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 07:18:43,710 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2025-03-09 07:18:43,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:18:43,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:18:43,712 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:18:43,713 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-03-09 07:18:43,713 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-09 07:18:43,714 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 07:18:43,774 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-09 07:18:43,779 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2025-03-09 07:18:43,779 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 07:18:43,779 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 07:18:43,779 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 07:18:43,779 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 07:18:43,779 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-09 07:18:43,779 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:18:43,779 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 07:18:43,779 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 07:18:43,779 INFO L132 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration1_Loop [2025-03-09 07:18:43,779 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 07:18:43,779 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 07:18:43,780 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:18:43,782 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:18:43,784 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:18:43,794 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:18:43,799 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:18:43,839 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 07:18:43,842 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-09 07:18:43,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:18:43,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:18:43,844 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:18:43,846 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-03-09 07:18:43,847 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:18:43,858 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:18:43,859 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:18:43,859 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:18:43,859 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:18:43,859 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:18:43,862 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:18:43,862 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:18:43,864 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:18:43,870 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2025-03-09 07:18:43,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:18:43,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:18:43,872 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:18:43,873 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-03-09 07:18:43,876 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:18:43,886 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:18:43,886 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:18:43,886 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:18:43,886 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:18:43,886 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:18:43,887 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:18:43,887 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:18:43,888 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:18:43,894 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2025-03-09 07:18:43,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:18:43,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:18:43,896 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:18:43,897 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-03-09 07:18:43,897 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:18:43,907 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:18:43,907 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:18:43,907 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:18:43,907 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:18:43,907 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:18:43,909 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:18:43,909 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:18:43,911 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-09 07:18:43,916 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-09 07:18:43,917 INFO L444 ModelExtractionUtils]: 3 out of 6 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-03-09 07:18:43,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:18:43,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:18:43,921 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:18:43,922 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-03-09 07:18:43,923 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-09 07:18:43,924 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-09 07:18:43,924 INFO L474 LassoAnalysis]: Proved termination. [2025-03-09 07:18:43,924 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~l~0#1) = 1*ULTIMATE.start_main_~l~0#1 Supporting invariants [] [2025-03-09 07:18:43,931 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2025-03-09 07:18:43,934 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-09 07:18:43,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:18:43,959 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-09 07:18:43,964 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-09 07:18:43,964 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:18:43,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:18:43,965 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-09 07:18:43,965 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 07:18:43,976 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 07:18:43,979 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 07:18:43,979 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:18:43,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:18:43,979 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 07:18:43,980 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 07:18:44,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 07:18:44,029 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-03-09 07:18:44,030 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 84 states, 83 states have (on average 1.4337349397590362) internal successors, (119), 83 states have internal predecessors, (119), 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 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 07:18:44,084 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2025-03-09 07:18:44,115 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 84 states, 83 states have (on average 1.4337349397590362) internal successors, (119), 83 states have internal predecessors, (119), 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 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 298 states and 410 transitions. Complement of second has 8 states. [2025-03-09 07:18:44,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-03-09 07:18:44,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 07:18:44,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 317 transitions. [2025-03-09 07:18:44,123 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 317 transitions. Stem has 4 letters. Loop has 7 letters. [2025-03-09 07:18:44,123 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 07:18:44,123 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 317 transitions. Stem has 11 letters. Loop has 7 letters. [2025-03-09 07:18:44,124 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 07:18:44,124 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 317 transitions. Stem has 4 letters. Loop has 14 letters. [2025-03-09 07:18:44,124 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 07:18:44,124 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 298 states and 410 transitions. [2025-03-09 07:18:44,130 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 66 [2025-03-09 07:18:44,132 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 298 states to 108 states and 126 transitions. [2025-03-09 07:18:44,132 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 71 [2025-03-09 07:18:44,132 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 72 [2025-03-09 07:18:44,133 INFO L73 IsDeterministic]: Start isDeterministic. Operand 108 states and 126 transitions. [2025-03-09 07:18:44,133 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 07:18:44,133 INFO L218 hiAutomatonCegarLoop]: Abstraction has 108 states and 126 transitions. [2025-03-09 07:18:44,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states and 126 transitions. [2025-03-09 07:18:44,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 107. [2025-03-09 07:18:44,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 107 states have (on average 1.158878504672897) internal successors, (124), 106 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 07:18:44,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 124 transitions. [2025-03-09 07:18:44,155 INFO L240 hiAutomatonCegarLoop]: Abstraction has 107 states and 124 transitions. [2025-03-09 07:18:44,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 07:18:44,157 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 07:18:44,158 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 07:18:44,158 INFO L87 Difference]: Start difference. First operand 107 states and 124 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 07:18:44,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 07:18:44,180 INFO L93 Difference]: Finished difference Result 129 states and 148 transitions. [2025-03-09 07:18:44,180 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 129 states and 148 transitions. [2025-03-09 07:18:44,181 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 93 [2025-03-09 07:18:44,182 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 129 states to 98 states and 112 transitions. [2025-03-09 07:18:44,182 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 98 [2025-03-09 07:18:44,182 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 98 [2025-03-09 07:18:44,182 INFO L73 IsDeterministic]: Start isDeterministic. Operand 98 states and 112 transitions. [2025-03-09 07:18:44,183 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-09 07:18:44,183 INFO L218 hiAutomatonCegarLoop]: Abstraction has 98 states and 112 transitions. [2025-03-09 07:18:44,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states and 112 transitions. [2025-03-09 07:18:44,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 66. [2025-03-09 07:18:44,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 66 states have (on average 1.1515151515151516) internal successors, (76), 65 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 07:18:44,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 76 transitions. [2025-03-09 07:18:44,186 INFO L240 hiAutomatonCegarLoop]: Abstraction has 66 states and 76 transitions. [2025-03-09 07:18:44,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 07:18:44,187 INFO L432 stractBuchiCegarLoop]: Abstraction has 66 states and 76 transitions. [2025-03-09 07:18:44,187 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-03-09 07:18:44,187 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 66 states and 76 transitions. [2025-03-09 07:18:44,187 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 62 [2025-03-09 07:18:44,187 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 07:18:44,187 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 07:18:44,188 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-03-09 07:18:44,188 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-09 07:18:44,188 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;main_#in~argc#1, main_#in~argv#1.base, main_#in~argv#1.offset := #in~argc#1, #in~argv#1.base, #in~argv#1.offset;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post2#1, main_#t~post3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post6#1, main_#t~post7#1, main_~argc#1, main_~n~0#1, main_~l~0#1, main_~r~0#1, main_~i~0#1, main_~j~0#1;main_~argc#1 := main_#in~argc#1;havoc main_~n~0#1;havoc main_~l~0#1;havoc main_~r~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet1#1;main_~n~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;" "assume !!(1 <= main_~n~0#1 && main_~n~0#1 <= 1000000);main_~l~0#1 := 1 + (if main_~n~0#1 < 0 && 0 != main_~n~0#1 % 2 then 1 + main_~n~0#1 / 2 else main_~n~0#1 / 2);main_~r~0#1 := main_~n~0#1;" "assume main_~l~0#1 > 1;main_#t~post2#1 := main_~l~0#1;main_~l~0#1 := main_#t~post2#1 - 1;havoc main_#t~post2#1;" [2025-03-09 07:18:44,188 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~r~0#1 > 1;main_~i~0#1 := main_~l~0#1;main_~j~0#1 := 2 * main_~l~0#1;" "assume !(main_~j~0#1 <= main_~r~0#1);" "assume main_~l~0#1 > 1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 1 <= main_~l~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~l~0#1 <= main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post6#1 := main_~l~0#1;main_~l~0#1 := main_#t~post6#1 - 1;havoc main_#t~post6#1;" [2025-03-09 07:18:44,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:18:44,188 INFO L85 PathProgramCache]: Analyzing trace with hash 5139898, now seen corresponding path program 1 times [2025-03-09 07:18:44,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:18:44,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519255470] [2025-03-09 07:18:44,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:18:44,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:18:44,191 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-09 07:18:44,195 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-09 07:18:44,197 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:18:44,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:18:44,197 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:18:44,198 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-09 07:18:44,203 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-09 07:18:44,204 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:18:44,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:18:44,205 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:18:44,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:18:44,205 INFO L85 PathProgramCache]: Analyzing trace with hash -1261806587, now seen corresponding path program 2 times [2025-03-09 07:18:44,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:18:44,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275040476] [2025-03-09 07:18:44,206 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 07:18:44,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:18:44,208 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 7 statements into 1 equivalence classes. [2025-03-09 07:18:44,212 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 07:18:44,213 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 07:18:44,214 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:18:44,214 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:18:44,216 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 07:18:44,219 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 07:18:44,221 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:18:44,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:18:44,223 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:18:44,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:18:44,225 INFO L85 PathProgramCache]: Analyzing trace with hash 1385217068, now seen corresponding path program 1 times [2025-03-09 07:18:44,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:18:44,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910957191] [2025-03-09 07:18:44,225 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:18:44,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:18:44,234 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-09 07:18:44,242 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-09 07:18:44,242 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:18:44,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:18:44,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 07:18:44,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 07:18:44,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910957191] [2025-03-09 07:18:44,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910957191] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 07:18:44,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 07:18:44,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 07:18:44,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886856673] [2025-03-09 07:18:44,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 07:18:44,417 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 07:18:44,417 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 07:18:44,417 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 07:18:44,417 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 07:18:44,417 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-09 07:18:44,417 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:18:44,417 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 07:18:44,417 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 07:18:44,417 INFO L132 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration2_Loop [2025-03-09 07:18:44,417 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 07:18:44,417 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 07:18:44,418 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:18:44,420 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:18:44,421 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:18:44,423 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:18:44,431 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:18:44,469 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 07:18:44,469 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-09 07:18:44,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:18:44,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:18:44,472 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:18:44,473 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-03-09 07:18:44,474 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 07:18:44,474 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 07:18:44,485 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-09 07:18:44,486 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post6#1=0} Honda state: {ULTIMATE.start_main_#t~post6#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-09 07:18:44,491 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2025-03-09 07:18:44,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:18:44,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:18:44,494 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:18:44,495 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-03-09 07:18:44,497 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 07:18:44,497 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 07:18:44,509 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-09 07:18:44,509 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start___VERIFIER_assert_#in~cond#1=0} Honda state: {ULTIMATE.start___VERIFIER_assert_#in~cond#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-09 07:18:44,515 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2025-03-09 07:18:44,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:18:44,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:18:44,517 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:18:44,518 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-03-09 07:18:44,519 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 07:18:44,520 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 07:18:44,530 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-09 07:18:44,531 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start___VERIFIER_assert_~cond#1=0} Honda state: {ULTIMATE.start___VERIFIER_assert_~cond#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-09 07:18:44,536 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2025-03-09 07:18:44,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:18:44,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:18:44,538 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:18:44,540 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-03-09 07:18:44,541 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 07:18:44,541 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 07:18:44,559 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2025-03-09 07:18:44,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:18:44,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:18:44,562 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:18:44,563 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2025-03-09 07:18:44,564 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-09 07:18:44,564 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 07:18:44,621 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-09 07:18:44,625 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2025-03-09 07:18:44,626 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 07:18:44,626 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 07:18:44,626 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 07:18:44,626 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 07:18:44,626 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-09 07:18:44,626 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:18:44,626 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 07:18:44,626 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 07:18:44,626 INFO L132 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration2_Loop [2025-03-09 07:18:44,626 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 07:18:44,626 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 07:18:44,627 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:18:44,629 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:18:44,638 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:18:44,648 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:18:44,650 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:18:44,680 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 07:18:44,680 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-09 07:18:44,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:18:44,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:18:44,683 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:18:44,684 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2025-03-09 07:18:44,685 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:18:44,695 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:18:44,695 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:18:44,695 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:18:44,695 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:18:44,695 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:18:44,696 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:18:44,696 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:18:44,699 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:18:44,704 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2025-03-09 07:18:44,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:18:44,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:18:44,706 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:18:44,707 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2025-03-09 07:18:44,708 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:18:44,718 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:18:44,718 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:18:44,718 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:18:44,718 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:18:44,718 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:18:44,718 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:18:44,718 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:18:44,719 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:18:44,724 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2025-03-09 07:18:44,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:18:44,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:18:44,726 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:18:44,727 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2025-03-09 07:18:44,727 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:18:44,737 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:18:44,737 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:18:44,737 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:18:44,737 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:18:44,737 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:18:44,739 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:18:44,739 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:18:44,741 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-09 07:18:44,745 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-09 07:18:44,745 INFO L444 ModelExtractionUtils]: 3 out of 6 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-03-09 07:18:44,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:18:44,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:18:44,747 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:18:44,748 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2025-03-09 07:18:44,749 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-09 07:18:44,749 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-09 07:18:44,749 INFO L474 LassoAnalysis]: Proved termination. [2025-03-09 07:18:44,749 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~l~0#1) = 1*ULTIMATE.start_main_~l~0#1 Supporting invariants [] [2025-03-09 07:18:44,755 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2025-03-09 07:18:44,755 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-09 07:18:44,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:18:44,769 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-09 07:18:44,773 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-09 07:18:44,773 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:18:44,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:18:44,773 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-09 07:18:44,774 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 07:18:44,780 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 07:18:44,782 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 07:18:44,782 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:18:44,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:18:44,782 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 07:18:44,783 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 07:18:44,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 07:18:44,803 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-03-09 07:18:44,804 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 66 states and 76 transitions. cyclomatic complexity: 12 Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 07:18:44,826 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 66 states and 76 transitions. cyclomatic complexity: 12. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 160 states and 185 transitions. Complement of second has 6 states. [2025-03-09 07:18:44,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-03-09 07:18:44,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 07:18:44,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 81 transitions. [2025-03-09 07:18:44,827 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 81 transitions. Stem has 4 letters. Loop has 7 letters. [2025-03-09 07:18:44,827 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 07:18:44,827 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 81 transitions. Stem has 11 letters. Loop has 7 letters. [2025-03-09 07:18:44,827 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 07:18:44,827 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 81 transitions. Stem has 4 letters. Loop has 14 letters. [2025-03-09 07:18:44,827 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 07:18:44,827 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 160 states and 185 transitions. [2025-03-09 07:18:44,828 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 87 [2025-03-09 07:18:44,829 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 160 states to 125 states and 145 transitions. [2025-03-09 07:18:44,829 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 93 [2025-03-09 07:18:44,829 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 94 [2025-03-09 07:18:44,829 INFO L73 IsDeterministic]: Start isDeterministic. Operand 125 states and 145 transitions. [2025-03-09 07:18:44,829 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 07:18:44,830 INFO L218 hiAutomatonCegarLoop]: Abstraction has 125 states and 145 transitions. [2025-03-09 07:18:44,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states and 145 transitions. [2025-03-09 07:18:44,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 67. [2025-03-09 07:18:44,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 67 states have (on average 1.164179104477612) internal successors, (78), 66 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 07:18:44,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 78 transitions. [2025-03-09 07:18:44,832 INFO L240 hiAutomatonCegarLoop]: Abstraction has 67 states and 78 transitions. [2025-03-09 07:18:44,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 07:18:44,832 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 07:18:44,832 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 07:18:44,832 INFO L87 Difference]: Start difference. First operand 67 states and 78 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 07:18:44,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 07:18:44,908 INFO L93 Difference]: Finished difference Result 138 states and 156 transitions. [2025-03-09 07:18:44,909 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 138 states and 156 transitions. [2025-03-09 07:18:44,909 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 70 [2025-03-09 07:18:44,911 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 138 states to 138 states and 156 transitions. [2025-03-09 07:18:44,913 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 86 [2025-03-09 07:18:44,913 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 86 [2025-03-09 07:18:44,913 INFO L73 IsDeterministic]: Start isDeterministic. Operand 138 states and 156 transitions. [2025-03-09 07:18:44,913 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 07:18:44,913 INFO L218 hiAutomatonCegarLoop]: Abstraction has 138 states and 156 transitions. [2025-03-09 07:18:44,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states and 156 transitions. [2025-03-09 07:18:44,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 69. [2025-03-09 07:18:44,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 69 states have (on average 1.1594202898550725) internal successors, (80), 68 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 07:18:44,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 80 transitions. [2025-03-09 07:18:44,916 INFO L240 hiAutomatonCegarLoop]: Abstraction has 69 states and 80 transitions. [2025-03-09 07:18:44,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 07:18:44,916 INFO L432 stractBuchiCegarLoop]: Abstraction has 69 states and 80 transitions. [2025-03-09 07:18:44,916 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-03-09 07:18:44,916 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 69 states and 80 transitions. [2025-03-09 07:18:44,917 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 31 [2025-03-09 07:18:44,917 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 07:18:44,917 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 07:18:44,917 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-03-09 07:18:44,917 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-09 07:18:44,917 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;main_#in~argc#1, main_#in~argv#1.base, main_#in~argv#1.offset := #in~argc#1, #in~argv#1.base, #in~argv#1.offset;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post2#1, main_#t~post3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post6#1, main_#t~post7#1, main_~argc#1, main_~n~0#1, main_~l~0#1, main_~r~0#1, main_~i~0#1, main_~j~0#1;main_~argc#1 := main_#in~argc#1;havoc main_~n~0#1;havoc main_~l~0#1;havoc main_~r~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet1#1;main_~n~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;" "assume !!(1 <= main_~n~0#1 && main_~n~0#1 <= 1000000);main_~l~0#1 := 1 + (if main_~n~0#1 < 0 && 0 != main_~n~0#1 % 2 then 1 + main_~n~0#1 / 2 else main_~n~0#1 / 2);main_~r~0#1 := main_~n~0#1;" "assume !(main_~l~0#1 > 1);main_#t~post3#1 := main_~r~0#1;main_~r~0#1 := main_#t~post3#1 - 1;havoc main_#t~post3#1;" [2025-03-09 07:18:44,917 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~r~0#1 > 1;main_~i~0#1 := main_~l~0#1;main_~j~0#1 := 2 * main_~l~0#1;" "assume !(main_~j~0#1 <= main_~r~0#1);" "assume !(main_~l~0#1 > 1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 1 <= main_~r~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~r~0#1 <= main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post7#1 := main_~r~0#1;main_~r~0#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1;" [2025-03-09 07:18:44,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:18:44,917 INFO L85 PathProgramCache]: Analyzing trace with hash 5139899, now seen corresponding path program 2 times [2025-03-09 07:18:44,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:18:44,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657397000] [2025-03-09 07:18:44,917 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 07:18:44,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:18:44,920 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 4 statements into 1 equivalence classes. [2025-03-09 07:18:44,922 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-09 07:18:44,922 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 07:18:44,922 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:18:44,922 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:18:44,923 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-09 07:18:44,925 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-09 07:18:44,925 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:18:44,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:18:44,926 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:18:44,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:18:44,926 INFO L85 PathProgramCache]: Analyzing trace with hash -1245583402, now seen corresponding path program 1 times [2025-03-09 07:18:44,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:18:44,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399878963] [2025-03-09 07:18:44,926 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:18:44,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:18:44,929 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 07:18:44,930 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 07:18:44,930 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:18:44,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:18:44,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 07:18:44,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 07:18:44,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399878963] [2025-03-09 07:18:44,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399878963] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 07:18:44,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 07:18:44,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 07:18:44,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757830481] [2025-03-09 07:18:44,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 07:18:44,951 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-09 07:18:44,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 07:18:44,951 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 07:18:44,951 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 07:18:44,951 INFO L87 Difference]: Start difference. First operand 69 states and 80 transitions. cyclomatic complexity: 13 Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 07:18:45,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 07:18:45,010 INFO L93 Difference]: Finished difference Result 129 states and 146 transitions. [2025-03-09 07:18:45,010 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 129 states and 146 transitions. [2025-03-09 07:18:45,011 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 61 [2025-03-09 07:18:45,012 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 129 states to 128 states and 145 transitions. [2025-03-09 07:18:45,012 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 67 [2025-03-09 07:18:45,012 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 67 [2025-03-09 07:18:45,012 INFO L73 IsDeterministic]: Start isDeterministic. Operand 128 states and 145 transitions. [2025-03-09 07:18:45,012 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 07:18:45,012 INFO L218 hiAutomatonCegarLoop]: Abstraction has 128 states and 145 transitions. [2025-03-09 07:18:45,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states and 145 transitions. [2025-03-09 07:18:45,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 69. [2025-03-09 07:18:45,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 69 states have (on average 1.1594202898550725) internal successors, (80), 68 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 07:18:45,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 80 transitions. [2025-03-09 07:18:45,016 INFO L240 hiAutomatonCegarLoop]: Abstraction has 69 states and 80 transitions. [2025-03-09 07:18:45,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 07:18:45,017 INFO L432 stractBuchiCegarLoop]: Abstraction has 69 states and 80 transitions. [2025-03-09 07:18:45,017 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-03-09 07:18:45,017 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 69 states and 80 transitions. [2025-03-09 07:18:45,017 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 32 [2025-03-09 07:18:45,017 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 07:18:45,017 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 07:18:45,017 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-03-09 07:18:45,017 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 07:18:45,018 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;main_#in~argc#1, main_#in~argv#1.base, main_#in~argv#1.offset := #in~argc#1, #in~argv#1.base, #in~argv#1.offset;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post2#1, main_#t~post3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post6#1, main_#t~post7#1, main_~argc#1, main_~n~0#1, main_~l~0#1, main_~r~0#1, main_~i~0#1, main_~j~0#1;main_~argc#1 := main_#in~argc#1;havoc main_~n~0#1;havoc main_~l~0#1;havoc main_~r~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet1#1;main_~n~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;" "assume !!(1 <= main_~n~0#1 && main_~n~0#1 <= 1000000);main_~l~0#1 := 1 + (if main_~n~0#1 < 0 && 0 != main_~n~0#1 % 2 then 1 + main_~n~0#1 / 2 else main_~n~0#1 / 2);main_~r~0#1 := main_~n~0#1;" "assume !(main_~l~0#1 > 1);main_#t~post3#1 := main_~r~0#1;main_~r~0#1 := main_#t~post3#1 - 1;havoc main_#t~post3#1;" [2025-03-09 07:18:45,018 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~r~0#1 > 1;main_~i~0#1 := main_~l~0#1;main_~j~0#1 := 2 * main_~l~0#1;" "assume main_~j~0#1 <= main_~r~0#1;" "assume !(main_~j~0#1 < main_~r~0#1);" "assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 1 <= main_~j~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_#t~nondet5#1;" "assume 0 != main_#t~nondet5#1;havoc main_#t~nondet5#1;" "assume !(main_~l~0#1 > 1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 1 <= main_~r~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~r~0#1 <= main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post7#1 := main_~r~0#1;main_~r~0#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1;" [2025-03-09 07:18:45,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:18:45,018 INFO L85 PathProgramCache]: Analyzing trace with hash 5139899, now seen corresponding path program 3 times [2025-03-09 07:18:45,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:18:45,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114354667] [2025-03-09 07:18:45,018 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 07:18:45,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:18:45,021 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 4 statements into 1 equivalence classes. [2025-03-09 07:18:45,024 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-09 07:18:45,024 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-09 07:18:45,024 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:18:45,024 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:18:45,025 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-09 07:18:45,027 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-09 07:18:45,027 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:18:45,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:18:45,029 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:18:45,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:18:45,029 INFO L85 PathProgramCache]: Analyzing trace with hash 451354109, now seen corresponding path program 1 times [2025-03-09 07:18:45,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:18:45,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413845499] [2025-03-09 07:18:45,029 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:18:45,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:18:45,054 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-09 07:18:45,057 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2025-03-09 07:18:45,059 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-09 07:18:45,059 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:18:45,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:18:45,059 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:18:45,060 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-09 07:18:45,062 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-09 07:18:45,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:18:45,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:18:45,064 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:18:45,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:18:45,064 INFO L85 PathProgramCache]: Analyzing trace with hash 811466295, now seen corresponding path program 1 times [2025-03-09 07:18:45,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:18:45,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322466529] [2025-03-09 07:18:45,064 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:18:45,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:18:45,068 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-09 07:18:45,071 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 07:18:45,071 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:18:45,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:18:45,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 07:18:45,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 07:18:45,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322466529] [2025-03-09 07:18:45,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322466529] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 07:18:45,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 07:18:45,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 07:18:45,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679607990] [2025-03-09 07:18:45,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 07:18:45,235 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 07:18:45,235 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 07:18:45,235 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 07:18:45,235 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 07:18:45,235 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-09 07:18:45,235 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:18:45,235 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 07:18:45,235 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 07:18:45,235 INFO L132 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration4_Loop [2025-03-09 07:18:45,235 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 07:18:45,235 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 07:18:45,236 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:18:45,238 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:18:45,248 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:18:45,249 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:18:45,251 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:18:45,291 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 07:18:45,291 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-09 07:18:45,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:18:45,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:18:45,293 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:18:45,295 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2025-03-09 07:18:45,296 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 07:18:45,296 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 07:18:45,306 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-09 07:18:45,306 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet5#1=0} Honda state: {ULTIMATE.start_main_#t~nondet5#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-09 07:18:45,311 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2025-03-09 07:18:45,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:18:45,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:18:45,313 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:18:45,315 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2025-03-09 07:18:45,316 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 07:18:45,316 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 07:18:45,331 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2025-03-09 07:18:45,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:18:45,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:18:45,334 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:18:45,334 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2025-03-09 07:18:45,335 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-09 07:18:45,335 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 07:18:45,363 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-09 07:18:45,367 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2025-03-09 07:18:45,368 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 07:18:45,368 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 07:18:45,368 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 07:18:45,368 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 07:18:45,368 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-09 07:18:45,368 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:18:45,368 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 07:18:45,368 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 07:18:45,368 INFO L132 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration4_Loop [2025-03-09 07:18:45,368 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 07:18:45,368 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 07:18:45,369 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:18:45,374 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:18:45,376 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:18:45,378 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:18:45,380 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:18:45,427 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 07:18:45,428 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-09 07:18:45,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:18:45,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:18:45,429 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:18:45,431 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2025-03-09 07:18:45,432 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:18:45,441 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:18:45,442 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:18:45,442 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:18:45,442 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:18:45,442 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:18:45,442 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:18:45,442 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:18:45,443 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:18:45,449 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2025-03-09 07:18:45,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:18:45,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:18:45,450 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:18:45,452 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2025-03-09 07:18:45,453 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:18:45,462 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:18:45,462 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:18:45,462 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:18:45,462 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:18:45,462 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:18:45,463 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:18:45,463 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:18:45,464 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:18:45,469 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2025-03-09 07:18:45,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:18:45,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:18:45,471 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:18:45,471 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2025-03-09 07:18:45,472 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:18:45,482 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:18:45,482 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:18:45,482 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:18:45,482 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:18:45,482 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:18:45,482 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:18:45,482 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:18:45,483 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:18:45,488 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2025-03-09 07:18:45,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:18:45,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:18:45,490 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:18:45,490 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2025-03-09 07:18:45,491 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:18:45,501 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:18:45,501 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:18:45,501 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:18:45,501 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:18:45,501 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:18:45,501 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:18:45,501 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:18:45,502 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:18:45,507 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2025-03-09 07:18:45,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:18:45,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:18:45,509 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:18:45,510 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2025-03-09 07:18:45,511 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:18:45,520 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:18:45,521 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:18:45,521 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:18:45,521 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:18:45,521 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:18:45,522 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:18:45,522 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:18:45,525 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-09 07:18:45,527 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-09 07:18:45,527 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-03-09 07:18:45,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:18:45,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:18:45,529 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:18:45,530 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2025-03-09 07:18:45,530 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-09 07:18:45,530 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-09 07:18:45,531 INFO L474 LassoAnalysis]: Proved termination. [2025-03-09 07:18:45,531 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~r~0#1) = 1*ULTIMATE.start_main_~r~0#1 Supporting invariants [] [2025-03-09 07:18:45,536 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2025-03-09 07:18:45,536 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-09 07:18:45,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:18:45,551 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-09 07:18:45,555 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-09 07:18:45,555 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:18:45,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:18:45,555 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-09 07:18:45,556 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 07:18:45,563 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-09 07:18:45,567 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-09 07:18:45,567 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:18:45,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:18:45,568 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 07:18:45,569 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 07:18:45,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 07:18:45,615 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-03-09 07:18:45,615 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 69 states and 80 transitions. cyclomatic complexity: 13 Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 07:18:45,634 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 69 states and 80 transitions. cyclomatic complexity: 13. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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 133 states and 153 transitions. Complement of second has 4 states. [2025-03-09 07:18:45,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-03-09 07:18:45,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 07:18:45,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 80 transitions. [2025-03-09 07:18:45,635 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 80 transitions. Stem has 4 letters. Loop has 14 letters. [2025-03-09 07:18:45,635 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 07:18:45,635 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 80 transitions. Stem has 18 letters. Loop has 14 letters. [2025-03-09 07:18:45,635 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 07:18:45,635 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 80 transitions. Stem has 4 letters. Loop has 28 letters. [2025-03-09 07:18:45,636 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 07:18:45,636 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 133 states and 153 transitions. [2025-03-09 07:18:45,636 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 57 [2025-03-09 07:18:45,637 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 133 states to 128 states and 147 transitions. [2025-03-09 07:18:45,637 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 63 [2025-03-09 07:18:45,637 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 64 [2025-03-09 07:18:45,637 INFO L73 IsDeterministic]: Start isDeterministic. Operand 128 states and 147 transitions. [2025-03-09 07:18:45,638 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 07:18:45,638 INFO L218 hiAutomatonCegarLoop]: Abstraction has 128 states and 147 transitions. [2025-03-09 07:18:45,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states and 147 transitions. [2025-03-09 07:18:45,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 127. [2025-03-09 07:18:45,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 127 states have (on average 1.1496062992125984) internal successors, (146), 126 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 07:18:45,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 146 transitions. [2025-03-09 07:18:45,641 INFO L240 hiAutomatonCegarLoop]: Abstraction has 127 states and 146 transitions. [2025-03-09 07:18:45,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 07:18:45,641 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 07:18:45,641 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 07:18:45,641 INFO L87 Difference]: Start difference. First operand 127 states and 146 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 07:18:45,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 07:18:45,667 INFO L93 Difference]: Finished difference Result 70 states and 80 transitions. [2025-03-09 07:18:45,667 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 70 states and 80 transitions. [2025-03-09 07:18:45,667 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 32 [2025-03-09 07:18:45,667 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 70 states to 69 states and 79 transitions. [2025-03-09 07:18:45,667 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 37 [2025-03-09 07:18:45,668 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 37 [2025-03-09 07:18:45,668 INFO L73 IsDeterministic]: Start isDeterministic. Operand 69 states and 79 transitions. [2025-03-09 07:18:45,668 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 07:18:45,668 INFO L218 hiAutomatonCegarLoop]: Abstraction has 69 states and 79 transitions. [2025-03-09 07:18:45,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states and 79 transitions. [2025-03-09 07:18:45,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2025-03-09 07:18:45,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 69 states have (on average 1.144927536231884) internal successors, (79), 68 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 07:18:45,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 79 transitions. [2025-03-09 07:18:45,670 INFO L240 hiAutomatonCegarLoop]: Abstraction has 69 states and 79 transitions. [2025-03-09 07:18:45,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 07:18:45,670 INFO L432 stractBuchiCegarLoop]: Abstraction has 69 states and 79 transitions. [2025-03-09 07:18:45,670 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-03-09 07:18:45,670 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 69 states and 79 transitions. [2025-03-09 07:18:45,671 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 32 [2025-03-09 07:18:45,671 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 07:18:45,671 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 07:18:45,671 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-03-09 07:18:45,671 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 07:18:45,671 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;main_#in~argc#1, main_#in~argv#1.base, main_#in~argv#1.offset := #in~argc#1, #in~argv#1.base, #in~argv#1.offset;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post2#1, main_#t~post3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post6#1, main_#t~post7#1, main_~argc#1, main_~n~0#1, main_~l~0#1, main_~r~0#1, main_~i~0#1, main_~j~0#1;main_~argc#1 := main_#in~argc#1;havoc main_~n~0#1;havoc main_~l~0#1;havoc main_~r~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet1#1;main_~n~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;" "assume !!(1 <= main_~n~0#1 && main_~n~0#1 <= 1000000);main_~l~0#1 := 1 + (if main_~n~0#1 < 0 && 0 != main_~n~0#1 % 2 then 1 + main_~n~0#1 / 2 else main_~n~0#1 / 2);main_~r~0#1 := main_~n~0#1;" "assume main_~l~0#1 > 1;main_#t~post2#1 := main_~l~0#1;main_~l~0#1 := main_#t~post2#1 - 1;havoc main_#t~post2#1;" "assume main_~r~0#1 > 1;main_~i~0#1 := main_~l~0#1;main_~j~0#1 := 2 * main_~l~0#1;" [2025-03-09 07:18:45,671 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~j~0#1 <= main_~r~0#1;" "assume !(main_~j~0#1 < main_~r~0#1);" "assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 1 <= main_~j~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_#t~nondet5#1;" "assume 0 != main_#t~nondet5#1;havoc main_#t~nondet5#1;" "assume !(main_~l~0#1 > 1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 1 <= main_~r~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~r~0#1 <= main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post7#1 := main_~r~0#1;main_~r~0#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1;" "assume main_~r~0#1 > 1;main_~i~0#1 := main_~l~0#1;main_~j~0#1 := 2 * main_~l~0#1;" [2025-03-09 07:18:45,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:18:45,671 INFO L85 PathProgramCache]: Analyzing trace with hash 159336966, now seen corresponding path program 1 times [2025-03-09 07:18:45,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:18:45,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926561635] [2025-03-09 07:18:45,672 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:18:45,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:18:45,674 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 07:18:45,676 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 07:18:45,677 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:18:45,677 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:18:45,677 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:18:45,678 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 07:18:45,684 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 07:18:45,684 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:18:45,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:18:45,685 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:18:45,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:18:45,686 INFO L85 PathProgramCache]: Analyzing trace with hash -862908923, now seen corresponding path program 2 times [2025-03-09 07:18:45,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:18:45,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936812987] [2025-03-09 07:18:45,686 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 07:18:45,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:18:45,690 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 1 equivalence classes. [2025-03-09 07:18:45,692 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-09 07:18:45,696 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 07:18:45,696 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:18:45,696 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:18:45,699 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-09 07:18:45,701 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-09 07:18:45,701 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:18:45,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:18:45,702 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:18:45,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:18:45,702 INFO L85 PathProgramCache]: Analyzing trace with hash -103814326, now seen corresponding path program 1 times [2025-03-09 07:18:45,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:18:45,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969092408] [2025-03-09 07:18:45,702 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:18:45,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:18:45,707 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-09 07:18:45,710 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-09 07:18:45,710 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:18:45,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:18:45,754 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 07:18:45,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 07:18:45,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969092408] [2025-03-09 07:18:45,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969092408] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 07:18:45,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 07:18:45,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 07:18:45,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285407539] [2025-03-09 07:18:45,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 07:18:45,844 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2025-03-09 07:18:45,865 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 07:18:45,865 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 07:18:45,866 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 07:18:45,866 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 07:18:45,866 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-09 07:18:45,866 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:18:45,866 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 07:18:45,866 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 07:18:45,866 INFO L132 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration5_Loop [2025-03-09 07:18:45,866 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 07:18:45,866 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 07:18:45,867 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:18:45,870 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:18:45,872 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:18:45,873 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:18:45,883 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:18:45,921 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 07:18:45,921 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-09 07:18:45,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:18:45,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:18:45,923 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:18:45,924 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2025-03-09 07:18:45,925 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 07:18:45,926 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 07:18:45,938 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-09 07:18:45,938 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post7#1=0} Honda state: {ULTIMATE.start_main_#t~post7#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-09 07:18:45,944 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2025-03-09 07:18:45,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:18:45,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:18:45,946 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:18:45,946 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2025-03-09 07:18:45,947 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 07:18:45,947 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 07:18:45,957 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-09 07:18:45,958 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start___VERIFIER_assert_~cond#1=0} Honda state: {ULTIMATE.start___VERIFIER_assert_~cond#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-09 07:18:45,963 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2025-03-09 07:18:45,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:18:45,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:18:45,965 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:18:45,965 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2025-03-09 07:18:45,966 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 07:18:45,966 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 07:18:45,976 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-09 07:18:45,976 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet5#1=0} Honda state: {ULTIMATE.start_main_#t~nondet5#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-09 07:18:45,981 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2025-03-09 07:18:45,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:18:45,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:18:45,983 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:18:45,984 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2025-03-09 07:18:45,985 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 07:18:45,985 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 07:18:46,001 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2025-03-09 07:18:46,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:18:46,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:18:46,004 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:18:46,005 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2025-03-09 07:18:46,006 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-09 07:18:46,006 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 07:18:46,266 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-09 07:18:46,274 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2025-03-09 07:18:46,275 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 07:18:46,275 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 07:18:46,275 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 07:18:46,275 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 07:18:46,275 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-09 07:18:46,275 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:18:46,275 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 07:18:46,275 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 07:18:46,275 INFO L132 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration5_Loop [2025-03-09 07:18:46,275 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 07:18:46,275 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 07:18:46,275 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:18:46,277 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:18:46,290 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:18:46,292 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:18:46,294 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:18:46,330 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 07:18:46,330 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-09 07:18:46,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:18:46,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:18:46,332 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:18:46,333 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2025-03-09 07:18:46,335 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:18:46,346 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:18:46,346 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:18:46,346 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:18:46,346 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:18:46,346 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:18:46,346 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:18:46,346 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:18:46,348 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:18:46,353 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2025-03-09 07:18:46,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:18:46,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:18:46,355 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:18:46,357 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2025-03-09 07:18:46,360 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:18:46,370 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:18:46,370 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:18:46,370 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:18:46,370 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:18:46,370 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:18:46,372 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:18:46,372 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:18:46,374 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-09 07:18:46,376 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2025-03-09 07:18:46,376 INFO L444 ModelExtractionUtils]: 5 out of 7 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-03-09 07:18:46,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:18:46,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:18:46,378 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:18:46,378 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2025-03-09 07:18:46,379 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-09 07:18:46,379 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-09 07:18:46,379 INFO L474 LassoAnalysis]: Proved termination. [2025-03-09 07:18:46,379 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0#1) = 1*ULTIMATE.start_main_~j~0#1 Supporting invariants [] [2025-03-09 07:18:46,384 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2025-03-09 07:18:46,385 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-09 07:18:46,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:18:46,398 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 07:18:46,401 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 07:18:46,401 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:18:46,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:18:46,401 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-09 07:18:46,402 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 07:18:46,408 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-09 07:18:46,411 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-09 07:18:46,411 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:18:46,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:18:46,412 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-09 07:18:46,412 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 07:18:46,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 07:18:46,458 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2025-03-09 07:18:46,459 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 69 states and 79 transitions. cyclomatic complexity: 12 Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 07:18:46,577 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 69 states and 79 transitions. cyclomatic complexity: 12. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 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 400 states and 442 transitions. Complement of second has 17 states. [2025-03-09 07:18:46,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 1 stem states 7 non-accepting loop states 1 accepting loop states [2025-03-09 07:18:46,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 07:18:46,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 109 transitions. [2025-03-09 07:18:46,579 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 109 transitions. Stem has 5 letters. Loop has 14 letters. [2025-03-09 07:18:46,579 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 07:18:46,579 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 109 transitions. Stem has 19 letters. Loop has 14 letters. [2025-03-09 07:18:46,579 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 07:18:46,579 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 109 transitions. Stem has 5 letters. Loop has 28 letters. [2025-03-09 07:18:46,579 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 07:18:46,579 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 400 states and 442 transitions. [2025-03-09 07:18:46,581 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 71 [2025-03-09 07:18:46,584 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 400 states to 330 states and 371 transitions. [2025-03-09 07:18:46,585 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 108 [2025-03-09 07:18:46,585 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 109 [2025-03-09 07:18:46,585 INFO L73 IsDeterministic]: Start isDeterministic. Operand 330 states and 371 transitions. [2025-03-09 07:18:46,585 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 07:18:46,585 INFO L218 hiAutomatonCegarLoop]: Abstraction has 330 states and 371 transitions. [2025-03-09 07:18:46,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states and 371 transitions. [2025-03-09 07:18:46,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 197. [2025-03-09 07:18:46,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 197 states have (on average 1.1573604060913705) internal successors, (228), 196 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 07:18:46,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 228 transitions. [2025-03-09 07:18:46,592 INFO L240 hiAutomatonCegarLoop]: Abstraction has 197 states and 228 transitions. [2025-03-09 07:18:46,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 07:18:46,592 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 07:18:46,592 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-09 07:18:46,592 INFO L87 Difference]: Start difference. First operand 197 states and 228 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 07:18:46,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 07:18:46,723 INFO L93 Difference]: Finished difference Result 657 states and 728 transitions. [2025-03-09 07:18:46,723 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 657 states and 728 transitions. [2025-03-09 07:18:46,726 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 165 [2025-03-09 07:18:46,728 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 657 states to 593 states and 657 transitions. [2025-03-09 07:18:46,728 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 198 [2025-03-09 07:18:46,729 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 211 [2025-03-09 07:18:46,729 INFO L73 IsDeterministic]: Start isDeterministic. Operand 593 states and 657 transitions. [2025-03-09 07:18:46,729 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 07:18:46,729 INFO L218 hiAutomatonCegarLoop]: Abstraction has 593 states and 657 transitions. [2025-03-09 07:18:46,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states and 657 transitions. [2025-03-09 07:18:46,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 189. [2025-03-09 07:18:46,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 189 states have (on average 1.1534391534391535) internal successors, (218), 188 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 07:18:46,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 218 transitions. [2025-03-09 07:18:46,738 INFO L240 hiAutomatonCegarLoop]: Abstraction has 189 states and 218 transitions. [2025-03-09 07:18:46,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-09 07:18:46,739 INFO L432 stractBuchiCegarLoop]: Abstraction has 189 states and 218 transitions. [2025-03-09 07:18:46,739 INFO L338 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-03-09 07:18:46,739 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 189 states and 218 transitions. [2025-03-09 07:18:46,739 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 58 [2025-03-09 07:18:46,739 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 07:18:46,739 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 07:18:46,740 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-03-09 07:18:46,740 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 07:18:46,740 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;main_#in~argc#1, main_#in~argv#1.base, main_#in~argv#1.offset := #in~argc#1, #in~argv#1.base, #in~argv#1.offset;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post2#1, main_#t~post3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post6#1, main_#t~post7#1, main_~argc#1, main_~n~0#1, main_~l~0#1, main_~r~0#1, main_~i~0#1, main_~j~0#1;main_~argc#1 := main_#in~argc#1;havoc main_~n~0#1;havoc main_~l~0#1;havoc main_~r~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet1#1;main_~n~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;" "assume !!(1 <= main_~n~0#1 && main_~n~0#1 <= 1000000);main_~l~0#1 := 1 + (if main_~n~0#1 < 0 && 0 != main_~n~0#1 % 2 then 1 + main_~n~0#1 / 2 else main_~n~0#1 / 2);main_~r~0#1 := main_~n~0#1;" "assume main_~l~0#1 > 1;main_#t~post2#1 := main_~l~0#1;main_~l~0#1 := main_#t~post2#1 - 1;havoc main_#t~post2#1;" "assume main_~r~0#1 > 1;main_~i~0#1 := main_~l~0#1;main_~j~0#1 := 2 * main_~l~0#1;" [2025-03-09 07:18:46,740 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~j~0#1 <= main_~r~0#1;" "assume main_~j~0#1 < main_~r~0#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 1 <= main_~j~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 1 <= 1 + main_~j~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 1 + main_~j~0#1 <= main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_#t~nondet4#1;" "assume 0 != main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1;" "assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 1 <= main_~j~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_#t~nondet5#1;" "assume 0 != main_#t~nondet5#1;havoc main_#t~nondet5#1;" "assume !(main_~l~0#1 > 1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 1 <= main_~r~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~r~0#1 <= main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post7#1 := main_~r~0#1;main_~r~0#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1;" "assume main_~r~0#1 > 1;main_~i~0#1 := main_~l~0#1;main_~j~0#1 := 2 * main_~l~0#1;" [2025-03-09 07:18:46,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:18:46,740 INFO L85 PathProgramCache]: Analyzing trace with hash 159336966, now seen corresponding path program 2 times [2025-03-09 07:18:46,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:18:46,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956145956] [2025-03-09 07:18:46,740 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 07:18:46,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:18:46,743 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 5 statements into 1 equivalence classes. [2025-03-09 07:18:46,745 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 07:18:46,745 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 07:18:46,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:18:46,745 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:18:46,746 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 07:18:46,748 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 07:18:46,748 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:18:46,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:18:46,749 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:18:46,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:18:46,750 INFO L85 PathProgramCache]: Analyzing trace with hash 1749372508, now seen corresponding path program 1 times [2025-03-09 07:18:46,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:18:46,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342516191] [2025-03-09 07:18:46,750 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:18:46,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:18:46,754 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-09 07:18:46,758 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-09 07:18:46,758 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:18:46,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:18:46,758 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:18:46,759 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-09 07:18:46,765 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-09 07:18:46,765 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:18:46,765 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:18:46,766 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:18:46,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:18:46,766 INFO L85 PathProgramCache]: Analyzing trace with hash 2134544055, now seen corresponding path program 1 times [2025-03-09 07:18:46,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:18:46,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001300950] [2025-03-09 07:18:46,767 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:18:46,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:18:46,770 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-09 07:18:46,776 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-09 07:18:46,778 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:18:46,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:18:46,778 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:18:46,780 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-09 07:18:46,783 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-09 07:18:46,786 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:18:46,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:18:46,790 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:18:46,928 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2025-03-09 07:18:46,967 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 07:18:46,968 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 07:18:46,968 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 07:18:46,968 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 07:18:46,968 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-09 07:18:46,968 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:18:46,968 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 07:18:46,968 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 07:18:46,968 INFO L132 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration6_Loop [2025-03-09 07:18:46,968 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 07:18:46,968 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 07:18:46,968 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:18:46,980 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:18:46,981 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:18:46,983 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:18:46,988 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:18:46,989 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:18:47,025 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 07:18:47,026 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-09 07:18:47,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:18:47,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:18:47,030 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:18:47,030 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2025-03-09 07:18:47,031 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 07:18:47,032 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 07:18:47,049 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Ended with exit code 0 [2025-03-09 07:18:47,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:18:47,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:18:47,052 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:18:47,054 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2025-03-09 07:18:47,055 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-09 07:18:47,055 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 07:18:47,114 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-09 07:18:47,119 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2025-03-09 07:18:47,119 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 07:18:47,119 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 07:18:47,119 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 07:18:47,119 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 07:18:47,119 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-09 07:18:47,119 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:18:47,119 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 07:18:47,119 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 07:18:47,120 INFO L132 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration6_Loop [2025-03-09 07:18:47,120 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 07:18:47,120 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 07:18:47,120 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:18:47,131 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:18:47,133 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:18:47,134 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:18:47,136 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:18:47,138 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:18:47,178 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 07:18:47,178 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-09 07:18:47,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:18:47,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:18:47,180 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:18:47,181 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2025-03-09 07:18:47,183 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:18:47,193 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:18:47,193 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:18:47,193 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:18:47,193 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:18:47,193 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:18:47,194 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:18:47,195 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:18:47,198 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-09 07:18:47,202 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-09 07:18:47,202 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-03-09 07:18:47,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:18:47,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:18:47,204 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:18:47,206 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2025-03-09 07:18:47,207 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-09 07:18:47,207 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-09 07:18:47,207 INFO L474 LassoAnalysis]: Proved termination. [2025-03-09 07:18:47,207 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~r~0#1) = 1*ULTIMATE.start_main_~r~0#1 Supporting invariants [] [2025-03-09 07:18:47,214 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Ended with exit code 0 [2025-03-09 07:18:47,214 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-09 07:18:47,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:18:47,230 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 07:18:47,236 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 07:18:47,236 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:18:47,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:18:47,237 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-09 07:18:47,237 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 07:18:47,252 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-09 07:18:47,257 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-09 07:18:47,257 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:18:47,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:18:47,258 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 07:18:47,258 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 07:18:47,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 07:18:47,289 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-03-09 07:18:47,289 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 189 states and 218 transitions. cyclomatic complexity: 35 Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 07:18:47,311 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 189 states and 218 transitions. cyclomatic complexity: 35. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 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 376 states and 436 transitions. Complement of second has 6 states. [2025-03-09 07:18:47,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-03-09 07:18:47,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 07:18:47,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 47 transitions. [2025-03-09 07:18:47,312 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 47 transitions. Stem has 5 letters. Loop has 23 letters. [2025-03-09 07:18:47,312 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 07:18:47,312 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 47 transitions. Stem has 28 letters. Loop has 23 letters. [2025-03-09 07:18:47,313 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 07:18:47,313 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 47 transitions. Stem has 5 letters. Loop has 46 letters. [2025-03-09 07:18:47,313 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 07:18:47,313 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 376 states and 436 transitions. [2025-03-09 07:18:47,315 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 50 [2025-03-09 07:18:47,317 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 376 states to 252 states and 292 transitions. [2025-03-09 07:18:47,317 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 60 [2025-03-09 07:18:47,318 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 61 [2025-03-09 07:18:47,318 INFO L73 IsDeterministic]: Start isDeterministic. Operand 252 states and 292 transitions. [2025-03-09 07:18:47,318 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 07:18:47,318 INFO L218 hiAutomatonCegarLoop]: Abstraction has 252 states and 292 transitions. [2025-03-09 07:18:47,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states and 292 transitions. [2025-03-09 07:18:47,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 132. [2025-03-09 07:18:47,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 132 states have (on average 1.1590909090909092) internal successors, (153), 131 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 07:18:47,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 153 transitions. [2025-03-09 07:18:47,321 INFO L240 hiAutomatonCegarLoop]: Abstraction has 132 states and 153 transitions. [2025-03-09 07:18:47,321 INFO L432 stractBuchiCegarLoop]: Abstraction has 132 states and 153 transitions. [2025-03-09 07:18:47,321 INFO L338 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-03-09 07:18:47,321 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 132 states and 153 transitions. [2025-03-09 07:18:47,323 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2025-03-09 07:18:47,323 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 07:18:47,323 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 07:18:47,323 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2025-03-09 07:18:47,323 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 07:18:47,323 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;main_#in~argc#1, main_#in~argv#1.base, main_#in~argv#1.offset := #in~argc#1, #in~argv#1.base, #in~argv#1.offset;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post2#1, main_#t~post3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post6#1, main_#t~post7#1, main_~argc#1, main_~n~0#1, main_~l~0#1, main_~r~0#1, main_~i~0#1, main_~j~0#1;main_~argc#1 := main_#in~argc#1;havoc main_~n~0#1;havoc main_~l~0#1;havoc main_~r~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet1#1;main_~n~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;" "assume !!(1 <= main_~n~0#1 && main_~n~0#1 <= 1000000);main_~l~0#1 := 1 + (if main_~n~0#1 < 0 && 0 != main_~n~0#1 % 2 then 1 + main_~n~0#1 / 2 else main_~n~0#1 / 2);main_~r~0#1 := main_~n~0#1;" "assume main_~l~0#1 > 1;main_#t~post2#1 := main_~l~0#1;main_~l~0#1 := main_#t~post2#1 - 1;havoc main_#t~post2#1;" "assume main_~r~0#1 > 1;main_~i~0#1 := main_~l~0#1;main_~j~0#1 := 2 * main_~l~0#1;" "assume main_~j~0#1 <= main_~r~0#1;" [2025-03-09 07:18:47,326 INFO L754 eck$LassoCheckResult]: Loop: "assume !(main_~j~0#1 < main_~r~0#1);" "assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 1 <= main_~j~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_#t~nondet5#1;" "assume !(0 != main_#t~nondet5#1);havoc main_#t~nondet5#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 1 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 1 <= main_~j~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_~i~0#1 := main_~j~0#1;main_~j~0#1 := 2 * main_~j~0#1;" "assume main_~j~0#1 <= main_~r~0#1;" [2025-03-09 07:18:47,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:18:47,326 INFO L85 PathProgramCache]: Analyzing trace with hash 644478776, now seen corresponding path program 1 times [2025-03-09 07:18:47,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:18:47,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371812980] [2025-03-09 07:18:47,326 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:18:47,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:18:47,332 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 07:18:47,333 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 07:18:47,333 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:18:47,333 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:18:47,333 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:18:47,334 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 07:18:47,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 07:18:47,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:18:47,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:18:47,339 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:18:47,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:18:47,339 INFO L85 PathProgramCache]: Analyzing trace with hash 1164822529, now seen corresponding path program 1 times [2025-03-09 07:18:47,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:18:47,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029659226] [2025-03-09 07:18:47,339 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:18:47,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:18:47,343 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-09 07:18:47,344 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-09 07:18:47,344 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:18:47,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:18:47,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 07:18:47,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 07:18:47,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029659226] [2025-03-09 07:18:47,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029659226] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 07:18:47,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 07:18:47,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 07:18:47,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900655477] [2025-03-09 07:18:47,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 07:18:47,405 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-09 07:18:47,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 07:18:47,405 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 07:18:47,405 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-09 07:18:47,405 INFO L87 Difference]: Start difference. First operand 132 states and 153 transitions. cyclomatic complexity: 25 Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 07:18:47,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 07:18:47,482 INFO L93 Difference]: Finished difference Result 210 states and 235 transitions. [2025-03-09 07:18:47,482 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 210 states and 235 transitions. [2025-03-09 07:18:47,483 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2025-03-09 07:18:47,484 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 210 states to 195 states and 220 transitions. [2025-03-09 07:18:47,484 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 32 [2025-03-09 07:18:47,484 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 32 [2025-03-09 07:18:47,484 INFO L73 IsDeterministic]: Start isDeterministic. Operand 195 states and 220 transitions. [2025-03-09 07:18:47,484 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 07:18:47,485 INFO L218 hiAutomatonCegarLoop]: Abstraction has 195 states and 220 transitions. [2025-03-09 07:18:47,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states and 220 transitions. [2025-03-09 07:18:47,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 177. [2025-03-09 07:18:47,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 177 states have (on average 1.1299435028248588) internal successors, (200), 176 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 07:18:47,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 200 transitions. [2025-03-09 07:18:47,487 INFO L240 hiAutomatonCegarLoop]: Abstraction has 177 states and 200 transitions. [2025-03-09 07:18:47,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 07:18:47,488 INFO L432 stractBuchiCegarLoop]: Abstraction has 177 states and 200 transitions. [2025-03-09 07:18:47,488 INFO L338 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2025-03-09 07:18:47,488 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 177 states and 200 transitions. [2025-03-09 07:18:47,488 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2025-03-09 07:18:47,488 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 07:18:47,488 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 07:18:47,489 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2025-03-09 07:18:47,489 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 07:18:47,489 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;main_#in~argc#1, main_#in~argv#1.base, main_#in~argv#1.offset := #in~argc#1, #in~argv#1.base, #in~argv#1.offset;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post2#1, main_#t~post3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post6#1, main_#t~post7#1, main_~argc#1, main_~n~0#1, main_~l~0#1, main_~r~0#1, main_~i~0#1, main_~j~0#1;main_~argc#1 := main_#in~argc#1;havoc main_~n~0#1;havoc main_~l~0#1;havoc main_~r~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet1#1;main_~n~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;" "assume !!(1 <= main_~n~0#1 && main_~n~0#1 <= 1000000);main_~l~0#1 := 1 + (if main_~n~0#1 < 0 && 0 != main_~n~0#1 % 2 then 1 + main_~n~0#1 / 2 else main_~n~0#1 / 2);main_~r~0#1 := main_~n~0#1;" "assume main_~l~0#1 > 1;main_#t~post2#1 := main_~l~0#1;main_~l~0#1 := main_#t~post2#1 - 1;havoc main_#t~post2#1;" "assume main_~r~0#1 > 1;main_~i~0#1 := main_~l~0#1;main_~j~0#1 := 2 * main_~l~0#1;" "assume main_~j~0#1 <= main_~r~0#1;" [2025-03-09 07:18:47,489 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~j~0#1 < main_~r~0#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 1 <= main_~j~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 1 <= 1 + main_~j~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 1 + main_~j~0#1 <= main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_#t~nondet4#1;" "assume 0 != main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1;" "assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 1 <= main_~j~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_#t~nondet5#1;" "assume !(0 != main_#t~nondet5#1);havoc main_#t~nondet5#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 1 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 1 <= main_~j~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_~i~0#1 := main_~j~0#1;main_~j~0#1 := 2 * main_~j~0#1;" "assume main_~j~0#1 <= main_~r~0#1;" [2025-03-09 07:18:47,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:18:47,489 INFO L85 PathProgramCache]: Analyzing trace with hash 644478776, now seen corresponding path program 2 times [2025-03-09 07:18:47,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:18:47,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733759736] [2025-03-09 07:18:47,490 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 07:18:47,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:18:47,492 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 6 statements into 1 equivalence classes. [2025-03-09 07:18:47,493 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 07:18:47,494 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 07:18:47,494 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:18:47,494 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:18:47,495 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 07:18:47,499 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 07:18:47,500 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:18:47,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:18:47,501 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:18:47,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:18:47,501 INFO L85 PathProgramCache]: Analyzing trace with hash -1047677438, now seen corresponding path program 1 times [2025-03-09 07:18:47,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:18:47,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827620500] [2025-03-09 07:18:47,501 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:18:47,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:18:47,504 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-09 07:18:47,511 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-09 07:18:47,511 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:18:47,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:18:47,511 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:18:47,513 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-09 07:18:47,521 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-09 07:18:47,521 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:18:47,521 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:18:47,522 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:18:47,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:18:47,525 INFO L85 PathProgramCache]: Analyzing trace with hash -2010613077, now seen corresponding path program 1 times [2025-03-09 07:18:47,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:18:47,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753717966] [2025-03-09 07:18:47,525 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:18:47,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:18:47,530 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-09 07:18:47,533 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-09 07:18:47,534 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:18:47,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:18:47,567 ERROR L418 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Exception during sending of exit command (exit): Broken pipe [2025-03-09 07:18:47,571 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Ended with exit code 0 [2025-03-09 07:18:47,641 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 07:18:47,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 07:18:47,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753717966] [2025-03-09 07:18:47,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753717966] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 07:18:47,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1168859061] [2025-03-09 07:18:47,641 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:18:47,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 07:18:47,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:18:47,643 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 07:18:47,645 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2025-03-09 07:18:47,677 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-09 07:18:47,687 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-09 07:18:47,687 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:18:47,687 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:18:47,687 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-09 07:18:47,688 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 07:18:47,842 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 07:18:47,843 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 07:18:47,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1168859061] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 07:18:47,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 07:18:47,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 12 [2025-03-09 07:18:47,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384393050] [2025-03-09 07:18:47,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 07:18:48,001 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 07:18:48,001 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 07:18:48,001 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 07:18:48,001 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 07:18:48,001 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-09 07:18:48,001 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:18:48,001 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 07:18:48,001 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 07:18:48,001 INFO L132 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration8_Loop [2025-03-09 07:18:48,001 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 07:18:48,001 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 07:18:48,002 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:18:48,003 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:18:48,004 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:18:48,005 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:18:48,007 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:18:48,047 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 07:18:48,047 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-09 07:18:48,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:18:48,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:18:48,049 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:18:48,050 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2025-03-09 07:18:48,051 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 07:18:48,052 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 07:18:48,063 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-09 07:18:48,063 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start___VERIFIER_assert_~cond#1=0} Honda state: {ULTIMATE.start___VERIFIER_assert_~cond#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-09 07:18:48,068 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Forceful destruction successful, exit code 0 [2025-03-09 07:18:48,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:18:48,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:18:48,070 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:18:48,071 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2025-03-09 07:18:48,073 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 07:18:48,073 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 07:18:48,084 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-09 07:18:48,085 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet4#1=0} Honda state: {ULTIMATE.start_main_#t~nondet4#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-09 07:18:48,093 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Forceful destruction successful, exit code 0 [2025-03-09 07:18:48,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:18:48,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:18:48,095 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:18:48,096 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2025-03-09 07:18:48,098 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 07:18:48,098 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 07:18:48,110 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-09 07:18:48,110 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet5#1=0} Honda state: {ULTIMATE.start_main_#t~nondet5#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-09 07:18:48,116 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Forceful destruction successful, exit code 0 [2025-03-09 07:18:48,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:18:48,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:18:48,119 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:18:48,120 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2025-03-09 07:18:48,121 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 07:18:48,121 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 07:18:48,133 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-09 07:18:48,133 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start___VERIFIER_assert_#in~cond#1=0} Honda state: {ULTIMATE.start___VERIFIER_assert_#in~cond#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-09 07:18:48,139 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Forceful destruction successful, exit code 0 [2025-03-09 07:18:48,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:18:48,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:18:48,141 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:18:48,143 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2025-03-09 07:18:48,144 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 07:18:48,144 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 07:18:48,168 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Forceful destruction successful, exit code 0 [2025-03-09 07:18:48,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:18:48,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:18:48,170 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:18:48,180 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-09 07:18:48,180 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 07:18:48,182 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2025-03-09 07:18:48,244 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-09 07:18:48,248 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Forceful destruction successful, exit code 0 [2025-03-09 07:18:48,248 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 07:18:48,248 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 07:18:48,248 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 07:18:48,248 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 07:18:48,248 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-09 07:18:48,248 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:18:48,248 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 07:18:48,248 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 07:18:48,248 INFO L132 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration8_Loop [2025-03-09 07:18:48,248 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 07:18:48,248 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 07:18:48,249 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:18:48,251 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:18:48,252 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:18:48,255 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:18:48,256 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:18:48,290 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 07:18:48,290 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-09 07:18:48,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:18:48,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:18:48,292 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:18:48,293 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2025-03-09 07:18:48,293 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:18:48,303 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:18:48,303 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:18:48,303 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:18:48,303 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:18:48,303 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:18:48,303 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:18:48,303 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:18:48,304 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:18:48,309 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Ended with exit code 0 [2025-03-09 07:18:48,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:18:48,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:18:48,311 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:18:48,311 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2025-03-09 07:18:48,312 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:18:48,321 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:18:48,321 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:18:48,322 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:18:48,322 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:18:48,322 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:18:48,322 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:18:48,322 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:18:48,323 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:18:48,327 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Forceful destruction successful, exit code 0 [2025-03-09 07:18:48,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:18:48,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:18:48,331 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:18:48,333 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2025-03-09 07:18:48,334 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:18:48,343 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:18:48,343 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:18:48,343 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:18:48,343 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:18:48,343 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:18:48,344 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:18:48,344 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:18:48,344 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:18:48,350 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Forceful destruction successful, exit code 0 [2025-03-09 07:18:48,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:18:48,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:18:48,351 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:18:48,352 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2025-03-09 07:18:48,353 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:18:48,362 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:18:48,362 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:18:48,362 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:18:48,362 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:18:48,362 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:18:48,363 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:18:48,363 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:18:48,364 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:18:48,369 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Ended with exit code 0 [2025-03-09 07:18:48,369 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:18:48,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:18:48,371 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:18:48,371 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2025-03-09 07:18:48,372 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:18:48,382 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:18:48,382 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:18:48,382 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:18:48,382 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:18:48,382 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:18:48,384 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:18:48,384 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:18:48,387 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-09 07:18:48,391 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-03-09 07:18:48,391 INFO L444 ModelExtractionUtils]: 2 out of 6 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-03-09 07:18:48,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:18:48,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:18:48,393 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:18:48,394 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2025-03-09 07:18:48,395 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-09 07:18:48,395 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-09 07:18:48,395 INFO L474 LassoAnalysis]: Proved termination. [2025-03-09 07:18:48,395 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0#1, ULTIMATE.start_main_~r~0#1) = -8*ULTIMATE.start_main_~j~0#1 + 5*ULTIMATE.start_main_~r~0#1 Supporting invariants [] [2025-03-09 07:18:48,401 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Forceful destruction successful, exit code 0 [2025-03-09 07:18:48,402 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-09 07:18:48,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:18:48,420 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 07:18:48,423 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 07:18:48,423 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:18:48,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:18:48,424 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-09 07:18:48,424 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 07:18:48,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-09 07:18:48,439 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-09 07:18:48,439 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:18:48,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:18:48,441 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-09 07:18:48,442 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 07:18:48,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 07:18:48,557 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2025-03-09 07:18:48,557 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 177 states and 200 transitions. cyclomatic complexity: 27 Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 07:18:48,767 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 177 states and 200 transitions. cyclomatic complexity: 27. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 827 states and 904 transitions. Complement of second has 17 states. [2025-03-09 07:18:48,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 1 stem states 7 non-accepting loop states 1 accepting loop states [2025-03-09 07:18:48,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 07:18:48,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 84 transitions. [2025-03-09 07:18:48,768 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 84 transitions. Stem has 6 letters. Loop has 25 letters. [2025-03-09 07:18:48,768 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 07:18:48,768 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 84 transitions. Stem has 31 letters. Loop has 25 letters. [2025-03-09 07:18:48,768 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 07:18:48,768 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 84 transitions. Stem has 6 letters. Loop has 50 letters. [2025-03-09 07:18:48,768 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 07:18:48,768 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 827 states and 904 transitions. [2025-03-09 07:18:48,774 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2025-03-09 07:18:48,776 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 827 states to 601 states and 665 transitions. [2025-03-09 07:18:48,776 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 32 [2025-03-09 07:18:48,776 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 32 [2025-03-09 07:18:48,776 INFO L73 IsDeterministic]: Start isDeterministic. Operand 601 states and 665 transitions. [2025-03-09 07:18:48,776 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 07:18:48,776 INFO L218 hiAutomatonCegarLoop]: Abstraction has 601 states and 665 transitions. [2025-03-09 07:18:48,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states and 665 transitions. [2025-03-09 07:18:48,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 430. [2025-03-09 07:18:48,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 430 states, 430 states have (on average 1.1186046511627907) internal successors, (481), 429 states have internal predecessors, (481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 07:18:48,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 481 transitions. [2025-03-09 07:18:48,783 INFO L240 hiAutomatonCegarLoop]: Abstraction has 430 states and 481 transitions. [2025-03-09 07:18:48,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 07:18:48,783 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 07:18:48,784 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2025-03-09 07:18:48,784 INFO L87 Difference]: Start difference. First operand 430 states and 481 transitions. Second operand has 7 states, 6 states have (on average 5.166666666666667) internal successors, (31), 7 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 07:18:48,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 07:18:48,907 INFO L93 Difference]: Finished difference Result 584 states and 629 transitions. [2025-03-09 07:18:48,907 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 584 states and 629 transitions. [2025-03-09 07:18:48,909 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2025-03-09 07:18:48,910 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 584 states to 321 states and 357 transitions. [2025-03-09 07:18:48,910 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31 [2025-03-09 07:18:48,910 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2025-03-09 07:18:48,910 INFO L73 IsDeterministic]: Start isDeterministic. Operand 321 states and 357 transitions. [2025-03-09 07:18:48,910 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 07:18:48,910 INFO L218 hiAutomatonCegarLoop]: Abstraction has 321 states and 357 transitions. [2025-03-09 07:18:48,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states and 357 transitions. [2025-03-09 07:18:48,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 226. [2025-03-09 07:18:48,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 226 states have (on average 1.1238938053097345) internal successors, (254), 225 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 07:18:48,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 254 transitions. [2025-03-09 07:18:48,914 INFO L240 hiAutomatonCegarLoop]: Abstraction has 226 states and 254 transitions. [2025-03-09 07:18:48,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-09 07:18:48,915 INFO L432 stractBuchiCegarLoop]: Abstraction has 226 states and 254 transitions. [2025-03-09 07:18:48,915 INFO L338 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2025-03-09 07:18:48,915 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 226 states and 254 transitions. [2025-03-09 07:18:48,916 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2025-03-09 07:18:48,916 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 07:18:48,916 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 07:18:48,917 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 07:18:48,917 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 07:18:48,917 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;main_#in~argc#1, main_#in~argv#1.base, main_#in~argv#1.offset := #in~argc#1, #in~argv#1.base, #in~argv#1.offset;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post2#1, main_#t~post3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post6#1, main_#t~post7#1, main_~argc#1, main_~n~0#1, main_~l~0#1, main_~r~0#1, main_~i~0#1, main_~j~0#1;main_~argc#1 := main_#in~argc#1;havoc main_~n~0#1;havoc main_~l~0#1;havoc main_~r~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet1#1;main_~n~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;" "assume !!(1 <= main_~n~0#1 && main_~n~0#1 <= 1000000);main_~l~0#1 := 1 + (if main_~n~0#1 < 0 && 0 != main_~n~0#1 % 2 then 1 + main_~n~0#1 / 2 else main_~n~0#1 / 2);main_~r~0#1 := main_~n~0#1;" "assume main_~l~0#1 > 1;main_#t~post2#1 := main_~l~0#1;main_~l~0#1 := main_#t~post2#1 - 1;havoc main_#t~post2#1;" "assume main_~r~0#1 > 1;main_~i~0#1 := main_~l~0#1;main_~j~0#1 := 2 * main_~l~0#1;" "assume main_~j~0#1 <= main_~r~0#1;" "assume !(main_~j~0#1 < main_~r~0#1);" "assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 1 <= main_~j~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_#t~nondet5#1;" "assume 0 != main_#t~nondet5#1;havoc main_#t~nondet5#1;" "assume main_~l~0#1 > 1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 1 <= main_~l~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~l~0#1 <= main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post6#1 := main_~l~0#1;main_~l~0#1 := main_#t~post6#1 - 1;havoc main_#t~post6#1;" "assume main_~r~0#1 > 1;main_~i~0#1 := main_~l~0#1;main_~j~0#1 := 2 * main_~l~0#1;" [2025-03-09 07:18:48,917 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~j~0#1 <= main_~r~0#1;" "assume main_~j~0#1 < main_~r~0#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 1 <= main_~j~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 1 <= 1 + main_~j~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 1 + main_~j~0#1 <= main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_#t~nondet4#1;" "assume 0 != main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1;" "assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 1 <= main_~j~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_#t~nondet5#1;" "assume !(0 != main_#t~nondet5#1);havoc main_#t~nondet5#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 1 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 1 <= main_~j~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_~i~0#1 := main_~j~0#1;main_~j~0#1 := 2 * main_~j~0#1;" [2025-03-09 07:18:48,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:18:48,918 INFO L85 PathProgramCache]: Analyzing trace with hash -606733061, now seen corresponding path program 1 times [2025-03-09 07:18:48,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:18:48,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637601641] [2025-03-09 07:18:48,918 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:18:48,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:18:48,921 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-09 07:18:48,924 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-09 07:18:48,924 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:18:48,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:18:48,924 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:18:48,925 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-09 07:18:48,928 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-09 07:18:48,928 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:18:48,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:18:48,931 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:18:48,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:18:48,931 INFO L85 PathProgramCache]: Analyzing trace with hash 676492952, now seen corresponding path program 2 times [2025-03-09 07:18:48,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:18:48,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687963097] [2025-03-09 07:18:48,931 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 07:18:48,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:18:48,935 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 1 equivalence classes. [2025-03-09 07:18:48,938 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-09 07:18:48,938 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 07:18:48,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:18:48,938 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:18:48,939 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-09 07:18:48,945 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-09 07:18:48,945 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:18:48,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:18:48,947 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:18:48,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:18:48,948 INFO L85 PathProgramCache]: Analyzing trace with hash -1842665762, now seen corresponding path program 1 times [2025-03-09 07:18:48,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:18:48,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487822235] [2025-03-09 07:18:48,948 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:18:48,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:18:48,954 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-09 07:18:48,960 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-09 07:18:48,960 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:18:48,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:18:48,960 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:18:48,962 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-09 07:18:48,966 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-09 07:18:48,966 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:18:48,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:18:48,980 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:18:48,984 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Forceful destruction successful, exit code 0 [2025-03-09 07:18:49,133 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 07:18:49,133 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 07:18:49,133 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 07:18:49,133 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 07:18:49,133 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-09 07:18:49,133 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:18:49,133 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 07:18:49,133 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 07:18:49,133 INFO L132 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration9_Loop [2025-03-09 07:18:49,134 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 07:18:49,134 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 07:18:49,134 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:18:49,136 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:18:49,137 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:18:49,139 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:18:49,149 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:18:49,179 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 07:18:49,179 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-09 07:18:49,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:18:49,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:18:49,182 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:18:49,183 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2025-03-09 07:18:49,184 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 07:18:49,184 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 07:18:49,194 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-09 07:18:49,194 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start___VERIFIER_assert_#in~cond#1=0} Honda state: {ULTIMATE.start___VERIFIER_assert_#in~cond#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-09 07:18:49,199 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Ended with exit code 0 [2025-03-09 07:18:49,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:18:49,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:18:49,201 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:18:49,202 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2025-03-09 07:18:49,204 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 07:18:49,204 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 07:18:49,214 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-09 07:18:49,214 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet4#1=0} Honda state: {ULTIMATE.start_main_#t~nondet4#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-09 07:18:49,219 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Forceful destruction successful, exit code 0 [2025-03-09 07:18:49,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:18:49,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:18:49,222 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:18:49,222 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2025-03-09 07:18:49,223 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 07:18:49,223 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 07:18:49,233 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-09 07:18:49,233 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet5#1=0} Honda state: {ULTIMATE.start_main_#t~nondet5#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-09 07:18:49,239 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Ended with exit code 0 [2025-03-09 07:18:49,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:18:49,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:18:49,240 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:18:49,241 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Waiting until timeout for monitored process [2025-03-09 07:18:49,242 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 07:18:49,242 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 07:18:49,267 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Ended with exit code 0 [2025-03-09 07:18:49,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:18:49,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:18:49,269 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:18:49,270 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Waiting until timeout for monitored process [2025-03-09 07:18:49,271 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-09 07:18:49,271 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 07:18:49,355 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-09 07:18:49,359 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Ended with exit code 0 [2025-03-09 07:18:49,360 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 07:18:49,360 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 07:18:49,360 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 07:18:49,360 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 07:18:49,360 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-09 07:18:49,360 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:18:49,360 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 07:18:49,360 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 07:18:49,360 INFO L132 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration9_Loop [2025-03-09 07:18:49,360 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 07:18:49,360 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 07:18:49,360 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:18:49,363 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:18:49,365 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:18:49,366 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:18:49,367 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:18:49,400 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 07:18:49,400 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-09 07:18:49,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:18:49,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:18:49,402 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:18:49,403 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Waiting until timeout for monitored process [2025-03-09 07:18:49,403 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:18:49,413 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:18:49,413 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:18:49,413 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:18:49,413 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:18:49,413 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:18:49,414 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:18:49,414 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:18:49,414 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:18:49,419 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Ended with exit code 0 [2025-03-09 07:18:49,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:18:49,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:18:49,421 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:18:49,421 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Waiting until timeout for monitored process [2025-03-09 07:18:49,422 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:18:49,432 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:18:49,432 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:18:49,432 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:18:49,432 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:18:49,432 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:18:49,432 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:18:49,432 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:18:49,433 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:18:49,438 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Ended with exit code 0 [2025-03-09 07:18:49,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:18:49,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:18:49,440 INFO L229 MonitoredProcess]: Starting monitored process 58 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:18:49,440 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Waiting until timeout for monitored process [2025-03-09 07:18:49,441 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:18:49,450 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:18:49,451 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:18:49,451 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:18:49,451 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:18:49,451 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:18:49,451 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:18:49,451 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:18:49,452 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:18:49,457 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Ended with exit code 0 [2025-03-09 07:18:49,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:18:49,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:18:49,458 INFO L229 MonitoredProcess]: Starting monitored process 59 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:18:49,459 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Waiting until timeout for monitored process [2025-03-09 07:18:49,460 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:18:49,469 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:18:49,469 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:18:49,469 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:18:49,469 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:18:49,469 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:18:49,470 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:18:49,470 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:18:49,470 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:18:49,475 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Forceful destruction successful, exit code 0 [2025-03-09 07:18:49,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:18:49,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:18:49,478 INFO L229 MonitoredProcess]: Starting monitored process 60 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:18:49,478 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Waiting until timeout for monitored process [2025-03-09 07:18:49,479 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:18:49,489 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:18:49,489 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:18:49,489 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:18:49,489 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:18:49,489 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:18:49,490 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:18:49,490 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:18:49,493 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-09 07:18:49,496 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-03-09 07:18:49,496 INFO L444 ModelExtractionUtils]: 2 out of 6 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-03-09 07:18:49,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:18:49,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:18:49,498 INFO L229 MonitoredProcess]: Starting monitored process 61 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:18:49,499 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Waiting until timeout for monitored process [2025-03-09 07:18:49,500 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-09 07:18:49,500 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-09 07:18:49,500 INFO L474 LassoAnalysis]: Proved termination. [2025-03-09 07:18:49,500 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~r~0#1, ULTIMATE.start_main_~j~0#1) = 1*ULTIMATE.start_main_~r~0#1 - 1*ULTIMATE.start_main_~j~0#1 Supporting invariants [] [2025-03-09 07:18:49,505 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Forceful destruction successful, exit code 0 [2025-03-09 07:18:49,505 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-09 07:18:49,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:18:49,522 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-09 07:18:49,527 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-09 07:18:49,527 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:18:49,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:18:49,528 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-09 07:18:49,528 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 07:18:49,551 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-09 07:18:49,557 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-09 07:18:49,557 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:18:49,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:18:49,560 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-09 07:18:49,561 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 07:18:49,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 07:18:49,664 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2025-03-09 07:18:49,664 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 226 states and 254 transitions. cyclomatic complexity: 32 Second operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 07:18:49,699 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 226 states and 254 transitions. cyclomatic complexity: 32. Second operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 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) Result 382 states and 418 transitions. Complement of second has 7 states. [2025-03-09 07:18:49,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-03-09 07:18:49,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 07:18:49,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 57 transitions. [2025-03-09 07:18:49,700 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 57 transitions. Stem has 19 letters. Loop has 25 letters. [2025-03-09 07:18:49,700 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 07:18:49,700 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-09 07:18:49,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:18:49,713 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-09 07:18:49,730 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Forceful destruction successful, exit code 0 [2025-03-09 07:18:49,735 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-09 07:18:49,735 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:18:49,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:18:49,736 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-09 07:18:49,737 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 07:18:49,758 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-09 07:18:49,764 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-09 07:18:49,764 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:18:49,764 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:18:49,765 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-09 07:18:49,765 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 07:18:49,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 07:18:49,876 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 5 loop predicates [2025-03-09 07:18:49,876 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 226 states and 254 transitions. cyclomatic complexity: 32 Second operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 07:18:49,985 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 226 states and 254 transitions. cyclomatic complexity: 32. Second operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 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) Result 462 states and 500 transitions. Complement of second has 15 states. [2025-03-09 07:18:49,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 1 stem states 6 non-accepting loop states 1 accepting loop states [2025-03-09 07:18:49,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 07:18:49,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 76 transitions. [2025-03-09 07:18:49,986 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 76 transitions. Stem has 19 letters. Loop has 25 letters. [2025-03-09 07:18:49,986 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 07:18:49,986 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-09 07:18:49,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:18:49,999 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-09 07:18:50,005 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-09 07:18:50,005 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:18:50,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:18:50,006 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-09 07:18:50,006 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 07:18:50,024 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-09 07:18:50,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-09 07:18:50,030 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:18:50,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:18:50,032 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-09 07:18:50,033 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 07:18:50,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 07:18:50,170 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 4 loop predicates [2025-03-09 07:18:50,170 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 226 states and 254 transitions. cyclomatic complexity: 32 Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 07:18:50,287 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 226 states and 254 transitions. cyclomatic complexity: 32. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 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) Result 813 states and 893 transitions. Complement of second has 11 states. [2025-03-09 07:18:50,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2025-03-09 07:18:50,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 07:18:50,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 108 transitions. [2025-03-09 07:18:50,288 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 108 transitions. Stem has 19 letters. Loop has 25 letters. [2025-03-09 07:18:50,288 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 07:18:50,289 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-09 07:18:50,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:18:50,302 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-09 07:18:50,307 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-09 07:18:50,307 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:18:50,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:18:50,308 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-09 07:18:50,309 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 07:18:50,332 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-09 07:18:50,337 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-09 07:18:50,337 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:18:50,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:18:50,337 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-09 07:18:50,339 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 07:18:50,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 07:18:50,466 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and with honda bouncer for loop.1 stem predicates 5 loop predicates [2025-03-09 07:18:50,466 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 226 states and 254 transitions. cyclomatic complexity: 32 Second operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 07:18:50,639 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 226 states and 254 transitions. cyclomatic complexity: 32. Second operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 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) Result 913 states and 983 transitions. Complement of second has 14 states. [2025-03-09 07:18:50,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 1 stem states 6 non-accepting loop states 1 accepting loop states [2025-03-09 07:18:50,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 07:18:50,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 131 transitions. [2025-03-09 07:18:50,640 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 131 transitions. Stem has 19 letters. Loop has 25 letters. [2025-03-09 07:18:50,641 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 07:18:50,641 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 131 transitions. Stem has 44 letters. Loop has 25 letters. [2025-03-09 07:18:50,641 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 07:18:50,641 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 131 transitions. Stem has 19 letters. Loop has 50 letters. [2025-03-09 07:18:50,641 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 07:18:50,641 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 913 states and 983 transitions. [2025-03-09 07:18:50,645 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2025-03-09 07:18:50,647 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 913 states to 632 states and 696 transitions. [2025-03-09 07:18:50,647 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 57 [2025-03-09 07:18:50,648 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 58 [2025-03-09 07:18:50,648 INFO L73 IsDeterministic]: Start isDeterministic. Operand 632 states and 696 transitions. [2025-03-09 07:18:50,648 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 07:18:50,648 INFO L218 hiAutomatonCegarLoop]: Abstraction has 632 states and 696 transitions. [2025-03-09 07:18:50,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states and 696 transitions. [2025-03-09 07:18:50,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 418. [2025-03-09 07:18:50,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 418 states, 418 states have (on average 1.1172248803827751) internal successors, (467), 417 states have internal predecessors, (467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 07:18:50,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 467 transitions. [2025-03-09 07:18:50,655 INFO L240 hiAutomatonCegarLoop]: Abstraction has 418 states and 467 transitions. [2025-03-09 07:18:50,655 INFO L432 stractBuchiCegarLoop]: Abstraction has 418 states and 467 transitions. [2025-03-09 07:18:50,655 INFO L338 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2025-03-09 07:18:50,655 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 418 states and 467 transitions. [2025-03-09 07:18:50,657 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2025-03-09 07:18:50,657 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 07:18:50,657 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 07:18:50,658 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 07:18:50,659 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 07:18:50,659 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;main_#in~argc#1, main_#in~argv#1.base, main_#in~argv#1.offset := #in~argc#1, #in~argv#1.base, #in~argv#1.offset;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post2#1, main_#t~post3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post6#1, main_#t~post7#1, main_~argc#1, main_~n~0#1, main_~l~0#1, main_~r~0#1, main_~i~0#1, main_~j~0#1;main_~argc#1 := main_#in~argc#1;havoc main_~n~0#1;havoc main_~l~0#1;havoc main_~r~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet1#1;main_~n~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;" "assume !!(1 <= main_~n~0#1 && main_~n~0#1 <= 1000000);main_~l~0#1 := 1 + (if main_~n~0#1 < 0 && 0 != main_~n~0#1 % 2 then 1 + main_~n~0#1 / 2 else main_~n~0#1 / 2);main_~r~0#1 := main_~n~0#1;" "assume main_~l~0#1 > 1;main_#t~post2#1 := main_~l~0#1;main_~l~0#1 := main_#t~post2#1 - 1;havoc main_#t~post2#1;" "assume main_~r~0#1 > 1;main_~i~0#1 := main_~l~0#1;main_~j~0#1 := 2 * main_~l~0#1;" "assume main_~j~0#1 <= main_~r~0#1;" "assume !(main_~j~0#1 < main_~r~0#1);" "assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 1 <= main_~j~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_#t~nondet5#1;" "assume 0 != main_#t~nondet5#1;havoc main_#t~nondet5#1;" "assume main_~l~0#1 > 1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 1 <= main_~l~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~l~0#1 <= main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post6#1 := main_~l~0#1;main_~l~0#1 := main_#t~post6#1 - 1;havoc main_#t~post6#1;" "assume main_~r~0#1 > 1;main_~i~0#1 := main_~l~0#1;main_~j~0#1 := 2 * main_~l~0#1;" "assume main_~j~0#1 <= main_~r~0#1;" "assume main_~j~0#1 < main_~r~0#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 1 <= main_~j~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 1 <= 1 + main_~j~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 1 + main_~j~0#1 <= main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_#t~nondet4#1;" "assume !(0 != main_#t~nondet4#1);havoc main_#t~nondet4#1;" [2025-03-09 07:18:50,659 INFO L754 eck$LassoCheckResult]: Loop: "assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 1 <= main_~j~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_#t~nondet5#1;" "assume !(0 != main_#t~nondet5#1);havoc main_#t~nondet5#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 1 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 1 <= main_~j~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_~i~0#1 := main_~j~0#1;main_~j~0#1 := 2 * main_~j~0#1;" "assume main_~j~0#1 <= main_~r~0#1;" "assume main_~j~0#1 < main_~r~0#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 1 <= main_~j~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 1 <= 1 + main_~j~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 1 + main_~j~0#1 <= main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_#t~nondet4#1;" "assume 0 != main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1;" [2025-03-09 07:18:50,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:18:50,660 INFO L85 PathProgramCache]: Analyzing trace with hash -1277632226, now seen corresponding path program 1 times [2025-03-09 07:18:50,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:18:50,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098134860] [2025-03-09 07:18:50,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:18:50,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:18:50,664 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-09 07:18:50,667 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-09 07:18:50,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:18:50,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:18:50,668 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:18:50,669 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-09 07:18:50,676 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-09 07:18:50,677 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:18:50,677 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:18:50,679 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:18:50,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:18:50,680 INFO L85 PathProgramCache]: Analyzing trace with hash 1735025910, now seen corresponding path program 3 times [2025-03-09 07:18:50,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:18:50,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232500214] [2025-03-09 07:18:50,680 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 07:18:50,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:18:50,683 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 1 equivalence classes. [2025-03-09 07:18:50,687 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-09 07:18:50,688 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-09 07:18:50,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:18:50,688 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:18:50,689 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-09 07:18:50,695 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-09 07:18:50,695 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:18:50,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:18:50,697 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:18:50,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:18:50,698 INFO L85 PathProgramCache]: Analyzing trace with hash 1849626233, now seen corresponding path program 1 times [2025-03-09 07:18:50,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:18:50,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101842856] [2025-03-09 07:18:50,698 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:18:50,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:18:50,704 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-09 07:18:50,709 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-09 07:18:50,709 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:18:50,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:18:50,789 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 10 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 07:18:50,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 07:18:50,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101842856] [2025-03-09 07:18:50,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101842856] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 07:18:50,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [253013173] [2025-03-09 07:18:50,790 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:18:50,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 07:18:50,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:18:50,792 INFO L229 MonitoredProcess]: Starting monitored process 62 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 07:18:50,794 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (62)] Waiting until timeout for monitored process [2025-03-09 07:18:50,833 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-09 07:18:50,847 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-09 07:18:50,847 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:18:50,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:18:50,848 INFO L256 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-09 07:18:50,849 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 07:18:50,993 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 07:18:50,993 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 07:18:51,085 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 10 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 07:18:51,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [253013173] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 07:18:51,085 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 07:18:51,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2025-03-09 07:18:51,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333753051] [2025-03-09 07:18:51,086 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 07:18:51,239 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 07:18:51,239 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 07:18:51,239 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 07:18:51,239 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 07:18:51,239 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-09 07:18:51,239 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:18:51,239 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 07:18:51,239 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 07:18:51,239 INFO L132 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration10_Loop [2025-03-09 07:18:51,239 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 07:18:51,239 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 07:18:51,239 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:18:51,247 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:18:51,249 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:18:51,250 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:18:51,253 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:18:51,277 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 07:18:51,277 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-09 07:18:51,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:18:51,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:18:51,279 INFO L229 MonitoredProcess]: Starting monitored process 63 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:18:51,280 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Waiting until timeout for monitored process [2025-03-09 07:18:51,280 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 07:18:51,281 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 07:18:51,304 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Ended with exit code 0 [2025-03-09 07:18:51,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:18:51,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:18:51,306 INFO L229 MonitoredProcess]: Starting monitored process 64 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:18:51,307 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Waiting until timeout for monitored process [2025-03-09 07:18:51,307 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-09 07:18:51,307 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 07:18:51,353 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-09 07:18:51,357 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Ended with exit code 0 [2025-03-09 07:18:51,357 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 07:18:51,357 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 07:18:51,357 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 07:18:51,357 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 07:18:51,357 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-09 07:18:51,357 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:18:51,357 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 07:18:51,357 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 07:18:51,357 INFO L132 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration10_Loop [2025-03-09 07:18:51,357 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 07:18:51,357 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 07:18:51,358 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:18:51,366 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:18:51,368 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:18:51,369 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:18:51,370 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:18:51,394 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 07:18:51,394 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-09 07:18:51,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:18:51,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:18:51,396 INFO L229 MonitoredProcess]: Starting monitored process 65 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:18:51,397 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Waiting until timeout for monitored process [2025-03-09 07:18:51,398 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:18:51,408 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:18:51,408 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:18:51,408 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:18:51,408 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:18:51,408 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:18:51,409 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:18:51,409 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:18:51,411 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-09 07:18:51,414 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-03-09 07:18:51,414 INFO L444 ModelExtractionUtils]: 2 out of 6 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-03-09 07:18:51,414 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:18:51,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:18:51,416 INFO L229 MonitoredProcess]: Starting monitored process 66 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:18:51,417 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Waiting until timeout for monitored process [2025-03-09 07:18:51,418 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-09 07:18:51,418 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-09 07:18:51,418 INFO L474 LassoAnalysis]: Proved termination. [2025-03-09 07:18:51,418 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~r~0#1, ULTIMATE.start_main_~j~0#1) = 2*ULTIMATE.start_main_~r~0#1 - 3*ULTIMATE.start_main_~j~0#1 Supporting invariants [] [2025-03-09 07:18:51,423 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Forceful destruction successful, exit code 0 [2025-03-09 07:18:51,424 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-09 07:18:51,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:18:51,442 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-09 07:18:51,449 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-09 07:18:51,449 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:18:51,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:18:51,449 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-09 07:18:51,449 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 07:18:51,483 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-09 07:18:51,488 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-09 07:18:51,488 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:18:51,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:18:51,489 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-09 07:18:51,490 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 07:18:51,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 07:18:51,629 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2025-03-09 07:18:51,629 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 418 states and 467 transitions. cyclomatic complexity: 54 Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 07:18:51,630 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Forceful destruction successful, exit code 0 [2025-03-09 07:18:51,933 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 418 states and 467 transitions. cyclomatic complexity: 54. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 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 1359 states and 1478 transitions. Complement of second has 23 states. [2025-03-09 07:18:51,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 1 stem states 10 non-accepting loop states 1 accepting loop states [2025-03-09 07:18:51,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 07:18:51,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 164 transitions. [2025-03-09 07:18:51,934 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 164 transitions. Stem has 30 letters. Loop has 25 letters. [2025-03-09 07:18:51,935 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 07:18:51,935 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 164 transitions. Stem has 55 letters. Loop has 25 letters. [2025-03-09 07:18:51,935 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 07:18:51,935 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 164 transitions. Stem has 30 letters. Loop has 50 letters. [2025-03-09 07:18:51,935 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 07:18:51,935 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1359 states and 1478 transitions. [2025-03-09 07:18:51,940 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 50 [2025-03-09 07:18:51,943 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1359 states to 1171 states and 1286 transitions. [2025-03-09 07:18:51,943 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 101 [2025-03-09 07:18:51,943 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 102 [2025-03-09 07:18:51,943 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1171 states and 1286 transitions. [2025-03-09 07:18:51,943 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 07:18:51,943 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1171 states and 1286 transitions. [2025-03-09 07:18:51,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1171 states and 1286 transitions. [2025-03-09 07:18:51,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1171 to 862. [2025-03-09 07:18:51,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 862 states, 862 states have (on average 1.1078886310904872) internal successors, (955), 861 states have internal predecessors, (955), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 07:18:51,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 862 states to 862 states and 955 transitions. [2025-03-09 07:18:51,954 INFO L240 hiAutomatonCegarLoop]: Abstraction has 862 states and 955 transitions. [2025-03-09 07:18:51,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 07:18:51,955 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-09 07:18:51,955 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2025-03-09 07:18:51,955 INFO L87 Difference]: Start difference. First operand 862 states and 955 transitions. Second operand has 14 states, 14 states have (on average 7.0) internal successors, (98), 14 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 07:18:52,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 07:18:52,736 INFO L93 Difference]: Finished difference Result 4166 states and 4470 transitions. [2025-03-09 07:18:52,736 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4166 states and 4470 transitions. [2025-03-09 07:18:52,750 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 114 [2025-03-09 07:18:52,758 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4166 states to 2898 states and 3126 transitions. [2025-03-09 07:18:52,758 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 276 [2025-03-09 07:18:52,758 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 276 [2025-03-09 07:18:52,758 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2898 states and 3126 transitions. [2025-03-09 07:18:52,758 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 07:18:52,758 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2898 states and 3126 transitions. [2025-03-09 07:18:52,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2898 states and 3126 transitions. [2025-03-09 07:18:52,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2898 to 1303. [2025-03-09 07:18:52,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1303 states, 1303 states have (on average 1.1028396009209516) internal successors, (1437), 1302 states have internal predecessors, (1437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 07:18:52,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1303 states to 1303 states and 1437 transitions. [2025-03-09 07:18:52,776 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1303 states and 1437 transitions. [2025-03-09 07:18:52,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2025-03-09 07:18:52,777 INFO L432 stractBuchiCegarLoop]: Abstraction has 1303 states and 1437 transitions. [2025-03-09 07:18:52,777 INFO L338 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2025-03-09 07:18:52,777 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1303 states and 1437 transitions. [2025-03-09 07:18:52,780 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 50 [2025-03-09 07:18:52,780 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 07:18:52,780 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 07:18:52,780 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 07:18:52,781 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 07:18:52,781 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;main_#in~argc#1, main_#in~argv#1.base, main_#in~argv#1.offset := #in~argc#1, #in~argv#1.base, #in~argv#1.offset;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post2#1, main_#t~post3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post6#1, main_#t~post7#1, main_~argc#1, main_~n~0#1, main_~l~0#1, main_~r~0#1, main_~i~0#1, main_~j~0#1;main_~argc#1 := main_#in~argc#1;havoc main_~n~0#1;havoc main_~l~0#1;havoc main_~r~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet1#1;main_~n~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;" "assume !!(1 <= main_~n~0#1 && main_~n~0#1 <= 1000000);main_~l~0#1 := 1 + (if main_~n~0#1 < 0 && 0 != main_~n~0#1 % 2 then 1 + main_~n~0#1 / 2 else main_~n~0#1 / 2);main_~r~0#1 := main_~n~0#1;" "assume main_~l~0#1 > 1;main_#t~post2#1 := main_~l~0#1;main_~l~0#1 := main_#t~post2#1 - 1;havoc main_#t~post2#1;" "assume main_~r~0#1 > 1;main_~i~0#1 := main_~l~0#1;main_~j~0#1 := 2 * main_~l~0#1;" "assume main_~j~0#1 <= main_~r~0#1;" "assume main_~j~0#1 < main_~r~0#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 1 <= main_~j~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 1 <= 1 + main_~j~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 1 + main_~j~0#1 <= main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_#t~nondet4#1;" "assume !(0 != main_#t~nondet4#1);havoc main_#t~nondet4#1;" "assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 1 <= main_~j~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_#t~nondet5#1;" "assume 0 != main_#t~nondet5#1;havoc main_#t~nondet5#1;" "assume main_~l~0#1 > 1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 1 <= main_~l~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~l~0#1 <= main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post6#1 := main_~l~0#1;main_~l~0#1 := main_#t~post6#1 - 1;havoc main_#t~post6#1;" "assume main_~r~0#1 > 1;main_~i~0#1 := main_~l~0#1;main_~j~0#1 := 2 * main_~l~0#1;" "assume main_~j~0#1 <= main_~r~0#1;" "assume main_~j~0#1 < main_~r~0#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 1 <= main_~j~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 1 <= 1 + main_~j~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 1 + main_~j~0#1 <= main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_#t~nondet4#1;" "assume !(0 != main_#t~nondet4#1);havoc main_#t~nondet4#1;" [2025-03-09 07:18:52,781 INFO L754 eck$LassoCheckResult]: Loop: "assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 1 <= main_~j~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_#t~nondet5#1;" "assume !(0 != main_#t~nondet5#1);havoc main_#t~nondet5#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 1 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 1 <= main_~j~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_~i~0#1 := main_~j~0#1;main_~j~0#1 := 2 * main_~j~0#1;" "assume main_~j~0#1 <= main_~r~0#1;" "assume main_~j~0#1 < main_~r~0#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 1 <= main_~j~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 1 <= 1 + main_~j~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 1 + main_~j~0#1 <= main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_#t~nondet4#1;" "assume 0 != main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1;" [2025-03-09 07:18:52,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:18:52,782 INFO L85 PathProgramCache]: Analyzing trace with hash -417376656, now seen corresponding path program 1 times [2025-03-09 07:18:52,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:18:52,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683317562] [2025-03-09 07:18:52,782 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:18:52,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:18:52,786 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-09 07:18:52,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-09 07:18:52,790 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:18:52,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:18:52,790 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:18:52,792 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-09 07:18:52,795 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-09 07:18:52,795 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:18:52,796 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:18:52,799 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:18:52,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:18:52,799 INFO L85 PathProgramCache]: Analyzing trace with hash 1735025910, now seen corresponding path program 4 times [2025-03-09 07:18:52,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:18:52,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167614315] [2025-03-09 07:18:52,800 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 07:18:52,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:18:52,803 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-03-09 07:18:52,807 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-03-09 07:18:52,807 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-09 07:18:52,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:18:52,807 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:18:52,808 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-09 07:18:52,812 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-09 07:18:52,812 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:18:52,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:18:52,813 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:18:52,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:18:52,813 INFO L85 PathProgramCache]: Analyzing trace with hash 1079171431, now seen corresponding path program 1 times [2025-03-09 07:18:52,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:18:52,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920541131] [2025-03-09 07:18:52,814 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:18:52,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:18:52,818 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-09 07:18:52,827 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-09 07:18:52,827 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:18:52,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:18:52,827 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:18:52,828 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-09 07:18:52,833 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-09 07:18:52,833 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:18:52,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:18:52,836 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:18:53,000 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 07:18:53,000 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 07:18:53,000 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 07:18:53,000 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 07:18:53,000 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-09 07:18:53,000 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:18:53,000 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 07:18:53,000 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 07:18:53,000 INFO L132 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration11_Loop [2025-03-09 07:18:53,000 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 07:18:53,000 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 07:18:53,001 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:18:53,003 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:18:53,004 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:18:53,006 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:18:53,015 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:18:53,045 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 07:18:53,045 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-09 07:18:53,045 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:18:53,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:18:53,047 INFO L229 MonitoredProcess]: Starting monitored process 67 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:18:53,049 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Waiting until timeout for monitored process [2025-03-09 07:18:53,050 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 07:18:53,050 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 07:18:53,060 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-09 07:18:53,060 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start___VERIFIER_assert_#in~cond#1=0} Honda state: {ULTIMATE.start___VERIFIER_assert_#in~cond#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-09 07:18:53,066 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Forceful destruction successful, exit code 0 [2025-03-09 07:18:53,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:18:53,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:18:53,067 INFO L229 MonitoredProcess]: Starting monitored process 68 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:18:53,068 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Waiting until timeout for monitored process [2025-03-09 07:18:53,069 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 07:18:53,069 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 07:18:53,079 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-09 07:18:53,079 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet4#1=0} Honda state: {ULTIMATE.start_main_#t~nondet4#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-09 07:18:53,084 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Ended with exit code 0 [2025-03-09 07:18:53,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:18:53,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:18:53,086 INFO L229 MonitoredProcess]: Starting monitored process 69 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:18:53,086 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Waiting until timeout for monitored process [2025-03-09 07:18:53,087 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 07:18:53,087 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 07:18:53,097 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-09 07:18:53,097 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet5#1=0} Honda state: {ULTIMATE.start_main_#t~nondet5#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-09 07:18:53,103 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Ended with exit code 0 [2025-03-09 07:18:53,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:18:53,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:18:53,104 INFO L229 MonitoredProcess]: Starting monitored process 70 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:18:53,105 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Waiting until timeout for monitored process [2025-03-09 07:18:53,106 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 07:18:53,106 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 07:18:53,128 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Ended with exit code 0 [2025-03-09 07:18:53,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:18:53,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:18:53,130 INFO L229 MonitoredProcess]: Starting monitored process 71 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:18:53,131 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Waiting until timeout for monitored process [2025-03-09 07:18:53,132 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-09 07:18:53,132 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 07:18:53,178 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-09 07:18:53,182 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Ended with exit code 0 [2025-03-09 07:18:53,182 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 07:18:53,182 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 07:18:53,182 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 07:18:53,182 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 07:18:53,182 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-09 07:18:53,182 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:18:53,182 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 07:18:53,182 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 07:18:53,182 INFO L132 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration11_Loop [2025-03-09 07:18:53,182 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 07:18:53,182 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 07:18:53,182 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:18:53,185 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:18:53,186 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:18:53,187 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:18:53,188 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:18:53,221 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 07:18:53,222 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-09 07:18:53,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:18:53,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:18:53,223 INFO L229 MonitoredProcess]: Starting monitored process 72 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:18:53,224 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Waiting until timeout for monitored process [2025-03-09 07:18:53,226 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:18:53,235 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:18:53,235 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:18:53,235 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:18:53,235 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:18:53,235 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:18:53,236 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:18:53,236 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:18:53,237 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:18:53,242 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Ended with exit code 0 [2025-03-09 07:18:53,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:18:53,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:18:53,244 INFO L229 MonitoredProcess]: Starting monitored process 73 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:18:53,245 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Waiting until timeout for monitored process [2025-03-09 07:18:53,246 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:18:53,256 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:18:53,256 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:18:53,256 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:18:53,256 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:18:53,256 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:18:53,256 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:18:53,256 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:18:53,257 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:18:53,263 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Ended with exit code 0 [2025-03-09 07:18:53,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:18:53,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:18:53,264 INFO L229 MonitoredProcess]: Starting monitored process 74 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:18:53,265 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Waiting until timeout for monitored process [2025-03-09 07:18:53,266 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:18:53,275 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:18:53,275 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:18:53,275 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:18:53,275 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:18:53,275 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:18:53,276 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:18:53,276 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:18:53,277 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:18:53,282 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Ended with exit code 0 [2025-03-09 07:18:53,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:18:53,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:18:53,284 INFO L229 MonitoredProcess]: Starting monitored process 75 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:18:53,284 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Waiting until timeout for monitored process [2025-03-09 07:18:53,285 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:18:53,294 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:18:53,294 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:18:53,294 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:18:53,294 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:18:53,294 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:18:53,295 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:18:53,295 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:18:53,296 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:18:53,301 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Ended with exit code 0 [2025-03-09 07:18:53,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:18:53,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:18:53,303 INFO L229 MonitoredProcess]: Starting monitored process 76 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:18:53,303 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Waiting until timeout for monitored process [2025-03-09 07:18:53,304 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:18:53,313 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:18:53,313 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:18:53,313 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:18:53,313 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:18:53,313 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:18:53,315 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:18:53,315 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:18:53,317 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-09 07:18:53,319 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-03-09 07:18:53,319 INFO L444 ModelExtractionUtils]: 2 out of 6 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-03-09 07:18:53,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:18:53,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:18:53,321 INFO L229 MonitoredProcess]: Starting monitored process 77 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:18:53,322 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Waiting until timeout for monitored process [2025-03-09 07:18:53,322 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-09 07:18:53,322 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-09 07:18:53,322 INFO L474 LassoAnalysis]: Proved termination. [2025-03-09 07:18:53,322 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0#1, ULTIMATE.start_main_~r~0#1) = -3*ULTIMATE.start_main_~j~0#1 + 2*ULTIMATE.start_main_~r~0#1 Supporting invariants [] [2025-03-09 07:18:53,327 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Forceful destruction successful, exit code 0 [2025-03-09 07:18:53,328 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-09 07:18:53,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:18:53,343 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-09 07:18:53,352 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-09 07:18:53,353 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:18:53,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:18:53,353 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-09 07:18:53,353 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 07:18:53,380 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-09 07:18:53,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-09 07:18:53,389 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:18:53,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:18:53,389 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-09 07:18:53,390 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 07:18:53,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 07:18:53,489 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2025-03-09 07:18:53,489 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1303 states and 1437 transitions. cyclomatic complexity: 151 Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 07:18:53,714 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1303 states and 1437 transitions. cyclomatic complexity: 151. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 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 2334 states and 2516 transitions. Complement of second has 21 states. [2025-03-09 07:18:53,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 1 stem states 9 non-accepting loop states 1 accepting loop states [2025-03-09 07:18:53,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 07:18:53,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 164 transitions. [2025-03-09 07:18:53,715 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 164 transitions. Stem has 39 letters. Loop has 25 letters. [2025-03-09 07:18:53,715 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 07:18:53,715 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-09 07:18:53,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:18:53,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-09 07:18:53,743 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-09 07:18:53,743 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:18:53,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:18:53,743 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-09 07:18:53,744 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 07:18:53,771 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-09 07:18:53,775 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-09 07:18:53,776 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:18:53,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:18:53,776 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-09 07:18:53,776 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 07:18:53,793 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Forceful destruction successful, exit code 0 [2025-03-09 07:18:53,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 07:18:53,883 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 5 loop predicates [2025-03-09 07:18:53,884 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1303 states and 1437 transitions. cyclomatic complexity: 151 Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 07:18:54,094 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1303 states and 1437 transitions. cyclomatic complexity: 151. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 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 2333 states and 2516 transitions. Complement of second has 21 states. [2025-03-09 07:18:54,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 1 stem states 9 non-accepting loop states 1 accepting loop states [2025-03-09 07:18:54,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 07:18:54,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 164 transitions. [2025-03-09 07:18:54,095 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 164 transitions. Stem has 39 letters. Loop has 25 letters. [2025-03-09 07:18:54,096 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 07:18:54,096 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-09 07:18:54,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:18:54,112 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-09 07:18:54,122 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-09 07:18:54,122 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:18:54,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:18:54,122 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-09 07:18:54,122 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 07:18:54,148 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-09 07:18:54,153 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-09 07:18:54,153 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:18:54,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:18:54,153 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-09 07:18:54,154 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 07:18:54,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 07:18:54,257 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 6 loop predicates [2025-03-09 07:18:54,257 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1303 states and 1437 transitions. cyclomatic complexity: 151 Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 07:18:54,463 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1303 states and 1437 transitions. cyclomatic complexity: 151. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 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 2892 states and 3102 transitions. Complement of second has 35 states. [2025-03-09 07:18:54,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 1 stem states 10 non-accepting loop states 1 accepting loop states [2025-03-09 07:18:54,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 07:18:54,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 165 transitions. [2025-03-09 07:18:54,464 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 165 transitions. Stem has 39 letters. Loop has 25 letters. [2025-03-09 07:18:54,464 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 07:18:54,464 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 165 transitions. Stem has 64 letters. Loop has 25 letters. [2025-03-09 07:18:54,465 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 07:18:54,465 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 165 transitions. Stem has 39 letters. Loop has 50 letters. [2025-03-09 07:18:54,465 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 07:18:54,465 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2892 states and 3102 transitions. [2025-03-09 07:18:54,473 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 50 [2025-03-09 07:18:54,478 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2892 states to 1957 states and 2133 transitions. [2025-03-09 07:18:54,478 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 119 [2025-03-09 07:18:54,478 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 123 [2025-03-09 07:18:54,478 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1957 states and 2133 transitions. [2025-03-09 07:18:54,478 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 07:18:54,478 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1957 states and 2133 transitions. [2025-03-09 07:18:54,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1957 states and 2133 transitions. [2025-03-09 07:18:54,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1957 to 741. [2025-03-09 07:18:54,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 741 states, 741 states have (on average 1.0998650472334683) internal successors, (815), 740 states have internal predecessors, (815), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 07:18:54,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 741 states to 741 states and 815 transitions. [2025-03-09 07:18:54,502 INFO L240 hiAutomatonCegarLoop]: Abstraction has 741 states and 815 transitions. [2025-03-09 07:18:54,502 INFO L432 stractBuchiCegarLoop]: Abstraction has 741 states and 815 transitions. [2025-03-09 07:18:54,502 INFO L338 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2025-03-09 07:18:54,502 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 741 states and 815 transitions. [2025-03-09 07:18:54,503 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2025-03-09 07:18:54,503 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 07:18:54,503 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 07:18:54,504 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 07:18:54,504 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 07:18:54,505 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;main_#in~argc#1, main_#in~argv#1.base, main_#in~argv#1.offset := #in~argc#1, #in~argv#1.base, #in~argv#1.offset;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post2#1, main_#t~post3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post6#1, main_#t~post7#1, main_~argc#1, main_~n~0#1, main_~l~0#1, main_~r~0#1, main_~i~0#1, main_~j~0#1;main_~argc#1 := main_#in~argc#1;havoc main_~n~0#1;havoc main_~l~0#1;havoc main_~r~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet1#1;main_~n~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;" "assume !!(1 <= main_~n~0#1 && main_~n~0#1 <= 1000000);main_~l~0#1 := 1 + (if main_~n~0#1 < 0 && 0 != main_~n~0#1 % 2 then 1 + main_~n~0#1 / 2 else main_~n~0#1 / 2);main_~r~0#1 := main_~n~0#1;" "assume main_~l~0#1 > 1;main_#t~post2#1 := main_~l~0#1;main_~l~0#1 := main_#t~post2#1 - 1;havoc main_#t~post2#1;" "assume main_~r~0#1 > 1;main_~i~0#1 := main_~l~0#1;main_~j~0#1 := 2 * main_~l~0#1;" "assume main_~j~0#1 <= main_~r~0#1;" "assume main_~j~0#1 < main_~r~0#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 1 <= main_~j~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 1 <= 1 + main_~j~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 1 + main_~j~0#1 <= main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_#t~nondet4#1;" "assume 0 != main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1;" "assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 1 <= main_~j~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_#t~nondet5#1;" "assume 0 != main_#t~nondet5#1;havoc main_#t~nondet5#1;" "assume main_~l~0#1 > 1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 1 <= main_~l~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~l~0#1 <= main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post6#1 := main_~l~0#1;main_~l~0#1 := main_#t~post6#1 - 1;havoc main_#t~post6#1;" "assume main_~r~0#1 > 1;main_~i~0#1 := main_~l~0#1;main_~j~0#1 := 2 * main_~l~0#1;" "assume main_~j~0#1 <= main_~r~0#1;" "assume main_~j~0#1 < main_~r~0#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 1 <= main_~j~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 1 <= 1 + main_~j~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 1 + main_~j~0#1 <= main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_#t~nondet4#1;" "assume !(0 != main_#t~nondet4#1);havoc main_#t~nondet4#1;" "assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 1 <= main_~j~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" [2025-03-09 07:18:54,505 INFO L754 eck$LassoCheckResult]: Loop: "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_#t~nondet5#1;" "assume !(0 != main_#t~nondet5#1);havoc main_#t~nondet5#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 1 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 1 <= main_~j~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_~i~0#1 := main_~j~0#1;main_~j~0#1 := 2 * main_~j~0#1;" "assume main_~j~0#1 <= main_~r~0#1;" "assume main_~j~0#1 < main_~r~0#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 1 <= main_~j~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 1 <= 1 + main_~j~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 1 + main_~j~0#1 <= main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_#t~nondet4#1;" "assume !(0 != main_#t~nondet4#1);havoc main_#t~nondet4#1;" "assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 1 <= main_~j~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" [2025-03-09 07:18:54,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:18:54,505 INFO L85 PathProgramCache]: Analyzing trace with hash 2023434984, now seen corresponding path program 1 times [2025-03-09 07:18:54,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:18:54,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414498903] [2025-03-09 07:18:54,505 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:18:54,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:18:54,509 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-09 07:18:54,513 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-09 07:18:54,513 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:18:54,513 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:18:54,513 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:18:54,515 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-09 07:18:54,522 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-09 07:18:54,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:18:54,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:18:54,524 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:18:54,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:18:54,526 INFO L85 PathProgramCache]: Analyzing trace with hash -1445161255, now seen corresponding path program 1 times [2025-03-09 07:18:54,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:18:54,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120472552] [2025-03-09 07:18:54,526 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:18:54,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:18:54,528 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-09 07:18:54,531 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-09 07:18:54,533 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:18:54,533 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:18:54,534 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:18:54,534 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-09 07:18:54,537 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-09 07:18:54,537 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:18:54,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:18:54,538 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:18:54,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:18:54,541 INFO L85 PathProgramCache]: Analyzing trace with hash -664883758, now seen corresponding path program 2 times [2025-03-09 07:18:54,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:18:54,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211523493] [2025-03-09 07:18:54,541 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 07:18:54,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:18:54,546 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 65 statements into 2 equivalence classes. [2025-03-09 07:18:54,554 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 65 of 65 statements. [2025-03-09 07:18:54,554 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 07:18:54,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:18:54,554 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:18:54,556 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-09 07:18:54,560 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-09 07:18:54,560 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:18:54,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:18:54,563 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:18:54,715 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 07:18:54,715 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 07:18:54,715 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 07:18:54,715 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 07:18:54,715 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-09 07:18:54,715 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:18:54,715 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 07:18:54,715 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 07:18:54,715 INFO L132 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration12_Loop [2025-03-09 07:18:54,715 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 07:18:54,716 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 07:18:54,716 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:18:54,717 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:18:54,719 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:18:54,720 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:18:54,729 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:18:54,765 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 07:18:54,765 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-09 07:18:54,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:18:54,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:18:54,767 INFO L229 MonitoredProcess]: Starting monitored process 78 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:18:54,768 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Waiting until timeout for monitored process [2025-03-09 07:18:54,769 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 07:18:54,769 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 07:18:54,780 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-09 07:18:54,780 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet4#1=0} Honda state: {ULTIMATE.start_main_#t~nondet4#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-09 07:18:54,784 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Forceful destruction successful, exit code 0 [2025-03-09 07:18:54,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:18:54,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:18:54,786 INFO L229 MonitoredProcess]: Starting monitored process 79 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:18:54,787 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Waiting until timeout for monitored process [2025-03-09 07:18:54,788 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 07:18:54,788 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 07:18:54,798 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-09 07:18:54,798 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start___VERIFIER_assert_#in~cond#1=0} Honda state: {ULTIMATE.start___VERIFIER_assert_#in~cond#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-09 07:18:54,803 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Ended with exit code 0 [2025-03-09 07:18:54,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:18:54,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:18:54,805 INFO L229 MonitoredProcess]: Starting monitored process 80 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:18:54,805 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Waiting until timeout for monitored process [2025-03-09 07:18:54,806 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 07:18:54,806 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 07:18:54,816 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-09 07:18:54,816 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet5#1=0} Honda state: {ULTIMATE.start_main_#t~nondet5#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-09 07:18:54,822 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Ended with exit code 0 [2025-03-09 07:18:54,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:18:54,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:18:54,823 INFO L229 MonitoredProcess]: Starting monitored process 81 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:18:54,824 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Waiting until timeout for monitored process [2025-03-09 07:18:54,825 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 07:18:54,825 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 07:18:54,849 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Ended with exit code 0 [2025-03-09 07:18:54,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:18:54,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:18:54,851 INFO L229 MonitoredProcess]: Starting monitored process 82 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:18:54,852 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Waiting until timeout for monitored process [2025-03-09 07:18:54,852 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-09 07:18:54,852 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 07:18:55,012 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-09 07:18:55,019 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Forceful destruction successful, exit code 0 [2025-03-09 07:18:55,019 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 07:18:55,019 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 07:18:55,019 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 07:18:55,019 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 07:18:55,019 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-09 07:18:55,019 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:18:55,019 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 07:18:55,019 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 07:18:55,019 INFO L132 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration12_Loop [2025-03-09 07:18:55,019 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 07:18:55,019 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 07:18:55,019 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:18:55,022 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:18:55,023 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:18:55,024 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:18:55,031 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:18:55,072 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 07:18:55,072 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-09 07:18:55,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:18:55,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:18:55,075 INFO L229 MonitoredProcess]: Starting monitored process 83 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:18:55,076 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Waiting until timeout for monitored process [2025-03-09 07:18:55,076 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:18:55,086 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:18:55,086 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:18:55,086 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:18:55,086 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:18:55,086 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:18:55,086 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:18:55,086 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:18:55,087 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:18:55,092 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Forceful destruction successful, exit code 0 [2025-03-09 07:18:55,092 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:18:55,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:18:55,094 INFO L229 MonitoredProcess]: Starting monitored process 84 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:18:55,095 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Waiting until timeout for monitored process [2025-03-09 07:18:55,096 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:18:55,105 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:18:55,105 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:18:55,105 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:18:55,105 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:18:55,105 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:18:55,106 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:18:55,106 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:18:55,107 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:18:55,112 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Ended with exit code 0 [2025-03-09 07:18:55,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:18:55,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:18:55,114 INFO L229 MonitoredProcess]: Starting monitored process 85 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:18:55,114 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Waiting until timeout for monitored process [2025-03-09 07:18:55,115 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:18:55,125 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:18:55,125 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:18:55,125 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:18:55,125 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:18:55,125 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:18:55,126 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:18:55,126 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:18:55,126 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:18:55,132 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Ended with exit code 0 [2025-03-09 07:18:55,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:18:55,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:18:55,135 INFO L229 MonitoredProcess]: Starting monitored process 86 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:18:55,135 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (86)] Waiting until timeout for monitored process [2025-03-09 07:18:55,136 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:18:55,145 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:18:55,146 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:18:55,146 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:18:55,146 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:18:55,146 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:18:55,147 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:18:55,147 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:18:55,149 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-09 07:18:55,151 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-09 07:18:55,151 INFO L444 ModelExtractionUtils]: 2 out of 6 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-03-09 07:18:55,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:18:55,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:18:55,153 INFO L229 MonitoredProcess]: Starting monitored process 87 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:18:55,155 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (87)] Waiting until timeout for monitored process [2025-03-09 07:18:55,155 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-09 07:18:55,155 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-09 07:18:55,155 INFO L474 LassoAnalysis]: Proved termination. [2025-03-09 07:18:55,155 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0#1, ULTIMATE.start_main_~n~0#1) = -2*ULTIMATE.start_main_~j~0#1 + 1*ULTIMATE.start_main_~n~0#1 Supporting invariants [] [2025-03-09 07:18:55,161 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (86)] Ended with exit code 0 [2025-03-09 07:18:55,161 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-09 07:18:55,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:18:55,175 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-09 07:18:55,184 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-09 07:18:55,184 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:18:55,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:18:55,184 INFO L256 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-09 07:18:55,185 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 07:18:55,211 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-09 07:18:55,216 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-09 07:18:55,216 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:18:55,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:18:55,216 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-09 07:18:55,216 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 07:18:55,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 07:18:55,329 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2025-03-09 07:18:55,329 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 741 states and 815 transitions. cyclomatic complexity: 80 Second operand has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 07:18:55,386 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (87)] Ended with exit code 0 [2025-03-09 07:18:55,426 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 741 states and 815 transitions. cyclomatic complexity: 80. Second operand has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 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 1072 states and 1161 transitions. Complement of second has 13 states. [2025-03-09 07:18:55,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2025-03-09 07:18:55,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 07:18:55,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 60 transitions. [2025-03-09 07:18:55,427 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 60 transitions. Stem has 40 letters. Loop has 25 letters. [2025-03-09 07:18:55,427 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 07:18:55,427 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-09 07:18:55,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:18:55,439 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-09 07:18:55,447 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-09 07:18:55,447 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:18:55,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:18:55,448 INFO L256 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-09 07:18:55,448 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 07:18:55,485 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-09 07:18:55,490 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-09 07:18:55,490 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:18:55,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:18:55,490 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-09 07:18:55,491 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 07:18:55,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 07:18:55,604 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 6 loop predicates [2025-03-09 07:18:55,604 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 741 states and 815 transitions. cyclomatic complexity: 80 Second operand has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 07:18:55,704 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 741 states and 815 transitions. cyclomatic complexity: 80. Second operand has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 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 1072 states and 1161 transitions. Complement of second has 13 states. [2025-03-09 07:18:55,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2025-03-09 07:18:55,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 07:18:55,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 60 transitions. [2025-03-09 07:18:55,705 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 60 transitions. Stem has 40 letters. Loop has 25 letters. [2025-03-09 07:18:55,705 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 07:18:55,705 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-09 07:18:55,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:18:55,724 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-09 07:18:55,734 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-09 07:18:55,734 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:18:55,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:18:55,734 INFO L256 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-09 07:18:55,735 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 07:18:55,769 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-09 07:18:55,775 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-09 07:18:55,775 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:18:55,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:18:55,776 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-09 07:18:55,776 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 07:18:55,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 07:18:55,902 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 6 loop predicates [2025-03-09 07:18:55,902 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 741 states and 815 transitions. cyclomatic complexity: 80 Second operand has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 07:18:56,055 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 741 states and 815 transitions. cyclomatic complexity: 80. Second operand has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 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 2074 states and 2221 transitions. Complement of second has 39 states. [2025-03-09 07:18:56,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 1 stem states 7 non-accepting loop states 1 accepting loop states [2025-03-09 07:18:56,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 07:18:56,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 129 transitions. [2025-03-09 07:18:56,056 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 129 transitions. Stem has 40 letters. Loop has 25 letters. [2025-03-09 07:18:56,056 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 07:18:56,056 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 129 transitions. Stem has 65 letters. Loop has 25 letters. [2025-03-09 07:18:56,057 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 07:18:56,057 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 129 transitions. Stem has 40 letters. Loop has 50 letters. [2025-03-09 07:18:56,057 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 07:18:56,057 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2074 states and 2221 transitions. [2025-03-09 07:18:56,062 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-03-09 07:18:56,062 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2074 states to 0 states and 0 transitions. [2025-03-09 07:18:56,062 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-03-09 07:18:56,063 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-03-09 07:18:56,063 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-03-09 07:18:56,063 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-09 07:18:56,063 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-09 07:18:56,063 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-09 07:18:56,063 INFO L432 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-09 07:18:56,063 INFO L338 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2025-03-09 07:18:56,063 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-03-09 07:18:56,063 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-03-09 07:18:56,063 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-03-09 07:18:56,068 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 09.03 07:18:56 BoogieIcfgContainer [2025-03-09 07:18:56,069 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-03-09 07:18:56,069 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-09 07:18:56,069 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-09 07:18:56,069 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-09 07:18:56,070 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 07:18:43" (3/4) ... [2025-03-09 07:18:56,071 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-09 07:18:56,071 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-09 07:18:56,072 INFO L158 Benchmark]: Toolchain (without parser) took 13311.62ms. Allocated memory was 167.8MB in the beginning and 243.3MB in the end (delta: 75.5MB). Free memory was 134.5MB in the beginning and 88.0MB in the end (delta: 46.5MB). Peak memory consumption was 118.6MB. Max. memory is 16.1GB. [2025-03-09 07:18:56,072 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 124.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 07:18:56,072 INFO L158 Benchmark]: CACSL2BoogieTranslator took 145.30ms. Allocated memory is still 167.8MB. Free memory was 134.0MB in the beginning and 122.9MB in the end (delta: 11.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 07:18:56,072 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.69ms. Allocated memory is still 167.8MB. Free memory was 122.9MB in the beginning and 121.6MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 07:18:56,072 INFO L158 Benchmark]: Boogie Preprocessor took 20.59ms. Allocated memory is still 167.8MB. Free memory was 121.6MB in the beginning and 120.1MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 07:18:56,072 INFO L158 Benchmark]: IcfgBuilder took 289.04ms. Allocated memory is still 167.8MB. Free memory was 120.1MB in the beginning and 103.8MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-09 07:18:56,072 INFO L158 Benchmark]: BuchiAutomizer took 12826.01ms. Allocated memory was 167.8MB in the beginning and 243.3MB in the end (delta: 75.5MB). Free memory was 103.3MB in the beginning and 88.1MB in the end (delta: 15.3MB). Peak memory consumption was 85.1MB. Max. memory is 16.1GB. [2025-03-09 07:18:56,073 INFO L158 Benchmark]: Witness Printer took 2.31ms. Allocated memory is still 243.3MB. Free memory was 88.1MB in the beginning and 88.0MB in the end (delta: 69.3kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 07:18:56,074 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 124.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 145.30ms. Allocated memory is still 167.8MB. Free memory was 134.0MB in the beginning and 122.9MB in the end (delta: 11.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 23.69ms. Allocated memory is still 167.8MB. Free memory was 122.9MB in the beginning and 121.6MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 20.59ms. Allocated memory is still 167.8MB. Free memory was 121.6MB in the beginning and 120.1MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 289.04ms. Allocated memory is still 167.8MB. Free memory was 120.1MB in the beginning and 103.8MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * BuchiAutomizer took 12826.01ms. Allocated memory was 167.8MB in the beginning and 243.3MB in the end (delta: 75.5MB). Free memory was 103.3MB in the beginning and 88.1MB in the end (delta: 15.3MB). Peak memory consumption was 85.1MB. Max. memory is 16.1GB. * Witness Printer took 2.31ms. Allocated memory is still 243.3MB. Free memory was 88.1MB in the beginning and 88.0MB in the end (delta: 69.3kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 18 terminating modules (8 trivial, 7 deterministic, 3 nondeterministic). One deterministic module has affine ranking function l and consists of 5 locations. One deterministic module has affine ranking function l and consists of 4 locations. One deterministic module has affine ranking function r and consists of 3 locations. One deterministic module has affine ranking function j and consists of 9 locations. One deterministic module has affine ranking function r and consists of 4 locations. One deterministic module has affine ranking function (((long long) 5 * r) + ((long long) -8 * j)) and consists of 9 locations. One deterministic module has affine ranking function (((long long) -3 * j) + ((long long) 2 * r)) and consists of 12 locations. One nondeterministic module has affine ranking function (((long long) -1 * j) + r) and consists of 8 locations. One nondeterministic module has affine ranking function (((long long) -3 * j) + ((long long) 2 * r)) and consists of 12 locations. One nondeterministic module has affine ranking function (((long long) -2 * j) + n) and consists of 9 locations. 8 modules have a trivial ranking function, the largest among these consists of 14 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 12.7s and 13 iterations. TraceHistogramMax:2. Analysis of lassos took 6.5s. Construction of modules took 1.6s. Büchi inclusion checks took 4.4s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 16. Automata minimization 0.1s AutomataMinimizationTime, 17 MinimizatonAttempts, 4495 StatesRemovedByMinimization, 16 NontrivialMinimizations. Non-live state removal took 0.1s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [7, 0, 2, 1, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3023 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3006 mSDsluCounter, 4081 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2546 mSDsCounter, 233 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3310 IncrementalHoareTripleChecker+Invalid, 3543 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 233 mSolverCounterUnsat, 1535 mSDtfsCounter, 3310 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT4 conc0 concLT6 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital29 mio100 ax100 hnf100 lsp98 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq147 hnf94 smp100 dnf100 smp100 tf105 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 21ms VariablesStem: 0 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 20 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 10 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 1.4s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-03-09 07:18:56,085 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (62)] Forceful destruction successful, exit code 0 [2025-03-09 07:18:56,288 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Forceful destruction successful, exit code 0 [2025-03-09 07:18:56,489 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE