./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 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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.5.800.v20200727-1323.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.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 21:26:35,192 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 21:26:35,253 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2024-11-12 21:26:35,258 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 21:26:35,260 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 21:26:35,290 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 21:26:35,292 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 21:26:35,293 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 21:26:35,293 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 21:26:35,295 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 21:26:35,295 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 21:26:35,295 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 21:26:35,296 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 21:26:35,296 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-12 21:26:35,296 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-12 21:26:35,296 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-12 21:26:35,297 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-12 21:26:35,297 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-12 21:26:35,298 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-12 21:26:35,299 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 21:26:35,299 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-12 21:26:35,302 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 21:26:35,302 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 21:26:35,302 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 21:26:35,302 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 21:26:35,302 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-12 21:26:35,302 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-12 21:26:35,302 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-12 21:26:35,302 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 21:26:35,303 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-12 21:26:35,303 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 21:26:35,303 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 21:26:35,303 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-12 21:26:35,303 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 21:26:35,303 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 21:26:35,304 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 21:26:35,304 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 21:26:35,304 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 21:26:35,304 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-12 21:26:35,304 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 [2024-11-12 21:26:35,502 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 21:26:35,524 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 21:26:35,526 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 21:26:35,527 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 21:26:35,528 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 21:26:35,529 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-invgen/heapsort.i [2024-11-12 21:26:36,952 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 21:26:37,123 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 21:26:37,124 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/heapsort.i [2024-11-12 21:26:37,133 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e062078c/0d49d2e31cc04227b44d0b64e3bca722/FLAGcf0045e42 [2024-11-12 21:26:37,148 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e062078c/0d49d2e31cc04227b44d0b64e3bca722 [2024-11-12 21:26:37,153 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 21:26:37,155 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 21:26:37,157 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 21:26:37,158 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 21:26:37,162 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 21:26:37,163 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 09:26:37" (1/1) ... [2024-11-12 21:26:37,163 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1bb9cb89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 09:26:37, skipping insertion in model container [2024-11-12 21:26:37,164 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 09:26:37" (1/1) ... [2024-11-12 21:26:37,185 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 21:26:37,369 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 21:26:37,396 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 21:26:37,426 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 21:26:37,479 INFO L204 MainTranslator]: Completed translation [2024-11-12 21:26:37,484 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 09:26:37 WrapperNode [2024-11-12 21:26:37,484 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 21:26:37,485 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 21:26:37,485 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 21:26:37,485 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 21:26:37,497 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 09:26:37" (1/1) ... [2024-11-12 21:26:37,506 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 09:26:37" (1/1) ... [2024-11-12 21:26:37,529 INFO L138 Inliner]: procedures = 16, calls = 21, calls flagged for inlining = 17, calls inlined = 30, statements flattened = 187 [2024-11-12 21:26:37,529 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 21:26:37,529 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 21:26:37,529 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 21:26:37,530 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 21:26:37,537 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 09:26:37" (1/1) ... [2024-11-12 21:26:37,538 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 09:26:37" (1/1) ... [2024-11-12 21:26:37,540 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 09:26:37" (1/1) ... [2024-11-12 21:26:37,552 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]. [2024-11-12 21:26:37,553 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 09:26:37" (1/1) ... [2024-11-12 21:26:37,553 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 09:26:37" (1/1) ... [2024-11-12 21:26:37,558 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 09:26:37" (1/1) ... [2024-11-12 21:26:37,561 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 09:26:37" (1/1) ... [2024-11-12 21:26:37,562 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 09:26:37" (1/1) ... [2024-11-12 21:26:37,563 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 09:26:37" (1/1) ... [2024-11-12 21:26:37,569 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 21:26:37,570 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 21:26:37,570 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 21:26:37,570 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 21:26:37,570 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 09:26:37" (1/1) ... [2024-11-12 21:26:37,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 21:26:37,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:26:37,619 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) [2024-11-12 21:26:37,626 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 [2024-11-12 21:26:37,663 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 21:26:37,663 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 21:26:37,664 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 21:26:37,664 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 21:26:37,721 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 21:26:37,723 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 21:26:37,966 INFO L? ?]: Removed 55 outVars from TransFormulas that were not future-live. [2024-11-12 21:26:37,968 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 21:26:37,981 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 21:26:37,981 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-12 21:26:37,982 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 09:26:37 BoogieIcfgContainer [2024-11-12 21:26:37,982 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 21:26:37,982 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-12 21:26:37,982 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-12 21:26:37,986 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-12 21:26:37,986 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-12 21:26:37,988 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 12.11 09:26:37" (1/3) ... [2024-11-12 21:26:37,989 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@72d8fcd5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.11 09:26:37, skipping insertion in model container [2024-11-12 21:26:37,989 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-12 21:26:37,989 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 09:26:37" (2/3) ... [2024-11-12 21:26:37,989 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@72d8fcd5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.11 09:26:37, skipping insertion in model container [2024-11-12 21:26:37,989 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-12 21:26:37,989 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 09:26:37" (3/3) ... [2024-11-12 21:26:37,990 INFO L332 chiAutomizerObserver]: Analyzing ICFG heapsort.i [2024-11-12 21:26:38,038 INFO L301 stractBuchiCegarLoop]: Interprodecural is true [2024-11-12 21:26:38,038 INFO L302 stractBuchiCegarLoop]: Hoare is None [2024-11-12 21:26:38,038 INFO L303 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-12 21:26:38,039 INFO L304 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-12 21:26:38,039 INFO L305 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-12 21:26:38,039 INFO L306 stractBuchiCegarLoop]: Difference is false [2024-11-12 21:26:38,039 INFO L307 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-12 21:26:38,040 INFO L311 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-12 21:26:38,044 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 85 states, 84 states have (on average 1.4523809523809523) internal successors, (122), 84 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 21:26:38,060 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 77 [2024-11-12 21:26:38,061 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-12 21:26:38,062 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-12 21:26:38,067 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2024-11-12 21:26:38,068 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-12 21:26:38,068 INFO L333 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-12 21:26:38,069 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 85 states, 84 states have (on average 1.4523809523809523) internal successors, (122), 84 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 21:26:38,074 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 77 [2024-11-12 21:26:38,075 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-12 21:26:38,075 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-12 21:26:38,075 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2024-11-12 21:26:38,076 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-12 21:26:38,081 INFO L747 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;" [2024-11-12 21:26:38,082 INFO L749 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;" [2024-11-12 21:26:38,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:26:38,086 INFO L85 PathProgramCache]: Analyzing trace with hash 925672, now seen corresponding path program 1 times [2024-11-12 21:26:38,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 21:26:38,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692938558] [2024-11-12 21:26:38,094 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:26:38,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 21:26:38,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:26:38,178 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 21:26:38,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:26:38,217 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 21:26:38,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:26:38,220 INFO L85 PathProgramCache]: Analyzing trace with hash -78633890, now seen corresponding path program 1 times [2024-11-12 21:26:38,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 21:26:38,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220189651] [2024-11-12 21:26:38,221 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:26:38,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 21:26:38,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:26:38,236 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 21:26:38,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:26:38,248 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 21:26:38,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:26:38,253 INFO L85 PathProgramCache]: Analyzing trace with hash 1881186967, now seen corresponding path program 1 times [2024-11-12 21:26:38,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 21:26:38,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450505012] [2024-11-12 21:26:38,254 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:26:38,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 21:26:38,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:26:38,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 21:26:38,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450505012] [2024-11-12 21:26:38,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450505012] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 21:26:38,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1572058684] [2024-11-12 21:26:38,381 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:26:38,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 21:26:38,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:26:38,383 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 21:26:38,384 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-12 21:26:38,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:26:38,434 INFO L256 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-12 21:26:38,439 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 21:26:38,460 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 21:26:38,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1572058684] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 21:26:38,473 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 21:26:38,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 3 [2024-11-12 21:26:38,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216329847] [2024-11-12 21:26:38,475 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 21:26:38,591 INFO L204 LassoAnalysis]: Preferences: [2024-11-12 21:26:38,591 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-12 21:26:38,591 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-12 21:26:38,592 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-12 21:26:38,592 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-12 21:26:38,592 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 21:26:38,592 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-12 21:26:38,592 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-12 21:26:38,592 INFO L132 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration1_Loop [2024-11-12 21:26:38,592 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-12 21:26:38,593 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-12 21:26:38,603 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 21:26:38,618 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 21:26:38,620 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 21:26:38,622 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 21:26:38,624 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 21:26:38,665 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-12 21:26:38,666 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-12 21:26:38,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 21:26:38,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:26:38,669 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) [2024-11-12 21:26:38,671 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 [2024-11-12 21:26:38,671 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-12 21:26:38,672 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-12 21:26:38,696 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2024-11-12 21:26:38,697 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 21:26:38,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:26:38,701 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) [2024-11-12 21:26:38,702 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 [2024-11-12 21:26:38,706 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-12 21:26:38,706 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-12 21:26:38,826 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-12 21:26:38,832 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 [2024-11-12 21:26:38,833 INFO L204 LassoAnalysis]: Preferences: [2024-11-12 21:26:38,833 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-12 21:26:38,833 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-12 21:26:38,833 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-12 21:26:38,834 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-12 21:26:38,834 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 21:26:38,834 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-12 21:26:38,834 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-12 21:26:38,834 INFO L132 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration1_Loop [2024-11-12 21:26:38,834 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-12 21:26:38,834 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-12 21:26:38,836 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 21:26:38,847 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 21:26:38,849 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 21:26:38,851 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 21:26:38,853 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 21:26:38,889 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-12 21:26:38,893 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-12 21:26:38,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 21:26:38,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:26:38,898 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) [2024-11-12 21:26:38,899 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 [2024-11-12 21:26:38,900 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 [2024-11-12 21:26:38,921 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-12 21:26:38,921 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-12 21:26:38,921 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-12 21:26:38,922 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-12 21:26:38,923 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-12 21:26:38,930 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-12 21:26:38,930 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-12 21:26:38,938 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-12 21:26:38,947 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-12 21:26:38,947 INFO L444 ModelExtractionUtils]: 3 out of 6 variables were initially zero. Simplification set additionally 1 variables to zero. [2024-11-12 21:26:38,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 21:26:38,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:26:38,951 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) [2024-11-12 21:26:38,952 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 [2024-11-12 21:26:38,953 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-12 21:26:38,953 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-12 21:26:38,954 INFO L474 LassoAnalysis]: Proved termination. [2024-11-12 21:26:38,954 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 [] [2024-11-12 21:26:38,965 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2024-11-12 21:26:38,967 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-12 21:26:38,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:26:39,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:26:39,004 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-12 21:26:39,005 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 21:26:39,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:26:39,022 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-12 21:26:39,023 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 21:26:39,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 21:26:39,086 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 [2024-11-12 21:26:39,088 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 85 states, 84 states have (on average 1.4523809523809523) internal successors, (122), 84 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 21:26:39,161 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 85 states, 84 states have (on average 1.4523809523809523) internal successors, (122), 84 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 304 states and 425 transitions. Complement of second has 8 states. [2024-11-12 21:26:39,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-11-12 21:26:39,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 21:26:39,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 327 transitions. [2024-11-12 21:26:39,169 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 327 transitions. Stem has 4 letters. Loop has 7 letters. [2024-11-12 21:26:39,170 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-12 21:26:39,170 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 327 transitions. Stem has 11 letters. Loop has 7 letters. [2024-11-12 21:26:39,170 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-12 21:26:39,170 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 327 transitions. Stem has 4 letters. Loop has 14 letters. [2024-11-12 21:26:39,170 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-12 21:26:39,171 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 304 states and 425 transitions. [2024-11-12 21:26:39,177 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 66 [2024-11-12 21:26:39,180 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 304 states to 108 states and 126 transitions. [2024-11-12 21:26:39,181 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 71 [2024-11-12 21:26:39,181 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 72 [2024-11-12 21:26:39,182 INFO L73 IsDeterministic]: Start isDeterministic. Operand 108 states and 126 transitions. [2024-11-12 21:26:39,182 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-12 21:26:39,182 INFO L218 hiAutomatonCegarLoop]: Abstraction has 108 states and 126 transitions. [2024-11-12 21:26:39,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states and 126 transitions. [2024-11-12 21:26:39,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 107. [2024-11-12 21:26:39,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 107 states have (on average 1.158878504672897) internal successors, (124), 106 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 21:26:39,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 124 transitions. [2024-11-12 21:26:39,204 INFO L240 hiAutomatonCegarLoop]: Abstraction has 107 states and 124 transitions. [2024-11-12 21:26:39,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 21:26:39,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 21:26:39,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 21:26:39,207 INFO L87 Difference]: Start difference. First operand 107 states and 124 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 21:26:39,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 21:26:39,223 INFO L93 Difference]: Finished difference Result 129 states and 148 transitions. [2024-11-12 21:26:39,223 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 129 states and 148 transitions. [2024-11-12 21:26:39,225 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 93 [2024-11-12 21:26:39,225 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 129 states to 98 states and 112 transitions. [2024-11-12 21:26:39,225 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 98 [2024-11-12 21:26:39,226 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 98 [2024-11-12 21:26:39,226 INFO L73 IsDeterministic]: Start isDeterministic. Operand 98 states and 112 transitions. [2024-11-12 21:26:39,226 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-12 21:26:39,226 INFO L218 hiAutomatonCegarLoop]: Abstraction has 98 states and 112 transitions. [2024-11-12 21:26:39,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states and 112 transitions. [2024-11-12 21:26:39,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 66. [2024-11-12 21:26:39,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 66 states have (on average 1.1515151515151516) internal successors, (76), 65 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 21:26:39,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 76 transitions. [2024-11-12 21:26:39,229 INFO L240 hiAutomatonCegarLoop]: Abstraction has 66 states and 76 transitions. [2024-11-12 21:26:39,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 21:26:39,230 INFO L426 stractBuchiCegarLoop]: Abstraction has 66 states and 76 transitions. [2024-11-12 21:26:39,230 INFO L333 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-12 21:26:39,230 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 66 states and 76 transitions. [2024-11-12 21:26:39,231 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 62 [2024-11-12 21:26:39,231 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-12 21:26:39,231 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-12 21:26:39,231 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2024-11-12 21:26:39,231 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-12 21:26:39,232 INFO L747 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;" [2024-11-12 21:26:39,232 INFO L749 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;" [2024-11-12 21:26:39,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:26:39,232 INFO L85 PathProgramCache]: Analyzing trace with hash 925670, now seen corresponding path program 1 times [2024-11-12 21:26:39,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 21:26:39,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141819435] [2024-11-12 21:26:39,232 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:26:39,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 21:26:39,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:26:39,241 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 21:26:39,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:26:39,283 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 21:26:39,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:26:39,284 INFO L85 PathProgramCache]: Analyzing trace with hash -78633890, now seen corresponding path program 2 times [2024-11-12 21:26:39,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 21:26:39,285 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 [2024-11-12 21:26:39,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732262604] [2024-11-12 21:26:39,285 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:26:39,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 21:26:39,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:26:39,296 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 21:26:39,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:26:39,305 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 21:26:39,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:26:39,309 INFO L85 PathProgramCache]: Analyzing trace with hash -1604433703, now seen corresponding path program 1 times [2024-11-12 21:26:39,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 21:26:39,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942594619] [2024-11-12 21:26:39,310 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:26:39,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 21:26:39,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:26:39,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 21:26:39,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942594619] [2024-11-12 21:26:39,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942594619] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 21:26:39,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1967233885] [2024-11-12 21:26:39,449 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:26:39,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 21:26:39,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:26:39,455 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 21:26:39,456 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-12 21:26:39,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:26:39,499 INFO L256 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-12 21:26:39,500 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 21:26:39,584 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 21:26:39,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1967233885] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 21:26:39,604 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 21:26:39,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2024-11-12 21:26:39,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62423647] [2024-11-12 21:26:39,605 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 21:26:39,670 INFO L204 LassoAnalysis]: Preferences: [2024-11-12 21:26:39,670 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-12 21:26:39,671 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-12 21:26:39,671 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-12 21:26:39,672 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-12 21:26:39,672 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 21:26:39,672 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-12 21:26:39,672 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-12 21:26:39,672 INFO L132 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration2_Loop [2024-11-12 21:26:39,672 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-12 21:26:39,672 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-12 21:26:39,672 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 21:26:39,676 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 21:26:39,680 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 21:26:39,688 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 21:26:39,694 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 21:26:39,725 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-12 21:26:39,725 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-12 21:26:39,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 21:26:39,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:26:39,726 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) [2024-11-12 21:26:39,730 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 [2024-11-12 21:26:39,731 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-12 21:26:39,731 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-12 21:26:39,743 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-12 21:26:39,743 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: [] [2024-11-12 21:26:39,754 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2024-11-12 21:26:39,754 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 21:26:39,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:26:39,756 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) [2024-11-12 21:26:39,757 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 [2024-11-12 21:26:39,758 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-12 21:26:39,758 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-12 21:26:39,770 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-12 21:26:39,770 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~j~0#1=0} Honda state: {ULTIMATE.start_main_~j~0#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-12 21:26:39,781 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 [2024-11-12 21:26:39,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 21:26:39,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:26:39,782 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) [2024-11-12 21:26:39,783 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 [2024-11-12 21:26:39,785 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-12 21:26:39,785 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-12 21:26:39,814 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 [2024-11-12 21:26:39,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 21:26:39,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:26:39,820 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) [2024-11-12 21:26:39,821 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 [2024-11-12 21:26:39,822 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-12 21:26:39,822 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-12 21:26:39,950 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-12 21:26:39,955 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2024-11-12 21:26:39,955 INFO L204 LassoAnalysis]: Preferences: [2024-11-12 21:26:39,956 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-12 21:26:39,956 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-12 21:26:39,956 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-12 21:26:39,956 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-12 21:26:39,956 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 21:26:39,956 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-12 21:26:39,956 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-12 21:26:39,956 INFO L132 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration2_Loop [2024-11-12 21:26:39,956 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-12 21:26:39,956 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-12 21:26:39,957 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 21:26:39,964 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 21:26:39,971 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 21:26:39,973 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 21:26:39,990 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 21:26:40,065 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-12 21:26:40,065 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-12 21:26:40,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 21:26:40,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:26:40,069 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) [2024-11-12 21:26:40,070 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 [2024-11-12 21:26:40,074 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 [2024-11-12 21:26:40,099 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-12 21:26:40,100 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-12 21:26:40,100 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-12 21:26:40,100 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-12 21:26:40,100 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-12 21:26:40,101 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-12 21:26:40,101 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-12 21:26:40,103 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-12 21:26:40,119 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2024-11-12 21:26:40,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 21:26:40,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:26:40,123 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) [2024-11-12 21:26:40,128 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 [2024-11-12 21:26:40,130 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 [2024-11-12 21:26:40,140 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-12 21:26:40,140 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-12 21:26:40,140 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-12 21:26:40,140 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-12 21:26:40,140 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-12 21:26:40,141 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-12 21:26:40,141 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-12 21:26:40,142 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-12 21:26:40,159 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 [2024-11-12 21:26:40,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 21:26:40,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:26:40,160 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) [2024-11-12 21:26:40,162 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 [2024-11-12 21:26:40,163 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 [2024-11-12 21:26:40,173 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-12 21:26:40,173 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-12 21:26:40,173 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-12 21:26:40,173 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-12 21:26:40,173 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-12 21:26:40,173 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-12 21:26:40,173 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-12 21:26:40,178 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-12 21:26:40,188 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2024-11-12 21:26:40,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 21:26:40,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:26:40,195 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) [2024-11-12 21:26:40,196 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 [2024-11-12 21:26:40,198 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 [2024-11-12 21:26:40,208 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-12 21:26:40,208 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-12 21:26:40,208 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-12 21:26:40,208 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-12 21:26:40,208 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-12 21:26:40,209 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-12 21:26:40,209 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-12 21:26:40,212 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-12 21:26:40,216 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-12 21:26:40,216 INFO L444 ModelExtractionUtils]: 3 out of 6 variables were initially zero. Simplification set additionally 1 variables to zero. [2024-11-12 21:26:40,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 21:26:40,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:26:40,218 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) [2024-11-12 21:26:40,221 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 [2024-11-12 21:26:40,222 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-12 21:26:40,222 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-12 21:26:40,222 INFO L474 LassoAnalysis]: Proved termination. [2024-11-12 21:26:40,224 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 [] [2024-11-12 21:26:40,239 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2024-11-12 21:26:40,239 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-12 21:26:40,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:26:40,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:26:40,271 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-12 21:26:40,271 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 21:26:40,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:26:40,286 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-12 21:26:40,287 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 21:26:40,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 21:26:40,329 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 [2024-11-12 21:26:40,329 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 66 states and 76 transitions. cyclomatic complexity: 12 Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 21:26:40,367 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 66 states and 76 transitions. cyclomatic complexity: 12. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 160 states and 185 transitions. Complement of second has 6 states. [2024-11-12 21:26:40,371 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 [2024-11-12 21:26:40,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 21:26:40,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 81 transitions. [2024-11-12 21:26:40,372 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 81 transitions. Stem has 4 letters. Loop has 7 letters. [2024-11-12 21:26:40,372 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-12 21:26:40,372 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 81 transitions. Stem has 11 letters. Loop has 7 letters. [2024-11-12 21:26:40,373 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-12 21:26:40,373 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 81 transitions. Stem has 4 letters. Loop has 14 letters. [2024-11-12 21:26:40,373 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-12 21:26:40,373 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 160 states and 185 transitions. [2024-11-12 21:26:40,374 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 87 [2024-11-12 21:26:40,375 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 160 states to 125 states and 145 transitions. [2024-11-12 21:26:40,379 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 93 [2024-11-12 21:26:40,379 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 94 [2024-11-12 21:26:40,379 INFO L73 IsDeterministic]: Start isDeterministic. Operand 125 states and 145 transitions. [2024-11-12 21:26:40,379 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-12 21:26:40,379 INFO L218 hiAutomatonCegarLoop]: Abstraction has 125 states and 145 transitions. [2024-11-12 21:26:40,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states and 145 transitions. [2024-11-12 21:26:40,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 67. [2024-11-12 21:26:40,385 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) [2024-11-12 21:26:40,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 78 transitions. [2024-11-12 21:26:40,385 INFO L240 hiAutomatonCegarLoop]: Abstraction has 67 states and 78 transitions. [2024-11-12 21:26:40,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 21:26:40,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 21:26:40,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-12 21:26:40,386 INFO L87 Difference]: Start difference. First operand 67 states and 78 transitions. Second operand has 8 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 21:26:40,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 21:26:40,583 INFO L93 Difference]: Finished difference Result 267 states and 297 transitions. [2024-11-12 21:26:40,583 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 267 states and 297 transitions. [2024-11-12 21:26:40,585 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 156 [2024-11-12 21:26:40,586 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 267 states to 267 states and 297 transitions. [2024-11-12 21:26:40,587 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 194 [2024-11-12 21:26:40,587 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 194 [2024-11-12 21:26:40,587 INFO L73 IsDeterministic]: Start isDeterministic. Operand 267 states and 297 transitions. [2024-11-12 21:26:40,587 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-12 21:26:40,587 INFO L218 hiAutomatonCegarLoop]: Abstraction has 267 states and 297 transitions. [2024-11-12 21:26:40,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states and 297 transitions. [2024-11-12 21:26:40,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 69. [2024-11-12 21:26:40,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 69 states have (on average 1.1594202898550725) internal successors, (80), 68 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 21:26:40,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 80 transitions. [2024-11-12 21:26:40,597 INFO L240 hiAutomatonCegarLoop]: Abstraction has 69 states and 80 transitions. [2024-11-12 21:26:40,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-12 21:26:40,602 INFO L426 stractBuchiCegarLoop]: Abstraction has 69 states and 80 transitions. [2024-11-12 21:26:40,602 INFO L333 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-11-12 21:26:40,602 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 69 states and 80 transitions. [2024-11-12 21:26:40,602 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 31 [2024-11-12 21:26:40,603 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-12 21:26:40,606 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-12 21:26:40,606 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2024-11-12 21:26:40,606 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-12 21:26:40,607 INFO L747 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;" [2024-11-12 21:26:40,607 INFO L749 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;" [2024-11-12 21:26:40,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:26:40,607 INFO L85 PathProgramCache]: Analyzing trace with hash 925672, now seen corresponding path program 2 times [2024-11-12 21:26:40,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 21:26:40,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711291945] [2024-11-12 21:26:40,607 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:26:40,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 21:26:40,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:26:40,621 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 21:26:40,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:26:40,631 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 21:26:40,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:26:40,632 INFO L85 PathProgramCache]: Analyzing trace with hash -44278910, now seen corresponding path program 1 times [2024-11-12 21:26:40,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 21:26:40,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129408975] [2024-11-12 21:26:40,632 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:26:40,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 21:26:40,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:26:40,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 21:26:40,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129408975] [2024-11-12 21:26:40,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129408975] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 21:26:40,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1799149674] [2024-11-12 21:26:40,673 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:26:40,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 21:26:40,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:26:40,675 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 21:26:40,676 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-11-12 21:26:40,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:26:40,706 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-12 21:26:40,706 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 21:26:40,725 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 21:26:40,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1799149674] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 21:26:40,738 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 21:26:40,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2024-11-12 21:26:40,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728980992] [2024-11-12 21:26:40,739 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 21:26:40,739 INFO L764 eck$LassoCheckResult]: loop already infeasible [2024-11-12 21:26:40,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 21:26:40,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 21:26:40,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-12 21:26:40,739 INFO L87 Difference]: Start difference. First operand 69 states and 80 transitions. cyclomatic complexity: 13 Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 21:26:40,799 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2024-11-12 21:26:40,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 21:26:40,843 INFO L93 Difference]: Finished difference Result 163 states and 182 transitions. [2024-11-12 21:26:40,843 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 163 states and 182 transitions. [2024-11-12 21:26:40,844 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 80 [2024-11-12 21:26:40,845 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 163 states to 162 states and 181 transitions. [2024-11-12 21:26:40,845 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 86 [2024-11-12 21:26:40,845 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 86 [2024-11-12 21:26:40,845 INFO L73 IsDeterministic]: Start isDeterministic. Operand 162 states and 181 transitions. [2024-11-12 21:26:40,845 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-12 21:26:40,845 INFO L218 hiAutomatonCegarLoop]: Abstraction has 162 states and 181 transitions. [2024-11-12 21:26:40,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states and 181 transitions. [2024-11-12 21:26:40,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 69. [2024-11-12 21:26:40,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 69 states have (on average 1.1594202898550725) internal successors, (80), 68 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 21:26:40,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 80 transitions. [2024-11-12 21:26:40,848 INFO L240 hiAutomatonCegarLoop]: Abstraction has 69 states and 80 transitions. [2024-11-12 21:26:40,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 21:26:40,849 INFO L426 stractBuchiCegarLoop]: Abstraction has 69 states and 80 transitions. [2024-11-12 21:26:40,849 INFO L333 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-11-12 21:26:40,849 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 69 states and 80 transitions. [2024-11-12 21:26:40,849 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 32 [2024-11-12 21:26:40,849 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-12 21:26:40,849 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-12 21:26:40,850 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2024-11-12 21:26:40,850 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 21:26:40,850 INFO L747 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;" [2024-11-12 21:26:40,850 INFO L749 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;" [2024-11-12 21:26:40,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:26:40,850 INFO L85 PathProgramCache]: Analyzing trace with hash 925672, now seen corresponding path program 3 times [2024-11-12 21:26:40,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 21:26:40,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863166182] [2024-11-12 21:26:40,851 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:26:40,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 21:26:40,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:26:40,855 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 21:26:40,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:26:40,858 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 21:26:40,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:26:40,858 INFO L85 PathProgramCache]: Analyzing trace with hash -1259032696, now seen corresponding path program 1 times [2024-11-12 21:26:40,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 21:26:40,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898570346] [2024-11-12 21:26:40,859 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:26:40,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 21:26:40,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:26:40,864 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 21:26:40,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:26:40,868 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 21:26:40,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:26:40,869 INFO L85 PathProgramCache]: Analyzing trace with hash 727543599, now seen corresponding path program 1 times [2024-11-12 21:26:40,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 21:26:40,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878992051] [2024-11-12 21:26:40,869 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:26:40,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 21:26:40,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:26:40,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 21:26:40,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878992051] [2024-11-12 21:26:40,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878992051] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 21:26:40,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1571715605] [2024-11-12 21:26:40,904 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:26:40,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 21:26:40,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:26:40,906 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 21:26:40,907 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-11-12 21:26:40,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:26:40,946 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-12 21:26:40,948 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 21:26:40,989 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 21:26:41,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1571715605] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 21:26:41,016 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 21:26:41,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 9 [2024-11-12 21:26:41,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083401286] [2024-11-12 21:26:41,017 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 21:26:41,117 INFO L204 LassoAnalysis]: Preferences: [2024-11-12 21:26:41,117 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-12 21:26:41,117 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-12 21:26:41,118 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-12 21:26:41,118 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-12 21:26:41,118 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 21:26:41,118 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-12 21:26:41,118 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-12 21:26:41,118 INFO L132 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration4_Loop [2024-11-12 21:26:41,118 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-12 21:26:41,118 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-12 21:26:41,119 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 21:26:41,121 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 21:26:41,122 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 21:26:41,124 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 21:26:41,125 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 21:26:41,176 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-12 21:26:41,177 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-12 21:26:41,177 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 21:26:41,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:26:41,179 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) [2024-11-12 21:26:41,180 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 [2024-11-12 21:26:41,181 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-12 21:26:41,181 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-12 21:26:41,192 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-12 21:26:41,192 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: [] [2024-11-12 21:26:41,203 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 [2024-11-12 21:26:41,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 21:26:41,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:26:41,205 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) [2024-11-12 21:26:41,206 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 [2024-11-12 21:26:41,207 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-12 21:26:41,207 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-12 21:26:41,220 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-12 21:26:41,221 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: [] [2024-11-12 21:26:41,234 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 [2024-11-12 21:26:41,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 21:26:41,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:26:41,236 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) [2024-11-12 21:26:41,236 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 [2024-11-12 21:26:41,238 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-12 21:26:41,238 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-12 21:26:41,249 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-12 21:26:41,249 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: [] [2024-11-12 21:26:41,260 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2024-11-12 21:26:41,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 21:26:41,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:26:41,262 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) [2024-11-12 21:26:41,263 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 [2024-11-12 21:26:41,264 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-12 21:26:41,264 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-12 21:26:41,275 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-12 21:26:41,275 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: [] [2024-11-12 21:26:41,285 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2024-11-12 21:26:41,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 21:26:41,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:26:41,287 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) [2024-11-12 21:26:41,288 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 [2024-11-12 21:26:41,289 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-12 21:26:41,289 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-12 21:26:41,312 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 [2024-11-12 21:26:41,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 21:26:41,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:26:41,314 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) [2024-11-12 21:26:41,316 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 [2024-11-12 21:26:41,317 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-12 21:26:41,317 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-12 21:26:41,557 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-12 21:26:41,563 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2024-11-12 21:26:41,563 INFO L204 LassoAnalysis]: Preferences: [2024-11-12 21:26:41,563 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-12 21:26:41,563 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-12 21:26:41,563 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-12 21:26:41,563 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-12 21:26:41,563 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 21:26:41,563 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-12 21:26:41,563 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-12 21:26:41,563 INFO L132 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration4_Loop [2024-11-12 21:26:41,564 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-12 21:26:41,564 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-12 21:26:41,564 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 21:26:41,572 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 21:26:41,575 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 21:26:41,576 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 21:26:41,585 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 21:26:41,625 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-12 21:26:41,625 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-12 21:26:41,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 21:26:41,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:26:41,627 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) [2024-11-12 21:26:41,628 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 [2024-11-12 21:26:41,629 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 [2024-11-12 21:26:41,640 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-12 21:26:41,640 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-12 21:26:41,640 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-12 21:26:41,640 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-12 21:26:41,640 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-12 21:26:41,641 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-12 21:26:41,641 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-12 21:26:41,645 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-12 21:26:41,659 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 [2024-11-12 21:26:41,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 21:26:41,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:26:41,661 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) [2024-11-12 21:26:41,663 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 [2024-11-12 21:26:41,663 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 [2024-11-12 21:26:41,673 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-12 21:26:41,673 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-12 21:26:41,673 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-12 21:26:41,673 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-12 21:26:41,673 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-12 21:26:41,673 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-12 21:26:41,673 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-12 21:26:41,674 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-12 21:26:41,685 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2024-11-12 21:26:41,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 21:26:41,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:26:41,687 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) [2024-11-12 21:26:41,688 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 [2024-11-12 21:26:41,688 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 [2024-11-12 21:26:41,698 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-12 21:26:41,698 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-12 21:26:41,698 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-12 21:26:41,698 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-12 21:26:41,698 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-12 21:26:41,698 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-12 21:26:41,698 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-12 21:26:41,700 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-12 21:26:41,711 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 [2024-11-12 21:26:41,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 21:26:41,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:26:41,713 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) [2024-11-12 21:26:41,713 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 [2024-11-12 21:26:41,714 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 [2024-11-12 21:26:41,724 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-12 21:26:41,724 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-12 21:26:41,724 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-12 21:26:41,724 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-12 21:26:41,724 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-12 21:26:41,725 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-12 21:26:41,726 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-12 21:26:41,729 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-12 21:26:41,734 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-12 21:26:41,734 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2024-11-12 21:26:41,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 21:26:41,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:26:41,736 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) [2024-11-12 21:26:41,737 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 [2024-11-12 21:26:41,737 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-12 21:26:41,738 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-12 21:26:41,738 INFO L474 LassoAnalysis]: Proved termination. [2024-11-12 21:26:41,738 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 [] [2024-11-12 21:26:41,748 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2024-11-12 21:26:41,749 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-12 21:26:41,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:26:41,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:26:41,770 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-12 21:26:41,770 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 21:26:41,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:26:41,788 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-12 21:26:41,788 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 21:26:41,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 21:26:41,842 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-11-12 21:26:41,842 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 69 states and 80 transitions. cyclomatic complexity: 13 Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 21:26:41,869 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 69 states and 80 transitions. cyclomatic complexity: 13. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 133 states and 153 transitions. Complement of second has 4 states. [2024-11-12 21:26:41,870 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 [2024-11-12 21:26:41,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 21:26:41,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 80 transitions. [2024-11-12 21:26:41,870 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 80 transitions. Stem has 4 letters. Loop has 14 letters. [2024-11-12 21:26:41,871 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-12 21:26:41,871 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 80 transitions. Stem has 18 letters. Loop has 14 letters. [2024-11-12 21:26:41,871 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-12 21:26:41,871 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 80 transitions. Stem has 4 letters. Loop has 28 letters. [2024-11-12 21:26:41,871 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-12 21:26:41,871 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 133 states and 153 transitions. [2024-11-12 21:26:41,872 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 57 [2024-11-12 21:26:41,872 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 133 states to 128 states and 147 transitions. [2024-11-12 21:26:41,872 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 63 [2024-11-12 21:26:41,872 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 64 [2024-11-12 21:26:41,872 INFO L73 IsDeterministic]: Start isDeterministic. Operand 128 states and 147 transitions. [2024-11-12 21:26:41,873 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-12 21:26:41,873 INFO L218 hiAutomatonCegarLoop]: Abstraction has 128 states and 147 transitions. [2024-11-12 21:26:41,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states and 147 transitions. [2024-11-12 21:26:41,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 127. [2024-11-12 21:26:41,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 127 states have (on average 1.1496062992125984) internal successors, (146), 126 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 21:26:41,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 146 transitions. [2024-11-12 21:26:41,875 INFO L240 hiAutomatonCegarLoop]: Abstraction has 127 states and 146 transitions. [2024-11-12 21:26:41,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 21:26:41,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-12 21:26:41,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-12 21:26:41,876 INFO L87 Difference]: Start difference. First operand 127 states and 146 transitions. Second operand has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 21:26:41,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 21:26:41,933 INFO L93 Difference]: Finished difference Result 70 states and 80 transitions. [2024-11-12 21:26:41,933 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 70 states and 80 transitions. [2024-11-12 21:26:41,933 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 32 [2024-11-12 21:26:41,934 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 70 states to 69 states and 79 transitions. [2024-11-12 21:26:41,934 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 37 [2024-11-12 21:26:41,934 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 37 [2024-11-12 21:26:41,934 INFO L73 IsDeterministic]: Start isDeterministic. Operand 69 states and 79 transitions. [2024-11-12 21:26:41,934 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-12 21:26:41,934 INFO L218 hiAutomatonCegarLoop]: Abstraction has 69 states and 79 transitions. [2024-11-12 21:26:41,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states and 79 transitions. [2024-11-12 21:26:41,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2024-11-12 21:26:41,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 69 states have (on average 1.144927536231884) internal successors, (79), 68 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 21:26:41,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 79 transitions. [2024-11-12 21:26:41,935 INFO L240 hiAutomatonCegarLoop]: Abstraction has 69 states and 79 transitions. [2024-11-12 21:26:41,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 21:26:41,937 INFO L426 stractBuchiCegarLoop]: Abstraction has 69 states and 79 transitions. [2024-11-12 21:26:41,937 INFO L333 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-11-12 21:26:41,937 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 69 states and 79 transitions. [2024-11-12 21:26:41,938 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 32 [2024-11-12 21:26:41,938 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-12 21:26:41,938 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-12 21:26:41,938 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2024-11-12 21:26:41,938 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 21:26:41,938 INFO L747 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;" [2024-11-12 21:26:41,938 INFO L749 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;" [2024-11-12 21:26:41,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:26:41,938 INFO L85 PathProgramCache]: Analyzing trace with hash 28695791, now seen corresponding path program 1 times [2024-11-12 21:26:41,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 21:26:41,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838503774] [2024-11-12 21:26:41,939 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:26:41,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 21:26:41,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:26:41,946 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 21:26:41,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:26:41,950 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 21:26:41,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:26:41,950 INFO L85 PathProgramCache]: Analyzing trace with hash 48961178, now seen corresponding path program 2 times [2024-11-12 21:26:41,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 21:26:41,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991966455] [2024-11-12 21:26:41,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:26:41,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 21:26:41,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:26:41,955 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 21:26:41,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:26:41,959 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 21:26:41,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:26:41,960 INFO L85 PathProgramCache]: Analyzing trace with hash 2100083464, now seen corresponding path program 1 times [2024-11-12 21:26:41,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 21:26:41,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666016095] [2024-11-12 21:26:41,960 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:26:41,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 21:26:41,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:26:41,990 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2024-11-12 21:26:42,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 21:26:42,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666016095] [2024-11-12 21:26:42,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666016095] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 21:26:42,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2005259190] [2024-11-12 21:26:42,027 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:26:42,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 21:26:42,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:26:42,030 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 21:26:42,040 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2024-11-12 21:26:42,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:26:42,075 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-12 21:26:42,076 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 21:26:42,101 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 21:26:42,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2005259190] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 21:26:42,158 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 21:26:42,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-11-12 21:26:42,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167485680] [2024-11-12 21:26:42,159 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 21:26:42,260 INFO L204 LassoAnalysis]: Preferences: [2024-11-12 21:26:42,260 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-12 21:26:42,260 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-12 21:26:42,260 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-12 21:26:42,260 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-12 21:26:42,260 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 21:26:42,260 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-12 21:26:42,260 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-12 21:26:42,260 INFO L132 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration5_Loop [2024-11-12 21:26:42,260 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-12 21:26:42,260 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-12 21:26:42,261 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 21:26:42,263 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 21:26:42,264 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 21:26:42,266 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 21:26:42,268 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 21:26:42,319 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-12 21:26:42,319 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-12 21:26:42,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 21:26:42,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:26:42,321 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) [2024-11-12 21:26:42,322 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 [2024-11-12 21:26:42,322 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-12 21:26:42,322 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-12 21:26:42,333 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-12 21:26:42,333 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: [] [2024-11-12 21:26:42,348 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2024-11-12 21:26:42,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 21:26:42,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:26:42,352 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) [2024-11-12 21:26:42,353 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 [2024-11-12 21:26:42,354 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-12 21:26:42,354 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-12 21:26:42,378 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-12 21:26:42,379 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: [] [2024-11-12 21:26:42,409 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 [2024-11-12 21:26:42,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 21:26:42,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:26:42,410 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) [2024-11-12 21:26:42,414 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 [2024-11-12 21:26:42,415 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-12 21:26:42,415 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-12 21:26:42,428 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-12 21:26:42,428 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: [] [2024-11-12 21:26:42,439 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 [2024-11-12 21:26:42,440 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 21:26:42,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:26:42,441 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) [2024-11-12 21:26:42,444 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 [2024-11-12 21:26:42,444 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-12 21:26:42,444 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-12 21:26:42,456 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-12 21:26:42,456 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: [] [2024-11-12 21:26:42,467 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 [2024-11-12 21:26:42,467 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 21:26:42,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:26:42,468 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) [2024-11-12 21:26:42,469 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 [2024-11-12 21:26:42,470 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-12 21:26:42,470 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-12 21:26:42,495 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 [2024-11-12 21:26:42,495 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 21:26:42,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:26:42,496 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) [2024-11-12 21:26:42,497 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 [2024-11-12 21:26:42,498 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-12 21:26:42,498 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-12 21:26:42,703 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-12 21:26:42,709 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Forceful destruction successful, exit code 0 [2024-11-12 21:26:42,709 INFO L204 LassoAnalysis]: Preferences: [2024-11-12 21:26:42,709 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-12 21:26:42,709 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-12 21:26:42,709 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-12 21:26:42,709 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-12 21:26:42,709 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 21:26:42,709 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-12 21:26:42,709 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-12 21:26:42,709 INFO L132 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration5_Loop [2024-11-12 21:26:42,709 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-12 21:26:42,709 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-12 21:26:42,710 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 21:26:42,712 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 21:26:42,713 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 21:26:42,715 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 21:26:42,729 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 21:26:42,786 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-12 21:26:42,786 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-12 21:26:42,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 21:26:42,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:26:42,790 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) [2024-11-12 21:26:42,795 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 [2024-11-12 21:26:42,796 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 [2024-11-12 21:26:42,805 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-12 21:26:42,805 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-12 21:26:42,806 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-12 21:26:42,806 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-12 21:26:42,806 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-12 21:26:42,806 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-12 21:26:42,806 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-12 21:26:42,809 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-12 21:26:42,819 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2024-11-12 21:26:42,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 21:26:42,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:26:42,821 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-12 21:26:42,823 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2024-11-12 21:26:42,823 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 [2024-11-12 21:26:42,833 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-12 21:26:42,833 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-12 21:26:42,833 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-12 21:26:42,833 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-12 21:26:42,833 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-12 21:26:42,834 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-12 21:26:42,834 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-12 21:26:42,836 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-12 21:26:42,846 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Forceful destruction successful, exit code 0 [2024-11-12 21:26:42,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 21:26:42,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:26:42,848 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) [2024-11-12 21:26:42,849 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 [2024-11-12 21:26:42,850 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 [2024-11-12 21:26:42,859 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-12 21:26:42,860 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-12 21:26:42,860 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-12 21:26:42,860 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-12 21:26:42,860 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-12 21:26:42,860 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-12 21:26:42,860 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-12 21:26:42,863 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-12 21:26:42,875 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 [2024-11-12 21:26:42,876 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 21:26:42,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:26:42,877 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) [2024-11-12 21:26:42,882 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 [2024-11-12 21:26:42,883 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 [2024-11-12 21:26:42,893 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-12 21:26:42,893 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-12 21:26:42,893 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-12 21:26:42,893 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-12 21:26:42,893 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-12 21:26:42,895 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-12 21:26:42,895 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-12 21:26:42,900 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-12 21:26:42,903 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-12 21:26:42,903 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2024-11-12 21:26:42,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 21:26:42,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:26:42,905 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) [2024-11-12 21:26:42,908 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 [2024-11-12 21:26:42,908 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-12 21:26:42,909 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-12 21:26:42,909 INFO L474 LassoAnalysis]: Proved termination. [2024-11-12 21:26:42,909 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 [] [2024-11-12 21:26:42,920 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Forceful destruction successful, exit code 0 [2024-11-12 21:26:42,921 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-12 21:26:42,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:26:42,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:26:42,937 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-12 21:26:42,937 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 21:26:42,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:26:42,949 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-12 21:26:42,950 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 21:26:42,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 21:26:42,967 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 [2024-11-12 21:26:42,967 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 69 states and 79 transitions. cyclomatic complexity: 12 Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 21:26:42,995 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 69 states and 79 transitions. cyclomatic complexity: 12. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 137 states and 159 transitions. Complement of second has 6 states. [2024-11-12 21:26:42,995 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 [2024-11-12 21:26:42,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 21:26:42,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 47 transitions. [2024-11-12 21:26:42,996 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 47 transitions. Stem has 5 letters. Loop has 14 letters. [2024-11-12 21:26:42,996 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-12 21:26:42,996 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 47 transitions. Stem has 19 letters. Loop has 14 letters. [2024-11-12 21:26:42,996 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-12 21:26:42,996 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 47 transitions. Stem has 5 letters. Loop has 28 letters. [2024-11-12 21:26:42,997 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-12 21:26:42,997 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 137 states and 159 transitions. [2024-11-12 21:26:42,998 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2024-11-12 21:26:42,998 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 137 states to 131 states and 152 transitions. [2024-11-12 21:26:42,998 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2024-11-12 21:26:42,998 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 34 [2024-11-12 21:26:42,998 INFO L73 IsDeterministic]: Start isDeterministic. Operand 131 states and 152 transitions. [2024-11-12 21:26:42,999 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-12 21:26:42,999 INFO L218 hiAutomatonCegarLoop]: Abstraction has 131 states and 152 transitions. [2024-11-12 21:26:42,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states and 152 transitions. [2024-11-12 21:26:43,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 129. [2024-11-12 21:26:43,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 129 states have (on average 1.1550387596899225) internal successors, (149), 128 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 21:26:43,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 149 transitions. [2024-11-12 21:26:43,001 INFO L240 hiAutomatonCegarLoop]: Abstraction has 129 states and 149 transitions. [2024-11-12 21:26:43,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 21:26:43,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 21:26:43,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-12 21:26:43,002 INFO L87 Difference]: Start difference. First operand 129 states and 149 transitions. Second operand has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 21:26:43,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 21:26:43,160 INFO L93 Difference]: Finished difference Result 430 states and 476 transitions. [2024-11-12 21:26:43,160 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 430 states and 476 transitions. [2024-11-12 21:26:43,162 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 64 [2024-11-12 21:26:43,164 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 430 states to 379 states and 421 transitions. [2024-11-12 21:26:43,164 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 96 [2024-11-12 21:26:43,164 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 96 [2024-11-12 21:26:43,164 INFO L73 IsDeterministic]: Start isDeterministic. Operand 379 states and 421 transitions. [2024-11-12 21:26:43,165 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-12 21:26:43,165 INFO L218 hiAutomatonCegarLoop]: Abstraction has 379 states and 421 transitions. [2024-11-12 21:26:43,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states and 421 transitions. [2024-11-12 21:26:43,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 130. [2024-11-12 21:26:43,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 130 states have (on average 1.1538461538461537) internal successors, (150), 129 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 21:26:43,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 150 transitions. [2024-11-12 21:26:43,168 INFO L240 hiAutomatonCegarLoop]: Abstraction has 130 states and 150 transitions. [2024-11-12 21:26:43,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-12 21:26:43,169 INFO L426 stractBuchiCegarLoop]: Abstraction has 130 states and 150 transitions. [2024-11-12 21:26:43,169 INFO L333 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-11-12 21:26:43,169 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 130 states and 150 transitions. [2024-11-12 21:26:43,170 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2024-11-12 21:26:43,170 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-12 21:26:43,170 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-12 21:26:43,170 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2024-11-12 21:26:43,170 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 21:26:43,170 INFO L747 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);" [2024-11-12 21:26:43,170 INFO L749 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);" [2024-11-12 21:26:43,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:26:43,171 INFO L85 PathProgramCache]: Analyzing trace with hash 889569551, now seen corresponding path program 1 times [2024-11-12 21:26:43,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 21:26:43,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433869398] [2024-11-12 21:26:43,171 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:26:43,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 21:26:43,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:26:43,175 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 21:26:43,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:26:43,178 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 21:26:43,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:26:43,179 INFO L85 PathProgramCache]: Analyzing trace with hash 93725893, now seen corresponding path program 1 times [2024-11-12 21:26:43,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 21:26:43,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592214916] [2024-11-12 21:26:43,179 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:26:43,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 21:26:43,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:26:43,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 21:26:43,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592214916] [2024-11-12 21:26:43,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592214916] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 21:26:43,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1511543215] [2024-11-12 21:26:43,237 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:26:43,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 21:26:43,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:26:43,242 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 21:26:43,243 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Waiting until timeout for monitored process [2024-11-12 21:26:43,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:26:43,300 INFO L256 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-12 21:26:43,301 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 21:26:43,366 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 21:26:43,425 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Ended with exit code 0 [2024-11-12 21:26:43,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1511543215] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 21:26:43,464 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 21:26:43,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2024-11-12 21:26:43,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683406834] [2024-11-12 21:26:43,464 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 21:26:43,465 INFO L764 eck$LassoCheckResult]: loop already infeasible [2024-11-12 21:26:43,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 21:26:43,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-12 21:26:43,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2024-11-12 21:26:43,465 INFO L87 Difference]: Start difference. First operand 130 states and 150 transitions. cyclomatic complexity: 24 Second operand has 11 states, 10 states have (on average 3.4) internal successors, (34), 10 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 21:26:43,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 21:26:43,644 INFO L93 Difference]: Finished difference Result 208 states and 232 transitions. [2024-11-12 21:26:43,644 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 208 states and 232 transitions. [2024-11-12 21:26:43,645 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2024-11-12 21:26:43,650 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 208 states to 193 states and 217 transitions. [2024-11-12 21:26:43,650 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 32 [2024-11-12 21:26:43,650 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 32 [2024-11-12 21:26:43,650 INFO L73 IsDeterministic]: Start isDeterministic. Operand 193 states and 217 transitions. [2024-11-12 21:26:43,650 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-12 21:26:43,650 INFO L218 hiAutomatonCegarLoop]: Abstraction has 193 states and 217 transitions. [2024-11-12 21:26:43,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states and 217 transitions. [2024-11-12 21:26:43,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 175. [2024-11-12 21:26:43,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 175 states have (on average 1.1257142857142857) internal successors, (197), 174 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 21:26:43,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 197 transitions. [2024-11-12 21:26:43,657 INFO L240 hiAutomatonCegarLoop]: Abstraction has 175 states and 197 transitions. [2024-11-12 21:26:43,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-12 21:26:43,658 INFO L426 stractBuchiCegarLoop]: Abstraction has 175 states and 197 transitions. [2024-11-12 21:26:43,659 INFO L333 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-11-12 21:26:43,659 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 175 states and 197 transitions. [2024-11-12 21:26:43,659 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2024-11-12 21:26:43,663 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-12 21:26:43,663 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-12 21:26:43,664 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2024-11-12 21:26:43,664 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] [2024-11-12 21:26:43,664 INFO L747 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);" [2024-11-12 21:26:43,664 INFO L749 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);" [2024-11-12 21:26:43,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:26:43,665 INFO L85 PathProgramCache]: Analyzing trace with hash 889569551, now seen corresponding path program 2 times [2024-11-12 21:26:43,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 21:26:43,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671964201] [2024-11-12 21:26:43,665 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:26:43,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 21:26:43,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:26:43,669 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 21:26:43,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:26:43,678 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 21:26:43,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:26:43,685 INFO L85 PathProgramCache]: Analyzing trace with hash -510635659, now seen corresponding path program 1 times [2024-11-12 21:26:43,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 21:26:43,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606608859] [2024-11-12 21:26:43,686 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:26:43,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 21:26:43,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:26:43,705 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 21:26:43,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:26:43,723 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 21:26:43,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:26:43,727 INFO L85 PathProgramCache]: Analyzing trace with hash -575128537, now seen corresponding path program 1 times [2024-11-12 21:26:43,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 21:26:43,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820467239] [2024-11-12 21:26:43,727 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:26:43,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 21:26:43,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:26:43,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 21:26:43,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820467239] [2024-11-12 21:26:43,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820467239] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 21:26:43,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2038785632] [2024-11-12 21:26:43,880 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:26:43,880 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 21:26:43,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:26:43,882 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 21:26:43,886 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Waiting until timeout for monitored process [2024-11-12 21:26:43,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:26:43,948 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-12 21:26:43,949 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 21:26:44,138 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 21:26:44,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2038785632] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 21:26:44,232 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 21:26:44,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 15 [2024-11-12 21:26:44,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491490372] [2024-11-12 21:26:44,233 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 21:26:44,460 INFO L204 LassoAnalysis]: Preferences: [2024-11-12 21:26:44,460 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-12 21:26:44,460 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-12 21:26:44,460 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-12 21:26:44,461 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-12 21:26:44,461 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 21:26:44,461 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-12 21:26:44,461 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-12 21:26:44,461 INFO L132 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration7_Loop [2024-11-12 21:26:44,461 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-12 21:26:44,461 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-12 21:26:44,461 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 21:26:44,463 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 21:26:44,479 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 21:26:44,481 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 21:26:44,482 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 21:26:44,533 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-12 21:26:44,533 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-12 21:26:44,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 21:26:44,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:26:44,540 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) [2024-11-12 21:26:44,544 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 [2024-11-12 21:26:44,545 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-12 21:26:44,545 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-12 21:26:44,556 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-12 21:26:44,556 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: [] [2024-11-12 21:26:44,566 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Forceful destruction successful, exit code 0 [2024-11-12 21:26:44,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 21:26:44,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:26:44,569 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) [2024-11-12 21:26:44,569 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 [2024-11-12 21:26:44,570 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-12 21:26:44,570 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-12 21:26:44,600 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Forceful destruction successful, exit code 0 [2024-11-12 21:26:44,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 21:26:44,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:26:44,602 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) [2024-11-12 21:26:44,603 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 [2024-11-12 21:26:44,604 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-12 21:26:44,604 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-12 21:26:44,689 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-12 21:26:44,694 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 [2024-11-12 21:26:44,694 INFO L204 LassoAnalysis]: Preferences: [2024-11-12 21:26:44,694 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-12 21:26:44,694 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-12 21:26:44,694 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-12 21:26:44,695 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-12 21:26:44,695 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 21:26:44,695 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-12 21:26:44,695 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-12 21:26:44,695 INFO L132 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration7_Loop [2024-11-12 21:26:44,695 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-12 21:26:44,695 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-12 21:26:44,695 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 21:26:44,697 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 21:26:44,699 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 21:26:44,700 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 21:26:44,716 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 21:26:44,774 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-12 21:26:44,774 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-12 21:26:44,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 21:26:44,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:26:44,775 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) [2024-11-12 21:26:44,781 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 [2024-11-12 21:26:44,785 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 [2024-11-12 21:26:44,802 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-12 21:26:44,803 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-12 21:26:44,803 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-12 21:26:44,803 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-12 21:26:44,803 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-12 21:26:44,803 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-12 21:26:44,803 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-12 21:26:44,804 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-12 21:26:44,818 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Forceful destruction successful, exit code 0 [2024-11-12 21:26:44,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 21:26:44,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:26:44,820 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) [2024-11-12 21:26:44,821 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 [2024-11-12 21:26:44,822 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 [2024-11-12 21:26:44,831 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-12 21:26:44,831 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-12 21:26:44,831 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-12 21:26:44,832 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-12 21:26:44,832 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-12 21:26:44,832 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-12 21:26:44,832 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-12 21:26:44,833 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-12 21:26:44,844 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Forceful destruction successful, exit code 0 [2024-11-12 21:26:44,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 21:26:44,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:26:44,847 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) [2024-11-12 21:26:44,849 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 [2024-11-12 21:26:44,853 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 [2024-11-12 21:26:44,864 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-12 21:26:44,864 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-12 21:26:44,864 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-12 21:26:44,864 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-12 21:26:44,864 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-12 21:26:44,865 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-12 21:26:44,865 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-12 21:26:44,866 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-12 21:26:44,876 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 [2024-11-12 21:26:44,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 21:26:44,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:26:44,878 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) [2024-11-12 21:26:44,879 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 [2024-11-12 21:26:44,879 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-12 21:26:44,891 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-12 21:26:44,891 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-12 21:26:44,891 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-12 21:26:44,891 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-12 21:26:44,891 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-12 21:26:44,894 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-12 21:26:44,894 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-12 21:26:44,900 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-12 21:26:44,904 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2024-11-12 21:26:44,904 INFO L444 ModelExtractionUtils]: 2 out of 6 variables were initially zero. Simplification set additionally 1 variables to zero. [2024-11-12 21:26:44,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 21:26:44,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:26:44,910 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) [2024-11-12 21:26:44,911 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-12 21:26:44,912 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-12 21:26:44,912 INFO L474 LassoAnalysis]: Proved termination. [2024-11-12 21:26:44,912 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~r~0#1, ULTIMATE.start_main_~j~0#1) = 5*ULTIMATE.start_main_~r~0#1 - 8*ULTIMATE.start_main_~j~0#1 Supporting invariants [] [2024-11-12 21:26:44,915 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 [2024-11-12 21:26:44,927 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 [2024-11-12 21:26:44,928 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-12 21:26:44,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:26:44,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:26:44,966 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-12 21:26:44,966 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 21:26:45,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:26:45,003 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-12 21:26:45,005 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 21:26:45,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 21:26:45,308 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 [2024-11-12 21:26:45,308 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 175 states and 197 transitions. cyclomatic complexity: 26 Second operand has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 21:26:45,559 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 175 states and 197 transitions. cyclomatic complexity: 26. Second operand has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 673 states and 724 transitions. Complement of second has 17 states. [2024-11-12 21:26:45,559 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 [2024-11-12 21:26:45,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 21:26:45,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 92 transitions. [2024-11-12 21:26:45,560 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 92 transitions. Stem has 6 letters. Loop has 25 letters. [2024-11-12 21:26:45,560 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-12 21:26:45,560 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 92 transitions. Stem has 31 letters. Loop has 25 letters. [2024-11-12 21:26:45,561 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-12 21:26:45,561 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 92 transitions. Stem has 6 letters. Loop has 50 letters. [2024-11-12 21:26:45,561 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-12 21:26:45,561 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 673 states and 724 transitions. [2024-11-12 21:26:45,564 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2024-11-12 21:26:45,566 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 673 states to 508 states and 557 transitions. [2024-11-12 21:26:45,566 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 55 [2024-11-12 21:26:45,566 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 56 [2024-11-12 21:26:45,566 INFO L73 IsDeterministic]: Start isDeterministic. Operand 508 states and 557 transitions. [2024-11-12 21:26:45,566 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-12 21:26:45,566 INFO L218 hiAutomatonCegarLoop]: Abstraction has 508 states and 557 transitions. [2024-11-12 21:26:45,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states and 557 transitions. [2024-11-12 21:26:45,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 313. [2024-11-12 21:26:45,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 313 states have (on average 1.1086261980830672) internal successors, (347), 312 states have internal predecessors, (347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 21:26:45,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 347 transitions. [2024-11-12 21:26:45,570 INFO L240 hiAutomatonCegarLoop]: Abstraction has 313 states and 347 transitions. [2024-11-12 21:26:45,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 21:26:45,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-12 21:26:45,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2024-11-12 21:26:45,571 INFO L87 Difference]: Start difference. First operand 313 states and 347 transitions. Second operand has 16 states, 15 states have (on average 5.933333333333334) internal successors, (89), 16 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 21:26:45,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 21:26:45,808 INFO L93 Difference]: Finished difference Result 616 states and 663 transitions. [2024-11-12 21:26:45,809 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 616 states and 663 transitions. [2024-11-12 21:26:45,811 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 50 [2024-11-12 21:26:45,812 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 616 states to 385 states and 425 transitions. [2024-11-12 21:26:45,812 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 56 [2024-11-12 21:26:45,812 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 56 [2024-11-12 21:26:45,813 INFO L73 IsDeterministic]: Start isDeterministic. Operand 385 states and 425 transitions. [2024-11-12 21:26:45,813 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-12 21:26:45,813 INFO L218 hiAutomatonCegarLoop]: Abstraction has 385 states and 425 transitions. [2024-11-12 21:26:45,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states and 425 transitions. [2024-11-12 21:26:45,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 194. [2024-11-12 21:26:45,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 194 states have (on average 1.1237113402061856) internal successors, (218), 193 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 21:26:45,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 218 transitions. [2024-11-12 21:26:45,815 INFO L240 hiAutomatonCegarLoop]: Abstraction has 194 states and 218 transitions. [2024-11-12 21:26:45,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-12 21:26:45,816 INFO L426 stractBuchiCegarLoop]: Abstraction has 194 states and 218 transitions. [2024-11-12 21:26:45,816 INFO L333 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-11-12 21:26:45,816 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 194 states and 218 transitions. [2024-11-12 21:26:45,817 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2024-11-12 21:26:45,817 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-12 21:26:45,817 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-12 21:26:45,817 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 21:26:45,817 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] [2024-11-12 21:26:45,818 INFO L747 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;" [2024-11-12 21:26:45,818 INFO L749 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;" [2024-11-12 21:26:45,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:26:45,818 INFO L85 PathProgramCache]: Analyzing trace with hash 1035079084, now seen corresponding path program 1 times [2024-11-12 21:26:45,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 21:26:45,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417346323] [2024-11-12 21:26:45,818 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:26:45,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 21:26:45,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:26:45,824 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 21:26:45,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:26:45,829 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 21:26:45,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:26:45,829 INFO L85 PathProgramCache]: Analyzing trace with hash -94981115, now seen corresponding path program 2 times [2024-11-12 21:26:45,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 21:26:45,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349893079] [2024-11-12 21:26:45,829 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:26:45,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 21:26:45,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:26:45,836 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 21:26:45,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:26:45,842 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 21:26:45,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:26:45,842 INFO L85 PathProgramCache]: Analyzing trace with hash 1850199226, now seen corresponding path program 1 times [2024-11-12 21:26:45,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 21:26:45,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027794610] [2024-11-12 21:26:45,842 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:26:45,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 21:26:45,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:26:45,867 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 21:26:45,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:26:45,880 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 [2024-11-12 21:26:45,881 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 21:26:46,071 INFO L204 LassoAnalysis]: Preferences: [2024-11-12 21:26:46,071 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-12 21:26:46,071 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-12 21:26:46,071 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-12 21:26:46,071 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-12 21:26:46,071 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 21:26:46,071 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-12 21:26:46,072 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-12 21:26:46,072 INFO L132 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration8_Loop [2024-11-12 21:26:46,072 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-12 21:26:46,072 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-12 21:26:46,072 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 21:26:46,079 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 21:26:46,082 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 21:26:46,083 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 21:26:46,085 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 21:26:46,123 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-12 21:26:46,123 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-12 21:26:46,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 21:26:46,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:26:46,125 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) [2024-11-12 21:26:46,126 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 [2024-11-12 21:26:46,127 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-12 21:26:46,127 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-12 21:26:46,138 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-12 21:26:46,138 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: [] [2024-11-12 21:26:46,148 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Forceful destruction successful, exit code 0 [2024-11-12 21:26:46,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 21:26:46,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:26:46,150 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) [2024-11-12 21:26:46,151 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 [2024-11-12 21:26:46,151 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-12 21:26:46,151 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-12 21:26:46,163 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-12 21:26:46,164 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: [] [2024-11-12 21:26:46,174 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 [2024-11-12 21:26:46,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 21:26:46,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:26:46,177 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) [2024-11-12 21:26:46,178 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 [2024-11-12 21:26:46,179 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-12 21:26:46,179 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-12 21:26:46,190 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-12 21:26:46,191 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: [] [2024-11-12 21:26:46,203 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 [2024-11-12 21:26:46,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 21:26:46,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:26:46,205 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) [2024-11-12 21:26:46,206 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 [2024-11-12 21:26:46,206 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-12 21:26:46,206 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-12 21:26:46,218 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-12 21:26:46,218 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: [] [2024-11-12 21:26:46,229 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Forceful destruction successful, exit code 0 [2024-11-12 21:26:46,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 21:26:46,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:26:46,231 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) [2024-11-12 21:26:46,232 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 [2024-11-12 21:26:46,233 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-12 21:26:46,233 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-12 21:26:46,270 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Forceful destruction successful, exit code 0 [2024-11-12 21:26:46,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 21:26:46,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:26:46,271 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) [2024-11-12 21:26:46,272 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 [2024-11-12 21:26:46,273 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-12 21:26:46,273 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-12 21:26:46,381 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-12 21:26:46,386 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 [2024-11-12 21:26:46,386 INFO L204 LassoAnalysis]: Preferences: [2024-11-12 21:26:46,386 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-12 21:26:46,387 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-12 21:26:46,387 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-12 21:26:46,387 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-12 21:26:46,387 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 21:26:46,387 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-12 21:26:46,387 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-12 21:26:46,387 INFO L132 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration8_Loop [2024-11-12 21:26:46,387 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-12 21:26:46,387 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-12 21:26:46,388 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 21:26:46,390 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 21:26:46,394 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 21:26:46,401 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 21:26:46,414 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 21:26:46,446 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-12 21:26:46,447 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-12 21:26:46,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 21:26:46,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:26:46,450 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) [2024-11-12 21:26:46,451 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 [2024-11-12 21:26:46,452 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 [2024-11-12 21:26:46,467 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-12 21:26:46,467 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-12 21:26:46,467 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-12 21:26:46,467 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-12 21:26:46,467 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-12 21:26:46,468 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-12 21:26:46,468 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-12 21:26:46,469 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-12 21:26:46,490 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Forceful destruction successful, exit code 0 [2024-11-12 21:26:46,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 21:26:46,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:26:46,492 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) [2024-11-12 21:26:46,493 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 [2024-11-12 21:26:46,493 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 [2024-11-12 21:26:46,503 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-12 21:26:46,503 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-12 21:26:46,503 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-12 21:26:46,504 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-12 21:26:46,504 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-12 21:26:46,504 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-12 21:26:46,504 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-12 21:26:46,505 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-12 21:26:46,515 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Ended with exit code 0 [2024-11-12 21:26:46,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 21:26:46,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:26:46,517 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) [2024-11-12 21:26:46,518 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 [2024-11-12 21:26:46,520 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 [2024-11-12 21:26:46,530 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-12 21:26:46,530 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-12 21:26:46,530 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-12 21:26:46,530 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-12 21:26:46,530 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-12 21:26:46,531 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-12 21:26:46,531 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-12 21:26:46,533 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-12 21:26:46,545 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 [2024-11-12 21:26:46,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 21:26:46,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:26:46,547 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) [2024-11-12 21:26:46,548 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 [2024-11-12 21:26:46,548 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 [2024-11-12 21:26:46,558 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-12 21:26:46,558 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-12 21:26:46,559 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-12 21:26:46,559 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-12 21:26:46,559 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-12 21:26:46,560 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-12 21:26:46,560 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-12 21:26:46,562 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-12 21:26:46,566 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2024-11-12 21:26:46,566 INFO L444 ModelExtractionUtils]: 2 out of 6 variables were initially zero. Simplification set additionally 1 variables to zero. [2024-11-12 21:26:46,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 21:26:46,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:26:46,568 INFO L229 MonitoredProcess]: Starting monitored process 62 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-12 21:26:46,569 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Waiting until timeout for monitored process [2024-11-12 21:26:46,569 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-12 21:26:46,570 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-12 21:26:46,570 INFO L474 LassoAnalysis]: Proved termination. [2024-11-12 21:26:46,570 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 [] [2024-11-12 21:26:46,580 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 [2024-11-12 21:26:46,581 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-12 21:26:46,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:26:46,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:26:46,640 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-12 21:26:46,640 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 21:26:46,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:26:46,725 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-12 21:26:46,726 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 21:26:47,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 21:26:47,119 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 [2024-11-12 21:26:47,120 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 194 states and 218 transitions. cyclomatic complexity: 28 Second operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 21:26:47,196 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 194 states and 218 transitions. cyclomatic complexity: 28. Second operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 376 states and 410 transitions. Complement of second has 7 states. [2024-11-12 21:26:47,196 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 [2024-11-12 21:26:47,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 21:26:47,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 57 transitions. [2024-11-12 21:26:47,198 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 57 transitions. Stem has 19 letters. Loop has 25 letters. [2024-11-12 21:26:47,198 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-12 21:26:47,198 INFO L683 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-12 21:26:47,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:26:47,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:26:47,231 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-12 21:26:47,232 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 21:26:47,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:26:47,264 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-12 21:26:47,266 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 21:26:47,394 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Ended with exit code 0 [2024-11-12 21:26:47,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 21:26:47,439 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 [2024-11-12 21:26:47,440 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 194 states and 218 transitions. cyclomatic complexity: 28 Second operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 21:26:47,629 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 194 states and 218 transitions. cyclomatic complexity: 28. Second operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 456 states and 492 transitions. Complement of second has 15 states. [2024-11-12 21:26:47,629 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 [2024-11-12 21:26:47,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 21:26:47,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 76 transitions. [2024-11-12 21:26:47,630 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 76 transitions. Stem has 19 letters. Loop has 25 letters. [2024-11-12 21:26:47,630 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-12 21:26:47,630 INFO L683 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-12 21:26:47,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:26:47,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:26:47,653 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-12 21:26:47,653 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 21:26:47,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:26:47,702 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-12 21:26:47,702 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 21:26:47,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 21:26:47,853 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 [2024-11-12 21:26:47,853 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 194 states and 218 transitions. cyclomatic complexity: 28 Second operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 21:26:47,911 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 194 states and 218 transitions. cyclomatic complexity: 28. Second operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 755 states and 816 transitions. Complement of second has 7 states. [2024-11-12 21:26:47,912 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 [2024-11-12 21:26:47,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 21:26:47,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 107 transitions. [2024-11-12 21:26:47,913 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 107 transitions. Stem has 19 letters. Loop has 25 letters. [2024-11-12 21:26:47,913 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-12 21:26:47,913 INFO L683 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-12 21:26:47,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:26:47,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:26:47,941 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-12 21:26:47,941 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 21:26:47,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:26:47,971 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-12 21:26:47,971 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 21:26:48,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 21:26:48,117 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 [2024-11-12 21:26:48,117 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 194 states and 218 transitions. cyclomatic complexity: 28 Second operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 21:26:48,284 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 194 states and 218 transitions. cyclomatic complexity: 28. Second operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 907 states and 975 transitions. Complement of second has 14 states. [2024-11-12 21:26:48,285 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 [2024-11-12 21:26:48,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 21:26:48,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 131 transitions. [2024-11-12 21:26:48,286 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 131 transitions. Stem has 19 letters. Loop has 25 letters. [2024-11-12 21:26:48,287 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-12 21:26:48,287 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 131 transitions. Stem has 44 letters. Loop has 25 letters. [2024-11-12 21:26:48,287 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-12 21:26:48,287 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 131 transitions. Stem has 19 letters. Loop has 50 letters. [2024-11-12 21:26:48,288 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-12 21:26:48,288 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 907 states and 975 transitions. [2024-11-12 21:26:48,294 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2024-11-12 21:26:48,296 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 907 states to 627 states and 689 transitions. [2024-11-12 21:26:48,296 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 57 [2024-11-12 21:26:48,296 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 58 [2024-11-12 21:26:48,296 INFO L73 IsDeterministic]: Start isDeterministic. Operand 627 states and 689 transitions. [2024-11-12 21:26:48,296 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-12 21:26:48,296 INFO L218 hiAutomatonCegarLoop]: Abstraction has 627 states and 689 transitions. [2024-11-12 21:26:48,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 627 states and 689 transitions. [2024-11-12 21:26:48,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 627 to 386. [2024-11-12 21:26:48,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 386 states have (on average 1.116580310880829) internal successors, (431), 385 states have internal predecessors, (431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 21:26:48,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 431 transitions. [2024-11-12 21:26:48,301 INFO L240 hiAutomatonCegarLoop]: Abstraction has 386 states and 431 transitions. [2024-11-12 21:26:48,301 INFO L426 stractBuchiCegarLoop]: Abstraction has 386 states and 431 transitions. [2024-11-12 21:26:48,301 INFO L333 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2024-11-12 21:26:48,301 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 386 states and 431 transitions. [2024-11-12 21:26:48,302 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2024-11-12 21:26:48,302 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-12 21:26:48,303 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-12 21:26:48,304 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 21:26:48,304 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] [2024-11-12 21:26:48,304 INFO L747 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;" [2024-11-12 21:26:48,304 INFO L749 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;" [2024-11-12 21:26:48,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:26:48,305 INFO L85 PathProgramCache]: Analyzing trace with hash -216057713, now seen corresponding path program 1 times [2024-11-12 21:26:48,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 21:26:48,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376339001] [2024-11-12 21:26:48,305 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:26:48,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 21:26:48,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:26:48,316 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 21:26:48,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:26:48,326 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 21:26:48,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:26:48,326 INFO L85 PathProgramCache]: Analyzing trace with hash -289806389, now seen corresponding path program 3 times [2024-11-12 21:26:48,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 21:26:48,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155871769] [2024-11-12 21:26:48,326 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:26:48,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 21:26:48,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:26:48,334 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 21:26:48,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:26:48,341 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 21:26:48,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:26:48,344 INFO L85 PathProgramCache]: Analyzing trace with hash -46806275, now seen corresponding path program 1 times [2024-11-12 21:26:48,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 21:26:48,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930130666] [2024-11-12 21:26:48,344 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:26:48,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 21:26:48,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:26:48,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 21:26:48,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930130666] [2024-11-12 21:26:48,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930130666] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 21:26:48,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1856878141] [2024-11-12 21:26:48,489 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:26:48,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 21:26:48,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:26:48,491 INFO L229 MonitoredProcess]: Starting monitored process 63 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 21:26:48,492 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (63)] Waiting until timeout for monitored process [2024-11-12 21:26:48,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:26:48,570 INFO L256 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-12 21:26:48,571 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 21:26:48,761 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 21:26:48,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1856878141] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 21:26:48,858 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 21:26:48,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2024-11-12 21:26:48,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662355837] [2024-11-12 21:26:48,858 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 21:26:49,034 INFO L204 LassoAnalysis]: Preferences: [2024-11-12 21:26:49,034 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-12 21:26:49,034 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-12 21:26:49,034 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-12 21:26:49,034 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-12 21:26:49,034 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 21:26:49,034 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-12 21:26:49,034 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-12 21:26:49,034 INFO L132 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration9_Loop [2024-11-12 21:26:49,034 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-12 21:26:49,034 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-12 21:26:49,035 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 21:26:49,044 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 21:26:49,046 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 21:26:49,047 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 21:26:49,050 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 21:26:49,081 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-12 21:26:49,081 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-12 21:26:49,081 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 21:26:49,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:26:49,083 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) [2024-11-12 21:26:49,084 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 [2024-11-12 21:26:49,084 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-12 21:26:49,085 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-12 21:26:49,114 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 [2024-11-12 21:26:49,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 21:26:49,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:26:49,116 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) [2024-11-12 21:26:49,117 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 [2024-11-12 21:26:49,117 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-12 21:26:49,117 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-12 21:26:49,199 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-12 21:26:49,204 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Forceful destruction successful, exit code 0 [2024-11-12 21:26:49,204 INFO L204 LassoAnalysis]: Preferences: [2024-11-12 21:26:49,204 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-12 21:26:49,204 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-12 21:26:49,204 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-12 21:26:49,205 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-12 21:26:49,205 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 21:26:49,205 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-12 21:26:49,205 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-12 21:26:49,205 INFO L132 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration9_Loop [2024-11-12 21:26:49,205 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-12 21:26:49,205 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-12 21:26:49,205 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 21:26:49,219 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 21:26:49,221 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 21:26:49,222 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 21:26:49,223 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 21:26:49,253 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-12 21:26:49,253 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-12 21:26:49,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 21:26:49,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:26:49,255 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) [2024-11-12 21:26:49,256 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 [2024-11-12 21:26:49,256 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 [2024-11-12 21:26:49,266 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-12 21:26:49,266 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-12 21:26:49,267 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-12 21:26:49,267 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-12 21:26:49,267 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-12 21:26:49,268 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-12 21:26:49,268 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-12 21:26:49,270 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-12 21:26:49,275 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2024-11-12 21:26:49,275 INFO L444 ModelExtractionUtils]: 1 out of 6 variables were initially zero. Simplification set additionally 2 variables to zero. [2024-11-12 21:26:49,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 21:26:49,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:26:49,277 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) [2024-11-12 21:26:49,278 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 [2024-11-12 21:26:49,278 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-12 21:26:49,278 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-12 21:26:49,278 INFO L474 LassoAnalysis]: Proved termination. [2024-11-12 21:26:49,278 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0#1, ULTIMATE.start_main_~j~0#1) = 2*ULTIMATE.start_main_~n~0#1 - 3*ULTIMATE.start_main_~j~0#1 Supporting invariants [] [2024-11-12 21:26:49,288 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Forceful destruction successful, exit code 0 [2024-11-12 21:26:49,288 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-12 21:26:49,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:26:49,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:26:49,312 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-12 21:26:49,312 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 21:26:49,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:26:49,343 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-12 21:26:49,344 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 21:26:49,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 21:26:49,483 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 [2024-11-12 21:26:49,483 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 386 states and 431 transitions. cyclomatic complexity: 50 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) [2024-11-12 21:26:49,596 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 [2024-11-12 21:26:49,770 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 386 states and 431 transitions. cyclomatic complexity: 50. 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 1355 states and 1470 transitions. Complement of second has 19 states. [2024-11-12 21:26:49,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 1 stem states 8 non-accepting loop states 1 accepting loop states [2024-11-12 21:26:49,771 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) [2024-11-12 21:26:49,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 164 transitions. [2024-11-12 21:26:49,771 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 164 transitions. Stem has 30 letters. Loop has 25 letters. [2024-11-12 21:26:49,771 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-12 21:26:49,771 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 164 transitions. Stem has 55 letters. Loop has 25 letters. [2024-11-12 21:26:49,772 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-12 21:26:49,772 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 164 transitions. Stem has 30 letters. Loop has 50 letters. [2024-11-12 21:26:49,772 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-12 21:26:49,772 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1355 states and 1470 transitions. [2024-11-12 21:26:49,778 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 50 [2024-11-12 21:26:49,782 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1355 states to 1168 states and 1281 transitions. [2024-11-12 21:26:49,783 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 101 [2024-11-12 21:26:49,783 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 102 [2024-11-12 21:26:49,783 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1168 states and 1281 transitions. [2024-11-12 21:26:49,783 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-12 21:26:49,783 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1168 states and 1281 transitions. [2024-11-12 21:26:49,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1168 states and 1281 transitions. [2024-11-12 21:26:49,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1168 to 819. [2024-11-12 21:26:49,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 819 states, 819 states have (on average 1.1074481074481075) internal successors, (907), 818 states have internal predecessors, (907), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 21:26:49,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 819 states to 819 states and 907 transitions. [2024-11-12 21:26:49,794 INFO L240 hiAutomatonCegarLoop]: Abstraction has 819 states and 907 transitions. [2024-11-12 21:26:49,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 21:26:49,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-12 21:26:49,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2024-11-12 21:26:49,795 INFO L87 Difference]: Start difference. First operand 819 states and 907 transitions. Second operand has 14 states, 14 states have (on average 7.0) internal successors, (98), 14 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 21:26:50,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 21:26:50,828 INFO L93 Difference]: Finished difference Result 4143 states and 4443 transitions. [2024-11-12 21:26:50,828 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4143 states and 4443 transitions. [2024-11-12 21:26:50,868 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 114 [2024-11-12 21:26:50,890 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4143 states to 2875 states and 3099 transitions. [2024-11-12 21:26:50,894 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 276 [2024-11-12 21:26:50,894 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 276 [2024-11-12 21:26:50,894 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2875 states and 3099 transitions. [2024-11-12 21:26:50,895 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-12 21:26:50,895 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2875 states and 3099 transitions. [2024-11-12 21:26:50,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2875 states and 3099 transitions. [2024-11-12 21:26:50,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2875 to 1311. [2024-11-12 21:26:50,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1311 states, 1311 states have (on average 1.1037376048817698) internal successors, (1447), 1310 states have internal predecessors, (1447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 21:26:50,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1311 states to 1311 states and 1447 transitions. [2024-11-12 21:26:50,939 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1311 states and 1447 transitions. [2024-11-12 21:26:50,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2024-11-12 21:26:50,943 INFO L426 stractBuchiCegarLoop]: Abstraction has 1311 states and 1447 transitions. [2024-11-12 21:26:50,943 INFO L333 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2024-11-12 21:26:50,943 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1311 states and 1447 transitions. [2024-11-12 21:26:50,951 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 50 [2024-11-12 21:26:50,951 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-12 21:26:50,951 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-12 21:26:50,951 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] [2024-11-12 21:26:50,952 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] [2024-11-12 21:26:50,952 INFO L747 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;" [2024-11-12 21:26:50,952 INFO L749 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;" [2024-11-12 21:26:50,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:26:50,952 INFO L85 PathProgramCache]: Analyzing trace with hash 247002273, now seen corresponding path program 1 times [2024-11-12 21:26:50,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 21:26:50,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937156470] [2024-11-12 21:26:50,953 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:26:50,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 21:26:50,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:26:50,980 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 21:26:50,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:26:50,990 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 21:26:50,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:26:50,990 INFO L85 PathProgramCache]: Analyzing trace with hash -289806389, now seen corresponding path program 4 times [2024-11-12 21:26:50,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 21:26:50,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649596716] [2024-11-12 21:26:50,991 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:26:50,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 21:26:51,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:26:51,001 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 21:26:51,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:26:51,008 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 21:26:51,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:26:51,009 INFO L85 PathProgramCache]: Analyzing trace with hash -1441831125, now seen corresponding path program 1 times [2024-11-12 21:26:51,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 21:26:51,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034894779] [2024-11-12 21:26:51,009 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:26:51,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 21:26:51,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:26:51,029 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 21:26:51,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:26:51,045 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 21:26:51,226 INFO L204 LassoAnalysis]: Preferences: [2024-11-12 21:26:51,226 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-12 21:26:51,226 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-12 21:26:51,226 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-12 21:26:51,226 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-12 21:26:51,227 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 21:26:51,227 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-12 21:26:51,227 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-12 21:26:51,227 INFO L132 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration10_Loop [2024-11-12 21:26:51,227 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-12 21:26:51,227 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-12 21:26:51,227 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 21:26:51,238 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 21:26:51,240 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 21:26:51,242 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 21:26:51,243 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 21:26:51,284 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-12 21:26:51,284 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-12 21:26:51,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 21:26:51,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:26:51,286 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) [2024-11-12 21:26:51,287 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 [2024-11-12 21:26:51,288 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-12 21:26:51,288 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-12 21:26:51,319 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 [2024-11-12 21:26:51,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 21:26:51,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:26:51,323 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) [2024-11-12 21:26:51,324 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 [2024-11-12 21:26:51,325 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-12 21:26:51,325 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-12 21:26:51,400 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-12 21:26:51,404 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Forceful destruction successful, exit code 0 [2024-11-12 21:26:51,405 INFO L204 LassoAnalysis]: Preferences: [2024-11-12 21:26:51,405 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-12 21:26:51,405 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-12 21:26:51,405 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-12 21:26:51,405 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-12 21:26:51,405 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 21:26:51,405 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-12 21:26:51,405 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-12 21:26:51,405 INFO L132 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration10_Loop [2024-11-12 21:26:51,405 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-12 21:26:51,405 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-12 21:26:51,406 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 21:26:51,407 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 21:26:51,417 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 21:26:51,419 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 21:26:51,420 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 21:26:51,452 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-12 21:26:51,452 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-12 21:26:51,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 21:26:51,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:26:51,453 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) [2024-11-12 21:26:51,454 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 [2024-11-12 21:26:51,455 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 [2024-11-12 21:26:51,464 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-12 21:26:51,465 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-12 21:26:51,465 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-12 21:26:51,465 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-12 21:26:51,465 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-12 21:26:51,465 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-12 21:26:51,465 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-12 21:26:51,466 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-12 21:26:51,476 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Forceful destruction successful, exit code 0 [2024-11-12 21:26:51,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 21:26:51,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:26:51,478 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) [2024-11-12 21:26:51,479 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 [2024-11-12 21:26:51,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 [2024-11-12 21:26:51,491 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-12 21:26:51,492 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-12 21:26:51,492 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-12 21:26:51,492 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-12 21:26:51,492 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-12 21:26:51,493 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-12 21:26:51,493 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-12 21:26:51,496 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-12 21:26:51,499 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2024-11-12 21:26:51,499 INFO L444 ModelExtractionUtils]: 2 out of 6 variables were initially zero. Simplification set additionally 1 variables to zero. [2024-11-12 21:26:51,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 21:26:51,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:26:51,501 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) [2024-11-12 21:26:51,502 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 [2024-11-12 21:26:51,502 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-12 21:26:51,503 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-12 21:26:51,503 INFO L474 LassoAnalysis]: Proved termination. [2024-11-12 21:26:51,503 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 [] [2024-11-12 21:26:51,513 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 [2024-11-12 21:26:51,517 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-12 21:26:51,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:26:51,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:26:51,552 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-12 21:26:51,552 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 21:26:51,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:26:51,594 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-12 21:26:51,594 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 21:26:51,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 21:26:51,706 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 [2024-11-12 21:26:51,707 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1311 states and 1447 transitions. cyclomatic complexity: 153 Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 21:26:51,827 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1311 states and 1447 transitions. cyclomatic complexity: 153. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 1858 states and 2039 transitions. Complement of second has 13 states. [2024-11-12 21:26:51,827 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 [2024-11-12 21:26:51,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 21:26:51,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 85 transitions. [2024-11-12 21:26:51,828 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 85 transitions. Stem has 39 letters. Loop has 25 letters. [2024-11-12 21:26:51,828 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-12 21:26:51,828 INFO L683 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-12 21:26:51,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:26:51,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:26:51,856 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-12 21:26:51,857 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 21:26:51,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:26:51,907 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-12 21:26:51,908 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 21:26:52,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 21:26:52,036 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 [2024-11-12 21:26:52,036 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1311 states and 1447 transitions. cyclomatic complexity: 153 Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 21:26:52,046 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Ended with exit code 0 [2024-11-12 21:26:52,299 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1311 states and 1447 transitions. cyclomatic complexity: 153. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 2405 states and 2597 transitions. Complement of second has 21 states. [2024-11-12 21:26:52,300 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 [2024-11-12 21:26:52,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 21:26:52,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 164 transitions. [2024-11-12 21:26:52,300 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 164 transitions. Stem has 39 letters. Loop has 25 letters. [2024-11-12 21:26:52,300 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-12 21:26:52,300 INFO L683 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-12 21:26:52,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:26:52,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:26:52,327 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-12 21:26:52,327 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 21:26:52,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:26:52,378 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-12 21:26:52,379 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 21:26:52,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 21:26:52,487 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 [2024-11-12 21:26:52,487 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1311 states and 1447 transitions. cyclomatic complexity: 153 Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 21:26:52,705 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1311 states and 1447 transitions. cyclomatic complexity: 153. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 2964 states and 3183 transitions. Complement of second has 30 states. [2024-11-12 21:26:52,705 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 [2024-11-12 21:26:52,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 21:26:52,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 165 transitions. [2024-11-12 21:26:52,706 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 165 transitions. Stem has 39 letters. Loop has 25 letters. [2024-11-12 21:26:52,706 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-12 21:26:52,706 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 165 transitions. Stem has 64 letters. Loop has 25 letters. [2024-11-12 21:26:52,707 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-12 21:26:52,707 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 165 transitions. Stem has 39 letters. Loop has 50 letters. [2024-11-12 21:26:52,707 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-12 21:26:52,707 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2964 states and 3183 transitions. [2024-11-12 21:26:52,716 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 50 [2024-11-12 21:26:52,721 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2964 states to 2048 states and 2230 transitions. [2024-11-12 21:26:52,721 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 119 [2024-11-12 21:26:52,721 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 123 [2024-11-12 21:26:52,721 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2048 states and 2230 transitions. [2024-11-12 21:26:52,722 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-12 21:26:52,722 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2048 states and 2230 transitions. [2024-11-12 21:26:52,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2048 states and 2230 transitions. [2024-11-12 21:26:52,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2048 to 1060. [2024-11-12 21:26:52,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1060 states, 1060 states have (on average 1.1018867924528302) internal successors, (1168), 1059 states have internal predecessors, (1168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 21:26:52,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1060 states to 1060 states and 1168 transitions. [2024-11-12 21:26:52,735 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1060 states and 1168 transitions. [2024-11-12 21:26:52,736 INFO L426 stractBuchiCegarLoop]: Abstraction has 1060 states and 1168 transitions. [2024-11-12 21:26:52,736 INFO L333 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2024-11-12 21:26:52,736 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1060 states and 1168 transitions. [2024-11-12 21:26:52,738 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2024-11-12 21:26:52,738 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-12 21:26:52,738 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-12 21:26:52,739 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 21:26:52,739 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] [2024-11-12 21:26:52,739 INFO L747 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;" [2024-11-12 21:26:52,739 INFO L749 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;" [2024-11-12 21:26:52,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:26:52,739 INFO L85 PathProgramCache]: Analyzing trace with hash -1073412628, now seen corresponding path program 1 times [2024-11-12 21:26:52,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 21:26:52,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761076445] [2024-11-12 21:26:52,740 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:26:52,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 21:26:52,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:26:52,747 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 21:26:52,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:26:52,753 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 21:26:52,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:26:52,753 INFO L85 PathProgramCache]: Analyzing trace with hash -472888785, now seen corresponding path program 1 times [2024-11-12 21:26:52,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 21:26:52,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565900332] [2024-11-12 21:26:52,753 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:26:52,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 21:26:52,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:26:52,758 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 21:26:52,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:26:52,763 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 21:26:52,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:26:52,764 INFO L85 PathProgramCache]: Analyzing trace with hash -1266011484, now seen corresponding path program 2 times [2024-11-12 21:26:52,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 21:26:52,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87560209] [2024-11-12 21:26:52,764 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:26:52,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 21:26:52,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:26:52,774 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 21:26:52,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:26:52,785 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 21:26:52,996 INFO L204 LassoAnalysis]: Preferences: [2024-11-12 21:26:52,997 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-12 21:26:52,997 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-12 21:26:52,997 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-12 21:26:52,997 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-12 21:26:52,997 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 21:26:52,997 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-12 21:26:52,997 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-12 21:26:52,997 INFO L132 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration11_Loop [2024-11-12 21:26:52,997 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-12 21:26:52,998 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-12 21:26:52,998 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 21:26:53,000 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 21:26:53,002 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 21:26:53,003 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 21:26:53,008 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 21:26:53,066 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-12 21:26:53,067 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-12 21:26:53,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 21:26:53,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:26:53,068 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) [2024-11-12 21:26:53,069 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 [2024-11-12 21:26:53,070 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-12 21:26:53,070 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-12 21:26:53,082 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-12 21:26:53,082 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: [] [2024-11-12 21:26:53,092 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 [2024-11-12 21:26:53,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 21:26:53,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:26:53,094 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) [2024-11-12 21:26:53,095 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 [2024-11-12 21:26:53,096 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-12 21:26:53,096 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-12 21:26:53,107 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-12 21:26:53,107 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: [] [2024-11-12 21:26:53,117 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Forceful destruction successful, exit code 0 [2024-11-12 21:26:53,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 21:26:53,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:26:53,118 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) [2024-11-12 21:26:53,119 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 [2024-11-12 21:26:53,119 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-12 21:26:53,119 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-12 21:26:53,130 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-12 21:26:53,130 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: [] [2024-11-12 21:26:53,140 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Forceful destruction successful, exit code 0 [2024-11-12 21:26:53,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 21:26:53,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:26:53,142 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) [2024-11-12 21:26:53,143 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 [2024-11-12 21:26:53,143 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-12 21:26:53,143 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-12 21:26:53,161 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-12 21:26:53,161 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start___VERIFIER_assert_~cond#1=1} Honda state: {ULTIMATE.start___VERIFIER_assert_~cond#1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-12 21:26:53,171 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 [2024-11-12 21:26:53,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 21:26:53,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:26:53,173 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) [2024-11-12 21:26:53,173 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 [2024-11-12 21:26:53,174 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-12 21:26:53,174 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-12 21:26:53,203 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Forceful destruction successful, exit code 0 [2024-11-12 21:26:53,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 21:26:53,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:26:53,204 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) [2024-11-12 21:26:53,205 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 [2024-11-12 21:26:53,206 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-12 21:26:53,206 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-12 21:26:53,354 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-12 21:26:53,359 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 [2024-11-12 21:26:53,359 INFO L204 LassoAnalysis]: Preferences: [2024-11-12 21:26:53,359 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-12 21:26:53,359 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-12 21:26:53,359 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-12 21:26:53,359 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-12 21:26:53,359 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 21:26:53,359 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-12 21:26:53,359 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-12 21:26:53,359 INFO L132 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration11_Loop [2024-11-12 21:26:53,359 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-12 21:26:53,359 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-12 21:26:53,360 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 21:26:53,362 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 21:26:53,364 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 21:26:53,367 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 21:26:53,369 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 21:26:53,428 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-12 21:26:53,428 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-12 21:26:53,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 21:26:53,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:26:53,430 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) [2024-11-12 21:26:53,431 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 [2024-11-12 21:26:53,432 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-12 21:26:53,443 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-12 21:26:53,443 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-12 21:26:53,443 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-12 21:26:53,443 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-12 21:26:53,444 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-12 21:26:53,444 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-12 21:26:53,444 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-12 21:26:53,445 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-12 21:26:53,457 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Ended with exit code 0 [2024-11-12 21:26:53,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 21:26:53,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:26:53,459 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) [2024-11-12 21:26:53,460 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 [2024-11-12 21:26:53,461 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-12 21:26:53,471 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-12 21:26:53,472 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-12 21:26:53,472 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-12 21:26:53,472 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-12 21:26:53,472 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-12 21:26:53,472 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-12 21:26:53,472 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-12 21:26:53,473 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-12 21:26:53,484 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Forceful destruction successful, exit code 0 [2024-11-12 21:26:53,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 21:26:53,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:26:53,486 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) [2024-11-12 21:26:53,487 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 [2024-11-12 21:26:53,488 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 [2024-11-12 21:26:53,498 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-12 21:26:53,498 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-12 21:26:53,498 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-12 21:26:53,498 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2024-11-12 21:26:53,498 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-12 21:26:53,499 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2024-11-12 21:26:53,499 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-12 21:26:53,502 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-12 21:26:53,512 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Ended with exit code 0 [2024-11-12 21:26:53,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 21:26:53,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:26:53,514 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) [2024-11-12 21:26:53,514 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 [2024-11-12 21:26:53,515 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 [2024-11-12 21:26:53,525 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-12 21:26:53,525 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-12 21:26:53,525 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-12 21:26:53,525 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-12 21:26:53,525 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-12 21:26:53,526 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-12 21:26:53,526 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-12 21:26:53,527 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-12 21:26:53,537 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Forceful destruction successful, exit code 0 [2024-11-12 21:26:53,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 21:26:53,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:26:53,539 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) [2024-11-12 21:26:53,540 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 [2024-11-12 21:26:53,540 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 [2024-11-12 21:26:53,550 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-12 21:26:53,550 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-12 21:26:53,550 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-12 21:26:53,550 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-12 21:26:53,550 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-12 21:26:53,552 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-12 21:26:53,552 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-12 21:26:53,554 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-12 21:26:53,560 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2024-11-12 21:26:53,560 INFO L444 ModelExtractionUtils]: 1 out of 6 variables were initially zero. Simplification set additionally 2 variables to zero. [2024-11-12 21:26:53,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 21:26:53,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:26:53,562 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) [2024-11-12 21:26:53,563 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 [2024-11-12 21:26:53,563 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-12 21:26:53,563 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-12 21:26:53,564 INFO L474 LassoAnalysis]: Proved termination. [2024-11-12 21:26:53,564 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 [] [2024-11-12 21:26:53,575 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 [2024-11-12 21:26:53,576 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-12 21:26:53,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:26:53,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:26:53,606 INFO L256 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-12 21:26:53,607 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 21:26:53,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:26:53,660 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-12 21:26:53,661 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 21:26:53,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 21:26:53,831 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 [2024-11-12 21:26:53,831 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1060 states and 1168 transitions. cyclomatic complexity: 118 Second operand has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 21:26:53,907 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1060 states and 1168 transitions. cyclomatic complexity: 118. Second operand has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 1278 states and 1395 transitions. Complement of second has 11 states. [2024-11-12 21:26:53,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2024-11-12 21:26:53,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 21:26:53,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 38 transitions. [2024-11-12 21:26:53,908 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 38 transitions. Stem has 40 letters. Loop has 25 letters. [2024-11-12 21:26:53,908 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-12 21:26:53,908 INFO L683 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-12 21:26:53,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:26:53,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:26:53,943 INFO L256 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-12 21:26:53,944 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 21:26:53,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:26:53,998 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-12 21:26:53,999 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 21:26:54,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 21:26:54,168 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 [2024-11-12 21:26:54,169 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1060 states and 1168 transitions. cyclomatic complexity: 118 Second operand has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 21:26:54,246 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1060 states and 1168 transitions. cyclomatic complexity: 118. Second operand has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 1278 states and 1395 transitions. Complement of second has 11 states. [2024-11-12 21:26:54,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2024-11-12 21:26:54,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 21:26:54,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 38 transitions. [2024-11-12 21:26:54,247 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 38 transitions. Stem has 40 letters. Loop has 25 letters. [2024-11-12 21:26:54,247 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-12 21:26:54,247 INFO L683 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-12 21:26:54,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:26:54,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:26:54,282 INFO L256 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-12 21:26:54,283 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 21:26:54,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:26:54,336 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-12 21:26:54,337 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 21:26:54,390 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 [2024-11-12 21:26:54,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 21:26:54,531 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 [2024-11-12 21:26:54,531 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1060 states and 1168 transitions. cyclomatic complexity: 118 Second operand has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 21:26:54,700 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1060 states and 1168 transitions. cyclomatic complexity: 118. Second operand has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 2414 states and 2606 transitions. Complement of second has 27 states. [2024-11-12 21:26:54,701 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 [2024-11-12 21:26:54,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 21:26:54,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 109 transitions. [2024-11-12 21:26:54,701 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 109 transitions. Stem has 40 letters. Loop has 25 letters. [2024-11-12 21:26:54,702 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-12 21:26:54,702 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 109 transitions. Stem has 65 letters. Loop has 25 letters. [2024-11-12 21:26:54,702 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-12 21:26:54,702 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 109 transitions. Stem has 40 letters. Loop has 50 letters. [2024-11-12 21:26:54,703 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-12 21:26:54,703 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2414 states and 2606 transitions. [2024-11-12 21:26:54,710 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-11-12 21:26:54,710 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2414 states to 0 states and 0 transitions. [2024-11-12 21:26:54,710 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2024-11-12 21:26:54,710 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2024-11-12 21:26:54,711 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2024-11-12 21:26:54,711 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-12 21:26:54,711 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-12 21:26:54,711 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-12 21:26:54,711 INFO L426 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-12 21:26:54,711 INFO L333 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2024-11-12 21:26:54,711 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2024-11-12 21:26:54,711 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-11-12 21:26:54,711 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2024-11-12 21:26:54,717 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 12.11 09:26:54 BoogieIcfgContainer [2024-11-12 21:26:54,717 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-11-12 21:26:54,718 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 21:26:54,718 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 21:26:54,718 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 21:26:54,719 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 09:26:37" (3/4) ... [2024-11-12 21:26:54,720 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-12 21:26:54,721 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 21:26:54,722 INFO L158 Benchmark]: Toolchain (without parser) took 17567.22ms. Allocated memory was 178.3MB in the beginning and 268.4MB in the end (delta: 90.2MB). Free memory was 110.4MB in the beginning and 177.5MB in the end (delta: -67.1MB). Peak memory consumption was 24.8MB. Max. memory is 16.1GB. [2024-11-12 21:26:54,722 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 115.3MB. Free memory is still 78.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 21:26:54,722 INFO L158 Benchmark]: CACSL2BoogieTranslator took 327.46ms. Allocated memory is still 178.3MB. Free memory was 110.2MB in the beginning and 150.9MB in the end (delta: -40.7MB). Peak memory consumption was 15.0MB. Max. memory is 16.1GB. [2024-11-12 21:26:54,722 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.09ms. Allocated memory is still 178.3MB. Free memory was 150.9MB in the beginning and 148.9MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 21:26:54,723 INFO L158 Benchmark]: Boogie Preprocessor took 39.76ms. Allocated memory is still 178.3MB. Free memory was 148.9MB in the beginning and 146.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 21:26:54,723 INFO L158 Benchmark]: RCFGBuilder took 412.09ms. Allocated memory is still 178.3MB. Free memory was 146.8MB in the beginning and 130.0MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-12 21:26:54,723 INFO L158 Benchmark]: BuchiAutomizer took 16735.23ms. Allocated memory was 178.3MB in the beginning and 268.4MB in the end (delta: 90.2MB). Free memory was 130.0MB in the beginning and 177.5MB in the end (delta: -47.5MB). Peak memory consumption was 43.4MB. Max. memory is 16.1GB. [2024-11-12 21:26:54,723 INFO L158 Benchmark]: Witness Printer took 3.31ms. Allocated memory is still 268.4MB. Free memory is still 177.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 21:26:54,724 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 115.3MB. Free memory is still 78.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 327.46ms. Allocated memory is still 178.3MB. Free memory was 110.2MB in the beginning and 150.9MB in the end (delta: -40.7MB). Peak memory consumption was 15.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.09ms. Allocated memory is still 178.3MB. Free memory was 150.9MB in the beginning and 148.9MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 39.76ms. Allocated memory is still 178.3MB. Free memory was 148.9MB in the beginning and 146.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 412.09ms. Allocated memory is still 178.3MB. Free memory was 146.8MB in the beginning and 130.0MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * BuchiAutomizer took 16735.23ms. Allocated memory was 178.3MB in the beginning and 268.4MB in the end (delta: 90.2MB). Free memory was 130.0MB in the beginning and 177.5MB in the end (delta: -47.5MB). Peak memory consumption was 43.4MB. Max. memory is 16.1GB. * Witness Printer took 3.31ms. Allocated memory is still 268.4MB. Free memory is still 177.5MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 17 terminating modules (8 trivial, 6 deterministic, 3 nondeterministic). One deterministic module has affine ranking function l and consists of 5 locations. One deterministic module has affine ranking function l and consists of 4 locations. One deterministic module has affine ranking function r and consists of 3 locations. One deterministic module has affine ranking function 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) 2 * n) + ((long long) -3 * j)) and consists of 10 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 11 locations. One nondeterministic module has affine ranking function (((long long) -2 * j) + n) and consists of 8 locations. 8 modules have a trivial ranking function, the largest among these consists of 16 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 16.6s and 12 iterations. TraceHistogramMax:2. Analysis of lassos took 8.6s. Construction of modules took 1.9s. Büchi inclusion checks took 5.8s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 15. Automata minimization 0.1s AutomataMinimizationTime, 16 MinimizatonAttempts, 4180 StatesRemovedByMinimization, 15 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 [6, 0, 2, 1, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2928 SdHoareTripleChecker+Valid, 2.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2912 mSDsluCounter, 4381 SdHoareTripleChecker+Invalid, 2.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2899 mSDsCounter, 210 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3342 IncrementalHoareTripleChecker+Invalid, 3552 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 210 mSolverCounterUnsat, 1482 mSDtfsCounter, 3342 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT3 conc0 concLT6 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital29 mio100 ax100 hnf100 lsp97 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq147 hnf94 smp100 dnf100 smp100 tf105 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 17ms VariablesStem: 0 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 0 MotzkinApplications: 4 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 19 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 9 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 1.8s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2024-11-12 21:26:54,751 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (63)] Forceful destruction successful, exit code 0 [2024-11-12 21:26:54,946 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Forceful destruction successful, exit code 0 [2024-11-12 21:26:55,149 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Forceful destruction successful, exit code 0 [2024-11-12 21:26:55,349 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Ended with exit code 0 [2024-11-12 21:26:55,551 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2024-11-12 21:26:55,750 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2024-11-12 21:26:55,949 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-12 21:26:56,154 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-12 21:26:56,356 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE