./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 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/loop-invgen/heapsort.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8e7c8e5dc2a9e8f11b25d1bb9948f05f37b9553e3dc9f8bd8213088dea43cb37 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 20:21:29,206 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 20:21:29,253 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2025-03-17 20:21:29,256 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 20:21:29,256 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 20:21:29,256 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2025-03-17 20:21:29,279 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 20:21:29,280 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 20:21:29,280 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 20:21:29,280 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 20:21:29,280 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 20:21:29,280 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 20:21:29,280 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 20:21:29,280 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 20:21:29,281 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-03-17 20:21:29,281 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-03-17 20:21:29,281 INFO L153 SettingsManager]: * Use old map elimination=false [2025-03-17 20:21:29,281 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-03-17 20:21:29,281 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-03-17 20:21:29,281 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-03-17 20:21:29,281 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 20:21:29,281 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-03-17 20:21:29,281 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 20:21:29,281 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 20:21:29,281 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 20:21:29,281 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 20:21:29,282 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-03-17 20:21:29,282 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-03-17 20:21:29,282 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-03-17 20:21:29,282 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 20:21:29,282 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 20:21:29,282 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 20:21:29,282 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-03-17 20:21:29,282 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 20:21:29,282 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 20:21:29,282 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 20:21:29,283 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 20:21:29,283 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 20:21:29,283 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 20:21:29,283 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-03-17 20:21:29,283 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8e7c8e5dc2a9e8f11b25d1bb9948f05f37b9553e3dc9f8bd8213088dea43cb37 [2025-03-17 20:21:29,529 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 20:21:29,534 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 20:21:29,535 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 20:21:29,536 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 20:21:29,537 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 20:21:29,537 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-invgen/heapsort.i [2025-03-17 20:21:30,699 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6c20281f3/6afe482a6bef4a80babb3d64396e81c0/FLAG2992a7170 [2025-03-17 20:21:30,974 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 20:21:30,975 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/heapsort.i [2025-03-17 20:21:30,980 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6c20281f3/6afe482a6bef4a80babb3d64396e81c0/FLAG2992a7170 [2025-03-17 20:21:31,285 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6c20281f3/6afe482a6bef4a80babb3d64396e81c0 [2025-03-17 20:21:31,287 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 20:21:31,288 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 20:21:31,288 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 20:21:31,289 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 20:21:31,291 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 20:21:31,292 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 08:21:31" (1/1) ... [2025-03-17 20:21:31,292 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70c934b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:21:31, skipping insertion in model container [2025-03-17 20:21:31,292 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 08:21:31" (1/1) ... [2025-03-17 20:21:31,304 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 20:21:31,416 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 20:21:31,425 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 20:21:31,438 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 20:21:31,450 INFO L204 MainTranslator]: Completed translation [2025-03-17 20:21:31,450 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:21:31 WrapperNode [2025-03-17 20:21:31,450 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 20:21:31,451 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 20:21:31,451 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 20:21:31,451 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 20:21:31,456 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:21:31" (1/1) ... [2025-03-17 20:21:31,461 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:21:31" (1/1) ... [2025-03-17 20:21:31,481 INFO L138 Inliner]: procedures = 16, calls = 21, calls flagged for inlining = 17, calls inlined = 30, statements flattened = 181 [2025-03-17 20:21:31,483 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 20:21:31,484 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 20:21:31,484 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 20:21:31,484 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 20:21:31,489 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:21:31" (1/1) ... [2025-03-17 20:21:31,489 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:21:31" (1/1) ... [2025-03-17 20:21:31,491 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:21:31" (1/1) ... [2025-03-17 20:21:31,503 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-17 20:21:31,503 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:21:31" (1/1) ... [2025-03-17 20:21:31,503 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:21:31" (1/1) ... [2025-03-17 20:21:31,506 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:21:31" (1/1) ... [2025-03-17 20:21:31,506 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:21:31" (1/1) ... [2025-03-17 20:21:31,509 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:21:31" (1/1) ... [2025-03-17 20:21:31,509 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:21:31" (1/1) ... [2025-03-17 20:21:31,510 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 20:21:31,511 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 20:21:31,511 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 20:21:31,511 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 20:21:31,512 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:21:31" (1/1) ... [2025-03-17 20:21:31,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:21:31,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:21:31,543 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:21:31,546 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2025-03-17 20:21:31,565 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 20:21:31,565 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 20:21:31,565 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 20:21:31,565 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 20:21:31,610 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 20:21:31,612 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 20:21:31,805 INFO L? ?]: Removed 55 outVars from TransFormulas that were not future-live. [2025-03-17 20:21:31,805 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 20:21:31,814 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 20:21:31,816 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 20:21:31,818 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 08:21:31 BoogieIcfgContainer [2025-03-17 20:21:31,818 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 20:21:31,819 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-03-17 20:21:31,819 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-03-17 20:21:31,822 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-03-17 20:21:31,823 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-17 20:21:31,823 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 17.03 08:21:31" (1/3) ... [2025-03-17 20:21:31,824 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3f9e1b96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.03 08:21:31, skipping insertion in model container [2025-03-17 20:21:31,824 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-17 20:21:31,824 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:21:31" (2/3) ... [2025-03-17 20:21:31,824 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3f9e1b96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.03 08:21:31, skipping insertion in model container [2025-03-17 20:21:31,824 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-17 20:21:31,824 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 08:21:31" (3/3) ... [2025-03-17 20:21:31,826 INFO L363 chiAutomizerObserver]: Analyzing ICFG heapsort.i [2025-03-17 20:21:31,860 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-03-17 20:21:31,860 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-03-17 20:21:31,860 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-03-17 20:21:31,861 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-03-17 20:21:31,861 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-03-17 20:21:31,861 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-03-17 20:21:31,861 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-03-17 20:21:31,862 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-03-17 20:21:31,866 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 69 states, 68 states have (on average 1.5294117647058822) internal successors, (104), 68 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:21:31,876 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 63 [2025-03-17 20:21:31,877 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:21:31,877 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:21:31,881 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-03-17 20:21:31,881 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-17 20:21:31,881 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-03-17 20:21:31,882 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 69 states, 68 states have (on average 1.5294117647058822) internal successors, (104), 68 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:21:31,884 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 63 [2025-03-17 20:21:31,884 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:21:31,884 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:21:31,884 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-03-17 20:21:31,884 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-17 20:21:31,889 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;main_#in~argc#1, main_#in~argv#1.base, main_#in~argv#1.offset := #in~argc#1, #in~argv#1.base, #in~argv#1.offset;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post2#1, main_#t~post3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post6#1, main_#t~post7#1, main_~argc#1, main_~n~0#1, main_~l~0#1, main_~r~0#1, main_~i~0#1, main_~j~0#1;main_~argc#1 := main_#in~argc#1;havoc main_~n~0#1;havoc main_~l~0#1;havoc main_~r~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet1#1;main_~n~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;" "assume !!(1 <= main_~n~0#1 && main_~n~0#1 <= 1000000);main_~l~0#1 := 1 + (if main_~n~0#1 < 0 && 0 != main_~n~0#1 % 2 then 1 + main_~n~0#1 / 2 else main_~n~0#1 / 2);main_~r~0#1 := main_~n~0#1;" "assume !(main_~l~0#1 > 1);main_#t~post3#1 := main_~r~0#1;main_~r~0#1 := main_#t~post3#1 - 1;havoc main_#t~post3#1;" [2025-03-17 20:21:31,889 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~r~0#1 > 1;main_~i~0#1 := main_~l~0#1;main_~j~0#1 := 2 * main_~l~0#1;" "assume !(main_~j~0#1 <= main_~r~0#1);" "assume !(main_~l~0#1 > 1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 1 <= main_~r~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~r~0#1 <= main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post7#1 := main_~r~0#1;main_~r~0#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1;" [2025-03-17 20:21:31,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:21:31,893 INFO L85 PathProgramCache]: Analyzing trace with hash 136998, now seen corresponding path program 1 times [2025-03-17 20:21:31,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:21:31,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628633422] [2025-03-17 20:21:31,902 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:21:31,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:21:31,947 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 20:21:31,966 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 20:21:31,966 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:21:31,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:21:31,967 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:21:31,972 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 20:21:31,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 20:21:31,982 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:21:31,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:21:31,996 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:21:31,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:21:31,999 INFO L85 PathProgramCache]: Analyzing trace with hash -1135131374, now seen corresponding path program 1 times [2025-03-17 20:21:31,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:21:31,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546930874] [2025-03-17 20:21:31,999 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:21:31,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:21:32,004 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-17 20:21:32,011 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 20:21:32,013 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:21:32,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:21:32,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 20:21:32,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 20:21:32,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546930874] [2025-03-17 20:21:32,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546930874] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 20:21:32,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 20:21:32,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 20:21:32,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813400757] [2025-03-17 20:21:32,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 20:21:32,094 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-17 20:21:32,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 20:21:32,113 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 20:21:32,113 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 20:21:32,115 INFO L87 Difference]: Start difference. First operand has 69 states, 68 states have (on average 1.5294117647058822) internal successors, (104), 68 states have internal predecessors, (104), 0 states have call successors, (0), 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-03-17 20:21:32,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 20:21:32,232 INFO L93 Difference]: Finished difference Result 104 states and 116 transitions. [2025-03-17 20:21:32,233 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 104 states and 116 transitions. [2025-03-17 20:21:32,236 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 70 [2025-03-17 20:21:32,240 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 104 states to 73 states and 84 transitions. [2025-03-17 20:21:32,241 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 73 [2025-03-17 20:21:32,241 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 73 [2025-03-17 20:21:32,241 INFO L73 IsDeterministic]: Start isDeterministic. Operand 73 states and 84 transitions. [2025-03-17 20:21:32,241 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-17 20:21:32,242 INFO L218 hiAutomatonCegarLoop]: Abstraction has 73 states and 84 transitions. [2025-03-17 20:21:32,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states and 84 transitions. [2025-03-17 20:21:32,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 40. [2025-03-17 20:21:32,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 40 states have (on average 1.175) internal successors, (47), 39 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:21:32,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 47 transitions. [2025-03-17 20:21:32,263 INFO L240 hiAutomatonCegarLoop]: Abstraction has 40 states and 47 transitions. [2025-03-17 20:21:32,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 20:21:32,266 INFO L432 stractBuchiCegarLoop]: Abstraction has 40 states and 47 transitions. [2025-03-17 20:21:32,267 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-03-17 20:21:32,267 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 47 transitions. [2025-03-17 20:21:32,268 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 37 [2025-03-17 20:21:32,268 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:21:32,268 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:21:32,268 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-03-17 20:21:32,268 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-17 20:21:32,268 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;main_#in~argc#1, main_#in~argv#1.base, main_#in~argv#1.offset := #in~argc#1, #in~argv#1.base, #in~argv#1.offset;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post2#1, main_#t~post3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post6#1, main_#t~post7#1, main_~argc#1, main_~n~0#1, main_~l~0#1, main_~r~0#1, main_~i~0#1, main_~j~0#1;main_~argc#1 := main_#in~argc#1;havoc main_~n~0#1;havoc main_~l~0#1;havoc main_~r~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet1#1;main_~n~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;" "assume !!(1 <= main_~n~0#1 && main_~n~0#1 <= 1000000);main_~l~0#1 := 1 + (if main_~n~0#1 < 0 && 0 != main_~n~0#1 % 2 then 1 + main_~n~0#1 / 2 else main_~n~0#1 / 2);main_~r~0#1 := main_~n~0#1;" "assume !(main_~l~0#1 > 1);main_#t~post3#1 := main_~r~0#1;main_~r~0#1 := main_#t~post3#1 - 1;havoc main_#t~post3#1;" [2025-03-17 20:21:32,269 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~r~0#1 > 1;main_~i~0#1 := main_~l~0#1;main_~j~0#1 := 2 * main_~l~0#1;" "assume !(main_~j~0#1 <= main_~r~0#1);" "assume main_~l~0#1 > 1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 1 <= main_~l~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~l~0#1 <= main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post6#1 := main_~l~0#1;main_~l~0#1 := main_#t~post6#1 - 1;havoc main_#t~post6#1;" [2025-03-17 20:21:32,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:21:32,269 INFO L85 PathProgramCache]: Analyzing trace with hash 136998, now seen corresponding path program 2 times [2025-03-17 20:21:32,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:21:32,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693492432] [2025-03-17 20:21:32,272 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 20:21:32,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:21:32,278 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-03-17 20:21:32,287 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 20:21:32,289 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 20:21:32,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:21:32,290 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:21:32,292 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 20:21:32,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 20:21:32,302 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:21:32,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:21:32,304 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:21:32,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:21:32,307 INFO L85 PathProgramCache]: Analyzing trace with hash -1147537339, now seen corresponding path program 1 times [2025-03-17 20:21:32,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:21:32,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460573601] [2025-03-17 20:21:32,308 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:21:32,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:21:32,313 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-17 20:21:32,319 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 20:21:32,319 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:21:32,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:21:32,319 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:21:32,321 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-17 20:21:32,327 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 20:21:32,328 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:21:32,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:21:32,333 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:21:32,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:21:32,333 INFO L85 PathProgramCache]: Analyzing trace with hash 1407942016, now seen corresponding path program 1 times [2025-03-17 20:21:32,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:21:32,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210273610] [2025-03-17 20:21:32,333 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:21:32,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:21:32,343 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-17 20:21:32,350 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-17 20:21:32,350 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:21:32,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:21:32,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 20:21:32,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 20:21:32,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210273610] [2025-03-17 20:21:32,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210273610] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 20:21:32,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 20:21:32,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 20:21:32,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695087106] [2025-03-17 20:21:32,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 20:21:32,494 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 20:21:32,495 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 20:21:32,495 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 20:21:32,495 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 20:21:32,495 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-17 20:21:32,495 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:21:32,495 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 20:21:32,496 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 20:21:32,496 INFO L132 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration2_Loop [2025-03-17 20:21:32,496 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 20:21:32,496 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 20:21:32,506 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:21:32,522 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:21:32,524 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:21:32,526 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:21:32,528 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:21:32,587 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 20:21:32,588 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-17 20:21:32,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:21:32,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:21:32,592 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:21:32,594 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2025-03-17 20:21:32,595 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 20:21:32,595 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 20:21:32,616 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2025-03-17 20:21:32,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:21:32,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:21:32,618 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:21:32,619 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-03-17 20:21:32,622 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-17 20:21:32,622 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 20:21:32,685 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-17 20:21:32,690 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2025-03-17 20:21:32,690 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 20:21:32,690 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 20:21:32,690 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 20:21:32,690 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 20:21:32,690 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 20:21:32,690 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:21:32,690 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 20:21:32,690 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 20:21:32,690 INFO L132 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration2_Loop [2025-03-17 20:21:32,690 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 20:21:32,690 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 20:21:32,691 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:21:32,695 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:21:32,697 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:21:32,709 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:21:32,711 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:21:32,750 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 20:21:32,753 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 20:21:32,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:21:32,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:21:32,758 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:21:32,760 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-03-17 20:21:32,761 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:21:32,773 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:21:32,773 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:21:32,773 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:21:32,773 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:21:32,773 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:21:32,779 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:21:32,779 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:21:32,781 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:21:32,787 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2025-03-17 20:21:32,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:21:32,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:21:32,790 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:21:32,791 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-03-17 20:21:32,793 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:21:32,803 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:21:32,803 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:21:32,803 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:21:32,803 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:21:32,803 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:21:32,804 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:21:32,804 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:21:32,806 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:21:32,811 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2025-03-17 20:21:32,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:21:32,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:21:32,813 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:21:32,814 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-03-17 20:21:32,815 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:21:32,827 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:21:32,828 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:21:32,828 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:21:32,828 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:21:32,828 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:21:32,830 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:21:32,830 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:21:32,833 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-17 20:21:32,840 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-17 20:21:32,843 INFO L444 ModelExtractionUtils]: 3 out of 6 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-03-17 20:21:32,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:21:32,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:21:32,847 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:21:32,848 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-03-17 20:21:32,849 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-17 20:21:32,849 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-17 20:21:32,849 INFO L474 LassoAnalysis]: Proved termination. [2025-03-17 20:21:32,850 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~l~0#1) = 1*ULTIMATE.start_main_~l~0#1 Supporting invariants [] [2025-03-17 20:21:32,858 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2025-03-17 20:21:32,860 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-17 20:21:32,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:21:32,898 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 20:21:32,903 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 20:21:32,903 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:21:32,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:21:32,905 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 20:21:32,906 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:21:32,917 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-17 20:21:32,923 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 20:21:32,923 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:21:32,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:21:32,924 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 20:21:32,924 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:21:32,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 20:21:32,960 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-03-17 20:21:32,961 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 40 states and 47 transitions. cyclomatic complexity: 8 Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:21:33,016 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 40 states and 47 transitions. cyclomatic complexity: 8. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 117 states and 138 transitions. Complement of second has 6 states. [2025-03-17 20:21:33,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-03-17 20:21:33,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:21:33,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 85 transitions. [2025-03-17 20:21:33,021 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 85 transitions. Stem has 3 letters. Loop has 7 letters. [2025-03-17 20:21:33,022 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:21:33,022 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 85 transitions. Stem has 10 letters. Loop has 7 letters. [2025-03-17 20:21:33,022 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:21:33,022 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 85 transitions. Stem has 3 letters. Loop has 14 letters. [2025-03-17 20:21:33,023 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:21:33,023 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 117 states and 138 transitions. [2025-03-17 20:21:33,024 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 69 [2025-03-17 20:21:33,025 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 117 states to 112 states and 131 transitions. [2025-03-17 20:21:33,025 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 73 [2025-03-17 20:21:33,026 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 74 [2025-03-17 20:21:33,026 INFO L73 IsDeterministic]: Start isDeterministic. Operand 112 states and 131 transitions. [2025-03-17 20:21:33,026 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 20:21:33,026 INFO L218 hiAutomatonCegarLoop]: Abstraction has 112 states and 131 transitions. [2025-03-17 20:21:33,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states and 131 transitions. [2025-03-17 20:21:33,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 111. [2025-03-17 20:21:33,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 111 states have (on average 1.1711711711711712) internal successors, (130), 110 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-03-17 20:21:33,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 130 transitions. [2025-03-17 20:21:33,031 INFO L240 hiAutomatonCegarLoop]: Abstraction has 111 states and 130 transitions. [2025-03-17 20:21:33,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 20:21:33,031 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 20:21:33,031 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 20:21:33,031 INFO L87 Difference]: Start difference. First operand 111 states and 130 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:21:33,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 20:21:33,047 INFO L93 Difference]: Finished difference Result 135 states and 155 transitions. [2025-03-17 20:21:33,047 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 135 states and 155 transitions. [2025-03-17 20:21:33,051 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 97 [2025-03-17 20:21:33,052 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 135 states to 101 states and 116 transitions. [2025-03-17 20:21:33,052 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 101 [2025-03-17 20:21:33,052 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 101 [2025-03-17 20:21:33,052 INFO L73 IsDeterministic]: Start isDeterministic. Operand 101 states and 116 transitions. [2025-03-17 20:21:33,052 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-17 20:21:33,052 INFO L218 hiAutomatonCegarLoop]: Abstraction has 101 states and 116 transitions. [2025-03-17 20:21:33,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states and 116 transitions. [2025-03-17 20:21:33,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 68. [2025-03-17 20:21:33,058 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-03-17 20:21:33,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 79 transitions. [2025-03-17 20:21:33,059 INFO L240 hiAutomatonCegarLoop]: Abstraction has 68 states and 79 transitions. [2025-03-17 20:21:33,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 20:21:33,061 INFO L432 stractBuchiCegarLoop]: Abstraction has 68 states and 79 transitions. [2025-03-17 20:21:33,061 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-03-17 20:21:33,061 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 68 states and 79 transitions. [2025-03-17 20:21:33,061 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 65 [2025-03-17 20:21:33,061 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:21:33,061 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:21:33,062 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-03-17 20:21:33,062 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-17 20:21:33,062 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;main_#in~argc#1, main_#in~argv#1.base, main_#in~argv#1.offset := #in~argc#1, #in~argv#1.base, #in~argv#1.offset;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post2#1, main_#t~post3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post6#1, main_#t~post7#1, main_~argc#1, main_~n~0#1, main_~l~0#1, main_~r~0#1, main_~i~0#1, main_~j~0#1;main_~argc#1 := main_#in~argc#1;havoc main_~n~0#1;havoc main_~l~0#1;havoc main_~r~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet1#1;main_~n~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;" "assume !!(1 <= main_~n~0#1 && main_~n~0#1 <= 1000000);main_~l~0#1 := 1 + (if main_~n~0#1 < 0 && 0 != main_~n~0#1 % 2 then 1 + main_~n~0#1 / 2 else main_~n~0#1 / 2);main_~r~0#1 := main_~n~0#1;" "assume main_~l~0#1 > 1;main_#t~post2#1 := main_~l~0#1;main_~l~0#1 := main_#t~post2#1 - 1;havoc main_#t~post2#1;" [2025-03-17 20:21:33,062 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~r~0#1 > 1;main_~i~0#1 := main_~l~0#1;main_~j~0#1 := 2 * main_~l~0#1;" "assume !(main_~j~0#1 <= main_~r~0#1);" "assume main_~l~0#1 > 1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 1 <= main_~l~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~l~0#1 <= main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post6#1 := main_~l~0#1;main_~l~0#1 := main_#t~post6#1 - 1;havoc main_#t~post6#1;" [2025-03-17 20:21:33,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:21:33,062 INFO L85 PathProgramCache]: Analyzing trace with hash 136997, now seen corresponding path program 1 times [2025-03-17 20:21:33,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:21:33,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797865253] [2025-03-17 20:21:33,062 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:21:33,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:21:33,069 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 20:21:33,076 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 20:21:33,076 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:21:33,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:21:33,076 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:21:33,080 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 20:21:33,085 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 20:21:33,085 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:21:33,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:21:33,087 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:21:33,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:21:33,087 INFO L85 PathProgramCache]: Analyzing trace with hash -1147537339, now seen corresponding path program 2 times [2025-03-17 20:21:33,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:21:33,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889898632] [2025-03-17 20:21:33,087 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 20:21:33,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:21:33,094 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 7 statements into 1 equivalence classes. [2025-03-17 20:21:33,097 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 20:21:33,097 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 20:21:33,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:21:33,097 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:21:33,098 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-17 20:21:33,101 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 20:21:33,101 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:21:33,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:21:33,102 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:21:33,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:21:33,102 INFO L85 PathProgramCache]: Analyzing trace with hash -334868319, now seen corresponding path program 1 times [2025-03-17 20:21:33,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:21:33,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768584349] [2025-03-17 20:21:33,103 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:21:33,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:21:33,106 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-17 20:21:33,109 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-17 20:21:33,110 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:21:33,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:21:33,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 20:21:33,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 20:21:33,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768584349] [2025-03-17 20:21:33,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768584349] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 20:21:33,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 20:21:33,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 20:21:33,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105807377] [2025-03-17 20:21:33,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 20:21:33,267 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 20:21:33,267 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 20:21:33,267 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 20:21:33,267 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 20:21:33,267 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-17 20:21:33,267 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:21:33,267 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 20:21:33,267 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 20:21:33,267 INFO L132 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration3_Loop [2025-03-17 20:21:33,267 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 20:21:33,267 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 20:21:33,268 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:21:33,270 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:21:33,272 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:21:33,274 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:21:33,282 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:21:33,315 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 20:21:33,315 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-17 20:21:33,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:21:33,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:21:33,318 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:21:33,319 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-03-17 20:21:33,320 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 20:21:33,320 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 20:21:33,334 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 20:21:33,334 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post6#1=0} Honda state: {ULTIMATE.start_main_#t~post6#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-17 20:21:33,339 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2025-03-17 20:21:33,340 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:21:33,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:21:33,341 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:21:33,342 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-03-17 20:21:33,343 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 20:21:33,343 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 20:21:33,354 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 20:21:33,354 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start___VERIFIER_assert_~cond#1=0} Honda state: {ULTIMATE.start___VERIFIER_assert_~cond#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-17 20:21:33,359 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2025-03-17 20:21:33,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:21:33,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:21:33,361 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:21:33,362 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-03-17 20:21:33,363 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 20:21:33,363 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 20:21:33,374 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 20:21:33,374 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start___VERIFIER_assert_#in~cond#1=0} Honda state: {ULTIMATE.start___VERIFIER_assert_#in~cond#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-17 20:21:33,380 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2025-03-17 20:21:33,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:21:33,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:21:33,382 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:21:33,382 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-03-17 20:21:33,383 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 20:21:33,383 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 20:21:33,400 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2025-03-17 20:21:33,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:21:33,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:21:33,402 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:21:33,403 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2025-03-17 20:21:33,404 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-17 20:21:33,404 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 20:21:33,461 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-17 20:21:33,465 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2025-03-17 20:21:33,466 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 20:21:33,466 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 20:21:33,466 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 20:21:33,466 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 20:21:33,466 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 20:21:33,466 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:21:33,466 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 20:21:33,466 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 20:21:33,466 INFO L132 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration3_Loop [2025-03-17 20:21:33,466 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 20:21:33,466 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 20:21:33,467 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:21:33,469 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:21:33,471 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:21:33,479 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:21:33,481 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:21:33,511 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 20:21:33,511 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 20:21:33,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:21:33,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:21:33,513 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:21:33,515 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2025-03-17 20:21:33,516 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:21:33,526 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:21:33,526 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:21:33,526 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:21:33,526 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:21:33,526 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:21:33,526 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:21:33,526 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:21:33,527 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:21:33,533 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2025-03-17 20:21:33,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:21:33,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:21:33,535 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:21:33,536 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2025-03-17 20:21:33,539 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:21:33,549 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:21:33,549 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:21:33,549 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:21:33,549 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:21:33,549 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:21:33,549 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:21:33,549 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:21:33,550 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:21:33,556 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2025-03-17 20:21:33,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:21:33,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:21:33,558 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:21:33,560 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2025-03-17 20:21:33,561 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:21:33,571 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:21:33,572 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:21:33,572 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:21:33,572 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:21:33,572 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:21:33,573 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:21:33,573 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:21:33,576 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-17 20:21:33,579 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-17 20:21:33,579 INFO L444 ModelExtractionUtils]: 3 out of 6 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-03-17 20:21:33,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:21:33,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:21:33,582 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:21:33,583 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2025-03-17 20:21:33,584 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-17 20:21:33,584 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-17 20:21:33,584 INFO L474 LassoAnalysis]: Proved termination. [2025-03-17 20:21:33,584 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~l~0#1) = 1*ULTIMATE.start_main_~l~0#1 Supporting invariants [] [2025-03-17 20:21:33,590 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2025-03-17 20:21:33,591 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-17 20:21:33,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:21:33,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 20:21:33,634 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 20:21:33,635 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:21:33,635 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:21:33,635 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 20:21:33,635 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:21:33,636 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2025-03-17 20:21:33,641 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2025-03-17 20:21:33,646 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-17 20:21:33,648 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 20:21:33,649 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:21:33,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:21:33,649 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 20:21:33,649 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:21:33,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 20:21:33,680 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-03-17 20:21:33,680 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 68 states and 79 transitions. cyclomatic complexity: 13 Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:21:33,709 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 68 states and 79 transitions. cyclomatic complexity: 13. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 165 states and 191 transitions. Complement of second has 6 states. [2025-03-17 20:21:33,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-03-17 20:21:33,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:21:33,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 80 transitions. [2025-03-17 20:21:33,712 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 80 transitions. Stem has 3 letters. Loop has 7 letters. [2025-03-17 20:21:33,712 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:21:33,712 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 80 transitions. Stem has 10 letters. Loop has 7 letters. [2025-03-17 20:21:33,713 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:21:33,713 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 80 transitions. Stem has 3 letters. Loop has 14 letters. [2025-03-17 20:21:33,713 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:21:33,713 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 165 states and 191 transitions. [2025-03-17 20:21:33,714 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 89 [2025-03-17 20:21:33,714 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 165 states to 128 states and 148 transitions. [2025-03-17 20:21:33,717 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 94 [2025-03-17 20:21:33,717 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 95 [2025-03-17 20:21:33,717 INFO L73 IsDeterministic]: Start isDeterministic. Operand 128 states and 148 transitions. [2025-03-17 20:21:33,718 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 20:21:33,718 INFO L218 hiAutomatonCegarLoop]: Abstraction has 128 states and 148 transitions. [2025-03-17 20:21:33,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states and 148 transitions. [2025-03-17 20:21:33,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 67. [2025-03-17 20:21:33,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 67 states have (on average 1.164179104477612) internal successors, (78), 66 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:21:33,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 78 transitions. [2025-03-17 20:21:33,724 INFO L240 hiAutomatonCegarLoop]: Abstraction has 67 states and 78 transitions. [2025-03-17 20:21:33,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 20:21:33,724 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 20:21:33,724 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 20:21:33,724 INFO L87 Difference]: Start difference. First operand 67 states and 78 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:21:33,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 20:21:33,807 INFO L93 Difference]: Finished difference Result 138 states and 156 transitions. [2025-03-17 20:21:33,808 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 138 states and 156 transitions. [2025-03-17 20:21:33,809 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 71 [2025-03-17 20:21:33,812 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 138 states to 138 states and 156 transitions. [2025-03-17 20:21:33,812 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 86 [2025-03-17 20:21:33,812 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 86 [2025-03-17 20:21:33,812 INFO L73 IsDeterministic]: Start isDeterministic. Operand 138 states and 156 transitions. [2025-03-17 20:21:33,813 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 20:21:33,813 INFO L218 hiAutomatonCegarLoop]: Abstraction has 138 states and 156 transitions. [2025-03-17 20:21:33,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states and 156 transitions. [2025-03-17 20:21:33,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 68. [2025-03-17 20:21:33,817 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-03-17 20:21:33,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 79 transitions. [2025-03-17 20:21:33,817 INFO L240 hiAutomatonCegarLoop]: Abstraction has 68 states and 79 transitions. [2025-03-17 20:21:33,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 20:21:33,818 INFO L432 stractBuchiCegarLoop]: Abstraction has 68 states and 79 transitions. [2025-03-17 20:21:33,819 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-03-17 20:21:33,819 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 68 states and 79 transitions. [2025-03-17 20:21:33,819 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 32 [2025-03-17 20:21:33,819 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:21:33,819 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:21:33,820 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-03-17 20:21:33,820 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 20:21:33,820 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;main_#in~argc#1, main_#in~argv#1.base, main_#in~argv#1.offset := #in~argc#1, #in~argv#1.base, #in~argv#1.offset;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post2#1, main_#t~post3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post6#1, main_#t~post7#1, main_~argc#1, main_~n~0#1, main_~l~0#1, main_~r~0#1, main_~i~0#1, main_~j~0#1;main_~argc#1 := main_#in~argc#1;havoc main_~n~0#1;havoc main_~l~0#1;havoc main_~r~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet1#1;main_~n~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;" "assume !!(1 <= main_~n~0#1 && main_~n~0#1 <= 1000000);main_~l~0#1 := 1 + (if main_~n~0#1 < 0 && 0 != main_~n~0#1 % 2 then 1 + main_~n~0#1 / 2 else main_~n~0#1 / 2);main_~r~0#1 := main_~n~0#1;" "assume !(main_~l~0#1 > 1);main_#t~post3#1 := main_~r~0#1;main_~r~0#1 := main_#t~post3#1 - 1;havoc main_#t~post3#1;" [2025-03-17 20:21:33,820 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~r~0#1 > 1;main_~i~0#1 := main_~l~0#1;main_~j~0#1 := 2 * main_~l~0#1;" "assume main_~j~0#1 <= main_~r~0#1;" "assume !(main_~j~0#1 < main_~r~0#1);" "assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 1 <= main_~j~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_#t~nondet5#1;" "assume 0 != main_#t~nondet5#1;havoc main_#t~nondet5#1;" "assume !(main_~l~0#1 > 1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 1 <= main_~r~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~r~0#1 <= main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post7#1 := main_~r~0#1;main_~r~0#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1;" [2025-03-17 20:21:33,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:21:33,821 INFO L85 PathProgramCache]: Analyzing trace with hash 136998, now seen corresponding path program 3 times [2025-03-17 20:21:33,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:21:33,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354778152] [2025-03-17 20:21:33,821 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 20:21:33,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:21:33,827 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 3 statements into 1 equivalence classes. [2025-03-17 20:21:33,832 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 20:21:33,833 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-17 20:21:33,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:21:33,833 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:21:33,835 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 20:21:33,836 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 20:21:33,836 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:21:33,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:21:33,839 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:21:33,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:21:33,842 INFO L85 PathProgramCache]: Analyzing trace with hash -1669542763, now seen corresponding path program 1 times [2025-03-17 20:21:33,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:21:33,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051600578] [2025-03-17 20:21:33,842 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:21:33,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:21:33,845 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-17 20:21:33,849 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-17 20:21:33,849 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:21:33,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:21:33,849 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:21:33,850 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-17 20:21:33,856 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-17 20:21:33,856 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:21:33,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:21:33,860 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:21:33,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:21:33,861 INFO L85 PathProgramCache]: Analyzing trace with hash 608239354, now seen corresponding path program 1 times [2025-03-17 20:21:33,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:21:33,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931993798] [2025-03-17 20:21:33,861 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:21:33,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:21:33,867 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-17 20:21:33,874 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-17 20:21:33,874 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:21:33,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:21:33,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 20:21:33,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 20:21:33,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931993798] [2025-03-17 20:21:33,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1931993798] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 20:21:33,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 20:21:33,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 20:21:33,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588086468] [2025-03-17 20:21:33,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 20:21:34,093 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 20:21:34,094 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 20:21:34,094 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 20:21:34,094 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 20:21:34,094 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-17 20:21:34,094 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:21:34,094 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 20:21:34,094 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 20:21:34,094 INFO L132 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration4_Loop [2025-03-17 20:21:34,094 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 20:21:34,094 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 20:21:34,095 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:21:34,097 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:21:34,107 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:21:34,109 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:21:34,110 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:21:34,155 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 20:21:34,155 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-17 20:21:34,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:21:34,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:21:34,158 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:21:34,159 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2025-03-17 20:21:34,160 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 20:21:34,160 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 20:21:34,171 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 20:21:34,171 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet5#1=0} Honda state: {ULTIMATE.start_main_#t~nondet5#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-17 20:21:34,177 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2025-03-17 20:21:34,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:21:34,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:21:34,179 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:21:34,181 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2025-03-17 20:21:34,183 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 20:21:34,183 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 20:21:34,200 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2025-03-17 20:21:34,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:21:34,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:21:34,202 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:21:34,204 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2025-03-17 20:21:34,205 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-17 20:21:34,205 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 20:21:34,235 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-17 20:21:34,239 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2025-03-17 20:21:34,240 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 20:21:34,240 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 20:21:34,240 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 20:21:34,240 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 20:21:34,240 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 20:21:34,240 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:21:34,240 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 20:21:34,240 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 20:21:34,240 INFO L132 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration4_Loop [2025-03-17 20:21:34,240 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 20:21:34,240 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 20:21:34,241 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:21:34,245 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:21:34,249 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:21:34,251 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:21:34,253 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:21:34,301 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 20:21:34,302 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 20:21:34,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:21:34,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:21:34,304 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:21:34,304 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2025-03-17 20:21:34,305 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:21:34,315 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:21:34,315 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:21:34,315 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:21:34,315 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:21:34,315 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:21:34,316 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:21:34,316 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:21:34,317 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:21:34,322 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2025-03-17 20:21:34,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:21:34,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:21:34,324 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:21:34,325 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2025-03-17 20:21:34,327 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:21:34,336 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:21:34,336 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:21:34,337 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:21:34,337 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:21:34,337 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:21:34,338 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:21:34,338 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:21:34,339 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:21:34,345 ERROR L418 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Exception during sending of exit command (exit): Broken pipe [2025-03-17 20:21:34,345 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2025-03-17 20:21:34,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:21:34,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:21:34,347 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:21:34,349 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2025-03-17 20:21:34,350 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:21:34,359 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:21:34,360 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:21:34,360 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:21:34,360 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:21:34,360 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:21:34,361 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:21:34,361 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:21:34,362 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:21:34,367 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2025-03-17 20:21:34,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:21:34,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:21:34,369 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:21:34,370 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2025-03-17 20:21:34,371 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:21:34,380 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:21:34,380 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:21:34,380 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:21:34,380 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:21:34,380 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:21:34,381 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:21:34,381 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:21:34,382 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:21:34,387 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2025-03-17 20:21:34,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:21:34,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:21:34,389 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:21:34,391 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2025-03-17 20:21:34,392 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:21:34,401 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:21:34,402 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:21:34,402 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:21:34,402 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:21:34,402 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:21:34,403 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:21:34,403 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:21:34,405 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-17 20:21:34,409 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-17 20:21:34,409 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-03-17 20:21:34,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:21:34,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:21:34,411 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:21:34,412 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2025-03-17 20:21:34,413 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-17 20:21:34,413 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-17 20:21:34,413 INFO L474 LassoAnalysis]: Proved termination. [2025-03-17 20:21:34,413 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~r~0#1) = 1*ULTIMATE.start_main_~r~0#1 Supporting invariants [] [2025-03-17 20:21:34,418 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2025-03-17 20:21:34,419 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-17 20:21:34,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:21:34,430 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 20:21:34,443 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2025-03-17 20:21:34,444 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 20:21:34,444 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:21:34,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:21:34,445 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 20:21:34,446 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:21:34,452 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-17 20:21:34,456 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-17 20:21:34,456 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:21:34,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:21:34,457 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 20:21:34,457 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:21:34,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 20:21:34,514 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-03-17 20:21:34,515 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 68 states and 79 transitions. cyclomatic complexity: 13 Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:21:34,538 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 68 states and 79 transitions. cyclomatic complexity: 13. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 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 132 states and 152 transitions. Complement of second has 4 states. [2025-03-17 20:21:34,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-03-17 20:21:34,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:21:34,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 79 transitions. [2025-03-17 20:21:34,540 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 79 transitions. Stem has 3 letters. Loop has 14 letters. [2025-03-17 20:21:34,540 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:21:34,540 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 79 transitions. Stem has 17 letters. Loop has 14 letters. [2025-03-17 20:21:34,540 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:21:34,540 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 79 transitions. Stem has 3 letters. Loop has 28 letters. [2025-03-17 20:21:34,540 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:21:34,540 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 132 states and 152 transitions. [2025-03-17 20:21:34,541 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 57 [2025-03-17 20:21:34,541 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 132 states to 127 states and 146 transitions. [2025-03-17 20:21:34,541 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 62 [2025-03-17 20:21:34,541 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 63 [2025-03-17 20:21:34,542 INFO L73 IsDeterministic]: Start isDeterministic. Operand 127 states and 146 transitions. [2025-03-17 20:21:34,542 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 20:21:34,542 INFO L218 hiAutomatonCegarLoop]: Abstraction has 127 states and 146 transitions. [2025-03-17 20:21:34,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states and 146 transitions. [2025-03-17 20:21:34,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 126. [2025-03-17 20:21:34,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 126 states have (on average 1.1507936507936507) internal successors, (145), 125 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:21:34,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 145 transitions. [2025-03-17 20:21:34,549 INFO L240 hiAutomatonCegarLoop]: Abstraction has 126 states and 145 transitions. [2025-03-17 20:21:34,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 20:21:34,549 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 20:21:34,549 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 20:21:34,549 INFO L87 Difference]: Start difference. First operand 126 states and 145 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:21:34,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 20:21:34,579 INFO L93 Difference]: Finished difference Result 69 states and 79 transitions. [2025-03-17 20:21:34,579 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 69 states and 79 transitions. [2025-03-17 20:21:34,580 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 32 [2025-03-17 20:21:34,580 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 69 states to 68 states and 78 transitions. [2025-03-17 20:21:34,580 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2025-03-17 20:21:34,580 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2025-03-17 20:21:34,580 INFO L73 IsDeterministic]: Start isDeterministic. Operand 68 states and 78 transitions. [2025-03-17 20:21:34,580 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 20:21:34,580 INFO L218 hiAutomatonCegarLoop]: Abstraction has 68 states and 78 transitions. [2025-03-17 20:21:34,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states and 78 transitions. [2025-03-17 20:21:34,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2025-03-17 20:21:34,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 68 states have (on average 1.1470588235294117) internal successors, (78), 67 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:21:34,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 78 transitions. [2025-03-17 20:21:34,582 INFO L240 hiAutomatonCegarLoop]: Abstraction has 68 states and 78 transitions. [2025-03-17 20:21:34,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 20:21:34,587 INFO L432 stractBuchiCegarLoop]: Abstraction has 68 states and 78 transitions. [2025-03-17 20:21:34,587 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-03-17 20:21:34,587 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 68 states and 78 transitions. [2025-03-17 20:21:34,587 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 32 [2025-03-17 20:21:34,587 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:21:34,587 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:21:34,588 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-03-17 20:21:34,588 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 20:21:34,588 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;main_#in~argc#1, main_#in~argv#1.base, main_#in~argv#1.offset := #in~argc#1, #in~argv#1.base, #in~argv#1.offset;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post2#1, main_#t~post3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post6#1, main_#t~post7#1, main_~argc#1, main_~n~0#1, main_~l~0#1, main_~r~0#1, main_~i~0#1, main_~j~0#1;main_~argc#1 := main_#in~argc#1;havoc main_~n~0#1;havoc main_~l~0#1;havoc main_~r~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet1#1;main_~n~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;" "assume !!(1 <= main_~n~0#1 && main_~n~0#1 <= 1000000);main_~l~0#1 := 1 + (if main_~n~0#1 < 0 && 0 != main_~n~0#1 % 2 then 1 + main_~n~0#1 / 2 else main_~n~0#1 / 2);main_~r~0#1 := main_~n~0#1;" "assume main_~l~0#1 > 1;main_#t~post2#1 := main_~l~0#1;main_~l~0#1 := main_#t~post2#1 - 1;havoc main_#t~post2#1;" "assume main_~r~0#1 > 1;main_~i~0#1 := main_~l~0#1;main_~j~0#1 := 2 * main_~l~0#1;" [2025-03-17 20:21:34,588 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~j~0#1 <= main_~r~0#1;" "assume !(main_~j~0#1 < main_~r~0#1);" "assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 1 <= main_~j~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_#t~nondet5#1;" "assume 0 != main_#t~nondet5#1;havoc main_#t~nondet5#1;" "assume !(main_~l~0#1 > 1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 1 <= main_~r~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~r~0#1 <= main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post7#1 := main_~r~0#1;main_~r~0#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1;" "assume main_~r~0#1 > 1;main_~i~0#1 := main_~l~0#1;main_~j~0#1 := 2 * main_~l~0#1;" [2025-03-17 20:21:34,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:21:34,588 INFO L85 PathProgramCache]: Analyzing trace with hash 4247007, now seen corresponding path program 1 times [2025-03-17 20:21:34,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:21:34,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558580929] [2025-03-17 20:21:34,588 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:21:34,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:21:34,591 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 20:21:34,593 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 20:21:34,593 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:21:34,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:21:34,593 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:21:34,594 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 20:21:34,596 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 20:21:34,596 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:21:34,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:21:34,597 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:21:34,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:21:34,597 INFO L85 PathProgramCache]: Analyzing trace with hash 1370542445, now seen corresponding path program 2 times [2025-03-17 20:21:34,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:21:34,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648330925] [2025-03-17 20:21:34,599 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 20:21:34,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:21:34,602 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 1 equivalence classes. [2025-03-17 20:21:34,609 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-17 20:21:34,609 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 20:21:34,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:21:34,609 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:21:34,610 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-17 20:21:34,612 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-17 20:21:34,612 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:21:34,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:21:34,613 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:21:34,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:21:34,613 INFO L85 PathProgramCache]: Analyzing trace with hash -2108882229, now seen corresponding path program 1 times [2025-03-17 20:21:34,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:21:34,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614926559] [2025-03-17 20:21:34,614 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:21:34,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:21:34,623 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-17 20:21:34,627 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-17 20:21:34,627 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:21:34,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:21:34,670 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 20:21:34,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 20:21:34,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614926559] [2025-03-17 20:21:34,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614926559] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 20:21:34,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 20:21:34,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 20:21:34,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23487041] [2025-03-17 20:21:34,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 20:21:34,754 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 20:21:34,755 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 20:21:34,755 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 20:21:34,755 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 20:21:34,755 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-17 20:21:34,755 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:21:34,755 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 20:21:34,755 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 20:21:34,755 INFO L132 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration5_Loop [2025-03-17 20:21:34,755 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 20:21:34,755 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 20:21:34,756 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:21:34,757 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:21:34,759 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:21:34,760 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:21:34,770 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:21:34,806 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 20:21:34,807 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-17 20:21:34,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:21:34,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:21:34,809 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:21:34,810 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2025-03-17 20:21:34,811 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 20:21:34,811 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 20:21:34,822 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 20:21:34,823 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post7#1=0} Honda state: {ULTIMATE.start_main_#t~post7#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-17 20:21:34,828 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2025-03-17 20:21:34,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:21:34,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:21:34,830 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:21:34,832 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2025-03-17 20:21:34,833 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 20:21:34,833 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 20:21:34,844 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 20:21:34,844 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start___VERIFIER_assert_~cond#1=0} Honda state: {ULTIMATE.start___VERIFIER_assert_~cond#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-17 20:21:34,850 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2025-03-17 20:21:34,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:21:34,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:21:34,852 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:21:34,852 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2025-03-17 20:21:34,855 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 20:21:34,855 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 20:21:34,865 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 20:21:34,866 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet5#1=0} Honda state: {ULTIMATE.start_main_#t~nondet5#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-17 20:21:34,871 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2025-03-17 20:21:34,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:21:34,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:21:34,872 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:21:34,873 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2025-03-17 20:21:34,875 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 20:21:34,875 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 20:21:34,891 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2025-03-17 20:21:34,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:21:34,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:21:34,893 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:21:34,894 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2025-03-17 20:21:34,895 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-17 20:21:34,895 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 20:21:35,169 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-17 20:21:35,178 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2025-03-17 20:21:35,179 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 20:21:35,179 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 20:21:35,179 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 20:21:35,179 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 20:21:35,179 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 20:21:35,179 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:21:35,179 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 20:21:35,179 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 20:21:35,179 INFO L132 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration5_Loop [2025-03-17 20:21:35,179 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 20:21:35,179 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 20:21:35,180 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:21:35,184 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:21:35,192 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:21:35,195 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:21:35,197 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:21:35,237 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 20:21:35,237 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 20:21:35,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:21:35,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:21:35,240 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:21:35,241 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2025-03-17 20:21:35,242 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:21:35,252 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:21:35,253 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:21:35,253 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:21:35,253 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:21:35,253 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:21:35,254 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:21:35,254 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:21:35,255 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:21:35,260 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2025-03-17 20:21:35,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:21:35,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:21:35,262 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:21:35,263 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2025-03-17 20:21:35,263 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:21:35,273 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:21:35,273 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:21:35,273 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:21:35,273 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:21:35,273 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:21:35,275 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:21:35,275 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:21:35,277 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-17 20:21:35,279 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2025-03-17 20:21:35,280 INFO L444 ModelExtractionUtils]: 5 out of 7 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-03-17 20:21:35,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:21:35,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:21:35,281 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:21:35,283 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2025-03-17 20:21:35,284 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-17 20:21:35,284 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-17 20:21:35,284 INFO L474 LassoAnalysis]: Proved termination. [2025-03-17 20:21:35,284 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0#1) = 1*ULTIMATE.start_main_~j~0#1 Supporting invariants [] [2025-03-17 20:21:35,290 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2025-03-17 20:21:35,290 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-17 20:21:35,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:21:35,306 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 20:21:35,309 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 20:21:35,309 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:21:35,309 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:21:35,309 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 20:21:35,310 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:21:35,315 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-17 20:21:35,318 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-17 20:21:35,318 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:21:35,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:21:35,319 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-17 20:21:35,320 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:21:35,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 20:21:35,370 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2025-03-17 20:21:35,371 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 68 states and 78 transitions. cyclomatic complexity: 12 Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:21:35,510 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2025-03-17 20:21:35,535 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 68 states and 78 transitions. cyclomatic complexity: 12. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 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 399 states and 441 transitions. Complement of second has 17 states. [2025-03-17 20:21:35,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 1 stem states 7 non-accepting loop states 1 accepting loop states [2025-03-17 20:21:35,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:21:35,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 108 transitions. [2025-03-17 20:21:35,536 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 108 transitions. Stem has 4 letters. Loop has 14 letters. [2025-03-17 20:21:35,536 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:21:35,536 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 108 transitions. Stem has 18 letters. Loop has 14 letters. [2025-03-17 20:21:35,537 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:21:35,537 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 108 transitions. Stem has 4 letters. Loop has 28 letters. [2025-03-17 20:21:35,538 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:21:35,539 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 399 states and 441 transitions. [2025-03-17 20:21:35,541 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 71 [2025-03-17 20:21:35,544 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 399 states to 329 states and 370 transitions. [2025-03-17 20:21:35,544 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 107 [2025-03-17 20:21:35,544 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 108 [2025-03-17 20:21:35,544 INFO L73 IsDeterministic]: Start isDeterministic. Operand 329 states and 370 transitions. [2025-03-17 20:21:35,544 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 20:21:35,544 INFO L218 hiAutomatonCegarLoop]: Abstraction has 329 states and 370 transitions. [2025-03-17 20:21:35,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states and 370 transitions. [2025-03-17 20:21:35,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 196. [2025-03-17 20:21:35,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 196 states have (on average 1.1581632653061225) internal successors, (227), 195 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:21:35,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 227 transitions. [2025-03-17 20:21:35,548 INFO L240 hiAutomatonCegarLoop]: Abstraction has 196 states and 227 transitions. [2025-03-17 20:21:35,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 20:21:35,549 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 20:21:35,549 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 20:21:35,549 INFO L87 Difference]: Start difference. First operand 196 states and 227 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:21:35,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 20:21:35,689 INFO L93 Difference]: Finished difference Result 656 states and 727 transitions. [2025-03-17 20:21:35,689 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 656 states and 727 transitions. [2025-03-17 20:21:35,693 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 165 [2025-03-17 20:21:35,696 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 656 states to 592 states and 656 transitions. [2025-03-17 20:21:35,696 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 197 [2025-03-17 20:21:35,696 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 210 [2025-03-17 20:21:35,696 INFO L73 IsDeterministic]: Start isDeterministic. Operand 592 states and 656 transitions. [2025-03-17 20:21:35,697 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 20:21:35,697 INFO L218 hiAutomatonCegarLoop]: Abstraction has 592 states and 656 transitions. [2025-03-17 20:21:35,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states and 656 transitions. [2025-03-17 20:21:35,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 188. [2025-03-17 20:21:35,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 188 states have (on average 1.1542553191489362) internal successors, (217), 187 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:21:35,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 217 transitions. [2025-03-17 20:21:35,702 INFO L240 hiAutomatonCegarLoop]: Abstraction has 188 states and 217 transitions. [2025-03-17 20:21:35,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 20:21:35,707 INFO L432 stractBuchiCegarLoop]: Abstraction has 188 states and 217 transitions. [2025-03-17 20:21:35,708 INFO L338 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-03-17 20:21:35,708 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 188 states and 217 transitions. [2025-03-17 20:21:35,709 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 58 [2025-03-17 20:21:35,709 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:21:35,709 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:21:35,709 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-03-17 20:21:35,709 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 20:21:35,710 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;main_#in~argc#1, main_#in~argv#1.base, main_#in~argv#1.offset := #in~argc#1, #in~argv#1.base, #in~argv#1.offset;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post2#1, main_#t~post3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post6#1, main_#t~post7#1, main_~argc#1, main_~n~0#1, main_~l~0#1, main_~r~0#1, main_~i~0#1, main_~j~0#1;main_~argc#1 := main_#in~argc#1;havoc main_~n~0#1;havoc main_~l~0#1;havoc main_~r~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet1#1;main_~n~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;" "assume !!(1 <= main_~n~0#1 && main_~n~0#1 <= 1000000);main_~l~0#1 := 1 + (if main_~n~0#1 < 0 && 0 != main_~n~0#1 % 2 then 1 + main_~n~0#1 / 2 else main_~n~0#1 / 2);main_~r~0#1 := main_~n~0#1;" "assume main_~l~0#1 > 1;main_#t~post2#1 := main_~l~0#1;main_~l~0#1 := main_#t~post2#1 - 1;havoc main_#t~post2#1;" "assume main_~r~0#1 > 1;main_~i~0#1 := main_~l~0#1;main_~j~0#1 := 2 * main_~l~0#1;" [2025-03-17 20:21:35,710 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~j~0#1 <= main_~r~0#1;" "assume main_~j~0#1 < main_~r~0#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 1 <= main_~j~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 1 <= 1 + main_~j~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 1 + main_~j~0#1 <= main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_#t~nondet4#1;" "assume 0 != main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1;" "assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 1 <= main_~j~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_#t~nondet5#1;" "assume 0 != main_#t~nondet5#1;havoc main_#t~nondet5#1;" "assume !(main_~l~0#1 > 1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 1 <= main_~r~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~r~0#1 <= main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post7#1 := main_~r~0#1;main_~r~0#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1;" "assume main_~r~0#1 > 1;main_~i~0#1 := main_~l~0#1;main_~j~0#1 := 2 * main_~l~0#1;" [2025-03-17 20:21:35,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:21:35,710 INFO L85 PathProgramCache]: Analyzing trace with hash 4247007, now seen corresponding path program 2 times [2025-03-17 20:21:35,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:21:35,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051694677] [2025-03-17 20:21:35,710 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 20:21:35,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:21:35,713 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 4 statements into 1 equivalence classes. [2025-03-17 20:21:35,716 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 20:21:35,716 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 20:21:35,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:21:35,717 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:21:35,718 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 20:21:35,720 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 20:21:35,720 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:21:35,720 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:21:35,721 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:21:35,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:21:35,722 INFO L85 PathProgramCache]: Analyzing trace with hash -1192778968, now seen corresponding path program 1 times [2025-03-17 20:21:35,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:21:35,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055789889] [2025-03-17 20:21:35,722 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:21:35,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:21:35,725 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-17 20:21:35,730 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-17 20:21:35,730 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:21:35,730 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:21:35,730 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:21:35,732 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-17 20:21:35,738 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-17 20:21:35,738 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:21:35,738 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:21:35,740 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:21:35,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:21:35,741 INFO L85 PathProgramCache]: Analyzing trace with hash 963255178, now seen corresponding path program 1 times [2025-03-17 20:21:35,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:21:35,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133545057] [2025-03-17 20:21:35,742 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:21:35,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:21:35,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-17 20:21:35,757 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-17 20:21:35,757 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:21:35,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:21:35,757 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:21:35,759 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-17 20:21:35,766 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-17 20:21:35,766 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:21:35,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:21:35,769 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:21:35,918 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 20:21:35,918 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 20:21:35,918 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 20:21:35,918 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 20:21:35,918 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-17 20:21:35,918 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:21:35,918 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 20:21:35,918 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 20:21:35,918 INFO L132 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration6_Loop [2025-03-17 20:21:35,918 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 20:21:35,918 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 20:21:35,919 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:21:35,930 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:21:35,932 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:21:35,933 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:21:35,934 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:21:35,936 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:21:35,982 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 20:21:35,982 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-17 20:21:35,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:21:35,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:21:35,986 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:21:35,987 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2025-03-17 20:21:35,988 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 20:21:35,988 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 20:21:36,007 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2025-03-17 20:21:36,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:21:36,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:21:36,009 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:21:36,010 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2025-03-17 20:21:36,012 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-17 20:21:36,013 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 20:21:36,071 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-17 20:21:36,075 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2025-03-17 20:21:36,076 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 20:21:36,076 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 20:21:36,076 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 20:21:36,076 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 20:21:36,076 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 20:21:36,076 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:21:36,076 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 20:21:36,076 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 20:21:36,076 INFO L132 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration6_Loop [2025-03-17 20:21:36,076 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 20:21:36,076 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 20:21:36,077 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:21:36,088 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:21:36,090 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:21:36,091 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:21:36,092 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:21:36,094 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:21:36,128 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 20:21:36,128 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 20:21:36,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:21:36,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:21:36,130 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:21:36,130 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2025-03-17 20:21:36,131 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:21:36,141 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:21:36,141 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:21:36,141 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:21:36,141 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:21:36,141 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:21:36,142 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:21:36,142 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:21:36,145 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-17 20:21:36,147 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-17 20:21:36,147 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-03-17 20:21:36,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:21:36,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:21:36,149 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:21:36,149 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2025-03-17 20:21:36,150 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-17 20:21:36,150 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-17 20:21:36,150 INFO L474 LassoAnalysis]: Proved termination. [2025-03-17 20:21:36,150 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~r~0#1) = 1*ULTIMATE.start_main_~r~0#1 Supporting invariants [] [2025-03-17 20:21:36,156 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Ended with exit code 0 [2025-03-17 20:21:36,156 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-17 20:21:36,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:21:36,172 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 20:21:36,177 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 20:21:36,177 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:21:36,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:21:36,178 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 20:21:36,178 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:21:36,194 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-17 20:21:36,200 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-17 20:21:36,200 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:21:36,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:21:36,200 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 20:21:36,201 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:21:36,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 20:21:36,233 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-03-17 20:21:36,233 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 188 states and 217 transitions. cyclomatic complexity: 35 Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:21:36,257 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 188 states and 217 transitions. cyclomatic complexity: 35. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 375 states and 435 transitions. Complement of second has 6 states. [2025-03-17 20:21:36,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-03-17 20:21:36,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:21:36,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 46 transitions. [2025-03-17 20:21:36,258 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 46 transitions. Stem has 4 letters. Loop has 23 letters. [2025-03-17 20:21:36,258 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:21:36,258 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 46 transitions. Stem has 27 letters. Loop has 23 letters. [2025-03-17 20:21:36,259 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:21:36,259 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 46 transitions. Stem has 4 letters. Loop has 46 letters. [2025-03-17 20:21:36,259 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:21:36,259 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 375 states and 435 transitions. [2025-03-17 20:21:36,262 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 50 [2025-03-17 20:21:36,264 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 375 states to 251 states and 291 transitions. [2025-03-17 20:21:36,264 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 59 [2025-03-17 20:21:36,264 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 60 [2025-03-17 20:21:36,264 INFO L73 IsDeterministic]: Start isDeterministic. Operand 251 states and 291 transitions. [2025-03-17 20:21:36,264 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 20:21:36,264 INFO L218 hiAutomatonCegarLoop]: Abstraction has 251 states and 291 transitions. [2025-03-17 20:21:36,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states and 291 transitions. [2025-03-17 20:21:36,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 131. [2025-03-17 20:21:36,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 131 states have (on average 1.1603053435114503) internal successors, (152), 130 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:21:36,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 152 transitions. [2025-03-17 20:21:36,267 INFO L240 hiAutomatonCegarLoop]: Abstraction has 131 states and 152 transitions. [2025-03-17 20:21:36,267 INFO L432 stractBuchiCegarLoop]: Abstraction has 131 states and 152 transitions. [2025-03-17 20:21:36,267 INFO L338 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-03-17 20:21:36,267 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 131 states and 152 transitions. [2025-03-17 20:21:36,268 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2025-03-17 20:21:36,268 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:21:36,268 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:21:36,268 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-03-17 20:21:36,268 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 20:21:36,268 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;main_#in~argc#1, main_#in~argv#1.base, main_#in~argv#1.offset := #in~argc#1, #in~argv#1.base, #in~argv#1.offset;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post2#1, main_#t~post3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post6#1, main_#t~post7#1, main_~argc#1, main_~n~0#1, main_~l~0#1, main_~r~0#1, main_~i~0#1, main_~j~0#1;main_~argc#1 := main_#in~argc#1;havoc main_~n~0#1;havoc main_~l~0#1;havoc main_~r~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet1#1;main_~n~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;" "assume !!(1 <= main_~n~0#1 && main_~n~0#1 <= 1000000);main_~l~0#1 := 1 + (if main_~n~0#1 < 0 && 0 != main_~n~0#1 % 2 then 1 + main_~n~0#1 / 2 else main_~n~0#1 / 2);main_~r~0#1 := main_~n~0#1;" "assume main_~l~0#1 > 1;main_#t~post2#1 := main_~l~0#1;main_~l~0#1 := main_#t~post2#1 - 1;havoc main_#t~post2#1;" "assume main_~r~0#1 > 1;main_~i~0#1 := main_~l~0#1;main_~j~0#1 := 2 * main_~l~0#1;" "assume main_~j~0#1 <= main_~r~0#1;" [2025-03-17 20:21:36,268 INFO L754 eck$LassoCheckResult]: Loop: "assume !(main_~j~0#1 < main_~r~0#1);" "assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 1 <= main_~j~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_#t~nondet5#1;" "assume !(0 != main_#t~nondet5#1);havoc main_#t~nondet5#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 1 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 1 <= main_~j~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_~i~0#1 := main_~j~0#1;main_~j~0#1 := 2 * main_~j~0#1;" "assume main_~j~0#1 <= main_~r~0#1;" [2025-03-17 20:21:36,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:21:36,268 INFO L85 PathProgramCache]: Analyzing trace with hash 131657315, now seen corresponding path program 1 times [2025-03-17 20:21:36,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:21:36,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936807057] [2025-03-17 20:21:36,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:21:36,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:21:36,273 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 20:21:36,275 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 20:21:36,276 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:21:36,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:21:36,276 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:21:36,276 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 20:21:36,278 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 20:21:36,278 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:21:36,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:21:36,279 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:21:36,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:21:36,279 INFO L85 PathProgramCache]: Analyzing trace with hash 538217657, now seen corresponding path program 1 times [2025-03-17 20:21:36,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:21:36,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382704716] [2025-03-17 20:21:36,279 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:21:36,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:21:36,281 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-17 20:21:36,284 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-17 20:21:36,284 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:21:36,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:21:36,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 20:21:36,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 20:21:36,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382704716] [2025-03-17 20:21:36,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382704716] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 20:21:36,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 20:21:36,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 20:21:36,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224528926] [2025-03-17 20:21:36,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 20:21:36,355 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-17 20:21:36,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 20:21:36,355 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 20:21:36,355 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 20:21:36,356 INFO L87 Difference]: Start difference. First operand 131 states and 152 transitions. cyclomatic complexity: 25 Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:21:36,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 20:21:36,452 INFO L93 Difference]: Finished difference Result 209 states and 234 transitions. [2025-03-17 20:21:36,452 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 209 states and 234 transitions. [2025-03-17 20:21:36,454 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2025-03-17 20:21:36,454 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 209 states to 194 states and 219 transitions. [2025-03-17 20:21:36,454 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31 [2025-03-17 20:21:36,454 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2025-03-17 20:21:36,454 INFO L73 IsDeterministic]: Start isDeterministic. Operand 194 states and 219 transitions. [2025-03-17 20:21:36,455 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 20:21:36,455 INFO L218 hiAutomatonCegarLoop]: Abstraction has 194 states and 219 transitions. [2025-03-17 20:21:36,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states and 219 transitions. [2025-03-17 20:21:36,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 176. [2025-03-17 20:21:36,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 176 states have (on average 1.1306818181818181) internal successors, (199), 175 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:21:36,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 199 transitions. [2025-03-17 20:21:36,459 INFO L240 hiAutomatonCegarLoop]: Abstraction has 176 states and 199 transitions. [2025-03-17 20:21:36,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 20:21:36,460 INFO L432 stractBuchiCegarLoop]: Abstraction has 176 states and 199 transitions. [2025-03-17 20:21:36,460 INFO L338 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2025-03-17 20:21:36,460 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 176 states and 199 transitions. [2025-03-17 20:21:36,461 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2025-03-17 20:21:36,461 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:21:36,461 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:21:36,461 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-03-17 20:21:36,461 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 20:21:36,461 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;main_#in~argc#1, main_#in~argv#1.base, main_#in~argv#1.offset := #in~argc#1, #in~argv#1.base, #in~argv#1.offset;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post2#1, main_#t~post3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post6#1, main_#t~post7#1, main_~argc#1, main_~n~0#1, main_~l~0#1, main_~r~0#1, main_~i~0#1, main_~j~0#1;main_~argc#1 := main_#in~argc#1;havoc main_~n~0#1;havoc main_~l~0#1;havoc main_~r~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet1#1;main_~n~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;" "assume !!(1 <= main_~n~0#1 && main_~n~0#1 <= 1000000);main_~l~0#1 := 1 + (if main_~n~0#1 < 0 && 0 != main_~n~0#1 % 2 then 1 + main_~n~0#1 / 2 else main_~n~0#1 / 2);main_~r~0#1 := main_~n~0#1;" "assume main_~l~0#1 > 1;main_#t~post2#1 := main_~l~0#1;main_~l~0#1 := main_#t~post2#1 - 1;havoc main_#t~post2#1;" "assume main_~r~0#1 > 1;main_~i~0#1 := main_~l~0#1;main_~j~0#1 := 2 * main_~l~0#1;" "assume main_~j~0#1 <= main_~r~0#1;" [2025-03-17 20:21:36,461 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~j~0#1 < main_~r~0#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 1 <= main_~j~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 1 <= 1 + main_~j~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 1 + main_~j~0#1 <= main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_#t~nondet4#1;" "assume 0 != main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1;" "assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 1 <= main_~j~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_#t~nondet5#1;" "assume !(0 != main_#t~nondet5#1);havoc main_#t~nondet5#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 1 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 1 <= main_~j~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_~i~0#1 := main_~j~0#1;main_~j~0#1 := 2 * main_~j~0#1;" "assume main_~j~0#1 <= main_~r~0#1;" [2025-03-17 20:21:36,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:21:36,461 INFO L85 PathProgramCache]: Analyzing trace with hash 131657315, now seen corresponding path program 2 times [2025-03-17 20:21:36,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:21:36,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557326688] [2025-03-17 20:21:36,461 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 20:21:36,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:21:36,464 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 5 statements into 1 equivalence classes. [2025-03-17 20:21:36,467 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 20:21:36,467 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 20:21:36,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:21:36,467 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:21:36,468 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 20:21:36,470 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 20:21:36,470 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:21:36,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:21:36,471 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:21:36,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:21:36,471 INFO L85 PathProgramCache]: Analyzing trace with hash -1397060066, now seen corresponding path program 1 times [2025-03-17 20:21:36,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:21:36,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288758846] [2025-03-17 20:21:36,471 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:21:36,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:21:36,477 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-17 20:21:36,482 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-17 20:21:36,482 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:21:36,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:21:36,482 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:21:36,483 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-17 20:21:36,493 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-17 20:21:36,493 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:21:36,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:21:36,494 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:21:36,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:21:36,495 INFO L85 PathProgramCache]: Analyzing trace with hash 1750807036, now seen corresponding path program 1 times [2025-03-17 20:21:36,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:21:36,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825232174] [2025-03-17 20:21:36,495 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:21:36,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:21:36,500 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-17 20:21:36,505 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-17 20:21:36,505 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:21:36,505 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:21:36,599 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Ended with exit code 0 [2025-03-17 20:21:36,621 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 20:21:36,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 20:21:36,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825232174] [2025-03-17 20:21:36,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825232174] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 20:21:36,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1447243075] [2025-03-17 20:21:36,622 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:21:36,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 20:21:36,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:21:36,625 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 20:21:36,626 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2025-03-17 20:21:36,652 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-17 20:21:36,661 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-17 20:21:36,662 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:21:36,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:21:36,662 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-17 20:21:36,663 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:21:36,803 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 20:21:36,803 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 20:21:36,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1447243075] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 20:21:36,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 20:21:36,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 12 [2025-03-17 20:21:36,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944921124] [2025-03-17 20:21:36,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 20:21:36,980 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 20:21:36,980 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 20:21:36,980 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 20:21:36,980 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 20:21:36,980 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-17 20:21:36,980 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:21:36,980 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 20:21:36,980 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 20:21:36,980 INFO L132 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration8_Loop [2025-03-17 20:21:36,980 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 20:21:36,980 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 20:21:36,980 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:21:36,984 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:21:36,985 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:21:36,987 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:21:36,988 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:21:37,025 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 20:21:37,026 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-17 20:21:37,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:21:37,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:21:37,028 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:21:37,029 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2025-03-17 20:21:37,030 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 20:21:37,030 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 20:21:37,040 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 20:21:37,041 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start___VERIFIER_assert_~cond#1=0} Honda state: {ULTIMATE.start___VERIFIER_assert_~cond#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-17 20:21:37,046 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Forceful destruction successful, exit code 0 [2025-03-17 20:21:37,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:21:37,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:21:37,048 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:21:37,049 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2025-03-17 20:21:37,050 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 20:21:37,050 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 20:21:37,060 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 20:21:37,060 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet4#1=0} Honda state: {ULTIMATE.start_main_#t~nondet4#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-17 20:21:37,066 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Ended with exit code 0 [2025-03-17 20:21:37,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:21:37,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:21:37,067 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:21:37,068 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2025-03-17 20:21:37,069 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 20:21:37,069 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 20:21:37,079 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 20:21:37,079 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet5#1=0} Honda state: {ULTIMATE.start_main_#t~nondet5#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-17 20:21:37,084 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Forceful destruction successful, exit code 0 [2025-03-17 20:21:37,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:21:37,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:21:37,086 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:21:37,087 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2025-03-17 20:21:37,088 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 20:21:37,088 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 20:21:37,098 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 20:21:37,099 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start___VERIFIER_assert_#in~cond#1=0} Honda state: {ULTIMATE.start___VERIFIER_assert_#in~cond#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-17 20:21:37,104 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Ended with exit code 0 [2025-03-17 20:21:37,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:21:37,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:21:37,106 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:21:37,106 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2025-03-17 20:21:37,107 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 20:21:37,107 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 20:21:37,130 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Ended with exit code 0 [2025-03-17 20:21:37,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:21:37,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:21:37,132 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:21:37,133 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2025-03-17 20:21:37,134 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-17 20:21:37,134 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 20:21:37,195 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-17 20:21:37,199 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Ended with exit code 0 [2025-03-17 20:21:37,199 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 20:21:37,199 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 20:21:37,199 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 20:21:37,199 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 20:21:37,199 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 20:21:37,199 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:21:37,199 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 20:21:37,199 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 20:21:37,200 INFO L132 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration8_Loop [2025-03-17 20:21:37,200 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 20:21:37,200 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 20:21:37,200 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:21:37,202 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:21:37,204 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:21:37,205 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:21:37,206 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:21:37,242 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 20:21:37,242 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 20:21:37,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:21:37,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:21:37,244 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:21:37,245 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2025-03-17 20:21:37,246 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:21:37,255 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:21:37,255 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:21:37,255 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:21:37,255 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:21:37,255 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:21:37,255 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:21:37,255 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:21:37,256 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:21:37,261 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Ended with exit code 0 [2025-03-17 20:21:37,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:21:37,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:21:37,263 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:21:37,264 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2025-03-17 20:21:37,265 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:21:37,275 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:21:37,275 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:21:37,275 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:21:37,275 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:21:37,275 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:21:37,275 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:21:37,275 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:21:37,276 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:21:37,282 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Ended with exit code 0 [2025-03-17 20:21:37,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:21:37,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:21:37,284 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:21:37,286 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2025-03-17 20:21:37,287 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:21:37,298 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:21:37,299 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:21:37,299 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:21:37,299 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:21:37,299 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:21:37,299 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:21:37,299 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:21:37,300 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:21:37,306 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Ended with exit code 0 [2025-03-17 20:21:37,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:21:37,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:21:37,308 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:21:37,309 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2025-03-17 20:21:37,310 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:21:37,320 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:21:37,320 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:21:37,320 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:21:37,320 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:21:37,320 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:21:37,321 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:21:37,321 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:21:37,322 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:21:37,328 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Ended with exit code 0 [2025-03-17 20:21:37,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:21:37,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:21:37,330 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:21:37,331 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2025-03-17 20:21:37,332 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:21:37,344 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:21:37,344 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:21:37,344 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:21:37,344 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:21:37,344 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:21:37,346 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:21:37,346 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:21:37,349 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-17 20:21:37,354 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-03-17 20:21:37,354 INFO L444 ModelExtractionUtils]: 2 out of 6 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-03-17 20:21:37,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:21:37,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:21:37,356 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:21:37,358 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2025-03-17 20:21:37,359 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-17 20:21:37,359 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-17 20:21:37,359 INFO L474 LassoAnalysis]: Proved termination. [2025-03-17 20:21:37,359 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0#1, ULTIMATE.start_main_~r~0#1) = -8*ULTIMATE.start_main_~j~0#1 + 5*ULTIMATE.start_main_~r~0#1 Supporting invariants [] [2025-03-17 20:21:37,365 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Forceful destruction successful, exit code 0 [2025-03-17 20:21:37,366 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-17 20:21:37,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:21:37,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 20:21:37,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 20:21:37,389 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:21:37,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:21:37,390 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 20:21:37,390 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:21:37,399 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-17 20:21:37,405 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-17 20:21:37,405 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:21:37,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:21:37,406 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-17 20:21:37,407 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:21:37,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 20:21:37,541 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2025-03-17 20:21:37,541 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 176 states and 199 transitions. cyclomatic complexity: 27 Second operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:21:37,747 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 176 states and 199 transitions. cyclomatic complexity: 27. Second operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 826 states and 903 transitions. Complement of second has 17 states. [2025-03-17 20:21:37,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 1 stem states 7 non-accepting loop states 1 accepting loop states [2025-03-17 20:21:37,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:21:37,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 83 transitions. [2025-03-17 20:21:37,749 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 83 transitions. Stem has 5 letters. Loop has 25 letters. [2025-03-17 20:21:37,749 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:21:37,749 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 83 transitions. Stem has 30 letters. Loop has 25 letters. [2025-03-17 20:21:37,749 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:21:37,749 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 83 transitions. Stem has 5 letters. Loop has 50 letters. [2025-03-17 20:21:37,750 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:21:37,750 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 826 states and 903 transitions. [2025-03-17 20:21:37,754 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2025-03-17 20:21:37,756 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 826 states to 600 states and 664 transitions. [2025-03-17 20:21:37,756 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31 [2025-03-17 20:21:37,756 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2025-03-17 20:21:37,756 INFO L73 IsDeterministic]: Start isDeterministic. Operand 600 states and 664 transitions. [2025-03-17 20:21:37,757 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 20:21:37,757 INFO L218 hiAutomatonCegarLoop]: Abstraction has 600 states and 664 transitions. [2025-03-17 20:21:37,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states and 664 transitions. [2025-03-17 20:21:37,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 429. [2025-03-17 20:21:37,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 429 states, 429 states have (on average 1.118881118881119) internal successors, (480), 428 states have internal predecessors, (480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:21:37,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 480 transitions. [2025-03-17 20:21:37,767 INFO L240 hiAutomatonCegarLoop]: Abstraction has 429 states and 480 transitions. [2025-03-17 20:21:37,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 20:21:37,767 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 20:21:37,767 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2025-03-17 20:21:37,767 INFO L87 Difference]: Start difference. First operand 429 states and 480 transitions. Second operand has 7 states, 6 states have (on average 5.0) internal successors, (30), 7 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:21:37,805 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Forceful destruction successful, exit code 0 [2025-03-17 20:21:37,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 20:21:37,939 INFO L93 Difference]: Finished difference Result 583 states and 628 transitions. [2025-03-17 20:21:37,940 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 583 states and 628 transitions. [2025-03-17 20:21:37,943 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2025-03-17 20:21:37,944 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 583 states to 320 states and 356 transitions. [2025-03-17 20:21:37,944 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2025-03-17 20:21:37,945 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2025-03-17 20:21:37,945 INFO L73 IsDeterministic]: Start isDeterministic. Operand 320 states and 356 transitions. [2025-03-17 20:21:37,945 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 20:21:37,945 INFO L218 hiAutomatonCegarLoop]: Abstraction has 320 states and 356 transitions. [2025-03-17 20:21:37,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states and 356 transitions. [2025-03-17 20:21:37,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 225. [2025-03-17 20:21:37,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 225 states have (on average 1.1244444444444444) internal successors, (253), 224 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:21:37,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 253 transitions. [2025-03-17 20:21:37,949 INFO L240 hiAutomatonCegarLoop]: Abstraction has 225 states and 253 transitions. [2025-03-17 20:21:37,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 20:21:37,950 INFO L432 stractBuchiCegarLoop]: Abstraction has 225 states and 253 transitions. [2025-03-17 20:21:37,950 INFO L338 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2025-03-17 20:21:37,950 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 225 states and 253 transitions. [2025-03-17 20:21:37,951 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2025-03-17 20:21:37,951 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:21:37,951 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:21:37,951 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 20:21:37,951 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 20:21:37,951 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;main_#in~argc#1, main_#in~argv#1.base, main_#in~argv#1.offset := #in~argc#1, #in~argv#1.base, #in~argv#1.offset;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post2#1, main_#t~post3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post6#1, main_#t~post7#1, main_~argc#1, main_~n~0#1, main_~l~0#1, main_~r~0#1, main_~i~0#1, main_~j~0#1;main_~argc#1 := main_#in~argc#1;havoc main_~n~0#1;havoc main_~l~0#1;havoc main_~r~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet1#1;main_~n~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;" "assume !!(1 <= main_~n~0#1 && main_~n~0#1 <= 1000000);main_~l~0#1 := 1 + (if main_~n~0#1 < 0 && 0 != main_~n~0#1 % 2 then 1 + main_~n~0#1 / 2 else main_~n~0#1 / 2);main_~r~0#1 := main_~n~0#1;" "assume main_~l~0#1 > 1;main_#t~post2#1 := main_~l~0#1;main_~l~0#1 := main_#t~post2#1 - 1;havoc main_#t~post2#1;" "assume main_~r~0#1 > 1;main_~i~0#1 := main_~l~0#1;main_~j~0#1 := 2 * main_~l~0#1;" "assume main_~j~0#1 <= main_~r~0#1;" "assume !(main_~j~0#1 < main_~r~0#1);" "assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 1 <= main_~j~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_#t~nondet5#1;" "assume 0 != main_#t~nondet5#1;havoc main_#t~nondet5#1;" "assume main_~l~0#1 > 1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 1 <= main_~l~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~l~0#1 <= main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post6#1 := main_~l~0#1;main_~l~0#1 := main_#t~post6#1 - 1;havoc main_#t~post6#1;" "assume main_~r~0#1 > 1;main_~i~0#1 := main_~l~0#1;main_~j~0#1 := 2 * main_~l~0#1;" [2025-03-17 20:21:37,951 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~j~0#1 <= main_~r~0#1;" "assume main_~j~0#1 < main_~r~0#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 1 <= main_~j~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 1 <= 1 + main_~j~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 1 + main_~j~0#1 <= main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_#t~nondet4#1;" "assume 0 != main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1;" "assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 1 <= main_~j~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_#t~nondet5#1;" "assume !(0 != main_#t~nondet5#1);havoc main_#t~nondet5#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 1 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 1 <= main_~j~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_~i~0#1 := main_~j~0#1;main_~j~0#1 := 2 * main_~j~0#1;" [2025-03-17 20:21:37,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:21:37,952 INFO L85 PathProgramCache]: Analyzing trace with hash 1801500152, now seen corresponding path program 1 times [2025-03-17 20:21:37,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:21:37,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390182487] [2025-03-17 20:21:37,952 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:21:37,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:21:37,956 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-17 20:21:37,960 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-17 20:21:37,960 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:21:37,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:21:37,960 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:21:37,961 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-17 20:21:37,965 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-17 20:21:37,965 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:21:37,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:21:37,967 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:21:37,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:21:37,968 INFO L85 PathProgramCache]: Analyzing trace with hash 1329941316, now seen corresponding path program 2 times [2025-03-17 20:21:37,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:21:37,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058570715] [2025-03-17 20:21:37,968 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 20:21:37,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:21:37,973 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 1 equivalence classes. [2025-03-17 20:21:37,980 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-17 20:21:37,980 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 20:21:37,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:21:37,980 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:21:37,983 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-17 20:21:37,990 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-17 20:21:37,991 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:21:37,991 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:21:37,992 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:21:37,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:21:37,993 INFO L85 PathProgramCache]: Analyzing trace with hash -531011283, now seen corresponding path program 1 times [2025-03-17 20:21:37,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:21:37,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691162224] [2025-03-17 20:21:37,993 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:21:37,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:21:38,002 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-17 20:21:38,010 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-17 20:21:38,010 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:21:38,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:21:38,010 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:21:38,013 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-17 20:21:38,019 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-17 20:21:38,019 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:21:38,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:21:38,024 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:21:38,200 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 20:21:38,200 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 20:21:38,200 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 20:21:38,200 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 20:21:38,200 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-17 20:21:38,200 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:21:38,200 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 20:21:38,200 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 20:21:38,200 INFO L132 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration9_Loop [2025-03-17 20:21:38,200 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 20:21:38,200 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 20:21:38,201 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:21:38,202 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:21:38,204 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:21:38,205 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:21:38,215 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:21:38,247 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 20:21:38,247 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-17 20:21:38,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:21:38,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:21:38,249 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:21:38,250 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2025-03-17 20:21:38,251 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 20:21:38,251 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 20:21:38,262 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 20:21:38,262 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start___VERIFIER_assert_#in~cond#1=0} Honda state: {ULTIMATE.start___VERIFIER_assert_#in~cond#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-17 20:21:38,267 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Forceful destruction successful, exit code 0 [2025-03-17 20:21:38,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:21:38,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:21:38,270 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:21:38,271 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2025-03-17 20:21:38,272 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 20:21:38,272 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 20:21:38,282 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 20:21:38,282 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet4#1=0} Honda state: {ULTIMATE.start_main_#t~nondet4#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-17 20:21:38,287 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Ended with exit code 0 [2025-03-17 20:21:38,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:21:38,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:21:38,289 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:21:38,290 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2025-03-17 20:21:38,291 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 20:21:38,291 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 20:21:38,301 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 20:21:38,304 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet5#1=0} Honda state: {ULTIMATE.start_main_#t~nondet5#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-17 20:21:38,310 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Ended with exit code 0 [2025-03-17 20:21:38,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:21:38,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:21:38,311 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:21:38,312 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Waiting until timeout for monitored process [2025-03-17 20:21:38,313 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 20:21:38,313 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 20:21:38,336 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Forceful destruction successful, exit code 0 [2025-03-17 20:21:38,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:21:38,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:21:38,338 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:21:38,339 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Waiting until timeout for monitored process [2025-03-17 20:21:38,340 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-17 20:21:38,340 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 20:21:38,429 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-17 20:21:38,434 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Ended with exit code 0 [2025-03-17 20:21:38,434 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 20:21:38,434 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 20:21:38,434 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 20:21:38,434 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 20:21:38,434 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 20:21:38,434 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:21:38,434 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 20:21:38,434 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 20:21:38,434 INFO L132 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration9_Loop [2025-03-17 20:21:38,434 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 20:21:38,434 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 20:21:38,435 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:21:38,437 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:21:38,438 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:21:38,439 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:21:38,440 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:21:38,476 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 20:21:38,476 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 20:21:38,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:21:38,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:21:38,478 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:21:38,479 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Waiting until timeout for monitored process [2025-03-17 20:21:38,480 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:21:38,490 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:21:38,490 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:21:38,490 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:21:38,490 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:21:38,490 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:21:38,490 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:21:38,490 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:21:38,491 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:21:38,496 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Ended with exit code 0 [2025-03-17 20:21:38,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:21:38,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:21:38,498 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:21:38,499 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Waiting until timeout for monitored process [2025-03-17 20:21:38,500 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:21:38,509 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:21:38,509 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:21:38,509 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:21:38,509 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:21:38,509 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:21:38,510 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:21:38,510 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:21:38,511 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:21:38,516 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Forceful destruction successful, exit code 0 [2025-03-17 20:21:38,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:21:38,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:21:38,517 INFO L229 MonitoredProcess]: Starting monitored process 58 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:21:38,518 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Waiting until timeout for monitored process [2025-03-17 20:21:38,519 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:21:38,529 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:21:38,529 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:21:38,529 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:21:38,529 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:21:38,529 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:21:38,529 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:21:38,529 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:21:38,530 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:21:38,535 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Ended with exit code 0 [2025-03-17 20:21:38,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:21:38,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:21:38,537 INFO L229 MonitoredProcess]: Starting monitored process 59 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:21:38,539 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Waiting until timeout for monitored process [2025-03-17 20:21:38,539 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:21:38,549 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:21:38,549 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:21:38,549 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:21:38,549 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:21:38,549 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:21:38,550 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:21:38,550 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:21:38,551 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:21:38,557 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Forceful destruction successful, exit code 0 [2025-03-17 20:21:38,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:21:38,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:21:38,559 INFO L229 MonitoredProcess]: Starting monitored process 60 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:21:38,561 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Waiting until timeout for monitored process [2025-03-17 20:21:38,561 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:21:38,571 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:21:38,572 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:21:38,572 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:21:38,572 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:21:38,572 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:21:38,573 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:21:38,573 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:21:38,575 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-17 20:21:38,581 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-03-17 20:21:38,581 INFO L444 ModelExtractionUtils]: 2 out of 6 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-03-17 20:21:38,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:21:38,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:21:38,583 INFO L229 MonitoredProcess]: Starting monitored process 61 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:21:38,583 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Waiting until timeout for monitored process [2025-03-17 20:21:38,585 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-17 20:21:38,585 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-17 20:21:38,585 INFO L474 LassoAnalysis]: Proved termination. [2025-03-17 20:21:38,585 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~r~0#1, ULTIMATE.start_main_~j~0#1) = 1*ULTIMATE.start_main_~r~0#1 - 1*ULTIMATE.start_main_~j~0#1 Supporting invariants [] [2025-03-17 20:21:38,591 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Forceful destruction successful, exit code 0 [2025-03-17 20:21:38,591 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-17 20:21:38,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:21:38,604 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-17 20:21:38,610 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-17 20:21:38,610 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:21:38,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:21:38,610 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 20:21:38,619 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:21:38,623 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Forceful destruction successful, exit code 0 [2025-03-17 20:21:38,648 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-17 20:21:38,654 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-17 20:21:38,655 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:21:38,655 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:21:38,655 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-17 20:21:38,656 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:21:38,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 20:21:38,765 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2025-03-17 20:21:38,766 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 225 states and 253 transitions. cyclomatic complexity: 32 Second operand has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:21:38,798 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 225 states and 253 transitions. cyclomatic complexity: 32. Second operand has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 0 states have call successors, (0), 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 381 states and 417 transitions. Complement of second has 7 states. [2025-03-17 20:21:38,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-03-17 20:21:38,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:21:38,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 56 transitions. [2025-03-17 20:21:38,799 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 56 transitions. Stem has 18 letters. Loop has 25 letters. [2025-03-17 20:21:38,799 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:21:38,799 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-17 20:21:38,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:21:38,812 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-17 20:21:38,821 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-17 20:21:38,821 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:21:38,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:21:38,822 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 20:21:38,822 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:21:38,845 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-17 20:21:38,851 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-17 20:21:38,852 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:21:38,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:21:38,852 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-17 20:21:38,853 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:21:38,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 20:21:38,960 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 5 loop predicates [2025-03-17 20:21:38,960 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 225 states and 253 transitions. cyclomatic complexity: 32 Second operand has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:21:39,066 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 225 states and 253 transitions. cyclomatic complexity: 32. Second operand has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 0 states have call successors, (0), 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 461 states and 499 transitions. Complement of second has 15 states. [2025-03-17 20:21:39,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 1 stem states 6 non-accepting loop states 1 accepting loop states [2025-03-17 20:21:39,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:21:39,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 75 transitions. [2025-03-17 20:21:39,067 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 75 transitions. Stem has 18 letters. Loop has 25 letters. [2025-03-17 20:21:39,067 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:21:39,067 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-17 20:21:39,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:21:39,078 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-17 20:21:39,087 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-17 20:21:39,087 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:21:39,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:21:39,089 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 20:21:39,090 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:21:39,118 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-17 20:21:39,123 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-17 20:21:39,123 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:21:39,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:21:39,124 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-17 20:21:39,125 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:21:39,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 20:21:39,241 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-03-17 20:21:39,241 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 225 states and 253 transitions. cyclomatic complexity: 32 Second operand has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:21:39,297 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 225 states and 253 transitions. cyclomatic complexity: 32. Second operand has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 0 states have call successors, (0), 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 760 states and 823 transitions. Complement of second has 7 states. [2025-03-17 20:21:39,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-03-17 20:21:39,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:21:39,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 106 transitions. [2025-03-17 20:21:39,299 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 106 transitions. Stem has 18 letters. Loop has 25 letters. [2025-03-17 20:21:39,299 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:21:39,299 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-17 20:21:39,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:21:39,313 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-17 20:21:39,318 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-17 20:21:39,318 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:21:39,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:21:39,319 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 20:21:39,319 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:21:39,344 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-17 20:21:39,351 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-17 20:21:39,351 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:21:39,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:21:39,352 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-17 20:21:39,352 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:21:39,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 20:21:39,458 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and with honda bouncer for loop.1 stem predicates 5 loop predicates [2025-03-17 20:21:39,459 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 225 states and 253 transitions. cyclomatic complexity: 32 Second operand has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:21:39,578 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 225 states and 253 transitions. cyclomatic complexity: 32. Second operand has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 0 states have call successors, (0), 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 912 states and 982 transitions. Complement of second has 14 states. [2025-03-17 20:21:39,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 1 stem states 6 non-accepting loop states 1 accepting loop states [2025-03-17 20:21:39,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:21:39,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 130 transitions. [2025-03-17 20:21:39,579 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 130 transitions. Stem has 18 letters. Loop has 25 letters. [2025-03-17 20:21:39,580 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:21:39,580 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 130 transitions. Stem has 43 letters. Loop has 25 letters. [2025-03-17 20:21:39,580 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:21:39,580 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 130 transitions. Stem has 18 letters. Loop has 50 letters. [2025-03-17 20:21:39,580 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:21:39,580 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 912 states and 982 transitions. [2025-03-17 20:21:39,586 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2025-03-17 20:21:39,588 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 912 states to 631 states and 695 transitions. [2025-03-17 20:21:39,588 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 56 [2025-03-17 20:21:39,588 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 57 [2025-03-17 20:21:39,588 INFO L73 IsDeterministic]: Start isDeterministic. Operand 631 states and 695 transitions. [2025-03-17 20:21:39,589 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 20:21:39,589 INFO L218 hiAutomatonCegarLoop]: Abstraction has 631 states and 695 transitions. [2025-03-17 20:21:39,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states and 695 transitions. [2025-03-17 20:21:39,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 417. [2025-03-17 20:21:39,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 417 states, 417 states have (on average 1.1175059952038369) internal successors, (466), 416 states have internal predecessors, (466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:21:39,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 466 transitions. [2025-03-17 20:21:39,598 INFO L240 hiAutomatonCegarLoop]: Abstraction has 417 states and 466 transitions. [2025-03-17 20:21:39,598 INFO L432 stractBuchiCegarLoop]: Abstraction has 417 states and 466 transitions. [2025-03-17 20:21:39,598 INFO L338 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2025-03-17 20:21:39,598 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 417 states and 466 transitions. [2025-03-17 20:21:39,600 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2025-03-17 20:21:39,600 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:21:39,600 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:21:39,600 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] [2025-03-17 20:21:39,600 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 20:21:39,600 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;main_#in~argc#1, main_#in~argv#1.base, main_#in~argv#1.offset := #in~argc#1, #in~argv#1.base, #in~argv#1.offset;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post2#1, main_#t~post3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post6#1, main_#t~post7#1, main_~argc#1, main_~n~0#1, main_~l~0#1, main_~r~0#1, main_~i~0#1, main_~j~0#1;main_~argc#1 := main_#in~argc#1;havoc main_~n~0#1;havoc main_~l~0#1;havoc main_~r~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet1#1;main_~n~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;" "assume !!(1 <= main_~n~0#1 && main_~n~0#1 <= 1000000);main_~l~0#1 := 1 + (if main_~n~0#1 < 0 && 0 != main_~n~0#1 % 2 then 1 + main_~n~0#1 / 2 else main_~n~0#1 / 2);main_~r~0#1 := main_~n~0#1;" "assume main_~l~0#1 > 1;main_#t~post2#1 := main_~l~0#1;main_~l~0#1 := main_#t~post2#1 - 1;havoc main_#t~post2#1;" "assume main_~r~0#1 > 1;main_~i~0#1 := main_~l~0#1;main_~j~0#1 := 2 * main_~l~0#1;" "assume main_~j~0#1 <= main_~r~0#1;" "assume !(main_~j~0#1 < main_~r~0#1);" "assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 1 <= main_~j~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_#t~nondet5#1;" "assume 0 != main_#t~nondet5#1;havoc main_#t~nondet5#1;" "assume main_~l~0#1 > 1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 1 <= main_~l~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~l~0#1 <= main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post6#1 := main_~l~0#1;main_~l~0#1 := main_#t~post6#1 - 1;havoc main_#t~post6#1;" "assume main_~r~0#1 > 1;main_~i~0#1 := main_~l~0#1;main_~j~0#1 := 2 * main_~l~0#1;" "assume main_~j~0#1 <= main_~r~0#1;" "assume main_~j~0#1 < main_~r~0#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 1 <= main_~j~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 1 <= 1 + main_~j~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 1 + main_~j~0#1 <= main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_#t~nondet4#1;" "assume !(0 != main_#t~nondet4#1);havoc main_#t~nondet4#1;" [2025-03-17 20:21:39,600 INFO L754 eck$LassoCheckResult]: Loop: "assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 1 <= main_~j~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_#t~nondet5#1;" "assume !(0 != main_#t~nondet5#1);havoc main_#t~nondet5#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 1 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 1 <= main_~j~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_~i~0#1 := main_~j~0#1;main_~j~0#1 := 2 * main_~j~0#1;" "assume main_~j~0#1 <= main_~r~0#1;" "assume main_~j~0#1 < main_~r~0#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 1 <= main_~j~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 1 <= 1 + main_~j~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 1 + main_~j~0#1 <= main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_#t~nondet4#1;" "assume 0 != main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1;" [2025-03-17 20:21:39,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:21:39,605 INFO L85 PathProgramCache]: Analyzing trace with hash -463332379, now seen corresponding path program 1 times [2025-03-17 20:21:39,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:21:39,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126912840] [2025-03-17 20:21:39,605 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:21:39,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:21:39,608 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-17 20:21:39,611 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-17 20:21:39,611 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:21:39,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:21:39,612 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:21:39,613 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-17 20:21:39,616 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-17 20:21:39,616 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:21:39,616 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:21:39,617 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:21:39,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:21:39,618 INFO L85 PathProgramCache]: Analyzing trace with hash -176436206, now seen corresponding path program 3 times [2025-03-17 20:21:39,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:21:39,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064731893] [2025-03-17 20:21:39,618 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 20:21:39,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:21:39,621 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 1 equivalence classes. [2025-03-17 20:21:39,624 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-17 20:21:39,624 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-17 20:21:39,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:21:39,624 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:21:39,625 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-17 20:21:39,629 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-17 20:21:39,629 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:21:39,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:21:39,633 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:21:39,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:21:39,634 INFO L85 PathProgramCache]: Analyzing trace with hash -190048082, now seen corresponding path program 1 times [2025-03-17 20:21:39,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:21:39,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123151961] [2025-03-17 20:21:39,634 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:21:39,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:21:39,640 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-17 20:21:39,644 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-17 20:21:39,644 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:21:39,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:21:39,719 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 10 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 20:21:39,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 20:21:39,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123151961] [2025-03-17 20:21:39,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123151961] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 20:21:39,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1424522137] [2025-03-17 20:21:39,720 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:21:39,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 20:21:39,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:21:39,721 INFO L229 MonitoredProcess]: Starting monitored process 62 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 20:21:39,723 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (62)] Waiting until timeout for monitored process [2025-03-17 20:21:39,761 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-17 20:21:39,780 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-17 20:21:39,780 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:21:39,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:21:39,783 INFO L256 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-17 20:21:39,784 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:21:39,932 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 20:21:39,932 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 20:21:40,026 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 10 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 20:21:40,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1424522137] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 20:21:40,026 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 20:21:40,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2025-03-17 20:21:40,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689385079] [2025-03-17 20:21:40,026 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 20:21:40,194 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 20:21:40,194 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 20:21:40,194 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 20:21:40,194 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 20:21:40,194 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-17 20:21:40,194 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:21:40,194 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 20:21:40,194 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 20:21:40,194 INFO L132 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration10_Loop [2025-03-17 20:21:40,194 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 20:21:40,194 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 20:21:40,195 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:21:40,208 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:21:40,209 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:21:40,210 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:21:40,212 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:21:40,241 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 20:21:40,241 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-17 20:21:40,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:21:40,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:21:40,249 INFO L229 MonitoredProcess]: Starting monitored process 63 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:21:40,250 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Waiting until timeout for monitored process [2025-03-17 20:21:40,251 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 20:21:40,251 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 20:21:40,279 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Ended with exit code 0 [2025-03-17 20:21:40,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:21:40,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:21:40,282 INFO L229 MonitoredProcess]: Starting monitored process 64 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:21:40,283 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Waiting until timeout for monitored process [2025-03-17 20:21:40,284 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-17 20:21:40,284 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 20:21:40,333 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-17 20:21:40,337 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Ended with exit code 0 [2025-03-17 20:21:40,338 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 20:21:40,338 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 20:21:40,338 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 20:21:40,338 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 20:21:40,338 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 20:21:40,338 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:21:40,338 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 20:21:40,338 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 20:21:40,338 INFO L132 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration10_Loop [2025-03-17 20:21:40,338 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 20:21:40,338 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 20:21:40,338 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:21:40,346 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:21:40,348 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:21:40,349 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:21:40,351 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:21:40,381 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 20:21:40,381 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 20:21:40,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:21:40,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:21:40,383 INFO L229 MonitoredProcess]: Starting monitored process 65 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:21:40,384 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Waiting until timeout for monitored process [2025-03-17 20:21:40,385 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:21:40,395 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:21:40,395 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:21:40,396 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:21:40,396 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:21:40,396 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:21:40,397 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:21:40,397 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:21:40,399 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-17 20:21:40,401 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-03-17 20:21:40,401 INFO L444 ModelExtractionUtils]: 2 out of 6 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-03-17 20:21:40,401 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:21:40,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:21:40,403 INFO L229 MonitoredProcess]: Starting monitored process 66 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:21:40,404 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Waiting until timeout for monitored process [2025-03-17 20:21:40,404 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-17 20:21:40,404 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-17 20:21:40,404 INFO L474 LassoAnalysis]: Proved termination. [2025-03-17 20:21:40,404 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~r~0#1, ULTIMATE.start_main_~j~0#1) = 2*ULTIMATE.start_main_~r~0#1 - 3*ULTIMATE.start_main_~j~0#1 Supporting invariants [] [2025-03-17 20:21:40,411 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Ended with exit code 0 [2025-03-17 20:21:40,411 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-17 20:21:40,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:21:40,441 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Ended with exit code 0 [2025-03-17 20:21:40,442 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-17 20:21:40,452 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-17 20:21:40,452 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:21:40,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:21:40,453 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 20:21:40,453 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:21:40,478 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-17 20:21:40,484 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-17 20:21:40,484 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:21:40,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:21:40,485 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-17 20:21:40,486 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:21:40,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 20:21:40,621 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2025-03-17 20:21:40,622 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 417 states and 466 transitions. cyclomatic complexity: 54 Second operand has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:21:40,876 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 417 states and 466 transitions. cyclomatic complexity: 54. Second operand has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 0 states have call successors, (0), 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 1358 states and 1477 transitions. Complement of second has 23 states. [2025-03-17 20:21:40,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 1 stem states 10 non-accepting loop states 1 accepting loop states [2025-03-17 20:21:40,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:21:40,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 163 transitions. [2025-03-17 20:21:40,877 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 163 transitions. Stem has 29 letters. Loop has 25 letters. [2025-03-17 20:21:40,877 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:21:40,877 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 163 transitions. Stem has 54 letters. Loop has 25 letters. [2025-03-17 20:21:40,878 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:21:40,878 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 163 transitions. Stem has 29 letters. Loop has 50 letters. [2025-03-17 20:21:40,878 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:21:40,878 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1358 states and 1477 transitions. [2025-03-17 20:21:40,885 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 50 [2025-03-17 20:21:40,889 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1358 states to 1170 states and 1285 transitions. [2025-03-17 20:21:40,889 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 100 [2025-03-17 20:21:40,889 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 101 [2025-03-17 20:21:40,889 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1170 states and 1285 transitions. [2025-03-17 20:21:40,889 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 20:21:40,889 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1170 states and 1285 transitions. [2025-03-17 20:21:40,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1170 states and 1285 transitions. [2025-03-17 20:21:40,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1170 to 861. [2025-03-17 20:21:40,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 861 states, 861 states have (on average 1.10801393728223) internal successors, (954), 860 states have internal predecessors, (954), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:21:40,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 861 states to 861 states and 954 transitions. [2025-03-17 20:21:40,901 INFO L240 hiAutomatonCegarLoop]: Abstraction has 861 states and 954 transitions. [2025-03-17 20:21:40,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 20:21:40,902 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-17 20:21:40,902 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2025-03-17 20:21:40,902 INFO L87 Difference]: Start difference. First operand 861 states and 954 transitions. Second operand has 14 states, 14 states have (on average 6.928571428571429) internal successors, (97), 14 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:21:41,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 20:21:41,675 INFO L93 Difference]: Finished difference Result 4165 states and 4469 transitions. [2025-03-17 20:21:41,675 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4165 states and 4469 transitions. [2025-03-17 20:21:41,691 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 114 [2025-03-17 20:21:41,699 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4165 states to 2897 states and 3125 transitions. [2025-03-17 20:21:41,700 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 275 [2025-03-17 20:21:41,700 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 275 [2025-03-17 20:21:41,700 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2897 states and 3125 transitions. [2025-03-17 20:21:41,700 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 20:21:41,700 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2897 states and 3125 transitions. [2025-03-17 20:21:41,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2897 states and 3125 transitions. [2025-03-17 20:21:41,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2897 to 1302. [2025-03-17 20:21:41,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1302 states, 1302 states have (on average 1.1029185867895546) internal successors, (1436), 1301 states have internal predecessors, (1436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:21:41,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1302 states to 1302 states and 1436 transitions. [2025-03-17 20:21:41,745 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1302 states and 1436 transitions. [2025-03-17 20:21:41,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2025-03-17 20:21:41,746 INFO L432 stractBuchiCegarLoop]: Abstraction has 1302 states and 1436 transitions. [2025-03-17 20:21:41,746 INFO L338 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2025-03-17 20:21:41,746 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1302 states and 1436 transitions. [2025-03-17 20:21:41,749 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 50 [2025-03-17 20:21:41,749 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:21:41,749 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:21:41,749 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 20:21:41,749 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 20:21:41,750 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;main_#in~argc#1, main_#in~argv#1.base, main_#in~argv#1.offset := #in~argc#1, #in~argv#1.base, #in~argv#1.offset;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post2#1, main_#t~post3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post6#1, main_#t~post7#1, main_~argc#1, main_~n~0#1, main_~l~0#1, main_~r~0#1, main_~i~0#1, main_~j~0#1;main_~argc#1 := main_#in~argc#1;havoc main_~n~0#1;havoc main_~l~0#1;havoc main_~r~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet1#1;main_~n~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;" "assume !!(1 <= main_~n~0#1 && main_~n~0#1 <= 1000000);main_~l~0#1 := 1 + (if main_~n~0#1 < 0 && 0 != main_~n~0#1 % 2 then 1 + main_~n~0#1 / 2 else main_~n~0#1 / 2);main_~r~0#1 := main_~n~0#1;" "assume main_~l~0#1 > 1;main_#t~post2#1 := main_~l~0#1;main_~l~0#1 := main_#t~post2#1 - 1;havoc main_#t~post2#1;" "assume main_~r~0#1 > 1;main_~i~0#1 := main_~l~0#1;main_~j~0#1 := 2 * main_~l~0#1;" "assume main_~j~0#1 <= main_~r~0#1;" "assume main_~j~0#1 < main_~r~0#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 1 <= main_~j~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 1 <= 1 + main_~j~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 1 + main_~j~0#1 <= main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_#t~nondet4#1;" "assume !(0 != main_#t~nondet4#1);havoc main_#t~nondet4#1;" "assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 1 <= main_~j~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_#t~nondet5#1;" "assume 0 != main_#t~nondet5#1;havoc main_#t~nondet5#1;" "assume main_~l~0#1 > 1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 1 <= main_~l~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~l~0#1 <= main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post6#1 := main_~l~0#1;main_~l~0#1 := main_#t~post6#1 - 1;havoc main_#t~post6#1;" "assume main_~r~0#1 > 1;main_~i~0#1 := main_~l~0#1;main_~j~0#1 := 2 * main_~l~0#1;" "assume main_~j~0#1 <= main_~r~0#1;" "assume main_~j~0#1 < main_~r~0#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 1 <= main_~j~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 1 <= 1 + main_~j~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 1 + main_~j~0#1 <= main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_#t~nondet4#1;" "assume !(0 != main_#t~nondet4#1);havoc main_#t~nondet4#1;" [2025-03-17 20:21:41,750 INFO L754 eck$LassoCheckResult]: Loop: "assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 1 <= main_~j~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_#t~nondet5#1;" "assume !(0 != main_#t~nondet5#1);havoc main_#t~nondet5#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 1 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 1 <= main_~j~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_~i~0#1 := main_~j~0#1;main_~j~0#1 := 2 * main_~j~0#1;" "assume main_~j~0#1 <= main_~r~0#1;" "assume main_~j~0#1 < main_~r~0#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 1 <= main_~j~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 1 <= 1 + main_~j~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 1 + main_~j~0#1 <= main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_#t~nondet4#1;" "assume 0 != main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1;" [2025-03-17 20:21:41,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:21:41,752 INFO L85 PathProgramCache]: Analyzing trace with hash -365824859, now seen corresponding path program 1 times [2025-03-17 20:21:41,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:21:41,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430941041] [2025-03-17 20:21:41,752 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:21:41,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:21:41,757 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-17 20:21:41,761 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-17 20:21:41,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:21:41,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:21:41,761 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:21:41,763 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-17 20:21:41,769 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-17 20:21:41,772 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:21:41,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:21:41,774 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:21:41,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:21:41,775 INFO L85 PathProgramCache]: Analyzing trace with hash -176436206, now seen corresponding path program 4 times [2025-03-17 20:21:41,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:21:41,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506940149] [2025-03-17 20:21:41,775 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 20:21:41,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:21:41,778 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-03-17 20:21:41,784 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-03-17 20:21:41,784 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 20:21:41,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:21:41,786 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:21:41,787 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-17 20:21:41,791 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-17 20:21:41,792 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:21:41,792 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:21:41,794 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:21:41,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:21:41,794 INFO L85 PathProgramCache]: Analyzing trace with hash -2032298002, now seen corresponding path program 1 times [2025-03-17 20:21:41,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:21:41,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502251489] [2025-03-17 20:21:41,794 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:21:41,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:21:41,800 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-17 20:21:41,809 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-17 20:21:41,809 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:21:41,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:21:41,809 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:21:41,811 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-17 20:21:41,816 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-17 20:21:41,816 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:21:41,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:21:41,819 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:21:41,962 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 20:21:41,962 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 20:21:41,962 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 20:21:41,962 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 20:21:41,962 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-17 20:21:41,962 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:21:41,962 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 20:21:41,962 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 20:21:41,962 INFO L132 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration11_Loop [2025-03-17 20:21:41,962 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 20:21:41,962 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 20:21:41,963 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:21:41,964 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:21:41,965 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:21:41,967 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:21:41,977 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:21:42,002 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 20:21:42,002 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-17 20:21:42,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:21:42,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:21:42,005 INFO L229 MonitoredProcess]: Starting monitored process 67 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:21:42,005 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Waiting until timeout for monitored process [2025-03-17 20:21:42,006 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 20:21:42,006 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 20:21:42,016 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 20:21:42,017 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start___VERIFIER_assert_#in~cond#1=0} Honda state: {ULTIMATE.start___VERIFIER_assert_#in~cond#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-17 20:21:42,022 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Ended with exit code 0 [2025-03-17 20:21:42,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:21:42,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:21:42,024 INFO L229 MonitoredProcess]: Starting monitored process 68 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:21:42,025 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Waiting until timeout for monitored process [2025-03-17 20:21:42,026 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 20:21:42,026 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 20:21:42,037 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 20:21:42,038 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet4#1=0} Honda state: {ULTIMATE.start_main_#t~nondet4#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-17 20:21:42,043 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Ended with exit code 0 [2025-03-17 20:21:42,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:21:42,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:21:42,045 INFO L229 MonitoredProcess]: Starting monitored process 69 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:21:42,046 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Waiting until timeout for monitored process [2025-03-17 20:21:42,046 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 20:21:42,046 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 20:21:42,056 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 20:21:42,057 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet5#1=0} Honda state: {ULTIMATE.start_main_#t~nondet5#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-17 20:21:42,062 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Ended with exit code 0 [2025-03-17 20:21:42,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:21:42,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:21:42,064 INFO L229 MonitoredProcess]: Starting monitored process 70 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:21:42,064 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Waiting until timeout for monitored process [2025-03-17 20:21:42,066 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 20:21:42,066 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 20:21:42,088 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Ended with exit code 0 [2025-03-17 20:21:42,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:21:42,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:21:42,090 INFO L229 MonitoredProcess]: Starting monitored process 71 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:21:42,091 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Waiting until timeout for monitored process [2025-03-17 20:21:42,092 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-17 20:21:42,092 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 20:21:42,139 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-17 20:21:42,143 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Ended with exit code 0 [2025-03-17 20:21:42,143 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 20:21:42,143 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 20:21:42,143 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 20:21:42,143 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 20:21:42,143 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 20:21:42,143 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:21:42,143 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 20:21:42,143 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 20:21:42,143 INFO L132 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration11_Loop [2025-03-17 20:21:42,143 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 20:21:42,143 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 20:21:42,144 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:21:42,149 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:21:42,151 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:21:42,152 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:21:42,153 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:21:42,185 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 20:21:42,186 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 20:21:42,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:21:42,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:21:42,187 INFO L229 MonitoredProcess]: Starting monitored process 72 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:21:42,189 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Waiting until timeout for monitored process [2025-03-17 20:21:42,189 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:21:42,200 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:21:42,200 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:21:42,200 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:21:42,200 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:21:42,201 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:21:42,201 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:21:42,201 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:21:42,202 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:21:42,207 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Forceful destruction successful, exit code 0 [2025-03-17 20:21:42,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:21:42,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:21:42,209 INFO L229 MonitoredProcess]: Starting monitored process 73 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:21:42,225 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Waiting until timeout for monitored process [2025-03-17 20:21:42,225 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:21:42,235 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:21:42,235 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:21:42,235 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:21:42,235 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:21:42,235 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:21:42,236 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:21:42,236 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:21:42,237 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:21:42,243 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Ended with exit code 0 [2025-03-17 20:21:42,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:21:42,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:21:42,245 INFO L229 MonitoredProcess]: Starting monitored process 74 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:21:42,246 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Waiting until timeout for monitored process [2025-03-17 20:21:42,247 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:21:42,256 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:21:42,256 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:21:42,256 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:21:42,256 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:21:42,256 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:21:42,257 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:21:42,257 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:21:42,258 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:21:42,264 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Ended with exit code 0 [2025-03-17 20:21:42,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:21:42,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:21:42,266 INFO L229 MonitoredProcess]: Starting monitored process 75 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:21:42,266 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Waiting until timeout for monitored process [2025-03-17 20:21:42,267 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:21:42,279 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:21:42,279 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:21:42,279 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:21:42,279 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:21:42,279 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:21:42,280 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:21:42,280 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:21:42,281 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:21:42,286 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Ended with exit code 0 [2025-03-17 20:21:42,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:21:42,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:21:42,288 INFO L229 MonitoredProcess]: Starting monitored process 76 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:21:42,289 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Waiting until timeout for monitored process [2025-03-17 20:21:42,291 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:21:42,301 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:21:42,301 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:21:42,301 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:21:42,301 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:21:42,301 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:21:42,306 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:21:42,306 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:21:42,308 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-17 20:21:42,312 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-03-17 20:21:42,312 INFO L444 ModelExtractionUtils]: 2 out of 6 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-03-17 20:21:42,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:21:42,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:21:42,314 INFO L229 MonitoredProcess]: Starting monitored process 77 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:21:42,316 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Waiting until timeout for monitored process [2025-03-17 20:21:42,316 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-17 20:21:42,317 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-17 20:21:42,317 INFO L474 LassoAnalysis]: Proved termination. [2025-03-17 20:21:42,317 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0#1, ULTIMATE.start_main_~r~0#1) = -3*ULTIMATE.start_main_~j~0#1 + 2*ULTIMATE.start_main_~r~0#1 Supporting invariants [] [2025-03-17 20:21:42,323 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Ended with exit code 0 [2025-03-17 20:21:42,323 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-17 20:21:42,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:21:42,339 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-17 20:21:42,351 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-17 20:21:42,351 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:21:42,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:21:42,351 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 20:21:42,352 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:21:42,387 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-17 20:21:42,394 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-17 20:21:42,394 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:21:42,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:21:42,395 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-17 20:21:42,395 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:21:42,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 20:21:42,513 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2025-03-17 20:21:42,514 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1302 states and 1436 transitions. cyclomatic complexity: 151 Second operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:21:42,743 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1302 states and 1436 transitions. cyclomatic complexity: 151. Second operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 2333 states and 2515 transitions. Complement of second has 21 states. [2025-03-17 20:21:42,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 1 stem states 9 non-accepting loop states 1 accepting loop states [2025-03-17 20:21:42,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:21:42,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 163 transitions. [2025-03-17 20:21:42,745 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 163 transitions. Stem has 38 letters. Loop has 25 letters. [2025-03-17 20:21:42,745 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:21:42,745 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-17 20:21:42,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:21:42,759 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-17 20:21:42,769 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-17 20:21:42,769 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:21:42,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:21:42,770 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 20:21:42,771 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:21:42,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-17 20:21:42,811 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-17 20:21:42,811 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:21:42,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:21:42,812 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-17 20:21:42,812 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:21:42,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 20:21:42,916 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 5 loop predicates [2025-03-17 20:21:42,916 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1302 states and 1436 transitions. cyclomatic complexity: 151 Second operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:21:43,109 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Ended with exit code 0 [2025-03-17 20:21:43,119 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1302 states and 1436 transitions. cyclomatic complexity: 151. Second operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 0 states have call successors, (0), 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 2332 states and 2515 transitions. Complement of second has 21 states. [2025-03-17 20:21:43,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 1 stem states 9 non-accepting loop states 1 accepting loop states [2025-03-17 20:21:43,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:21:43,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 163 transitions. [2025-03-17 20:21:43,120 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 163 transitions. Stem has 38 letters. Loop has 25 letters. [2025-03-17 20:21:43,120 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:21:43,120 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-17 20:21:43,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:21:43,137 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-17 20:21:43,145 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-17 20:21:43,145 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:21:43,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:21:43,146 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 20:21:43,146 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:21:43,172 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-17 20:21:43,181 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-17 20:21:43,182 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:21:43,182 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:21:43,183 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-17 20:21:43,184 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:21:43,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 20:21:43,298 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2025-03-17 20:21:43,298 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1302 states and 1436 transitions. cyclomatic complexity: 151 Second operand has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:21:43,513 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1302 states and 1436 transitions. cyclomatic complexity: 151. Second operand has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 0 states have call successors, (0), 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 2891 states and 3101 transitions. Complement of second has 35 states. [2025-03-17 20:21:43,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 1 stem states 10 non-accepting loop states 1 accepting loop states [2025-03-17 20:21:43,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:21:43,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 164 transitions. [2025-03-17 20:21:43,514 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 164 transitions. Stem has 38 letters. Loop has 25 letters. [2025-03-17 20:21:43,514 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:21:43,514 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 164 transitions. Stem has 63 letters. Loop has 25 letters. [2025-03-17 20:21:43,514 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:21:43,514 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 164 transitions. Stem has 38 letters. Loop has 50 letters. [2025-03-17 20:21:43,514 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:21:43,514 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2891 states and 3101 transitions. [2025-03-17 20:21:43,522 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 50 [2025-03-17 20:21:43,528 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2891 states to 1956 states and 2132 transitions. [2025-03-17 20:21:43,528 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 118 [2025-03-17 20:21:43,528 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 122 [2025-03-17 20:21:43,528 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1956 states and 2132 transitions. [2025-03-17 20:21:43,528 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 20:21:43,528 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1956 states and 2132 transitions. [2025-03-17 20:21:43,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1956 states and 2132 transitions. [2025-03-17 20:21:43,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1956 to 740. [2025-03-17 20:21:43,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 740 states, 740 states have (on average 1.1) internal successors, (814), 739 states have internal predecessors, (814), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:21:43,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 740 states to 740 states and 814 transitions. [2025-03-17 20:21:43,539 INFO L240 hiAutomatonCegarLoop]: Abstraction has 740 states and 814 transitions. [2025-03-17 20:21:43,539 INFO L432 stractBuchiCegarLoop]: Abstraction has 740 states and 814 transitions. [2025-03-17 20:21:43,539 INFO L338 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2025-03-17 20:21:43,539 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 740 states and 814 transitions. [2025-03-17 20:21:43,541 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2025-03-17 20:21:43,541 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:21:43,541 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:21:43,541 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 20:21:43,541 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 20:21:43,542 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;main_#in~argc#1, main_#in~argv#1.base, main_#in~argv#1.offset := #in~argc#1, #in~argv#1.base, #in~argv#1.offset;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post2#1, main_#t~post3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post6#1, main_#t~post7#1, main_~argc#1, main_~n~0#1, main_~l~0#1, main_~r~0#1, main_~i~0#1, main_~j~0#1;main_~argc#1 := main_#in~argc#1;havoc main_~n~0#1;havoc main_~l~0#1;havoc main_~r~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet1#1;main_~n~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;" "assume !!(1 <= main_~n~0#1 && main_~n~0#1 <= 1000000);main_~l~0#1 := 1 + (if main_~n~0#1 < 0 && 0 != main_~n~0#1 % 2 then 1 + main_~n~0#1 / 2 else main_~n~0#1 / 2);main_~r~0#1 := main_~n~0#1;" "assume main_~l~0#1 > 1;main_#t~post2#1 := main_~l~0#1;main_~l~0#1 := main_#t~post2#1 - 1;havoc main_#t~post2#1;" "assume main_~r~0#1 > 1;main_~i~0#1 := main_~l~0#1;main_~j~0#1 := 2 * main_~l~0#1;" "assume main_~j~0#1 <= main_~r~0#1;" "assume main_~j~0#1 < main_~r~0#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 1 <= main_~j~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 1 <= 1 + main_~j~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 1 + main_~j~0#1 <= main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_#t~nondet4#1;" "assume 0 != main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1;" "assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 1 <= main_~j~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_#t~nondet5#1;" "assume 0 != main_#t~nondet5#1;havoc main_#t~nondet5#1;" "assume main_~l~0#1 > 1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 1 <= main_~l~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~l~0#1 <= main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post6#1 := main_~l~0#1;main_~l~0#1 := main_#t~post6#1 - 1;havoc main_#t~post6#1;" "assume main_~r~0#1 > 1;main_~i~0#1 := main_~l~0#1;main_~j~0#1 := 2 * main_~l~0#1;" "assume main_~j~0#1 <= main_~r~0#1;" "assume main_~j~0#1 < main_~r~0#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 1 <= main_~j~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 1 <= 1 + main_~j~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 1 + main_~j~0#1 <= main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_#t~nondet4#1;" "assume !(0 != main_#t~nondet4#1);havoc main_#t~nondet4#1;" "assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 1 <= main_~j~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" [2025-03-17 20:21:43,542 INFO L754 eck$LassoCheckResult]: Loop: "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_#t~nondet5#1;" "assume !(0 != main_#t~nondet5#1);havoc main_#t~nondet5#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 1 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 1 <= main_~j~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_~i~0#1 := main_~j~0#1;main_~j~0#1 := 2 * main_~j~0#1;" "assume main_~j~0#1 <= main_~r~0#1;" "assume main_~j~0#1 < main_~r~0#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 1 <= main_~j~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 1 <= 1 + main_~j~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 1 + main_~j~0#1 <= main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_#t~nondet4#1;" "assume !(0 != main_#t~nondet4#1);havoc main_#t~nondet4#1;" "assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 1 <= main_~j~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" [2025-03-17 20:21:43,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:21:43,542 INFO L85 PathProgramCache]: Analyzing trace with hash -673426625, now seen corresponding path program 1 times [2025-03-17 20:21:43,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:21:43,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910489348] [2025-03-17 20:21:43,542 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:21:43,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:21:43,547 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-17 20:21:43,550 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-17 20:21:43,551 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:21:43,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:21:43,551 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:21:43,552 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-17 20:21:43,555 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-17 20:21:43,555 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:21:43,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:21:43,557 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:21:43,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:21:43,558 INFO L85 PathProgramCache]: Analyzing trace with hash 49451413, now seen corresponding path program 1 times [2025-03-17 20:21:43,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:21:43,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979816166] [2025-03-17 20:21:43,558 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:21:43,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:21:43,563 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-17 20:21:43,566 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-17 20:21:43,566 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:21:43,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:21:43,567 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:21:43,567 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-17 20:21:43,573 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-17 20:21:43,573 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:21:43,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:21:43,574 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:21:43,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:21:43,574 INFO L85 PathProgramCache]: Analyzing trace with hash 1663811607, now seen corresponding path program 2 times [2025-03-17 20:21:43,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:21:43,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769174790] [2025-03-17 20:21:43,575 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 20:21:43,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:21:43,581 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 64 statements into 2 equivalence classes. [2025-03-17 20:21:43,587 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 64 of 64 statements. [2025-03-17 20:21:43,587 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 20:21:43,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:21:43,587 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:21:43,589 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-17 20:21:43,595 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-17 20:21:43,595 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:21:43,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:21:43,597 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:21:43,770 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 20:21:43,770 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 20:21:43,770 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 20:21:43,770 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 20:21:43,770 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-17 20:21:43,771 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:21:43,771 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 20:21:43,771 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 20:21:43,771 INFO L132 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration12_Loop [2025-03-17 20:21:43,771 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 20:21:43,771 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 20:21:43,771 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:21:43,773 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:21:43,774 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:21:43,776 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:21:43,785 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:21:43,829 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 20:21:43,829 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-17 20:21:43,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:21:43,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:21:43,831 INFO L229 MonitoredProcess]: Starting monitored process 78 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:21:43,832 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Waiting until timeout for monitored process [2025-03-17 20:21:43,833 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 20:21:43,833 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 20:21:43,844 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 20:21:43,845 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet4#1=0} Honda state: {ULTIMATE.start_main_#t~nondet4#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-17 20:21:43,850 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Forceful destruction successful, exit code 0 [2025-03-17 20:21:43,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:21:43,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:21:43,852 INFO L229 MonitoredProcess]: Starting monitored process 79 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:21:43,854 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Waiting until timeout for monitored process [2025-03-17 20:21:43,855 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 20:21:43,855 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 20:21:43,866 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 20:21:43,866 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start___VERIFIER_assert_#in~cond#1=0} Honda state: {ULTIMATE.start___VERIFIER_assert_#in~cond#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-17 20:21:43,872 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Forceful destruction successful, exit code 0 [2025-03-17 20:21:43,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:21:43,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:21:43,875 INFO L229 MonitoredProcess]: Starting monitored process 80 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:21:43,876 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Waiting until timeout for monitored process [2025-03-17 20:21:43,877 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 20:21:43,877 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 20:21:43,887 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 20:21:43,888 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet5#1=0} Honda state: {ULTIMATE.start_main_#t~nondet5#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-17 20:21:43,893 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Ended with exit code 0 [2025-03-17 20:21:43,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:21:43,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:21:43,895 INFO L229 MonitoredProcess]: Starting monitored process 81 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:21:43,895 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Waiting until timeout for monitored process [2025-03-17 20:21:43,896 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 20:21:43,896 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 20:21:43,919 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Forceful destruction successful, exit code 0 [2025-03-17 20:21:43,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:21:43,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:21:43,921 INFO L229 MonitoredProcess]: Starting monitored process 82 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:21:43,922 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Waiting until timeout for monitored process [2025-03-17 20:21:43,923 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-17 20:21:43,923 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 20:21:44,089 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-17 20:21:44,095 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Ended with exit code 0 [2025-03-17 20:21:44,095 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 20:21:44,095 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 20:21:44,095 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 20:21:44,095 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 20:21:44,095 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 20:21:44,095 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:21:44,096 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 20:21:44,096 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 20:21:44,096 INFO L132 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration12_Loop [2025-03-17 20:21:44,096 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 20:21:44,096 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 20:21:44,096 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:21:44,098 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:21:44,099 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:21:44,101 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:21:44,109 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:21:44,157 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 20:21:44,157 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 20:21:44,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:21:44,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:21:44,159 INFO L229 MonitoredProcess]: Starting monitored process 83 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:21:44,161 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Waiting until timeout for monitored process [2025-03-17 20:21:44,161 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:21:44,171 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:21:44,172 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:21:44,172 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:21:44,172 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:21:44,172 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:21:44,173 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:21:44,173 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:21:44,174 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:21:44,180 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Ended with exit code 0 [2025-03-17 20:21:44,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:21:44,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:21:44,182 INFO L229 MonitoredProcess]: Starting monitored process 84 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:21:44,182 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Waiting until timeout for monitored process [2025-03-17 20:21:44,186 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:21:44,196 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:21:44,196 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:21:44,196 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:21:44,196 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:21:44,196 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:21:44,196 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:21:44,196 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:21:44,197 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:21:44,202 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Ended with exit code 0 [2025-03-17 20:21:44,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:21:44,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:21:44,204 INFO L229 MonitoredProcess]: Starting monitored process 85 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:21:44,205 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Waiting until timeout for monitored process [2025-03-17 20:21:44,206 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:21:44,215 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:21:44,215 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:21:44,215 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:21:44,215 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:21:44,215 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:21:44,216 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:21:44,216 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:21:44,216 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:21:44,222 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Ended with exit code 0 [2025-03-17 20:21:44,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:21:44,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:21:44,258 INFO L229 MonitoredProcess]: Starting monitored process 86 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:21:44,260 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (86)] Waiting until timeout for monitored process [2025-03-17 20:21:44,262 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:21:44,271 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:21:44,271 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:21:44,272 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:21:44,272 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:21:44,272 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:21:44,273 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:21:44,273 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:21:44,275 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-17 20:21:44,277 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-17 20:21:44,277 INFO L444 ModelExtractionUtils]: 2 out of 6 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-03-17 20:21:44,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:21:44,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:21:44,279 INFO L229 MonitoredProcess]: Starting monitored process 87 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:21:44,279 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (87)] Waiting until timeout for monitored process [2025-03-17 20:21:44,280 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-17 20:21:44,280 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-17 20:21:44,280 INFO L474 LassoAnalysis]: Proved termination. [2025-03-17 20:21:44,280 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0#1, ULTIMATE.start_main_~n~0#1) = -2*ULTIMATE.start_main_~j~0#1 + 1*ULTIMATE.start_main_~n~0#1 Supporting invariants [] [2025-03-17 20:21:44,286 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (86)] Ended with exit code 0 [2025-03-17 20:21:44,286 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-17 20:21:44,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:21:44,301 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-17 20:21:44,309 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-17 20:21:44,309 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:21:44,309 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:21:44,310 INFO L256 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 20:21:44,310 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:21:44,340 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-17 20:21:44,344 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-17 20:21:44,344 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:21:44,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:21:44,345 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-17 20:21:44,345 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:21:44,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 20:21:44,460 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2025-03-17 20:21:44,460 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 740 states and 814 transitions. cyclomatic complexity: 80 Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:21:44,543 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 740 states and 814 transitions. cyclomatic complexity: 80. 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 1071 states and 1160 transitions. Complement of second has 13 states. [2025-03-17 20:21:44,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2025-03-17 20:21:44,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:21:44,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 59 transitions. [2025-03-17 20:21:44,544 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 59 transitions. Stem has 39 letters. Loop has 25 letters. [2025-03-17 20:21:44,544 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:21:44,544 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-17 20:21:44,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:21:44,556 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-17 20:21:44,567 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-17 20:21:44,567 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:21:44,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:21:44,567 INFO L256 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 20:21:44,568 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:21:44,602 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-17 20:21:44,607 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-17 20:21:44,607 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:21:44,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:21:44,608 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-17 20:21:44,609 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:21:44,698 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (87)] Forceful destruction successful, exit code 0 [2025-03-17 20:21:44,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 20:21:44,732 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 6 loop predicates [2025-03-17 20:21:44,732 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 740 states and 814 transitions. cyclomatic complexity: 80 Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:21:44,828 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 740 states and 814 transitions. cyclomatic complexity: 80. 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 1071 states and 1160 transitions. Complement of second has 13 states. [2025-03-17 20:21:44,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2025-03-17 20:21:44,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:21:44,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 59 transitions. [2025-03-17 20:21:44,828 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 59 transitions. Stem has 39 letters. Loop has 25 letters. [2025-03-17 20:21:44,828 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:21:44,828 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-17 20:21:44,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:21:44,847 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-17 20:21:44,856 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-17 20:21:44,856 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:21:44,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:21:44,857 INFO L256 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 20:21:44,858 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:21:44,889 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-17 20:21:44,895 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-17 20:21:44,895 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:21:44,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:21:44,896 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-17 20:21:44,897 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:21:45,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 20:21:45,025 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2025-03-17 20:21:45,025 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 740 states and 814 transitions. cyclomatic complexity: 80 Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:21:45,187 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 740 states and 814 transitions. cyclomatic complexity: 80. 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 2073 states and 2220 transitions. Complement of second has 39 states. [2025-03-17 20:21:45,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 1 stem states 7 non-accepting loop states 1 accepting loop states [2025-03-17 20:21:45,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:21:45,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 128 transitions. [2025-03-17 20:21:45,188 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 128 transitions. Stem has 39 letters. Loop has 25 letters. [2025-03-17 20:21:45,188 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:21:45,188 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 128 transitions. Stem has 64 letters. Loop has 25 letters. [2025-03-17 20:21:45,188 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:21:45,188 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 128 transitions. Stem has 39 letters. Loop has 50 letters. [2025-03-17 20:21:45,189 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:21:45,189 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2073 states and 2220 transitions. [2025-03-17 20:21:45,194 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-03-17 20:21:45,194 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2073 states to 0 states and 0 transitions. [2025-03-17 20:21:45,194 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-03-17 20:21:45,194 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-03-17 20:21:45,194 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-03-17 20:21:45,194 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-17 20:21:45,194 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-17 20:21:45,194 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-17 20:21:45,194 INFO L432 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-17 20:21:45,194 INFO L338 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2025-03-17 20:21:45,194 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-03-17 20:21:45,194 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-03-17 20:21:45,194 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-03-17 20:21:45,200 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 17.03 08:21:45 BoogieIcfgContainer [2025-03-17 20:21:45,200 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-03-17 20:21:45,200 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 20:21:45,200 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 20:21:45,200 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 20:21:45,201 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 08:21:31" (3/4) ... [2025-03-17 20:21:45,202 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-17 20:21:45,203 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 20:21:45,204 INFO L158 Benchmark]: Toolchain (without parser) took 13915.82ms. Allocated memory was 142.6MB in the beginning and 218.1MB in the end (delta: 75.5MB). Free memory was 109.9MB in the beginning and 88.9MB in the end (delta: 21.0MB). Peak memory consumption was 100.4MB. Max. memory is 16.1GB. [2025-03-17 20:21:45,204 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 201.3MB. Free memory is still 126.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 20:21:45,205 INFO L158 Benchmark]: CACSL2BoogieTranslator took 162.30ms. Allocated memory is still 142.6MB. Free memory was 109.9MB in the beginning and 98.7MB in the end (delta: 11.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 20:21:45,205 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.45ms. Allocated memory is still 142.6MB. Free memory was 98.7MB in the beginning and 97.1MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 20:21:45,206 INFO L158 Benchmark]: Boogie Preprocessor took 26.47ms. Allocated memory is still 142.6MB. Free memory was 97.1MB in the beginning and 95.8MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 20:21:45,206 INFO L158 Benchmark]: IcfgBuilder took 307.22ms. Allocated memory is still 142.6MB. Free memory was 95.8MB in the beginning and 80.4MB in the end (delta: 15.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 20:21:45,206 INFO L158 Benchmark]: BuchiAutomizer took 13380.91ms. Allocated memory was 142.6MB in the beginning and 218.1MB in the end (delta: 75.5MB). Free memory was 80.4MB in the beginning and 88.9MB in the end (delta: -8.6MB). Peak memory consumption was 75.2MB. Max. memory is 16.1GB. [2025-03-17 20:21:45,206 INFO L158 Benchmark]: Witness Printer took 2.85ms. Allocated memory is still 218.1MB. Free memory was 88.9MB in the beginning and 88.9MB in the end (delta: 64.6kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 20:21:45,207 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.23ms. Allocated memory is still 201.3MB. Free memory is still 126.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 162.30ms. Allocated memory is still 142.6MB. Free memory was 109.9MB in the beginning and 98.7MB in the end (delta: 11.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.45ms. Allocated memory is still 142.6MB. Free memory was 98.7MB in the beginning and 97.1MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 26.47ms. Allocated memory is still 142.6MB. Free memory was 97.1MB in the beginning and 95.8MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 307.22ms. Allocated memory is still 142.6MB. Free memory was 95.8MB in the beginning and 80.4MB in the end (delta: 15.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * BuchiAutomizer took 13380.91ms. Allocated memory was 142.6MB in the beginning and 218.1MB in the end (delta: 75.5MB). Free memory was 80.4MB in the beginning and 88.9MB in the end (delta: -8.6MB). Peak memory consumption was 75.2MB. Max. memory is 16.1GB. * Witness Printer took 2.85ms. Allocated memory is still 218.1MB. Free memory was 88.9MB in the beginning and 88.9MB in the end (delta: 64.6kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 18 terminating modules (8 trivial, 7 deterministic, 3 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) 5 * r) + ((long long) -8 * j)) and consists of 9 locations. One deterministic module has affine ranking function (((long long) -3 * j) + ((long long) 2 * r)) and consists of 12 locations. One nondeterministic module has affine ranking function (((long long) -1 * j) + r) and consists of 8 locations. One nondeterministic module has affine ranking function (((long long) -3 * j) + ((long long) 2 * r)) and consists of 12 locations. One nondeterministic module has affine ranking function (((long long) -2 * j) + n) and consists of 9 locations. 8 modules have a trivial ranking function, the largest among these consists of 14 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 13.3s and 13 iterations. TraceHistogramMax:2. Analysis of lassos took 6.8s. Construction of modules took 1.6s. Büchi inclusion checks took 4.6s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 15. Automata minimization 0.2s AutomataMinimizationTime, 17 MinimizatonAttempts, 4474 StatesRemovedByMinimization, 16 NontrivialMinimizations. Non-live state removal took 0.1s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [7, 0, 2, 1, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2860 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2843 mSDsluCounter, 3905 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2434 mSDsCounter, 220 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3123 IncrementalHoareTripleChecker+Invalid, 3343 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 220 mSolverCounterUnsat, 1471 mSDtfsCounter, 3123 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT4 conc0 concLT6 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital29 mio100 ax100 hnf100 lsp98 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq147 hnf94 smp100 dnf100 smp100 tf105 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 25ms VariablesStem: 0 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 20 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 10 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 1.4s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-03-17 20:21:45,219 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (62)] Forceful destruction successful, exit code 0 [2025-03-17 20:21:45,420 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Ended with exit code 0 [2025-03-17 20:21:45,621 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE