./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 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/loop-invgen/heapsort.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8e7c8e5dc2a9e8f11b25d1bb9948f05f37b9553e3dc9f8bd8213088dea43cb37 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 07:34:39,587 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 07:34:39,623 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2025-01-10 07:34:39,626 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 07:34:39,626 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 07:34:39,640 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 07:34:39,641 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 07:34:39,641 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 07:34:39,641 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 07:34:39,641 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 07:34:39,641 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 07:34:39,641 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 07:34:39,641 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 07:34:39,641 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-01-10 07:34:39,641 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-01-10 07:34:39,641 INFO L153 SettingsManager]: * Use old map elimination=false [2025-01-10 07:34:39,642 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-01-10 07:34:39,642 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-01-10 07:34:39,642 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-01-10 07:34:39,642 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 07:34:39,642 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-01-10 07:34:39,642 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 07:34:39,642 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 07:34:39,642 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 07:34:39,642 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 07:34:39,642 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-01-10 07:34:39,642 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-01-10 07:34:39,642 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-01-10 07:34:39,642 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 07:34:39,642 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 07:34:39,642 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 07:34:39,642 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-01-10 07:34:39,642 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 07:34:39,642 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 07:34:39,643 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 07:34:39,643 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 07:34:39,643 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 07:34:39,643 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 07:34:39,643 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-01-10 07:34:39,643 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8e7c8e5dc2a9e8f11b25d1bb9948f05f37b9553e3dc9f8bd8213088dea43cb37 [2025-01-10 07:34:39,856 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 07:34:39,861 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 07:34:39,863 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 07:34:39,863 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 07:34:39,864 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 07:34:39,864 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-invgen/heapsort.i [2025-01-10 07:34:41,012 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/97b6a81b1/cb20ba35778542498149c9a88624c021/FLAG0f81f35ba [2025-01-10 07:34:41,262 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 07:34:41,263 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/loop-invgen/heapsort.i [2025-01-10 07:34:41,272 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/97b6a81b1/cb20ba35778542498149c9a88624c021/FLAG0f81f35ba [2025-01-10 07:34:41,579 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/97b6a81b1/cb20ba35778542498149c9a88624c021 [2025-01-10 07:34:41,580 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 07:34:41,581 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 07:34:41,584 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 07:34:41,585 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 07:34:41,587 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 07:34:41,588 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 07:34:41" (1/1) ... [2025-01-10 07:34:41,588 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7fe65bef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:34:41, skipping insertion in model container [2025-01-10 07:34:41,589 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 07:34:41" (1/1) ... [2025-01-10 07:34:41,609 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 07:34:41,803 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 07:34:41,819 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 07:34:41,836 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 07:34:41,847 INFO L204 MainTranslator]: Completed translation [2025-01-10 07:34:41,847 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:34:41 WrapperNode [2025-01-10 07:34:41,847 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 07:34:41,848 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 07:34:41,848 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 07:34:41,848 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 07:34:41,852 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:34:41" (1/1) ... [2025-01-10 07:34:41,856 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:34:41" (1/1) ... [2025-01-10 07:34:41,867 INFO L138 Inliner]: procedures = 16, calls = 21, calls flagged for inlining = 17, calls inlined = 30, statements flattened = 181 [2025-01-10 07:34:41,867 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 07:34:41,867 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 07:34:41,867 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 07:34:41,867 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 07:34:41,873 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:34:41" (1/1) ... [2025-01-10 07:34:41,874 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:34:41" (1/1) ... [2025-01-10 07:34:41,875 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:34:41" (1/1) ... [2025-01-10 07:34:41,881 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-01-10 07:34:41,882 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:34:41" (1/1) ... [2025-01-10 07:34:41,882 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:34:41" (1/1) ... [2025-01-10 07:34:41,884 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:34:41" (1/1) ... [2025-01-10 07:34:41,885 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:34:41" (1/1) ... [2025-01-10 07:34:41,887 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:34:41" (1/1) ... [2025-01-10 07:34:41,887 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:34:41" (1/1) ... [2025-01-10 07:34:41,888 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:34:41" (1/1) ... [2025-01-10 07:34:41,889 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 07:34:41,894 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 07:34:41,894 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 07:34:41,894 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 07:34:41,894 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:34:41" (1/1) ... [2025-01-10 07:34:41,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:34:41,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:34:41,923 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:34:41,926 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2025-01-10 07:34:41,949 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 07:34:41,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 07:34:41,952 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 07:34:41,953 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 07:34:42,012 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 07:34:42,017 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 07:34:42,199 INFO L? ?]: Removed 55 outVars from TransFormulas that were not future-live. [2025-01-10 07:34:42,199 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 07:34:42,209 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 07:34:42,211 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 07:34:42,212 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 07:34:42 BoogieIcfgContainer [2025-01-10 07:34:42,212 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 07:34:42,212 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-01-10 07:34:42,212 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-01-10 07:34:42,216 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-01-10 07:34:42,216 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-01-10 07:34:42,216 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.01 07:34:41" (1/3) ... [2025-01-10 07:34:42,217 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2eda3456 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.01 07:34:42, skipping insertion in model container [2025-01-10 07:34:42,217 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-01-10 07:34:42,217 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:34:41" (2/3) ... [2025-01-10 07:34:42,217 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2eda3456 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.01 07:34:42, skipping insertion in model container [2025-01-10 07:34:42,217 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-01-10 07:34:42,217 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 07:34:42" (3/3) ... [2025-01-10 07:34:42,218 INFO L363 chiAutomizerObserver]: Analyzing ICFG heapsort.i [2025-01-10 07:34:42,272 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-01-10 07:34:42,272 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-01-10 07:34:42,272 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-01-10 07:34:42,272 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-01-10 07:34:42,272 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-01-10 07:34:42,272 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-01-10 07:34:42,272 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-01-10 07:34:42,272 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-01-10 07:34:42,277 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-01-10 07:34:42,291 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 77 [2025-01-10 07:34:42,291 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:34:42,291 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:34:42,298 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-01-10 07:34:42,298 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2025-01-10 07:34:42,299 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-01-10 07:34:42,300 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-01-10 07:34:42,304 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 77 [2025-01-10 07:34:42,305 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:34:42,305 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:34:42,305 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-01-10 07:34:42,306 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2025-01-10 07:34:42,311 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-01-10 07:34:42,311 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-01-10 07:34:42,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:34:42,315 INFO L85 PathProgramCache]: Analyzing trace with hash 925672, now seen corresponding path program 1 times [2025-01-10 07:34:42,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:34:42,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448080446] [2025-01-10 07:34:42,320 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:34:42,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:34:42,362 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 07:34:42,374 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 07:34:42,374 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:34:42,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:34:42,375 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:34:42,377 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 07:34:42,381 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 07:34:42,382 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:34:42,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:34:42,391 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:34:42,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:34:42,393 INFO L85 PathProgramCache]: Analyzing trace with hash 719165117, now seen corresponding path program 1 times [2025-01-10 07:34:42,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:34:42,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493574717] [2025-01-10 07:34:42,393 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:34:42,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:34:42,397 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 07:34:42,400 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 07:34:42,400 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:34:42,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:34:42,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:34:42,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:34:42,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493574717] [2025-01-10 07:34:42,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493574717] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 07:34:42,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 07:34:42,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 07:34:42,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516052073] [2025-01-10 07:34:42,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 07:34:42,498 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-01-10 07:34:42,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:34:42,515 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 07:34:42,515 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 07:34:42,517 INFO L87 Difference]: Start difference. 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 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-01-10 07:34:42,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:34:42,633 INFO L93 Difference]: Finished difference Result 133 states and 145 transitions. [2025-01-10 07:34:42,634 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 133 states and 145 transitions. [2025-01-10 07:34:42,637 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 70 [2025-01-10 07:34:42,643 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 133 states to 74 states and 85 transitions. [2025-01-10 07:34:42,643 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 74 [2025-01-10 07:34:42,644 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 74 [2025-01-10 07:34:42,644 INFO L73 IsDeterministic]: Start isDeterministic. Operand 74 states and 85 transitions. [2025-01-10 07:34:42,644 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-01-10 07:34:42,645 INFO L218 hiAutomatonCegarLoop]: Abstraction has 74 states and 85 transitions. [2025-01-10 07:34:42,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states and 85 transitions. [2025-01-10 07:34:42,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 41. [2025-01-10 07:34:42,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 41 states have (on average 1.170731707317073) internal successors, (48), 40 states have internal predecessors, (48), 0 states have call successors, (0), 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-01-10 07:34:42,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 48 transitions. [2025-01-10 07:34:42,660 INFO L240 hiAutomatonCegarLoop]: Abstraction has 41 states and 48 transitions. [2025-01-10 07:34:42,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 07:34:42,662 INFO L432 stractBuchiCegarLoop]: Abstraction has 41 states and 48 transitions. [2025-01-10 07:34:42,662 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-01-10 07:34:42,663 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 48 transitions. [2025-01-10 07:34:42,663 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 37 [2025-01-10 07:34:42,663 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:34:42,663 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:34:42,664 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-01-10 07:34:42,664 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2025-01-10 07:34:42,664 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-01-10 07:34:42,664 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-01-10 07:34:42,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:34:42,665 INFO L85 PathProgramCache]: Analyzing trace with hash 925672, now seen corresponding path program 2 times [2025-01-10 07:34:42,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:34:42,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072856582] [2025-01-10 07:34:42,665 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 07:34:42,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:34:42,669 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 4 statements into 1 equivalence classes. [2025-01-10 07:34:42,677 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 07:34:42,677 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 07:34:42,677 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:34:42,680 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:34:42,682 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 07:34:42,685 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 07:34:42,685 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:34:42,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:34:42,690 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:34:42,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:34:42,690 INFO L85 PathProgramCache]: Analyzing trace with hash 684810137, now seen corresponding path program 1 times [2025-01-10 07:34:42,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:34:42,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579966956] [2025-01-10 07:34:42,690 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:34:42,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:34:42,697 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 07:34:42,701 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 07:34:42,702 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:34:42,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:34:42,702 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:34:42,704 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 07:34:42,709 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 07:34:42,710 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:34:42,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:34:42,713 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:34:42,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:34:42,713 INFO L85 PathProgramCache]: Analyzing trace with hash -1650336302, now seen corresponding path program 1 times [2025-01-10 07:34:42,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:34:42,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406223896] [2025-01-10 07:34:42,714 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:34:42,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:34:42,724 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 07:34:42,731 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 07:34:42,731 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:34:42,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:34:42,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:34:42,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:34:42,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406223896] [2025-01-10 07:34:42,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406223896] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 07:34:42,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 07:34:42,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 07:34:42,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183739464] [2025-01-10 07:34:42,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 07:34:42,849 INFO L204 LassoAnalysis]: Preferences: [2025-01-10 07:34:42,850 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-01-10 07:34:42,850 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-01-10 07:34:42,850 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-01-10 07:34:42,850 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-01-10 07:34:42,850 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:34:42,850 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-01-10 07:34:42,850 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-01-10 07:34:42,850 INFO L132 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration2_Loop [2025-01-10 07:34:42,850 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-01-10 07:34:42,850 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-01-10 07:34:42,858 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:34:42,870 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:34:42,872 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:34:42,874 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:34:42,876 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:34:42,915 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-01-10 07:34:42,915 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-01-10 07:34:42,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:34:42,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:34:42,921 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:34:42,929 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2025-01-10 07:34:42,929 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-01-10 07:34:42,930 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 07:34:42,949 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2025-01-10 07:34:42,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:34:42,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:34:42,951 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:34:42,952 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-01-10 07:34:42,954 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-01-10 07:34:42,954 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 07:34:43,015 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-01-10 07:34:43,019 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2025-01-10 07:34:43,019 INFO L204 LassoAnalysis]: Preferences: [2025-01-10 07:34:43,019 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-01-10 07:34:43,019 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-01-10 07:34:43,020 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-01-10 07:34:43,020 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-01-10 07:34:43,020 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:34:43,020 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-01-10 07:34:43,020 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-01-10 07:34:43,020 INFO L132 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration2_Loop [2025-01-10 07:34:43,020 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-01-10 07:34:43,020 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-01-10 07:34:43,021 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:34:43,023 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:34:43,025 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:34:43,035 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:34:43,037 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:34:43,070 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-01-10 07:34:43,073 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-01-10 07:34:43,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:34:43,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:34:43,079 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:34:43,080 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-01-10 07:34:43,081 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-01-10 07:34:43,091 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:34:43,091 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:34:43,092 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:34:43,092 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:34:43,092 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:34:43,094 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:34:43,095 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:34:43,096 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:34:43,102 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2025-01-10 07:34:43,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:34:43,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:34:43,104 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:34:43,105 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-01-10 07:34:43,106 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-01-10 07:34:43,116 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:34:43,116 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:34:43,117 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:34:43,117 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:34:43,117 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:34:43,121 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:34:43,121 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:34:43,125 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:34:43,131 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2025-01-10 07:34:43,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:34:43,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:34:43,134 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:34:43,140 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-01-10 07:34:43,141 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-01-10 07:34:43,151 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:34:43,151 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:34:43,152 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:34:43,152 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:34:43,152 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:34:43,154 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:34:43,154 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:34:43,177 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-01-10 07:34:43,182 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-01-10 07:34:43,183 INFO L444 ModelExtractionUtils]: 3 out of 6 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-01-10 07:34:43,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:34:43,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:34:43,187 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:34:43,191 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-01-10 07:34:43,196 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-01-10 07:34:43,196 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-01-10 07:34:43,196 INFO L474 LassoAnalysis]: Proved termination. [2025-01-10 07:34:43,196 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-01-10 07:34:43,203 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2025-01-10 07:34:43,204 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-01-10 07:34:43,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:34:43,226 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 07:34:43,231 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 07:34:43,231 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:34:43,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:34:43,232 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 07:34:43,232 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:34:43,240 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 07:34:43,243 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 07:34:43,243 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:34:43,243 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:34:43,243 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 07:34:43,244 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:34:43,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:34:43,268 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-01-10 07:34:43,269 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 41 states and 48 transitions. cyclomatic complexity: 8 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-01-10 07:34:43,338 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 41 states and 48 transitions. cyclomatic complexity: 8. 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 118 states and 139 transitions. Complement of second has 6 states. [2025-01-10 07:34:43,339 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-01-10 07:34:43,339 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-01-10 07:34:43,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 86 transitions. [2025-01-10 07:34:43,346 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 86 transitions. Stem has 4 letters. Loop has 7 letters. [2025-01-10 07:34:43,351 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:34:43,351 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 86 transitions. Stem has 11 letters. Loop has 7 letters. [2025-01-10 07:34:43,351 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:34:43,351 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 86 transitions. Stem has 4 letters. Loop has 14 letters. [2025-01-10 07:34:43,351 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:34:43,351 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 118 states and 139 transitions. [2025-01-10 07:34:43,353 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 69 [2025-01-10 07:34:43,357 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 118 states to 113 states and 132 transitions. [2025-01-10 07:34:43,357 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 74 [2025-01-10 07:34:43,357 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 75 [2025-01-10 07:34:43,357 INFO L73 IsDeterministic]: Start isDeterministic. Operand 113 states and 132 transitions. [2025-01-10 07:34:43,357 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 07:34:43,357 INFO L218 hiAutomatonCegarLoop]: Abstraction has 113 states and 132 transitions. [2025-01-10 07:34:43,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states and 132 transitions. [2025-01-10 07:34:43,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 112. [2025-01-10 07:34:43,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 112 states have (on average 1.1696428571428572) internal successors, (131), 111 states have internal predecessors, (131), 0 states have call successors, (0), 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-01-10 07:34:43,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 131 transitions. [2025-01-10 07:34:43,364 INFO L240 hiAutomatonCegarLoop]: Abstraction has 112 states and 131 transitions. [2025-01-10 07:34:43,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:34:43,365 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 07:34:43,365 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 07:34:43,365 INFO L87 Difference]: Start difference. First operand 112 states and 131 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-01-10 07:34:43,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:34:43,388 INFO L93 Difference]: Finished difference Result 136 states and 156 transitions. [2025-01-10 07:34:43,389 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 136 states and 156 transitions. [2025-01-10 07:34:43,390 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 97 [2025-01-10 07:34:43,391 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 136 states to 102 states and 117 transitions. [2025-01-10 07:34:43,391 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 102 [2025-01-10 07:34:43,391 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 102 [2025-01-10 07:34:43,391 INFO L73 IsDeterministic]: Start isDeterministic. Operand 102 states and 117 transitions. [2025-01-10 07:34:43,391 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-01-10 07:34:43,391 INFO L218 hiAutomatonCegarLoop]: Abstraction has 102 states and 117 transitions. [2025-01-10 07:34:43,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states and 117 transitions. [2025-01-10 07:34:43,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 69. [2025-01-10 07:34:43,393 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-01-10 07:34:43,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 80 transitions. [2025-01-10 07:34:43,394 INFO L240 hiAutomatonCegarLoop]: Abstraction has 69 states and 80 transitions. [2025-01-10 07:34:43,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 07:34:43,395 INFO L432 stractBuchiCegarLoop]: Abstraction has 69 states and 80 transitions. [2025-01-10 07:34:43,395 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-01-10 07:34:43,395 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 69 states and 80 transitions. [2025-01-10 07:34:43,395 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 65 [2025-01-10 07:34:43,395 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:34:43,395 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:34:43,396 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-01-10 07:34:43,396 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2025-01-10 07:34:43,396 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-01-10 07:34:43,396 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-01-10 07:34:43,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:34:43,396 INFO L85 PathProgramCache]: Analyzing trace with hash 925670, now seen corresponding path program 1 times [2025-01-10 07:34:43,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:34:43,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205998812] [2025-01-10 07:34:43,397 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:34:43,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:34:43,400 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 07:34:43,403 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 07:34:43,403 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:34:43,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:34:43,403 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:34:43,404 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 07:34:43,406 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 07:34:43,406 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:34:43,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:34:43,407 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:34:43,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:34:43,408 INFO L85 PathProgramCache]: Analyzing trace with hash 684810137, now seen corresponding path program 2 times [2025-01-10 07:34:43,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:34:43,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24422301] [2025-01-10 07:34:43,408 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 07:34:43,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:34:43,410 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 7 statements into 1 equivalence classes. [2025-01-10 07:34:43,412 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 07:34:43,412 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 07:34:43,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:34:43,412 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:34:43,413 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 07:34:43,415 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 07:34:43,415 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:34:43,415 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:34:43,416 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:34:43,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:34:43,416 INFO L85 PathProgramCache]: Analyzing trace with hash -840989676, now seen corresponding path program 1 times [2025-01-10 07:34:43,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:34:43,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328280278] [2025-01-10 07:34:43,417 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:34:43,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:34:43,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 07:34:43,423 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 07:34:43,423 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:34:43,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:34:43,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:34:43,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:34:43,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328280278] [2025-01-10 07:34:43,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328280278] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 07:34:43,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 07:34:43,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 07:34:43,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363167587] [2025-01-10 07:34:43,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 07:34:43,548 INFO L204 LassoAnalysis]: Preferences: [2025-01-10 07:34:43,548 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-01-10 07:34:43,548 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-01-10 07:34:43,548 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-01-10 07:34:43,548 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-01-10 07:34:43,548 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:34:43,549 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-01-10 07:34:43,549 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-01-10 07:34:43,549 INFO L132 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration3_Loop [2025-01-10 07:34:43,549 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-01-10 07:34:43,549 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-01-10 07:34:43,549 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:34:43,551 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:34:43,553 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:34:43,555 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:34:43,563 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:34:43,594 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-01-10 07:34:43,595 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-01-10 07:34:43,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:34:43,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:34:43,598 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:34:43,602 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-01-10 07:34:43,603 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-01-10 07:34:43,603 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 07:34:43,617 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-01-10 07:34:43,617 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-01-10 07:34:43,623 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2025-01-10 07:34:43,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:34:43,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:34:43,625 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:34:43,626 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-01-10 07:34:43,626 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-01-10 07:34:43,627 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 07:34:43,638 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-01-10 07:34:43,638 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-01-10 07:34:43,643 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2025-01-10 07:34:43,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:34:43,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:34:43,646 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:34:43,647 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-01-10 07:34:43,647 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-01-10 07:34:43,647 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 07:34:43,657 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-01-10 07:34:43,657 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-01-10 07:34:43,663 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2025-01-10 07:34:43,663 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:34:43,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:34:43,666 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:34:43,667 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-01-10 07:34:43,667 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-01-10 07:34:43,667 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 07:34:43,688 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2025-01-10 07:34:43,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:34:43,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:34:43,691 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:34:43,692 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2025-01-10 07:34:43,693 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-01-10 07:34:43,693 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 07:34:43,751 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-01-10 07:34:43,755 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2025-01-10 07:34:43,755 INFO L204 LassoAnalysis]: Preferences: [2025-01-10 07:34:43,755 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-01-10 07:34:43,755 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-01-10 07:34:43,755 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-01-10 07:34:43,755 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-01-10 07:34:43,755 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:34:43,756 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-01-10 07:34:43,756 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-01-10 07:34:43,756 INFO L132 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration3_Loop [2025-01-10 07:34:43,756 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-01-10 07:34:43,756 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-01-10 07:34:43,756 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:34:43,758 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:34:43,760 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:34:43,768 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:34:43,770 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:34:43,799 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-01-10 07:34:43,799 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-01-10 07:34:43,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:34:43,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:34:43,801 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:34:43,803 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2025-01-10 07:34:43,803 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-01-10 07:34:43,813 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:34:43,813 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:34:43,813 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:34:43,813 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:34:43,813 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:34:43,814 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:34:43,814 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:34:43,815 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:34:43,820 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2025-01-10 07:34:43,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:34:43,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:34:43,822 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:34:43,824 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2025-01-10 07:34:43,825 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:34:43,834 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:34:43,834 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:34:43,835 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:34:43,835 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:34:43,835 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:34:43,835 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:34:43,835 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:34:43,839 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:34:43,844 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2025-01-10 07:34:43,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:34:43,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:34:43,848 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:34:43,850 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2025-01-10 07:34:43,851 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-01-10 07:34:43,861 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:34:43,861 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:34:43,861 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:34:43,861 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:34:43,861 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:34:43,863 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:34:43,863 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:34:43,866 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-01-10 07:34:43,869 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-01-10 07:34:43,869 INFO L444 ModelExtractionUtils]: 3 out of 6 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-01-10 07:34:43,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:34:43,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:34:43,871 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:34:43,873 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2025-01-10 07:34:43,873 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-01-10 07:34:43,873 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-01-10 07:34:43,873 INFO L474 LassoAnalysis]: Proved termination. [2025-01-10 07:34:43,873 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-01-10 07:34:43,879 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2025-01-10 07:34:43,880 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-01-10 07:34:43,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:34:43,896 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 07:34:43,900 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 07:34:43,900 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:34:43,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:34:43,900 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 07:34:43,901 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:34:43,907 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 07:34:43,909 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 07:34:43,909 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:34:43,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:34:43,909 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 07:34:43,910 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:34:43,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:34:43,937 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-01-10 07:34:43,937 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 69 states and 80 transitions. cyclomatic complexity: 13 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-01-10 07:34:43,957 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 69 states and 80 transitions. cyclomatic complexity: 13. 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 166 states and 192 transitions. Complement of second has 6 states. [2025-01-10 07:34:43,957 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-01-10 07:34:43,958 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-01-10 07:34:43,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 81 transitions. [2025-01-10 07:34:43,958 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 81 transitions. Stem has 4 letters. Loop has 7 letters. [2025-01-10 07:34:43,958 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:34:43,958 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 81 transitions. Stem has 11 letters. Loop has 7 letters. [2025-01-10 07:34:43,958 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:34:43,958 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 81 transitions. Stem has 4 letters. Loop has 14 letters. [2025-01-10 07:34:43,959 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:34:43,959 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 166 states and 192 transitions. [2025-01-10 07:34:43,960 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 89 [2025-01-10 07:34:43,960 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 166 states to 129 states and 149 transitions. [2025-01-10 07:34:43,961 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 95 [2025-01-10 07:34:43,961 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 96 [2025-01-10 07:34:43,961 INFO L73 IsDeterministic]: Start isDeterministic. Operand 129 states and 149 transitions. [2025-01-10 07:34:43,961 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 07:34:43,961 INFO L218 hiAutomatonCegarLoop]: Abstraction has 129 states and 149 transitions. [2025-01-10 07:34:43,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states and 149 transitions. [2025-01-10 07:34:43,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 68. [2025-01-10 07:34:43,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 68 states have (on average 1.161764705882353) internal successors, (79), 67 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-01-10 07:34:43,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 79 transitions. [2025-01-10 07:34:43,963 INFO L240 hiAutomatonCegarLoop]: Abstraction has 68 states and 79 transitions. [2025-01-10 07:34:43,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:34:43,964 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 07:34:43,964 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 07:34:43,964 INFO L87 Difference]: Start difference. First operand 68 states and 79 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-01-10 07:34:44,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:34:44,045 INFO L93 Difference]: Finished difference Result 209 states and 233 transitions. [2025-01-10 07:34:44,045 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 209 states and 233 transitions. [2025-01-10 07:34:44,046 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 129 [2025-01-10 07:34:44,047 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 209 states to 209 states and 233 transitions. [2025-01-10 07:34:44,047 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 157 [2025-01-10 07:34:44,047 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 157 [2025-01-10 07:34:44,047 INFO L73 IsDeterministic]: Start isDeterministic. Operand 209 states and 233 transitions. [2025-01-10 07:34:44,047 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 07:34:44,047 INFO L218 hiAutomatonCegarLoop]: Abstraction has 209 states and 233 transitions. [2025-01-10 07:34:44,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states and 233 transitions. [2025-01-10 07:34:44,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 69. [2025-01-10 07:34:44,050 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-01-10 07:34:44,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 80 transitions. [2025-01-10 07:34:44,050 INFO L240 hiAutomatonCegarLoop]: Abstraction has 69 states and 80 transitions. [2025-01-10 07:34:44,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 07:34:44,051 INFO L432 stractBuchiCegarLoop]: Abstraction has 69 states and 80 transitions. [2025-01-10 07:34:44,051 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-01-10 07:34:44,051 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 69 states and 80 transitions. [2025-01-10 07:34:44,051 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 32 [2025-01-10 07:34:44,052 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:34:44,052 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:34:44,052 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-01-10 07:34:44,052 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 07:34:44,052 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-01-10 07:34:44,052 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-01-10 07:34:44,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:34:44,053 INFO L85 PathProgramCache]: Analyzing trace with hash 925672, now seen corresponding path program 3 times [2025-01-10 07:34:44,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:34:44,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608301011] [2025-01-10 07:34:44,053 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 07:34:44,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:34:44,056 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 4 statements into 1 equivalence classes. [2025-01-10 07:34:44,059 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 07:34:44,059 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-10 07:34:44,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:34:44,059 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:34:44,060 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 07:34:44,062 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 07:34:44,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:34:44,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:34:44,063 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:34:44,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:34:44,063 INFO L85 PathProgramCache]: Analyzing trace with hash 1437279971, now seen corresponding path program 1 times [2025-01-10 07:34:44,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:34:44,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466736836] [2025-01-10 07:34:44,063 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:34:44,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:34:44,066 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-10 07:34:44,072 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 07:34:44,072 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:34:44,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:34:44,072 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:34:44,073 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-10 07:34:44,081 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 07:34:44,081 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:34:44,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:34:44,083 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:34:44,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:34:44,083 INFO L85 PathProgramCache]: Analyzing trace with hash -871111030, now seen corresponding path program 1 times [2025-01-10 07:34:44,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:34:44,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397860273] [2025-01-10 07:34:44,083 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:34:44,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:34:44,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-10 07:34:44,101 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-10 07:34:44,101 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:34:44,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:34:44,169 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2025-01-10 07:34:44,176 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2025-01-10 07:34:44,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:34:44,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:34:44,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397860273] [2025-01-10 07:34:44,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397860273] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 07:34:44,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 07:34:44,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 07:34:44,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113569774] [2025-01-10 07:34:44,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 07:34:44,312 INFO L204 LassoAnalysis]: Preferences: [2025-01-10 07:34:44,312 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-01-10 07:34:44,312 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-01-10 07:34:44,312 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-01-10 07:34:44,312 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-01-10 07:34:44,312 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:34:44,312 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-01-10 07:34:44,312 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-01-10 07:34:44,312 INFO L132 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration4_Loop [2025-01-10 07:34:44,312 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-01-10 07:34:44,312 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-01-10 07:34:44,313 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:34:44,314 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:34:44,324 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:34:44,326 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:34:44,327 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:34:44,366 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-01-10 07:34:44,366 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-01-10 07:34:44,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:34:44,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:34:44,368 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:34:44,370 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2025-01-10 07:34:44,371 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-01-10 07:34:44,371 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 07:34:44,381 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-01-10 07:34:44,381 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-01-10 07:34:44,387 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2025-01-10 07:34:44,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:34:44,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:34:44,389 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:34:44,390 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2025-01-10 07:34:44,392 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-01-10 07:34:44,392 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 07:34:44,410 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2025-01-10 07:34:44,410 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:34:44,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:34:44,412 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:34:44,414 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2025-01-10 07:34:44,414 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-01-10 07:34:44,414 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 07:34:44,462 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-01-10 07:34:44,469 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2025-01-10 07:34:44,469 INFO L204 LassoAnalysis]: Preferences: [2025-01-10 07:34:44,469 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-01-10 07:34:44,469 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-01-10 07:34:44,469 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-01-10 07:34:44,469 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-01-10 07:34:44,470 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:34:44,470 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-01-10 07:34:44,470 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-01-10 07:34:44,470 INFO L132 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration4_Loop [2025-01-10 07:34:44,470 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-01-10 07:34:44,470 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-01-10 07:34:44,470 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:34:44,481 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:34:44,483 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:34:44,484 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:34:44,485 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:34:44,532 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-01-10 07:34:44,532 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-01-10 07:34:44,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:34:44,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:34:44,534 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:34:44,536 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2025-01-10 07:34:44,536 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-01-10 07:34:44,546 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:34:44,547 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:34:44,547 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:34:44,547 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:34:44,547 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:34:44,547 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:34:44,547 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:34:44,552 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:34:44,558 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2025-01-10 07:34:44,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:34:44,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:34:44,563 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:34:44,564 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2025-01-10 07:34:44,565 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:34:44,575 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:34:44,578 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:34:44,578 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:34:44,579 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:34:44,579 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:34:44,580 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:34:44,580 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:34:44,581 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:34:44,587 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2025-01-10 07:34:44,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:34:44,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:34:44,589 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:34:44,591 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2025-01-10 07:34:44,592 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-01-10 07:34:44,601 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:34:44,602 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:34:44,602 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:34:44,602 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:34:44,602 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:34:44,602 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:34:44,602 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:34:44,603 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:34:44,608 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2025-01-10 07:34:44,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:34:44,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:34:44,611 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:34:44,612 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2025-01-10 07:34:44,613 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-01-10 07:34:44,623 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:34:44,623 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:34:44,623 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:34:44,623 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:34:44,623 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:34:44,624 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:34:44,624 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:34:44,625 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:34:44,630 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2025-01-10 07:34:44,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:34:44,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:34:44,633 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:34:44,635 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2025-01-10 07:34:44,636 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-01-10 07:34:44,645 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:34:44,645 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:34:44,645 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:34:44,646 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:34:44,646 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:34:44,648 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:34:44,648 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:34:44,653 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-01-10 07:34:44,660 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-01-10 07:34:44,660 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-01-10 07:34:44,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:34:44,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:34:44,663 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:34:44,663 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2025-01-10 07:34:44,664 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-01-10 07:34:44,664 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-01-10 07:34:44,664 INFO L474 LassoAnalysis]: Proved termination. [2025-01-10 07:34:44,664 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-01-10 07:34:44,670 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2025-01-10 07:34:44,670 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-01-10 07:34:44,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:34:44,688 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 07:34:44,694 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 07:34:44,694 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:34:44,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:34:44,695 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 07:34:44,695 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:34:44,702 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-10 07:34:44,705 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 07:34:44,705 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:34:44,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:34:44,705 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 07:34:44,706 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:34:44,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:34:44,744 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-01-10 07:34:44,744 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-01-10 07:34:44,764 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-01-10 07:34:44,764 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-01-10 07:34:44,765 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-01-10 07:34:44,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 80 transitions. [2025-01-10 07:34:44,765 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 80 transitions. Stem has 4 letters. Loop has 14 letters. [2025-01-10 07:34:44,765 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:34:44,766 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 80 transitions. Stem has 18 letters. Loop has 14 letters. [2025-01-10 07:34:44,766 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:34:44,766 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 80 transitions. Stem has 4 letters. Loop has 28 letters. [2025-01-10 07:34:44,766 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:34:44,766 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 133 states and 153 transitions. [2025-01-10 07:34:44,767 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 57 [2025-01-10 07:34:44,767 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 133 states to 128 states and 147 transitions. [2025-01-10 07:34:44,767 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 63 [2025-01-10 07:34:44,768 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 64 [2025-01-10 07:34:44,768 INFO L73 IsDeterministic]: Start isDeterministic. Operand 128 states and 147 transitions. [2025-01-10 07:34:44,768 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 07:34:44,768 INFO L218 hiAutomatonCegarLoop]: Abstraction has 128 states and 147 transitions. [2025-01-10 07:34:44,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states and 147 transitions. [2025-01-10 07:34:44,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 127. [2025-01-10 07:34:44,771 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-01-10 07:34:44,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 146 transitions. [2025-01-10 07:34:44,771 INFO L240 hiAutomatonCegarLoop]: Abstraction has 127 states and 146 transitions. [2025-01-10 07:34:44,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:34:44,771 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 07:34:44,771 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 07:34:44,771 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-01-10 07:34:44,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:34:44,793 INFO L93 Difference]: Finished difference Result 70 states and 80 transitions. [2025-01-10 07:34:44,793 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 70 states and 80 transitions. [2025-01-10 07:34:44,793 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 32 [2025-01-10 07:34:44,794 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 70 states to 69 states and 79 transitions. [2025-01-10 07:34:44,794 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 37 [2025-01-10 07:34:44,794 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 37 [2025-01-10 07:34:44,794 INFO L73 IsDeterministic]: Start isDeterministic. Operand 69 states and 79 transitions. [2025-01-10 07:34:44,794 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 07:34:44,794 INFO L218 hiAutomatonCegarLoop]: Abstraction has 69 states and 79 transitions. [2025-01-10 07:34:44,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states and 79 transitions. [2025-01-10 07:34:44,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2025-01-10 07:34:44,796 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-01-10 07:34:44,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 79 transitions. [2025-01-10 07:34:44,796 INFO L240 hiAutomatonCegarLoop]: Abstraction has 69 states and 79 transitions. [2025-01-10 07:34:44,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 07:34:44,797 INFO L432 stractBuchiCegarLoop]: Abstraction has 69 states and 79 transitions. [2025-01-10 07:34:44,797 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-01-10 07:34:44,797 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 69 states and 79 transitions. [2025-01-10 07:34:44,797 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 32 [2025-01-10 07:34:44,797 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:34:44,797 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:34:44,802 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-01-10 07:34:44,803 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 07:34:44,803 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-01-10 07:34:44,803 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-01-10 07:34:44,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:34:44,803 INFO L85 PathProgramCache]: Analyzing trace with hash 28695786, now seen corresponding path program 1 times [2025-01-10 07:34:44,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:34:44,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647219756] [2025-01-10 07:34:44,803 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:34:44,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:34:44,806 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 07:34:44,808 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 07:34:44,808 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:34:44,808 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:34:44,809 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:34:44,809 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 07:34:44,811 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 07:34:44,811 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:34:44,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:34:44,812 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:34:44,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:34:44,812 INFO L85 PathProgramCache]: Analyzing trace with hash 978099679, now seen corresponding path program 2 times [2025-01-10 07:34:44,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:34:44,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849354064] [2025-01-10 07:34:44,813 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 07:34:44,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:34:44,819 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 1 equivalence classes. [2025-01-10 07:34:44,825 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 07:34:44,825 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 07:34:44,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:34:44,826 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:34:44,826 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-10 07:34:44,832 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 07:34:44,832 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:34:44,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:34:44,833 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:34:44,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:34:44,834 INFO L85 PathProgramCache]: Analyzing trace with hash -213569784, now seen corresponding path program 1 times [2025-01-10 07:34:44,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:34:44,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044115197] [2025-01-10 07:34:44,837 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:34:44,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:34:44,841 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-10 07:34:44,848 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-10 07:34:44,848 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:34:44,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:34:44,904 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:34:44,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:34:44,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044115197] [2025-01-10 07:34:44,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044115197] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 07:34:44,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 07:34:44,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 07:34:44,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897692833] [2025-01-10 07:34:44,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 07:34:44,997 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2025-01-10 07:34:45,022 INFO L204 LassoAnalysis]: Preferences: [2025-01-10 07:34:45,022 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-01-10 07:34:45,022 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-01-10 07:34:45,022 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-01-10 07:34:45,022 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-01-10 07:34:45,022 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:34:45,022 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-01-10 07:34:45,022 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-01-10 07:34:45,022 INFO L132 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration5_Loop [2025-01-10 07:34:45,022 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-01-10 07:34:45,022 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-01-10 07:34:45,023 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:34:45,025 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:34:45,027 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:34:45,028 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:34:45,038 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:34:45,080 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-01-10 07:34:45,080 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-01-10 07:34:45,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:34:45,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:34:45,087 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:34:45,088 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2025-01-10 07:34:45,089 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-01-10 07:34:45,091 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 07:34:45,112 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-01-10 07:34:45,112 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-01-10 07:34:45,126 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2025-01-10 07:34:45,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:34:45,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:34:45,129 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:34:45,131 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2025-01-10 07:34:45,132 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-01-10 07:34:45,132 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 07:34:45,146 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-01-10 07:34:45,146 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-01-10 07:34:45,152 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2025-01-10 07:34:45,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:34:45,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:34:45,154 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:34:45,155 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2025-01-10 07:34:45,157 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-01-10 07:34:45,157 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 07:34:45,170 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-01-10 07:34:45,170 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-01-10 07:34:45,178 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2025-01-10 07:34:45,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:34:45,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:34:45,183 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:34:45,185 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2025-01-10 07:34:45,185 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-01-10 07:34:45,186 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 07:34:45,209 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2025-01-10 07:34:45,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:34:45,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:34:45,211 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:34:45,212 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2025-01-10 07:34:45,214 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-01-10 07:34:45,214 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 07:34:45,499 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-01-10 07:34:45,508 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2025-01-10 07:34:45,508 INFO L204 LassoAnalysis]: Preferences: [2025-01-10 07:34:45,508 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-01-10 07:34:45,509 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-01-10 07:34:45,509 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-01-10 07:34:45,509 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-01-10 07:34:45,509 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:34:45,509 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-01-10 07:34:45,509 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-01-10 07:34:45,509 INFO L132 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration5_Loop [2025-01-10 07:34:45,509 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-01-10 07:34:45,509 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-01-10 07:34:45,510 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:34:45,512 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:34:45,520 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:34:45,522 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:34:45,527 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:34:45,571 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-01-10 07:34:45,571 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-01-10 07:34:45,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:34:45,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:34:45,577 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:34:45,578 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2025-01-10 07:34:45,579 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-01-10 07:34:45,590 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:34:45,590 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:34:45,590 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:34:45,590 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:34:45,590 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:34:45,590 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:34:45,590 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:34:45,593 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:34:45,602 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2025-01-10 07:34:45,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:34:45,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:34:45,607 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:34:45,611 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2025-01-10 07:34:45,614 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-01-10 07:34:45,624 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:34:45,624 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:34:45,624 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:34:45,624 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:34:45,624 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:34:45,626 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:34:45,626 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:34:45,629 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-01-10 07:34:45,632 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2025-01-10 07:34:45,632 INFO L444 ModelExtractionUtils]: 5 out of 7 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-01-10 07:34:45,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:34:45,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:34:45,636 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:34:45,639 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2025-01-10 07:34:45,639 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-01-10 07:34:45,639 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-01-10 07:34:45,639 INFO L474 LassoAnalysis]: Proved termination. [2025-01-10 07:34:45,639 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-01-10 07:34:45,645 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2025-01-10 07:34:45,645 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-01-10 07:34:45,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:34:45,688 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 07:34:45,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 07:34:45,700 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:34:45,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:34:45,700 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 07:34:45,701 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:34:45,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-10 07:34:45,742 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 07:34:45,742 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:34:45,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:34:45,743 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-10 07:34:45,743 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:34:45,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:34:45,812 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-01-10 07:34:45,812 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-01-10 07:34:45,987 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-01-10 07:34:45,987 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-01-10 07:34:45,988 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-01-10 07:34:45,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 109 transitions. [2025-01-10 07:34:45,988 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 109 transitions. Stem has 5 letters. Loop has 14 letters. [2025-01-10 07:34:45,988 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:34:45,988 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 109 transitions. Stem has 19 letters. Loop has 14 letters. [2025-01-10 07:34:45,988 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:34:45,989 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 109 transitions. Stem has 5 letters. Loop has 28 letters. [2025-01-10 07:34:45,989 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:34:45,989 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 400 states and 442 transitions. [2025-01-10 07:34:45,991 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 71 [2025-01-10 07:34:45,992 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 400 states to 330 states and 371 transitions. [2025-01-10 07:34:45,993 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 108 [2025-01-10 07:34:45,993 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 109 [2025-01-10 07:34:45,993 INFO L73 IsDeterministic]: Start isDeterministic. Operand 330 states and 371 transitions. [2025-01-10 07:34:45,993 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 07:34:45,994 INFO L218 hiAutomatonCegarLoop]: Abstraction has 330 states and 371 transitions. [2025-01-10 07:34:45,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states and 371 transitions. [2025-01-10 07:34:46,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 197. [2025-01-10 07:34:46,003 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-01-10 07:34:46,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 228 transitions. [2025-01-10 07:34:46,003 INFO L240 hiAutomatonCegarLoop]: Abstraction has 197 states and 228 transitions. [2025-01-10 07:34:46,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:34:46,004 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 07:34:46,004 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-10 07:34:46,004 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-01-10 07:34:46,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:34:46,098 INFO L93 Difference]: Finished difference Result 657 states and 728 transitions. [2025-01-10 07:34:46,098 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 657 states and 728 transitions. [2025-01-10 07:34:46,102 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 165 [2025-01-10 07:34:46,104 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 657 states to 593 states and 657 transitions. [2025-01-10 07:34:46,104 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 198 [2025-01-10 07:34:46,104 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 211 [2025-01-10 07:34:46,104 INFO L73 IsDeterministic]: Start isDeterministic. Operand 593 states and 657 transitions. [2025-01-10 07:34:46,105 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 07:34:46,105 INFO L218 hiAutomatonCegarLoop]: Abstraction has 593 states and 657 transitions. [2025-01-10 07:34:46,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states and 657 transitions. [2025-01-10 07:34:46,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 189. [2025-01-10 07:34:46,108 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-01-10 07:34:46,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 218 transitions. [2025-01-10 07:34:46,109 INFO L240 hiAutomatonCegarLoop]: Abstraction has 189 states and 218 transitions. [2025-01-10 07:34:46,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 07:34:46,110 INFO L432 stractBuchiCegarLoop]: Abstraction has 189 states and 218 transitions. [2025-01-10 07:34:46,110 INFO L338 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-01-10 07:34:46,110 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 189 states and 218 transitions. [2025-01-10 07:34:46,110 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 58 [2025-01-10 07:34:46,110 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:34:46,111 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:34:46,111 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-01-10 07:34:46,111 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-01-10 07:34:46,111 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-01-10 07:34:46,111 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;" "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-01-10 07:34:46,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:34:46,112 INFO L85 PathProgramCache]: Analyzing trace with hash 28695786, now seen corresponding path program 2 times [2025-01-10 07:34:46,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:34:46,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446880369] [2025-01-10 07:34:46,112 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 07:34:46,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:34:46,114 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 5 statements into 1 equivalence classes. [2025-01-10 07:34:46,116 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 07:34:46,116 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 07:34:46,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:34:46,116 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:34:46,117 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 07:34:46,118 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 07:34:46,118 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:34:46,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:34:46,119 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:34:46,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:34:46,119 INFO L85 PathProgramCache]: Analyzing trace with hash 936674463, now seen corresponding path program 1 times [2025-01-10 07:34:46,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:34:46,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697527624] [2025-01-10 07:34:46,119 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:34:46,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:34:46,122 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-10 07:34:46,125 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-10 07:34:46,125 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:34:46,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:34:46,125 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:34:46,129 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-10 07:34:46,137 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-10 07:34:46,137 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:34:46,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:34:46,139 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:34:46,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:34:46,139 INFO L85 PathProgramCache]: Analyzing trace with hash -827182698, now seen corresponding path program 1 times [2025-01-10 07:34:46,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:34:46,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007398466] [2025-01-10 07:34:46,139 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:34:46,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:34:46,147 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-10 07:34:46,154 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-10 07:34:46,157 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:34:46,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:34:46,157 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:34:46,159 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-10 07:34:46,162 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-10 07:34:46,165 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:34:46,165 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:34:46,170 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:34:46,390 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2025-01-10 07:34:46,428 INFO L204 LassoAnalysis]: Preferences: [2025-01-10 07:34:46,429 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-01-10 07:34:46,429 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-01-10 07:34:46,429 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-01-10 07:34:46,429 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-01-10 07:34:46,429 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:34:46,429 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-01-10 07:34:46,429 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-01-10 07:34:46,429 INFO L132 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration6_Loop [2025-01-10 07:34:46,429 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-01-10 07:34:46,429 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-01-10 07:34:46,429 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:34:46,431 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:34:46,449 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:34:46,453 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:34:46,455 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:34:46,456 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:34:46,518 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-01-10 07:34:46,520 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-01-10 07:34:46,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:34:46,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:34:46,523 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:34:46,525 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2025-01-10 07:34:46,525 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-01-10 07:34:46,526 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 07:34:46,540 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-01-10 07:34:46,540 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-01-10 07:34:46,548 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2025-01-10 07:34:46,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:34:46,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:34:46,553 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:34:46,557 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2025-01-10 07:34:46,559 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-01-10 07:34:46,559 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 07:34:46,581 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Ended with exit code 0 [2025-01-10 07:34:46,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:34:46,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:34:46,586 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:34:46,586 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2025-01-10 07:34:46,587 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-01-10 07:34:46,587 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 07:34:46,646 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-01-10 07:34:46,651 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Ended with exit code 0 [2025-01-10 07:34:46,651 INFO L204 LassoAnalysis]: Preferences: [2025-01-10 07:34:46,651 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-01-10 07:34:46,651 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-01-10 07:34:46,651 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-01-10 07:34:46,651 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-01-10 07:34:46,651 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:34:46,651 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-01-10 07:34:46,651 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-01-10 07:34:46,651 INFO L132 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration6_Loop [2025-01-10 07:34:46,651 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-01-10 07:34:46,651 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-01-10 07:34:46,652 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:34:46,664 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:34:46,666 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:34:46,667 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:34:46,668 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:34:46,672 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:34:46,712 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-01-10 07:34:46,712 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-01-10 07:34:46,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:34:46,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:34:46,715 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:34:46,716 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2025-01-10 07:34:46,717 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:34:46,732 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:34:46,732 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:34:46,732 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:34:46,732 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:34:46,732 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:34:46,733 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:34:46,733 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:34:46,736 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-01-10 07:34:46,740 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-01-10 07:34:46,740 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-01-10 07:34:46,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:34:46,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:34:46,747 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:34:46,750 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2025-01-10 07:34:46,751 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-01-10 07:34:46,751 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-01-10 07:34:46,751 INFO L474 LassoAnalysis]: Proved termination. [2025-01-10 07:34:46,751 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-01-10 07:34:46,759 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2025-01-10 07:34:46,760 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-01-10 07:34:46,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:34:46,771 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 07:34:46,780 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 07:34:46,780 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:34:46,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:34:46,780 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 07:34:46,781 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:34:46,800 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-10 07:34:46,810 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-10 07:34:46,811 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:34:46,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:34:46,811 INFO L256 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 07:34:46,812 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:34:46,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:34:46,842 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-01-10 07:34:46,842 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-01-10 07:34:46,866 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-01-10 07:34:46,866 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-01-10 07:34:46,866 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-01-10 07:34:46,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 47 transitions. [2025-01-10 07:34:46,867 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 47 transitions. Stem has 5 letters. Loop has 23 letters. [2025-01-10 07:34:46,867 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:34:46,867 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 47 transitions. Stem has 28 letters. Loop has 23 letters. [2025-01-10 07:34:46,867 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:34:46,867 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 47 transitions. Stem has 5 letters. Loop has 46 letters. [2025-01-10 07:34:46,867 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:34:46,867 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 376 states and 436 transitions. [2025-01-10 07:34:46,871 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 50 [2025-01-10 07:34:46,872 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 376 states to 252 states and 292 transitions. [2025-01-10 07:34:46,872 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 60 [2025-01-10 07:34:46,872 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 61 [2025-01-10 07:34:46,873 INFO L73 IsDeterministic]: Start isDeterministic. Operand 252 states and 292 transitions. [2025-01-10 07:34:46,873 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 07:34:46,873 INFO L218 hiAutomatonCegarLoop]: Abstraction has 252 states and 292 transitions. [2025-01-10 07:34:46,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states and 292 transitions. [2025-01-10 07:34:46,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 132. [2025-01-10 07:34:46,875 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-01-10 07:34:46,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 153 transitions. [2025-01-10 07:34:46,876 INFO L240 hiAutomatonCegarLoop]: Abstraction has 132 states and 153 transitions. [2025-01-10 07:34:46,876 INFO L432 stractBuchiCegarLoop]: Abstraction has 132 states and 153 transitions. [2025-01-10 07:34:46,876 INFO L338 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-01-10 07:34:46,876 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 132 states and 153 transitions. [2025-01-10 07:34:46,877 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2025-01-10 07:34:46,877 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:34:46,877 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:34:46,877 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2025-01-10 07:34:46,877 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 07:34:46,878 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-01-10 07:34:46,878 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-01-10 07:34:46,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:34:46,878 INFO L85 PathProgramCache]: Analyzing trace with hash 889569386, now seen corresponding path program 1 times [2025-01-10 07:34:46,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:34:46,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451225570] [2025-01-10 07:34:46,878 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:34:46,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:34:46,882 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 07:34:46,883 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 07:34:46,883 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:34:46,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:34:46,884 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:34:46,884 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 07:34:46,885 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 07:34:46,885 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:34:46,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:34:46,886 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:34:46,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:34:46,887 INFO L85 PathProgramCache]: Analyzing trace with hash -357377339, now seen corresponding path program 1 times [2025-01-10 07:34:46,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:34:46,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512373433] [2025-01-10 07:34:46,887 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:34:46,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:34:46,889 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-10 07:34:46,891 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-10 07:34:46,891 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:34:46,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:34:46,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:34:46,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:34:46,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512373433] [2025-01-10 07:34:46,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512373433] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 07:34:46,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 07:34:46,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 07:34:46,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096733805] [2025-01-10 07:34:46,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 07:34:46,941 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-01-10 07:34:46,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:34:46,941 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 07:34:46,941 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-10 07:34:46,941 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-01-10 07:34:47,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:34:47,036 INFO L93 Difference]: Finished difference Result 210 states and 235 transitions. [2025-01-10 07:34:47,036 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 210 states and 235 transitions. [2025-01-10 07:34:47,037 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2025-01-10 07:34:47,038 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 210 states to 195 states and 220 transitions. [2025-01-10 07:34:47,038 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 32 [2025-01-10 07:34:47,038 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 32 [2025-01-10 07:34:47,038 INFO L73 IsDeterministic]: Start isDeterministic. Operand 195 states and 220 transitions. [2025-01-10 07:34:47,038 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 07:34:47,038 INFO L218 hiAutomatonCegarLoop]: Abstraction has 195 states and 220 transitions. [2025-01-10 07:34:47,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states and 220 transitions. [2025-01-10 07:34:47,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 177. [2025-01-10 07:34:47,040 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-01-10 07:34:47,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 200 transitions. [2025-01-10 07:34:47,040 INFO L240 hiAutomatonCegarLoop]: Abstraction has 177 states and 200 transitions. [2025-01-10 07:34:47,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 07:34:47,044 INFO L432 stractBuchiCegarLoop]: Abstraction has 177 states and 200 transitions. [2025-01-10 07:34:47,044 INFO L338 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2025-01-10 07:34:47,044 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 177 states and 200 transitions. [2025-01-10 07:34:47,045 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2025-01-10 07:34:47,045 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:34:47,045 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:34:47,045 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2025-01-10 07:34:47,045 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-01-10 07:34:47,045 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-01-10 07:34:47,045 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;" "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-01-10 07:34:47,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:34:47,045 INFO L85 PathProgramCache]: Analyzing trace with hash 889569386, now seen corresponding path program 2 times [2025-01-10 07:34:47,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:34:47,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710303390] [2025-01-10 07:34:47,045 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 07:34:47,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:34:47,048 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 6 statements into 1 equivalence classes. [2025-01-10 07:34:47,049 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 07:34:47,049 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 07:34:47,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:34:47,049 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:34:47,050 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 07:34:47,051 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 07:34:47,051 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:34:47,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:34:47,052 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:34:47,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:34:47,052 INFO L85 PathProgramCache]: Analyzing trace with hash -110388183, now seen corresponding path program 1 times [2025-01-10 07:34:47,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:34:47,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92815395] [2025-01-10 07:34:47,052 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:34:47,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:34:47,055 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-10 07:34:47,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-10 07:34:47,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:34:47,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:34:47,058 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:34:47,059 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-10 07:34:47,061 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-10 07:34:47,061 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:34:47,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:34:47,062 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:34:47,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:34:47,063 INFO L85 PathProgramCache]: Analyzing trace with hash -998181920, now seen corresponding path program 1 times [2025-01-10 07:34:47,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:34:47,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578854989] [2025-01-10 07:34:47,063 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:34:47,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:34:47,066 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-01-10 07:34:47,069 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-01-10 07:34:47,069 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:34:47,069 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:34:47,124 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:34:47,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:34:47,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578854989] [2025-01-10 07:34:47,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578854989] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 07:34:47,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1899449746] [2025-01-10 07:34:47,125 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:34:47,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 07:34:47,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:34:47,128 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 07:34:47,130 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2025-01-10 07:34:47,156 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-01-10 07:34:47,166 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-01-10 07:34:47,166 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:34:47,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:34:47,166 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-10 07:34:47,167 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:34:47,193 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Forceful destruction successful, exit code 0 [2025-01-10 07:34:47,319 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:34:47,319 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 07:34:47,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1899449746] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 07:34:47,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 07:34:47,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 9 [2025-01-10 07:34:47,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786511296] [2025-01-10 07:34:47,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 07:34:47,495 INFO L204 LassoAnalysis]: Preferences: [2025-01-10 07:34:47,495 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-01-10 07:34:47,495 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-01-10 07:34:47,495 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-01-10 07:34:47,495 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-01-10 07:34:47,495 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:34:47,495 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-01-10 07:34:47,495 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-01-10 07:34:47,495 INFO L132 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration8_Loop [2025-01-10 07:34:47,495 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-01-10 07:34:47,495 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-01-10 07:34:47,495 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:34:47,497 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:34:47,511 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:34:47,513 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:34:47,516 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:34:47,554 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-01-10 07:34:47,554 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-01-10 07:34:47,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:34:47,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:34:47,559 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:34:47,564 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2025-01-10 07:34:47,565 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-01-10 07:34:47,565 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 07:34:47,575 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-01-10 07:34:47,575 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-01-10 07:34:47,582 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Ended with exit code 0 [2025-01-10 07:34:47,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:34:47,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:34:47,584 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:34:47,584 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2025-01-10 07:34:47,586 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-01-10 07:34:47,586 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 07:34:47,610 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Forceful destruction successful, exit code 0 [2025-01-10 07:34:47,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:34:47,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:34:47,615 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:34:47,617 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-01-10 07:34:47,617 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 07:34:47,620 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2025-01-10 07:34:47,685 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-01-10 07:34:47,690 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Forceful destruction successful, exit code 0 [2025-01-10 07:34:47,690 INFO L204 LassoAnalysis]: Preferences: [2025-01-10 07:34:47,690 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-01-10 07:34:47,691 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-01-10 07:34:47,691 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-01-10 07:34:47,691 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-01-10 07:34:47,691 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:34:47,691 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-01-10 07:34:47,691 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-01-10 07:34:47,691 INFO L132 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration8_Loop [2025-01-10 07:34:47,693 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-01-10 07:34:47,694 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-01-10 07:34:47,694 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:34:47,705 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:34:47,707 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:34:47,716 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:34:47,717 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:34:47,748 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-01-10 07:34:47,748 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-01-10 07:34:47,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:34:47,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:34:47,750 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:34:47,751 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2025-01-10 07:34:47,752 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-01-10 07:34:47,762 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:34:47,762 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:34:47,762 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:34:47,762 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:34:47,762 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:34:47,763 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:34:47,763 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:34:47,764 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:34:47,771 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Forceful destruction successful, exit code 0 [2025-01-10 07:34:47,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:34:47,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:34:47,773 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:34:47,774 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2025-01-10 07:34:47,775 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-01-10 07:34:47,785 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:34:47,785 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:34:47,785 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:34:47,785 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:34:47,785 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:34:47,788 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:34:47,788 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:34:47,789 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:34:47,795 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Forceful destruction successful, exit code 0 [2025-01-10 07:34:47,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:34:47,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:34:47,797 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:34:47,798 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2025-01-10 07:34:47,799 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:34:47,808 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:34:47,809 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:34:47,809 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:34:47,809 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:34:47,809 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:34:47,810 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:34:47,810 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:34:47,812 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-01-10 07:34:47,818 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-01-10 07:34:47,818 INFO L444 ModelExtractionUtils]: 2 out of 6 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-01-10 07:34:47,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:34:47,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:34:47,820 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:34:47,821 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2025-01-10 07:34:47,822 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-01-10 07:34:47,822 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-01-10 07:34:47,822 INFO L474 LassoAnalysis]: Proved termination. [2025-01-10 07:34:47,822 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~r~0#1, ULTIMATE.start_main_~j~0#1) = 3*ULTIMATE.start_main_~r~0#1 - 4*ULTIMATE.start_main_~j~0#1 Supporting invariants [] [2025-01-10 07:34:47,828 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Forceful destruction successful, exit code 0 [2025-01-10 07:34:47,828 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-01-10 07:34:47,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:34:47,847 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 07:34:47,850 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 07:34:47,851 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:34:47,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:34:47,851 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 07:34:47,851 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:34:47,861 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-10 07:34:47,868 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-10 07:34:47,868 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:34:47,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:34:47,868 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-10 07:34:47,870 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:34:47,983 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Ended with exit code 0 [2025-01-10 07:34:48,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:34:48,026 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-01-10 07:34:48,026 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-01-10 07:34:48,171 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 641 states and 695 transitions. Complement of second has 13 states. [2025-01-10 07:34:48,172 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-01-10 07:34:48,172 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-01-10 07:34:48,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 68 transitions. [2025-01-10 07:34:48,172 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 68 transitions. Stem has 6 letters. Loop has 25 letters. [2025-01-10 07:34:48,173 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:34:48,173 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 68 transitions. Stem has 31 letters. Loop has 25 letters. [2025-01-10 07:34:48,173 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:34:48,173 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 68 transitions. Stem has 6 letters. Loop has 50 letters. [2025-01-10 07:34:48,173 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:34:48,173 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 641 states and 695 transitions. [2025-01-10 07:34:48,176 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2025-01-10 07:34:48,178 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 641 states to 493 states and 542 transitions. [2025-01-10 07:34:48,178 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 55 [2025-01-10 07:34:48,178 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 56 [2025-01-10 07:34:48,178 INFO L73 IsDeterministic]: Start isDeterministic. Operand 493 states and 542 transitions. [2025-01-10 07:34:48,179 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 07:34:48,179 INFO L218 hiAutomatonCegarLoop]: Abstraction has 493 states and 542 transitions. [2025-01-10 07:34:48,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states and 542 transitions. [2025-01-10 07:34:48,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 315. [2025-01-10 07:34:48,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315 states, 315 states have (on average 1.1142857142857143) internal successors, (351), 314 states have internal predecessors, (351), 0 states have call successors, (0), 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-01-10 07:34:48,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 351 transitions. [2025-01-10 07:34:48,183 INFO L240 hiAutomatonCegarLoop]: Abstraction has 315 states and 351 transitions. [2025-01-10 07:34:48,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:34:48,183 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 07:34:48,183 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-01-10 07:34:48,184 INFO L87 Difference]: Start difference. First operand 315 states and 351 transitions. Second operand has 6 states, 5 states have (on average 6.2) 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-01-10 07:34:48,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:34:48,264 INFO L93 Difference]: Finished difference Result 472 states and 509 transitions. [2025-01-10 07:34:48,264 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 472 states and 509 transitions. [2025-01-10 07:34:48,266 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2025-01-10 07:34:48,267 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 472 states to 277 states and 307 transitions. [2025-01-10 07:34:48,267 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31 [2025-01-10 07:34:48,268 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2025-01-10 07:34:48,268 INFO L73 IsDeterministic]: Start isDeterministic. Operand 277 states and 307 transitions. [2025-01-10 07:34:48,268 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 07:34:48,268 INFO L218 hiAutomatonCegarLoop]: Abstraction has 277 states and 307 transitions. [2025-01-10 07:34:48,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states and 307 transitions. [2025-01-10 07:34:48,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 195. [2025-01-10 07:34:48,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 195 states have (on average 1.123076923076923) internal successors, (219), 194 states have internal predecessors, (219), 0 states have call successors, (0), 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-01-10 07:34:48,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 219 transitions. [2025-01-10 07:34:48,271 INFO L240 hiAutomatonCegarLoop]: Abstraction has 195 states and 219 transitions. [2025-01-10 07:34:48,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 07:34:48,271 INFO L432 stractBuchiCegarLoop]: Abstraction has 195 states and 219 transitions. [2025-01-10 07:34:48,271 INFO L338 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2025-01-10 07:34:48,271 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 195 states and 219 transitions. [2025-01-10 07:34:48,272 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2025-01-10 07:34:48,272 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:34:48,272 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:34:48,272 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-01-10 07:34:48,273 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-01-10 07:34:48,273 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-01-10 07:34:48,273 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;" "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-01-10 07:34:48,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:34:48,273 INFO L85 PathProgramCache]: Analyzing trace with hash -1278574164, now seen corresponding path program 1 times [2025-01-10 07:34:48,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:34:48,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832867353] [2025-01-10 07:34:48,273 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:34:48,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:34:48,276 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-10 07:34:48,279 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-10 07:34:48,279 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:34:48,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:34:48,279 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:34:48,280 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-10 07:34:48,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-10 07:34:48,282 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:34:48,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:34:48,284 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:34:48,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:34:48,284 INFO L85 PathProgramCache]: Analyzing trace with hash 46471037, now seen corresponding path program 2 times [2025-01-10 07:34:48,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:34:48,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45783185] [2025-01-10 07:34:48,284 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 07:34:48,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:34:48,287 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 1 equivalence classes. [2025-01-10 07:34:48,289 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-10 07:34:48,289 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 07:34:48,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:34:48,289 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:34:48,290 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-10 07:34:48,293 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-10 07:34:48,294 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:34:48,294 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:34:48,295 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:34:48,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:34:48,295 INFO L85 PathProgramCache]: Analyzing trace with hash 88620082, now seen corresponding path program 1 times [2025-01-10 07:34:48,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:34:48,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558483759] [2025-01-10 07:34:48,295 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:34:48,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:34:48,300 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-01-10 07:34:48,304 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-01-10 07:34:48,304 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:34:48,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:34:48,304 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:34:48,305 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-01-10 07:34:48,309 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-01-10 07:34:48,309 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:34:48,309 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:34:48,311 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:34:48,456 INFO L204 LassoAnalysis]: Preferences: [2025-01-10 07:34:48,456 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-01-10 07:34:48,456 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-01-10 07:34:48,456 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-01-10 07:34:48,456 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-01-10 07:34:48,456 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:34:48,456 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-01-10 07:34:48,456 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-01-10 07:34:48,456 INFO L132 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration9_Loop [2025-01-10 07:34:48,456 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-01-10 07:34:48,456 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-01-10 07:34:48,457 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:34:48,458 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:34:48,461 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:34:48,463 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:34:48,474 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:34:48,525 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-01-10 07:34:48,525 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-01-10 07:34:48,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:34:48,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:34:48,528 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:34:48,529 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2025-01-10 07:34:48,530 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-01-10 07:34:48,530 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 07:34:48,541 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-01-10 07:34:48,542 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-01-10 07:34:48,550 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Forceful destruction successful, exit code 0 [2025-01-10 07:34:48,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:34:48,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:34:48,553 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:34:48,554 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2025-01-10 07:34:48,554 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-01-10 07:34:48,554 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 07:34:48,565 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-01-10 07:34:48,565 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-01-10 07:34:48,571 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Ended with exit code 0 [2025-01-10 07:34:48,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:34:48,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:34:48,578 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:34:48,581 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2025-01-10 07:34:48,582 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-01-10 07:34:48,582 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 07:34:48,596 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-01-10 07:34:48,596 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-01-10 07:34:48,605 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Ended with exit code 0 [2025-01-10 07:34:48,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:34:48,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:34:48,607 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:34:48,612 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-01-10 07:34:48,612 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 07:34:48,615 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2025-01-10 07:34:48,646 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Forceful destruction successful, exit code 0 [2025-01-10 07:34:48,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:34:48,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:34:48,654 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:34:48,655 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2025-01-10 07:34:48,656 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-01-10 07:34:48,656 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 07:34:48,721 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-01-10 07:34:48,725 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Forceful destruction successful, exit code 0 [2025-01-10 07:34:48,726 INFO L204 LassoAnalysis]: Preferences: [2025-01-10 07:34:48,726 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-01-10 07:34:48,726 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-01-10 07:34:48,726 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-01-10 07:34:48,726 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-01-10 07:34:48,726 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:34:48,726 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-01-10 07:34:48,726 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-01-10 07:34:48,726 INFO L132 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration9_Loop [2025-01-10 07:34:48,726 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-01-10 07:34:48,726 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-01-10 07:34:48,726 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:34:48,731 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:34:48,732 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:34:48,733 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:34:48,734 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:34:48,777 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-01-10 07:34:48,779 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-01-10 07:34:48,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:34:48,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:34:48,782 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:34:48,782 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2025-01-10 07:34:48,786 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-01-10 07:34:48,796 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:34:48,796 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:34:48,796 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:34:48,796 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:34:48,796 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:34:48,798 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:34:48,798 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:34:48,799 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:34:48,805 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Ended with exit code 0 [2025-01-10 07:34:48,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:34:48,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:34:48,808 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:34:48,811 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2025-01-10 07:34:48,811 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-01-10 07:34:48,822 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:34:48,822 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:34:48,822 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:34:48,822 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:34:48,822 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:34:48,823 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:34:48,823 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:34:48,824 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:34:48,829 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Forceful destruction successful, exit code 0 [2025-01-10 07:34:48,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:34:48,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:34:48,832 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:34:48,834 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Waiting until timeout for monitored process [2025-01-10 07:34:48,835 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-01-10 07:34:48,844 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:34:48,845 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:34:48,845 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:34:48,845 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:34:48,845 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:34:48,845 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:34:48,845 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:34:48,847 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:34:48,852 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Ended with exit code 0 [2025-01-10 07:34:48,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:34:48,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:34:48,855 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:34:48,856 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Waiting until timeout for monitored process [2025-01-10 07:34:48,856 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-01-10 07:34:48,866 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:34:48,866 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:34:48,866 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:34:48,866 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:34:48,866 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:34:48,867 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:34:48,867 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:34:48,869 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:34:48,875 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Forceful destruction successful, exit code 0 [2025-01-10 07:34:48,876 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:34:48,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:34:48,877 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:34:48,878 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Waiting until timeout for monitored process [2025-01-10 07:34:48,879 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-01-10 07:34:48,888 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:34:48,889 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:34:48,889 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:34:48,889 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:34:48,889 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:34:48,890 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:34:48,890 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:34:48,892 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-01-10 07:34:48,895 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-01-10 07:34:48,895 INFO L444 ModelExtractionUtils]: 2 out of 6 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-01-10 07:34:48,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:34:48,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:34:48,897 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:34:48,898 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Waiting until timeout for monitored process [2025-01-10 07:34:48,899 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-01-10 07:34:48,899 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-01-10 07:34:48,899 INFO L474 LassoAnalysis]: Proved termination. [2025-01-10 07:34:48,899 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0#1, ULTIMATE.start_main_~n~0#1) = -1*ULTIMATE.start_main_~j~0#1 + 1*ULTIMATE.start_main_~n~0#1 Supporting invariants [] [2025-01-10 07:34:48,904 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Ended with exit code 0 [2025-01-10 07:34:48,905 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-01-10 07:34:48,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:34:48,921 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-10 07:34:48,927 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-10 07:34:48,927 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:34:48,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:34:48,927 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 07:34:48,928 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:34:48,947 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-10 07:34:48,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-10 07:34:48,953 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:34:48,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:34:48,954 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-01-10 07:34:48,955 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:34:49,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:34:49,079 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-01-10 07:34:49,079 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 195 states and 219 transitions. cyclomatic complexity: 28 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-01-10 07:34:49,238 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 195 states and 219 transitions. cyclomatic complexity: 28. 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 380 states and 414 transitions. Complement of second has 15 states. [2025-01-10 07:34:49,239 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-01-10 07:34:49,239 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-01-10 07:34:49,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 58 transitions. [2025-01-10 07:34:49,240 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 58 transitions. Stem has 19 letters. Loop has 25 letters. [2025-01-10 07:34:49,240 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:34:49,240 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-01-10 07:34:49,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:34:49,254 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-10 07:34:49,261 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-10 07:34:49,261 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:34:49,261 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:34:49,261 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 07:34:49,262 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:34:49,285 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-10 07:34:49,293 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-10 07:34:49,293 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:34:49,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:34:49,293 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-01-10 07:34:49,294 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:34:49,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:34:49,415 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-01-10 07:34:49,416 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 195 states and 219 transitions. cyclomatic complexity: 28 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-01-10 07:34:49,483 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Ended with exit code 0 [2025-01-10 07:34:49,586 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 195 states and 219 transitions. cyclomatic complexity: 28. 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 322 states and 354 transitions. Complement of second has 17 states. [2025-01-10 07:34:49,587 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-01-10 07:34:49,587 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-01-10 07:34:49,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 44 transitions. [2025-01-10 07:34:49,587 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 44 transitions. Stem has 19 letters. Loop has 25 letters. [2025-01-10 07:34:49,587 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:34:49,587 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-01-10 07:34:49,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:34:49,602 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-10 07:34:49,610 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-10 07:34:49,610 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:34:49,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:34:49,610 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 07:34:49,611 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:34:49,631 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-10 07:34:49,638 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-10 07:34:49,638 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:34:49,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:34:49,640 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-01-10 07:34:49,641 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:34:49,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:34:49,778 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 5 loop predicates [2025-01-10 07:34:49,778 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 195 states and 219 transitions. cyclomatic complexity: 28 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-01-10 07:34:49,946 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 195 states and 219 transitions. cyclomatic complexity: 28. 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 810 states and 879 transitions. Complement of second has 14 states. [2025-01-10 07:34:49,947 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-01-10 07:34:49,947 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-01-10 07:34:49,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 108 transitions. [2025-01-10 07:34:49,947 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 108 transitions. Stem has 19 letters. Loop has 25 letters. [2025-01-10 07:34:49,947 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:34:49,947 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 108 transitions. Stem has 44 letters. Loop has 25 letters. [2025-01-10 07:34:49,948 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:34:49,948 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 108 transitions. Stem has 19 letters. Loop has 50 letters. [2025-01-10 07:34:49,948 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:34:49,948 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 810 states and 879 transitions. [2025-01-10 07:34:49,951 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2025-01-10 07:34:49,953 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 810 states to 575 states and 632 transitions. [2025-01-10 07:34:49,953 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 45 [2025-01-10 07:34:49,953 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 47 [2025-01-10 07:34:49,953 INFO L73 IsDeterministic]: Start isDeterministic. Operand 575 states and 632 transitions. [2025-01-10 07:34:49,953 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 07:34:49,953 INFO L218 hiAutomatonCegarLoop]: Abstraction has 575 states and 632 transitions. [2025-01-10 07:34:49,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states and 632 transitions. [2025-01-10 07:34:49,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 358. [2025-01-10 07:34:49,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 358 states, 358 states have (on average 1.1173184357541899) internal successors, (400), 357 states have internal predecessors, (400), 0 states have call successors, (0), 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-01-10 07:34:49,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 400 transitions. [2025-01-10 07:34:49,958 INFO L240 hiAutomatonCegarLoop]: Abstraction has 358 states and 400 transitions. [2025-01-10 07:34:49,959 INFO L432 stractBuchiCegarLoop]: Abstraction has 358 states and 400 transitions. [2025-01-10 07:34:49,959 INFO L338 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2025-01-10 07:34:49,959 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 358 states and 400 transitions. [2025-01-10 07:34:49,960 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2025-01-10 07:34:49,960 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:34:49,960 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:34:49,960 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-01-10 07:34:49,960 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-01-10 07:34:49,961 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;main_~j~0#1 := 1 + main_~j~0#1;" [2025-01-10 07:34:49,961 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;" [2025-01-10 07:34:49,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:34:49,961 INFO L85 PathProgramCache]: Analyzing trace with hash 1695572675, now seen corresponding path program 1 times [2025-01-10 07:34:49,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:34:49,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788572955] [2025-01-10 07:34:49,961 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:34:49,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:34:49,964 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-10 07:34:49,968 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-10 07:34:49,968 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:34:49,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:34:49,968 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:34:49,969 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-10 07:34:49,972 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-10 07:34:49,972 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:34:49,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:34:49,974 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:34:49,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:34:49,974 INFO L85 PathProgramCache]: Analyzing trace with hash 1131509443, now seen corresponding path program 3 times [2025-01-10 07:34:49,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:34:49,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043750017] [2025-01-10 07:34:49,974 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 07:34:49,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:34:49,977 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 1 equivalence classes. [2025-01-10 07:34:49,981 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-10 07:34:49,982 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-10 07:34:49,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:34:49,982 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:34:49,983 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-10 07:34:49,985 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-10 07:34:49,985 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:34:49,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:34:49,986 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:34:49,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:34:49,986 INFO L85 PathProgramCache]: Analyzing trace with hash 1222922817, now seen corresponding path program 1 times [2025-01-10 07:34:49,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:34:49,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606310319] [2025-01-10 07:34:49,986 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:34:49,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:34:49,990 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-01-10 07:34:49,994 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-01-10 07:34:49,994 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:34:49,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:34:50,080 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 10 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:34:50,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:34:50,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606310319] [2025-01-10 07:34:50,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606310319] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 07:34:50,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [127851008] [2025-01-10 07:34:50,081 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:34:50,081 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 07:34:50,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:34:50,084 INFO L229 MonitoredProcess]: Starting monitored process 58 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 07:34:50,085 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (58)] Waiting until timeout for monitored process [2025-01-10 07:34:50,117 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-01-10 07:34:50,130 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-01-10 07:34:50,130 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:34:50,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:34:50,131 INFO L256 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-10 07:34:50,131 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:34:50,306 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:34:50,306 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 07:34:50,445 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 10 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:34:50,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [127851008] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 07:34:50,446 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 07:34:50,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2025-01-10 07:34:50,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18837202] [2025-01-10 07:34:50,446 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 07:34:50,594 INFO L204 LassoAnalysis]: Preferences: [2025-01-10 07:34:50,595 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-01-10 07:34:50,595 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-01-10 07:34:50,595 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-01-10 07:34:50,595 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-01-10 07:34:50,595 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:34:50,595 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-01-10 07:34:50,595 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-01-10 07:34:50,595 INFO L132 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration10_Loop [2025-01-10 07:34:50,595 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-01-10 07:34:50,595 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-01-10 07:34:50,596 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:34:50,607 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:34:50,609 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:34:50,610 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:34:50,612 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:34:50,643 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-01-10 07:34:50,643 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-01-10 07:34:50,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:34:50,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:34:50,646 INFO L229 MonitoredProcess]: Starting monitored process 59 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:34:50,647 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Waiting until timeout for monitored process [2025-01-10 07:34:50,648 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-01-10 07:34:50,648 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 07:34:50,674 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Ended with exit code 0 [2025-01-10 07:34:50,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:34:50,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:34:50,677 INFO L229 MonitoredProcess]: Starting monitored process 60 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:34:50,678 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Waiting until timeout for monitored process [2025-01-10 07:34:50,679 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-01-10 07:34:50,680 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 07:34:50,746 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-01-10 07:34:50,751 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Ended with exit code 0 [2025-01-10 07:34:50,751 INFO L204 LassoAnalysis]: Preferences: [2025-01-10 07:34:50,751 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-01-10 07:34:50,751 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-01-10 07:34:50,751 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-01-10 07:34:50,751 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-01-10 07:34:50,751 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:34:50,751 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-01-10 07:34:50,751 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-01-10 07:34:50,751 INFO L132 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration10_Loop [2025-01-10 07:34:50,751 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-01-10 07:34:50,751 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-01-10 07:34:50,752 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:34:50,763 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:34:50,764 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:34:50,766 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:34:50,768 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:34:50,800 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-01-10 07:34:50,800 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-01-10 07:34:50,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:34:50,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:34:50,802 INFO L229 MonitoredProcess]: Starting monitored process 61 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:34:50,803 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Waiting until timeout for monitored process [2025-01-10 07:34:50,804 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-01-10 07:34:50,815 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:34:50,815 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:34:50,815 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:34:50,815 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:34:50,815 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:34:50,819 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:34:50,819 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:34:50,821 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-01-10 07:34:50,825 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-01-10 07:34:50,825 INFO L444 ModelExtractionUtils]: 3 out of 6 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-01-10 07:34:50,825 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:34:50,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:34:50,827 INFO L229 MonitoredProcess]: Starting monitored process 62 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:34:50,828 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Waiting until timeout for monitored process [2025-01-10 07:34:50,829 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-01-10 07:34:50,829 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-01-10 07:34:50,829 INFO L474 LassoAnalysis]: Proved termination. [2025-01-10 07:34:50,829 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-01-10 07:34:50,836 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Ended with exit code 0 [2025-01-10 07:34:50,837 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-01-10 07:34:50,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:34:50,855 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-10 07:34:50,862 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-10 07:34:50,863 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:34:50,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:34:50,863 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 07:34:50,864 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:34:50,892 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-10 07:34:50,898 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-10 07:34:50,898 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:34:50,898 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:34:50,898 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-01-10 07:34:50,899 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:34:50,996 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Forceful destruction successful, exit code 0 [2025-01-10 07:34:51,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:34:51,041 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-01-10 07:34:51,041 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 358 states and 400 transitions. cyclomatic complexity: 47 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-01-10 07:34:51,229 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 358 states and 400 transitions. cyclomatic complexity: 47. 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 993 states and 1092 transitions. Complement of second has 17 states. [2025-01-10 07:34:51,229 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-01-10 07:34:51,229 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-01-10 07:34:51,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 108 transitions. [2025-01-10 07:34:51,230 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 108 transitions. Stem has 30 letters. Loop has 25 letters. [2025-01-10 07:34:51,230 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:34:51,230 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 108 transitions. Stem has 55 letters. Loop has 25 letters. [2025-01-10 07:34:51,230 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:34:51,230 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 108 transitions. Stem has 30 letters. Loop has 50 letters. [2025-01-10 07:34:51,231 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:34:51,231 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 993 states and 1092 transitions. [2025-01-10 07:34:51,234 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2025-01-10 07:34:51,236 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 993 states to 787 states and 876 transitions. [2025-01-10 07:34:51,237 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 34 [2025-01-10 07:34:51,237 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 34 [2025-01-10 07:34:51,237 INFO L73 IsDeterministic]: Start isDeterministic. Operand 787 states and 876 transitions. [2025-01-10 07:34:51,237 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 07:34:51,237 INFO L218 hiAutomatonCegarLoop]: Abstraction has 787 states and 876 transitions. [2025-01-10 07:34:51,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 787 states and 876 transitions. [2025-01-10 07:34:51,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 787 to 678. [2025-01-10 07:34:51,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 678 states, 678 states have (on average 1.1179941002949854) internal successors, (758), 677 states have internal predecessors, (758), 0 states have call successors, (0), 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-01-10 07:34:51,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 678 states to 678 states and 758 transitions. [2025-01-10 07:34:51,245 INFO L240 hiAutomatonCegarLoop]: Abstraction has 678 states and 758 transitions. [2025-01-10 07:34:51,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:34:51,245 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-01-10 07:34:51,245 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=306, Unknown=0, NotChecked=0, Total=380 [2025-01-10 07:34:51,245 INFO L87 Difference]: Start difference. First operand 678 states and 758 transitions. Second operand has 20 states, 20 states have (on average 6.5) internal successors, (130), 20 states have internal predecessors, (130), 0 states have call successors, (0), 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-01-10 07:34:52,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:34:52,130 INFO L93 Difference]: Finished difference Result 4144 states and 4479 transitions. [2025-01-10 07:34:52,131 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4144 states and 4479 transitions. [2025-01-10 07:34:52,144 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 128 [2025-01-10 07:34:52,153 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4144 states to 3772 states and 4083 transitions. [2025-01-10 07:34:52,153 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 155 [2025-01-10 07:34:52,154 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 155 [2025-01-10 07:34:52,154 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3772 states and 4083 transitions. [2025-01-10 07:34:52,154 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 07:34:52,154 INFO L218 hiAutomatonCegarLoop]: Abstraction has 3772 states and 4083 transitions. [2025-01-10 07:34:52,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3772 states and 4083 transitions. [2025-01-10 07:34:52,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3772 to 1296. [2025-01-10 07:34:52,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1296 states, 1296 states have (on average 1.1126543209876543) internal successors, (1442), 1295 states have internal predecessors, (1442), 0 states have call successors, (0), 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-01-10 07:34:52,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1296 states to 1296 states and 1442 transitions. [2025-01-10 07:34:52,177 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1296 states and 1442 transitions. [2025-01-10 07:34:52,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2025-01-10 07:34:52,178 INFO L432 stractBuchiCegarLoop]: Abstraction has 1296 states and 1442 transitions. [2025-01-10 07:34:52,178 INFO L338 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2025-01-10 07:34:52,178 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1296 states and 1442 transitions. [2025-01-10 07:34:52,181 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2025-01-10 07:34:52,181 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:34:52,181 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:34:52,182 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2025-01-10 07:34:52,182 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-01-10 07:34:52,182 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;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;main_~j~0#1 := 1 + main_~j~0#1;" [2025-01-10 07:34:52,182 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;" [2025-01-10 07:34:52,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:34:52,183 INFO L85 PathProgramCache]: Analyzing trace with hash 1316242565, now seen corresponding path program 1 times [2025-01-10 07:34:52,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:34:52,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644933473] [2025-01-10 07:34:52,183 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:34:52,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:34:52,188 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-01-10 07:34:52,193 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-01-10 07:34:52,193 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:34:52,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:34:52,193 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:34:52,194 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-01-10 07:34:52,198 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-01-10 07:34:52,198 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:34:52,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:34:52,201 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:34:52,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:34:52,202 INFO L85 PathProgramCache]: Analyzing trace with hash 1131509443, now seen corresponding path program 4 times [2025-01-10 07:34:52,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:34:52,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878000797] [2025-01-10 07:34:52,202 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 07:34:52,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:34:52,206 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-01-10 07:34:52,213 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-01-10 07:34:52,214 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 07:34:52,214 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:34:52,214 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:34:52,215 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-10 07:34:52,217 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-10 07:34:52,217 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:34:52,217 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:34:52,218 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:34:52,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:34:52,219 INFO L85 PathProgramCache]: Analyzing trace with hash 228626111, now seen corresponding path program 1 times [2025-01-10 07:34:52,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:34:52,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994068000] [2025-01-10 07:34:52,219 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:34:52,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:34:52,225 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-01-10 07:34:52,231 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-01-10 07:34:52,231 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:34:52,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:34:52,231 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:34:52,233 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-01-10 07:34:52,238 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-01-10 07:34:52,238 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:34:52,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:34:52,242 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:34:52,436 INFO L204 LassoAnalysis]: Preferences: [2025-01-10 07:34:52,439 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-01-10 07:34:52,439 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-01-10 07:34:52,439 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-01-10 07:34:52,439 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-01-10 07:34:52,440 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:34:52,440 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-01-10 07:34:52,440 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-01-10 07:34:52,440 INFO L132 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration11_Loop [2025-01-10 07:34:52,440 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-01-10 07:34:52,440 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-01-10 07:34:52,440 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:34:52,453 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:34:52,459 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:34:52,460 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:34:52,462 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:34:52,515 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-01-10 07:34:52,515 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-01-10 07:34:52,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:34:52,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:34:52,524 INFO L229 MonitoredProcess]: Starting monitored process 63 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:34:52,527 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-01-10 07:34:52,527 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 07:34:52,528 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Waiting until timeout for monitored process [2025-01-10 07:34:52,556 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Forceful destruction successful, exit code 0 [2025-01-10 07:34:52,556 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:34:52,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:34:52,561 INFO L229 MonitoredProcess]: Starting monitored process 64 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:34:52,563 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Waiting until timeout for monitored process [2025-01-10 07:34:52,564 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-01-10 07:34:52,565 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 07:34:52,628 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-01-10 07:34:52,634 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Ended with exit code 0 [2025-01-10 07:34:52,634 INFO L204 LassoAnalysis]: Preferences: [2025-01-10 07:34:52,634 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-01-10 07:34:52,634 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-01-10 07:34:52,634 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-01-10 07:34:52,634 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-01-10 07:34:52,634 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:34:52,634 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-01-10 07:34:52,634 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-01-10 07:34:52,634 INFO L132 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration11_Loop [2025-01-10 07:34:52,634 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-01-10 07:34:52,634 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-01-10 07:34:52,635 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:34:52,662 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:34:52,665 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:34:52,669 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:34:52,670 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:34:52,722 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-01-10 07:34:52,722 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-01-10 07:34:52,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:34:52,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:34:52,725 INFO L229 MonitoredProcess]: Starting monitored process 65 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:34:52,732 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Waiting until timeout for monitored process [2025-01-10 07:34:52,733 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-01-10 07:34:52,744 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:34:52,745 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:34:52,745 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:34:52,745 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:34:52,745 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:34:52,746 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:34:52,746 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:34:52,749 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-01-10 07:34:52,753 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-01-10 07:34:52,753 INFO L444 ModelExtractionUtils]: 2 out of 6 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-01-10 07:34:52,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:34:52,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:34:52,755 INFO L229 MonitoredProcess]: Starting monitored process 66 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:34:52,756 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Waiting until timeout for monitored process [2025-01-10 07:34:52,758 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-01-10 07:34:52,758 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-01-10 07:34:52,758 INFO L474 LassoAnalysis]: Proved termination. [2025-01-10 07:34:52,758 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 - 2*ULTIMATE.start_main_~j~0#1 Supporting invariants [] [2025-01-10 07:34:52,764 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Ended with exit code 0 [2025-01-10 07:34:52,765 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-01-10 07:34:52,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:34:52,785 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-01-10 07:34:52,800 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-01-10 07:34:52,801 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:34:52,801 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:34:52,801 INFO L256 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 07:34:52,802 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:34:52,855 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-10 07:34:52,861 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-10 07:34:52,862 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:34:52,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:34:52,862 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-10 07:34:52,863 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:34:52,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:34:52,961 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-01-10 07:34:52,961 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1296 states and 1442 transitions. cyclomatic complexity: 160 Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 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-01-10 07:34:53,067 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1296 states and 1442 transitions. cyclomatic complexity: 160. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 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 1801 states and 1984 transitions. Complement of second has 9 states. [2025-01-10 07:34:53,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2025-01-10 07:34:53,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 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-01-10 07:34:53,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 107 transitions. [2025-01-10 07:34:53,068 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 107 transitions. Stem has 62 letters. Loop has 25 letters. [2025-01-10 07:34:53,068 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:34:53,068 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-01-10 07:34:53,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:34:53,084 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-01-10 07:34:53,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-01-10 07:34:53,098 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:34:53,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:34:53,099 INFO L256 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 07:34:53,099 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:34:53,154 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-10 07:34:53,160 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-10 07:34:53,160 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:34:53,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:34:53,160 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-10 07:34:53,161 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:34:53,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:34:53,282 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-01-10 07:34:53,282 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1296 states and 1442 transitions. cyclomatic complexity: 160 Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 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-01-10 07:34:53,467 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1296 states and 1442 transitions. cyclomatic complexity: 160. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 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 2026 states and 2214 transitions. Complement of second has 17 states. [2025-01-10 07:34:53,468 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-01-10 07:34:53,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 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-01-10 07:34:53,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 107 transitions. [2025-01-10 07:34:53,468 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 107 transitions. Stem has 62 letters. Loop has 25 letters. [2025-01-10 07:34:53,468 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:34:53,468 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-01-10 07:34:53,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:34:53,486 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-01-10 07:34:53,500 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-01-10 07:34:53,500 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:34:53,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:34:53,501 INFO L256 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 07:34:53,502 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:34:53,553 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-10 07:34:53,559 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-10 07:34:53,559 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:34:53,559 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:34:53,559 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-10 07:34:53,560 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:34:53,581 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Forceful destruction successful, exit code 0 [2025-01-10 07:34:53,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:34:53,673 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-01-10 07:34:53,673 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1296 states and 1442 transitions. cyclomatic complexity: 160 Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 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-01-10 07:34:53,758 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1296 states and 1442 transitions. cyclomatic complexity: 160. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 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 1905 states and 2100 transitions. Complement of second has 10 states. [2025-01-10 07:34:53,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2025-01-10 07:34:53,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 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-01-10 07:34:53,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 108 transitions. [2025-01-10 07:34:53,759 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 108 transitions. Stem has 62 letters. Loop has 25 letters. [2025-01-10 07:34:53,759 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:34:53,759 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 108 transitions. Stem has 87 letters. Loop has 25 letters. [2025-01-10 07:34:53,760 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:34:53,760 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 108 transitions. Stem has 62 letters. Loop has 50 letters. [2025-01-10 07:34:53,760 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:34:53,760 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1905 states and 2100 transitions. [2025-01-10 07:34:53,771 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-01-10 07:34:53,774 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1905 states to 0 states and 0 transitions. [2025-01-10 07:34:53,775 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-01-10 07:34:53,775 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-01-10 07:34:53,775 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-01-10 07:34:53,775 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-01-10 07:34:53,775 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-10 07:34:53,775 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-10 07:34:53,775 INFO L432 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-10 07:34:53,775 INFO L338 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2025-01-10 07:34:53,775 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-01-10 07:34:53,775 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-01-10 07:34:53,775 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-01-10 07:34:53,786 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.01 07:34:53 BoogieIcfgContainer [2025-01-10 07:34:53,786 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-01-10 07:34:53,787 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-10 07:34:53,787 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-10 07:34:53,787 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-10 07:34:53,787 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 07:34:42" (3/4) ... [2025-01-10 07:34:53,789 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-10 07:34:53,789 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-10 07:34:53,790 INFO L158 Benchmark]: Toolchain (without parser) took 12208.51ms. Allocated memory was 167.8MB in the beginning and 243.3MB in the end (delta: 75.5MB). Free memory was 133.6MB in the beginning and 167.2MB in the end (delta: -33.5MB). Peak memory consumption was 37.9MB. Max. memory is 16.1GB. [2025-01-10 07:34:53,790 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 201.3MB. Free memory was 126.3MB in the beginning and 126.1MB in the end (delta: 293.7kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 07:34:53,791 INFO L158 Benchmark]: CACSL2BoogieTranslator took 263.49ms. Allocated memory is still 167.8MB. Free memory was 133.6MB in the beginning and 122.5MB in the end (delta: 11.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 07:34:53,791 INFO L158 Benchmark]: Boogie Procedure Inliner took 18.92ms. Allocated memory is still 167.8MB. Free memory was 122.5MB in the beginning and 120.8MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 07:34:53,791 INFO L158 Benchmark]: Boogie Preprocessor took 26.01ms. Allocated memory is still 167.8MB. Free memory was 120.8MB in the beginning and 118.8MB in the end (delta: 2.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 07:34:53,792 INFO L158 Benchmark]: RCFGBuilder took 317.88ms. Allocated memory is still 167.8MB. Free memory was 118.8MB in the beginning and 103.3MB in the end (delta: 15.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 07:34:53,792 INFO L158 Benchmark]: BuchiAutomizer took 11574.03ms. Allocated memory was 167.8MB in the beginning and 243.3MB in the end (delta: 75.5MB). Free memory was 102.9MB in the beginning and 167.2MB in the end (delta: -64.4MB). Peak memory consumption was 4.4MB. Max. memory is 16.1GB. [2025-01-10 07:34:53,792 INFO L158 Benchmark]: Witness Printer took 2.45ms. Allocated memory is still 243.3MB. Free memory was 167.2MB in the beginning and 167.2MB in the end (delta: 69.3kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 07:34:53,793 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 201.3MB. Free memory was 126.3MB in the beginning and 126.1MB in the end (delta: 293.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 263.49ms. Allocated memory is still 167.8MB. Free memory was 133.6MB in the beginning and 122.5MB in the end (delta: 11.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 18.92ms. Allocated memory is still 167.8MB. Free memory was 122.5MB in the beginning and 120.8MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 26.01ms. Allocated memory is still 167.8MB. Free memory was 120.8MB in the beginning and 118.8MB in the end (delta: 2.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 317.88ms. Allocated memory is still 167.8MB. Free memory was 118.8MB in the beginning and 103.3MB in the end (delta: 15.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * BuchiAutomizer took 11574.03ms. Allocated memory was 167.8MB in the beginning and 243.3MB in the end (delta: 75.5MB). Free memory was 102.9MB in the beginning and 167.2MB in the end (delta: -64.4MB). Peak memory consumption was 4.4MB. Max. memory is 16.1GB. * Witness Printer took 2.45ms. Allocated memory is still 243.3MB. Free memory was 167.2MB in the beginning and 167.2MB 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 17 terminating modules (8 trivial, 7 deterministic, 2 nondeterministic). One deterministic module has affine ranking function l and consists of 4 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) -4 * j) + ((long long) 3 * r)) and consists of 7 locations. One deterministic module has affine ranking function (((long long) -2 * j) + n) and consists of 9 locations. One nondeterministic module has affine ranking function (((long long) -1 * j) + n) and consists of 8 locations. One nondeterministic module has affine ranking function (((long long) -2 * j) + r) and consists of 5 locations. 8 modules have a trivial ranking function, the largest among these consists of 20 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 11.5s and 12 iterations. TraceHistogramMax:3. Analysis of lassos took 6.2s. Construction of modules took 1.3s. Büchi inclusion checks took 3.6s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 14. Automata minimization 0.1s AutomataMinimizationTime, 16 MinimizatonAttempts, 4006 StatesRemovedByMinimization, 15 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [7, 0, 2, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3129 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3116 mSDsluCounter, 2992 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1864 mSDsCounter, 222 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2509 IncrementalHoareTripleChecker+Invalid, 2731 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 222 mSolverCounterUnsat, 1128 mSDtfsCounter, 2509 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT3 conc0 concLT6 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital27 mio100 ax100 hnf100 lsp100 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq147 hnf93 smp100 dnf100 smp100 tf105 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 22ms VariablesStem: 0 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 12 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 9 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 1.3s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-01-10 07:34:53,809 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (58)] Ended with exit code 0 [2025-01-10 07:34:54,004 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Forceful destruction successful, exit code 0 [2025-01-10 07:34:54,205 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE