./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-memory-alloca/java_BubbleSort-alloca-2.i --full-output --architecture 64bit -------------------------------------------------------------------------------- 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/termination-memory-alloca/java_BubbleSort-alloca-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-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 64bit --witnessprinter.graph.data.programhash a88178fc87721f9fcc743f79bc2a47ff45a89438b0709780ae0f715015934520 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 20:58:54,335 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 20:58:54,426 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2024-11-12 20:58:54,432 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 20:58:54,432 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 20:58:54,471 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 20:58:54,471 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 20:58:54,471 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 20:58:54,472 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 20:58:54,473 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 20:58:54,474 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 20:58:54,474 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 20:58:54,474 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 20:58:54,475 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-12 20:58:54,477 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-12 20:58:54,477 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-12 20:58:54,477 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-12 20:58:54,477 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-12 20:58:54,478 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-12 20:58:54,478 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 20:58:54,478 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-12 20:58:54,479 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 20:58:54,482 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 20:58:54,482 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-12 20:58:54,483 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-12 20:58:54,483 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-12 20:58:54,483 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 20:58:54,483 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-12 20:58:54,483 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 20:58:54,483 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-12 20:58:54,484 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 20:58:54,484 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 20:58:54,484 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 20:58:54,484 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 20:58:54,484 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 20:58:54,485 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-12 20:58:54,485 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a88178fc87721f9fcc743f79bc2a47ff45a89438b0709780ae0f715015934520 [2024-11-12 20:58:54,734 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 20:58:54,758 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 20:58:54,760 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 20:58:54,761 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 20:58:54,762 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 20:58:54,763 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-alloca/java_BubbleSort-alloca-2.i [2024-11-12 20:58:56,241 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 20:58:56,460 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 20:58:56,461 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/java_BubbleSort-alloca-2.i [2024-11-12 20:58:56,471 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/939d61277/ba8e7b0680ed4732b35a1989558de6fb/FLAGce0aebb21 [2024-11-12 20:58:56,824 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/939d61277/ba8e7b0680ed4732b35a1989558de6fb [2024-11-12 20:58:56,826 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 20:58:56,827 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 20:58:56,828 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 20:58:56,829 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 20:58:56,833 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 20:58:56,834 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 08:58:56" (1/1) ... [2024-11-12 20:58:56,834 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29d662ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:58:56, skipping insertion in model container [2024-11-12 20:58:56,835 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 08:58:56" (1/1) ... [2024-11-12 20:58:56,872 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 20:58:57,191 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 20:58:57,201 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 20:58:57,256 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 20:58:57,289 INFO L204 MainTranslator]: Completed translation [2024-11-12 20:58:57,289 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:58:57 WrapperNode [2024-11-12 20:58:57,290 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 20:58:57,291 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 20:58:57,291 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 20:58:57,291 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 20:58:57,297 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:58:57" (1/1) ... [2024-11-12 20:58:57,309 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:58:57" (1/1) ... [2024-11-12 20:58:57,330 INFO L138 Inliner]: procedures = 111, calls = 13, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 65 [2024-11-12 20:58:57,331 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 20:58:57,333 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 20:58:57,333 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 20:58:57,333 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 20:58:57,342 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:58:57" (1/1) ... [2024-11-12 20:58:57,343 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:58:57" (1/1) ... [2024-11-12 20:58:57,348 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:58:57" (1/1) ... [2024-11-12 20:58:57,365 INFO L175 MemorySlicer]: Split 7 memory accesses to 1 slices as follows [7]. 100 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0]. The 3 writes are split as follows [3]. [2024-11-12 20:58:57,365 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:58:57" (1/1) ... [2024-11-12 20:58:57,365 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:58:57" (1/1) ... [2024-11-12 20:58:57,369 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:58:57" (1/1) ... [2024-11-12 20:58:57,371 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:58:57" (1/1) ... [2024-11-12 20:58:57,372 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:58:57" (1/1) ... [2024-11-12 20:58:57,373 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:58:57" (1/1) ... [2024-11-12 20:58:57,375 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 20:58:57,380 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 20:58:57,380 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 20:58:57,381 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 20:58:57,381 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:58:57" (1/1) ... [2024-11-12 20:58:57,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 20:58:57,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:58:57,421 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 20:58:57,423 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 20:58:57,467 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-12 20:58:57,467 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-12 20:58:57,467 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-12 20:58:57,486 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-12 20:58:57,487 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 20:58:57,487 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 20:58:57,600 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 20:58:57,602 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 20:58:57,717 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2024-11-12 20:58:57,718 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 20:58:57,726 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 20:58:57,726 INFO L316 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-12 20:58:57,727 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 08:58:57 BoogieIcfgContainer [2024-11-12 20:58:57,727 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 20:58:57,728 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-12 20:58:57,728 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-12 20:58:57,731 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-12 20:58:57,732 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-12 20:58:57,732 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 12.11 08:58:56" (1/3) ... [2024-11-12 20:58:57,733 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@30823d50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.11 08:58:57, skipping insertion in model container [2024-11-12 20:58:57,733 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-12 20:58:57,733 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:58:57" (2/3) ... [2024-11-12 20:58:57,734 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@30823d50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.11 08:58:57, skipping insertion in model container [2024-11-12 20:58:57,734 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-12 20:58:57,734 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 08:58:57" (3/3) ... [2024-11-12 20:58:57,735 INFO L332 chiAutomizerObserver]: Analyzing ICFG java_BubbleSort-alloca-2.i [2024-11-12 20:58:57,781 INFO L301 stractBuchiCegarLoop]: Interprodecural is true [2024-11-12 20:58:57,781 INFO L302 stractBuchiCegarLoop]: Hoare is None [2024-11-12 20:58:57,781 INFO L303 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-12 20:58:57,781 INFO L304 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-12 20:58:57,781 INFO L305 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-12 20:58:57,781 INFO L306 stractBuchiCegarLoop]: Difference is false [2024-11-12 20:58:57,781 INFO L307 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-12 20:58:57,781 INFO L311 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-12 20:58:57,785 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 16 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 15 states have internal predecessors, (23), 0 states have call successors, (0), 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 20:58:57,798 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2024-11-12 20:58:57,799 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-12 20:58:57,799 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-12 20:58:57,803 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2024-11-12 20:58:57,804 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-12 20:58:57,804 INFO L333 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-12 20:58:57,804 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 16 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 15 states have internal predecessors, (23), 0 states have call successors, (0), 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 20:58:57,805 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2024-11-12 20:58:57,805 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-12 20:58:57,806 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-12 20:58:57,806 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2024-11-12 20:58:57,806 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-12 20:58:57,813 INFO L747 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet10#1, main_#t~post11#1, main_~i~1#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet8#1;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;" "assume !(main_~array_size~0#1 < 1);" "call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 18446744073709551616);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~i~1#1 := 0;" [2024-11-12 20:58:57,813 INFO L749 eck$LassoCheckResult]: Loop: "assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet10#1;call write~int#0(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1;" "main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;" [2024-11-12 20:58:57,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:58:57,818 INFO L85 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2024-11-12 20:58:57,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:58:57,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504869835] [2024-11-12 20:58:57,827 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:58:57,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:58:57,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 20:58:57,914 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 20:58:57,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 20:58:57,944 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 20:58:57,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:58:57,948 INFO L85 PathProgramCache]: Analyzing trace with hash 1507, now seen corresponding path program 1 times [2024-11-12 20:58:57,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:58:57,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55959710] [2024-11-12 20:58:57,949 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:58:57,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:58:57,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 20:58:57,959 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 20:58:57,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 20:58:57,969 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 20:58:57,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:58:57,970 INFO L85 PathProgramCache]: Analyzing trace with hash 889568455, now seen corresponding path program 1 times [2024-11-12 20:58:57,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:58:57,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577698821] [2024-11-12 20:58:57,971 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:58:57,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:58:57,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 20:58:57,994 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 20:58:58,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 20:58:58,009 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 20:58:58,313 INFO L204 LassoAnalysis]: Preferences: [2024-11-12 20:58:58,314 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-12 20:58:58,314 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-12 20:58:58,315 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-12 20:58:58,315 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-12 20:58:58,315 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 20:58:58,315 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-12 20:58:58,315 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-12 20:58:58,315 INFO L132 ssoRankerPreferences]: Filename of dumped script: java_BubbleSort-alloca-2.i_Iteration1_Lasso [2024-11-12 20:58:58,315 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-12 20:58:58,315 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-12 20:58:58,335 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 20:58:58,342 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 20:58:58,345 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 20:58:58,349 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 20:58:58,351 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 20:58:58,355 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 20:58:58,503 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 20:58:58,505 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 20:58:58,509 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 20:58:58,758 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-12 20:58:58,764 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-12 20:58:58,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 20:58:58,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:58:58,767 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-12 20:58:58,768 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2024-11-12 20:58:58,770 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 20:58:58,782 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-12 20:58:58,782 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-12 20:58:58,783 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-12 20:58:58,783 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-12 20:58:58,783 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-12 20:58:58,784 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-12 20:58:58,784 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-12 20:58:58,787 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-12 20:58:58,802 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2024-11-12 20:58:58,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 20:58:58,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:58:58,804 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 20:58:58,806 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 20:58:58,807 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 20:58:58,817 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-12 20:58:58,817 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-12 20:58:58,817 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-12 20:58:58,817 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-12 20:58:58,817 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-12 20:58:58,818 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-12 20:58:58,818 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-12 20:58:58,820 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-12 20:58:58,832 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 20:58:58,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 20:58:58,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:58:58,834 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 20:58:58,835 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 20:58:58,836 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 20:58:58,846 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-12 20:58:58,846 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-12 20:58:58,846 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-12 20:58:58,846 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-12 20:58:58,849 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-12 20:58:58,849 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-12 20:58:58,853 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-12 20:58:58,869 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2024-11-12 20:58:58,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 20:58:58,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:58:58,871 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 20:58:58,872 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 20:58:58,874 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 20:58:58,888 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-12 20:58:58,889 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-12 20:58:58,889 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-12 20:58:58,889 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-12 20:58:58,889 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-12 20:58:58,890 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-12 20:58:58,890 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-12 20:58:58,894 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-12 20:58:58,909 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2024-11-12 20:58:58,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 20:58:58,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:58:58,912 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 20:58:58,913 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 20:58:58,914 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-12 20:58:58,927 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-12 20:58:58,927 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-12 20:58:58,927 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-12 20:58:58,927 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-12 20:58:58,930 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-12 20:58:58,931 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-12 20:58:58,935 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-12 20:58:58,950 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 20:58:58,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 20:58:58,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:58:58,953 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-12 20:58:58,954 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2024-11-12 20:58:58,955 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 20:58:58,969 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-12 20:58:58,970 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-12 20:58:58,970 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-12 20:58:58,970 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-12 20:58:58,981 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-12 20:58:58,982 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-12 20:58:58,996 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-12 20:58:59,029 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2024-11-12 20:58:59,030 INFO L444 ModelExtractionUtils]: 5 out of 19 variables were initially zero. Simplification set additionally 11 variables to zero. [2024-11-12 20:58:59,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 20:58:59,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:58:59,038 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 20:58:59,041 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 20:58:59,042 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-12 20:58:59,058 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-12 20:58:59,058 INFO L474 LassoAnalysis]: Proved termination. [2024-11-12 20:58:59,059 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~array_size~0#1, ULTIMATE.start_main_~i~1#1) = 1*ULTIMATE.start_main_~array_size~0#1 - 1*ULTIMATE.start_main_~i~1#1 Supporting invariants [] [2024-11-12 20:58:59,075 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2024-11-12 20:58:59,087 INFO L156 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2024-11-12 20:58:59,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:58:59,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:58:59,140 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-12 20:58:59,141 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 20:58:59,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:58:59,164 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-12 20:58:59,165 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 20:58:59,185 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 20:58:59,244 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 20:58:59,246 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 16 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 15 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 20:58:59,266 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 20:58:59,289 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 16 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 15 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 28 states and 42 transitions. Complement of second has 6 states. [2024-11-12 20:58:59,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2024-11-12 20:58:59,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 20:58:59,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 22 transitions. [2024-11-12 20:58:59,297 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 4 letters. Loop has 2 letters. [2024-11-12 20:58:59,298 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-12 20:58:59,298 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 6 letters. Loop has 2 letters. [2024-11-12 20:58:59,298 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-12 20:58:59,299 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 4 letters. Loop has 4 letters. [2024-11-12 20:58:59,299 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-12 20:58:59,299 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 42 transitions. [2024-11-12 20:58:59,301 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-11-12 20:58:59,306 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 13 states and 19 transitions. [2024-11-12 20:58:59,307 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2024-11-12 20:58:59,308 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2024-11-12 20:58:59,309 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 19 transitions. [2024-11-12 20:58:59,310 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-12 20:58:59,310 INFO L218 hiAutomatonCegarLoop]: Abstraction has 13 states and 19 transitions. [2024-11-12 20:58:59,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 19 transitions. [2024-11-12 20:58:59,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2024-11-12 20:58:59,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 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 20:58:59,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 19 transitions. [2024-11-12 20:58:59,333 INFO L240 hiAutomatonCegarLoop]: Abstraction has 13 states and 19 transitions. [2024-11-12 20:58:59,334 INFO L426 stractBuchiCegarLoop]: Abstraction has 13 states and 19 transitions. [2024-11-12 20:58:59,334 INFO L333 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-12 20:58:59,335 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 19 transitions. [2024-11-12 20:58:59,337 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-11-12 20:58:59,337 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-12 20:58:59,338 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-12 20:58:59,338 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2024-11-12 20:58:59,338 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-12 20:58:59,338 INFO L747 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet10#1, main_#t~post11#1, main_~i~1#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet8#1;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;" "assume !(main_~array_size~0#1 < 1);" "call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 18446744073709551616);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~i~1#1 := 0;" "assume !(main_~i~1#1 < main_~array_size~0#1);" "havoc main_~i~1#1;assume { :begin_inline_sort } true;sort_#in~x#1.base, sort_#in~x#1.offset, sort_#in~n#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc sort_#t~mem2#1, sort_#t~mem3#1, sort_#t~mem4#1, sort_#t~mem5#1, sort_~temp~0#1, sort_#t~post6#1, sort_#t~post7#1, sort_~x#1.base, sort_~x#1.offset, sort_~n#1, sort_~pass~0#1, sort_~i~0#1;sort_~x#1.base, sort_~x#1.offset := sort_#in~x#1.base, sort_#in~x#1.offset;sort_~n#1 := sort_#in~n#1;havoc sort_~pass~0#1;havoc sort_~i~0#1;sort_~pass~0#1 := 1;" [2024-11-12 20:58:59,339 INFO L749 eck$LassoCheckResult]: Loop: "assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0;" "assume !true;" "sort_#t~post7#1 := sort_~pass~0#1;sort_~pass~0#1 := 1 + sort_#t~post7#1;havoc sort_#t~post7#1;" [2024-11-12 20:58:59,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:58:59,341 INFO L85 PathProgramCache]: Analyzing trace with hash 889568397, now seen corresponding path program 1 times [2024-11-12 20:58:59,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:58:59,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380389934] [2024-11-12 20:58:59,341 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:58:59,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:58:59,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:58:59,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 20:58:59,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380389934] [2024-11-12 20:58:59,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380389934] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 20:58:59,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1553511971] [2024-11-12 20:58:59,468 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:58:59,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 20:58:59,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:58:59,470 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 20:58:59,471 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-12 20:58:59,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:58:59,522 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-12 20:58:59,522 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 20:58:59,550 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 20:58:59,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1553511971] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 20:58:59,567 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 20:58:59,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2024-11-12 20:58:59,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712387213] [2024-11-12 20:58:59,568 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 20:58:59,571 INFO L752 eck$LassoCheckResult]: stem already infeasible [2024-11-12 20:58:59,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:58:59,572 INFO L85 PathProgramCache]: Analyzing trace with hash 61120, now seen corresponding path program 1 times [2024-11-12 20:58:59,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:58:59,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367237797] [2024-11-12 20:58:59,573 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:58:59,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:58:59,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:58:59,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 20:58:59,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367237797] [2024-11-12 20:58:59,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367237797] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 20:58:59,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [427597241] [2024-11-12 20:58:59,589 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:58:59,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 20:58:59,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:58:59,606 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 20:58:59,608 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-12 20:58:59,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:58:59,648 INFO L256 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-12 20:58:59,648 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 20:58:59,650 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 20:58:59,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [427597241] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 20:58:59,651 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 20:58:59,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 2 [2024-11-12 20:58:59,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674577015] [2024-11-12 20:58:59,651 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 20:58:59,653 INFO L764 eck$LassoCheckResult]: loop already infeasible [2024-11-12 20:58:59,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 20:58:59,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 20:58:59,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 20:58:59,657 INFO L87 Difference]: Start difference. First operand 13 states and 19 transitions. cyclomatic complexity: 8 Second operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 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 20:58:59,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 20:58:59,665 INFO L93 Difference]: Finished difference Result 13 states and 18 transitions. [2024-11-12 20:58:59,665 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 18 transitions. [2024-11-12 20:58:59,665 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-11-12 20:58:59,666 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 13 states and 18 transitions. [2024-11-12 20:58:59,666 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2024-11-12 20:58:59,666 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2024-11-12 20:58:59,666 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 18 transitions. [2024-11-12 20:58:59,666 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-12 20:58:59,667 INFO L218 hiAutomatonCegarLoop]: Abstraction has 13 states and 18 transitions. [2024-11-12 20:58:59,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 18 transitions. [2024-11-12 20:58:59,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2024-11-12 20:58:59,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 12 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 20:58:59,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 18 transitions. [2024-11-12 20:58:59,669 INFO L240 hiAutomatonCegarLoop]: Abstraction has 13 states and 18 transitions. [2024-11-12 20:58:59,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 20:58:59,670 INFO L426 stractBuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2024-11-12 20:58:59,670 INFO L333 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-11-12 20:58:59,670 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 18 transitions. [2024-11-12 20:58:59,671 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-11-12 20:58:59,671 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-12 20:58:59,671 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-12 20:58:59,671 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2024-11-12 20:58:59,671 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-12 20:58:59,671 INFO L747 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet10#1, main_#t~post11#1, main_~i~1#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet8#1;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;" "assume !(main_~array_size~0#1 < 1);" "call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 18446744073709551616);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~i~1#1 := 0;" "assume !(main_~i~1#1 < main_~array_size~0#1);" "havoc main_~i~1#1;assume { :begin_inline_sort } true;sort_#in~x#1.base, sort_#in~x#1.offset, sort_#in~n#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc sort_#t~mem2#1, sort_#t~mem3#1, sort_#t~mem4#1, sort_#t~mem5#1, sort_~temp~0#1, sort_#t~post6#1, sort_#t~post7#1, sort_~x#1.base, sort_~x#1.offset, sort_~n#1, sort_~pass~0#1, sort_~i~0#1;sort_~x#1.base, sort_~x#1.offset := sort_#in~x#1.base, sort_#in~x#1.offset;sort_~n#1 := sort_#in~n#1;havoc sort_~pass~0#1;havoc sort_~i~0#1;sort_~pass~0#1 := 1;" [2024-11-12 20:58:59,672 INFO L749 eck$LassoCheckResult]: Loop: "assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0;" "assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);" "sort_#t~post7#1 := sort_~pass~0#1;sort_~pass~0#1 := 1 + sort_#t~post7#1;havoc sort_#t~post7#1;" [2024-11-12 20:58:59,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:58:59,672 INFO L85 PathProgramCache]: Analyzing trace with hash 889568397, now seen corresponding path program 2 times [2024-11-12 20:58:59,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:58:59,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320380890] [2024-11-12 20:58:59,673 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:58:59,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:58:59,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:58:59,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 20:58:59,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320380890] [2024-11-12 20:58:59,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320380890] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 20:58:59,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [62284044] [2024-11-12 20:58:59,725 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-12 20:58:59,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 20:58:59,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:58:59,728 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 20:58:59,729 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-12 20:58:59,771 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-12 20:58:59,771 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-12 20:58:59,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2024-11-12 20:58:59,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903741964] [2024-11-12 20:58:59,772 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-12 20:58:59,772 INFO L752 eck$LassoCheckResult]: stem already infeasible [2024-11-12 20:58:59,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:58:59,773 INFO L85 PathProgramCache]: Analyzing trace with hash 60779, now seen corresponding path program 1 times [2024-11-12 20:58:59,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:58:59,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625728370] [2024-11-12 20:58:59,773 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:58:59,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:58:59,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:58:59,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 20:58:59,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625728370] [2024-11-12 20:58:59,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625728370] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 20:58:59,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1632862674] [2024-11-12 20:58:59,802 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:58:59,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 20:58:59,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:58:59,804 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 20:58:59,806 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-12 20:58:59,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:58:59,843 INFO L256 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-12 20:58:59,843 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 20:58:59,854 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 20:58:59,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1632862674] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 20:58:59,868 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 20:58:59,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 3 [2024-11-12 20:58:59,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097951307] [2024-11-12 20:58:59,869 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 20:58:59,869 INFO L764 eck$LassoCheckResult]: loop already infeasible [2024-11-12 20:58:59,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 20:58:59,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 20:58:59,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-12 20:58:59,870 INFO L87 Difference]: Start difference. First operand 13 states and 18 transitions. cyclomatic complexity: 7 Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 20:58:59,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 20:58:59,888 INFO L93 Difference]: Finished difference Result 16 states and 22 transitions. [2024-11-12 20:58:59,888 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 22 transitions. [2024-11-12 20:58:59,889 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2024-11-12 20:58:59,889 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 16 states and 22 transitions. [2024-11-12 20:58:59,889 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2024-11-12 20:58:59,889 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2024-11-12 20:58:59,889 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 22 transitions. [2024-11-12 20:58:59,890 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-12 20:58:59,890 INFO L218 hiAutomatonCegarLoop]: Abstraction has 16 states and 22 transitions. [2024-11-12 20:58:59,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 22 transitions. [2024-11-12 20:58:59,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 14. [2024-11-12 20:58:59,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 13 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 20:58:59,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 19 transitions. [2024-11-12 20:58:59,892 INFO L240 hiAutomatonCegarLoop]: Abstraction has 14 states and 19 transitions. [2024-11-12 20:58:59,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 20:58:59,893 INFO L426 stractBuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2024-11-12 20:58:59,893 INFO L333 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-11-12 20:58:59,893 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 19 transitions. [2024-11-12 20:58:59,894 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2024-11-12 20:58:59,894 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-12 20:58:59,894 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-12 20:58:59,894 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2024-11-12 20:58:59,894 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2024-11-12 20:58:59,894 INFO L747 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet10#1, main_#t~post11#1, main_~i~1#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet8#1;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;" "assume !(main_~array_size~0#1 < 1);" "call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 18446744073709551616);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~i~1#1 := 0;" "assume !(main_~i~1#1 < main_~array_size~0#1);" "havoc main_~i~1#1;assume { :begin_inline_sort } true;sort_#in~x#1.base, sort_#in~x#1.offset, sort_#in~n#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc sort_#t~mem2#1, sort_#t~mem3#1, sort_#t~mem4#1, sort_#t~mem5#1, sort_~temp~0#1, sort_#t~post6#1, sort_#t~post7#1, sort_~x#1.base, sort_~x#1.offset, sort_~n#1, sort_~pass~0#1, sort_~i~0#1;sort_~x#1.base, sort_~x#1.offset := sort_#in~x#1.base, sort_#in~x#1.offset;sort_~n#1 := sort_#in~n#1;havoc sort_~pass~0#1;havoc sort_~i~0#1;sort_~pass~0#1 := 1;" [2024-11-12 20:58:59,895 INFO L749 eck$LassoCheckResult]: Loop: "assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0;" "assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);" "assume sort_#t~mem2#1 > sort_#t~mem3#1;havoc sort_#t~mem2#1;havoc sort_#t~mem3#1;call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem4#1;havoc sort_#t~mem4#1;call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem5#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem5#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1;" "sort_#t~post6#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post6#1;havoc sort_#t~post6#1;" "assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);" "sort_#t~post7#1 := sort_~pass~0#1;sort_~pass~0#1 := 1 + sort_#t~post7#1;havoc sort_#t~post7#1;" [2024-11-12 20:58:59,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:58:59,895 INFO L85 PathProgramCache]: Analyzing trace with hash 889568397, now seen corresponding path program 3 times [2024-11-12 20:58:59,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:58:59,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434984594] [2024-11-12 20:58:59,896 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:58:59,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:58:59,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:58:59,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 20:58:59,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434984594] [2024-11-12 20:58:59,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434984594] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 20:58:59,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1757240437] [2024-11-12 20:58:59,968 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-12 20:58:59,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 20:58:59,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:58:59,970 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 20:58:59,971 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-12 20:59:00,010 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-12 20:59:00,011 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-12 20:59:00,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2024-11-12 20:59:00,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634235793] [2024-11-12 20:59:00,014 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-12 20:59:00,014 INFO L752 eck$LassoCheckResult]: stem already infeasible [2024-11-12 20:59:00,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:59:00,015 INFO L85 PathProgramCache]: Analyzing trace with hash 1812321306, now seen corresponding path program 1 times [2024-11-12 20:59:00,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:59:00,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6939424] [2024-11-12 20:59:00,015 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:59:00,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:59:00,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 20:59:00,030 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 20:59:00,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 20:59:00,043 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 20:59:00,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 20:59:00,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 20:59:00,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-12 20:59:00,155 INFO L87 Difference]: Start difference. First operand 14 states and 19 transitions. cyclomatic complexity: 7 Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 20:59:00,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 20:59:00,174 INFO L93 Difference]: Finished difference Result 15 states and 19 transitions. [2024-11-12 20:59:00,175 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 19 transitions. [2024-11-12 20:59:00,175 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2024-11-12 20:59:00,176 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 15 states and 19 transitions. [2024-11-12 20:59:00,177 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2024-11-12 20:59:00,177 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2024-11-12 20:59:00,178 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 19 transitions. [2024-11-12 20:59:00,178 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-12 20:59:00,178 INFO L218 hiAutomatonCegarLoop]: Abstraction has 15 states and 19 transitions. [2024-11-12 20:59:00,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 19 transitions. [2024-11-12 20:59:00,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2024-11-12 20:59:00,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 13 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 20:59:00,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 18 transitions. [2024-11-12 20:59:00,180 INFO L240 hiAutomatonCegarLoop]: Abstraction has 14 states and 18 transitions. [2024-11-12 20:59:00,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 20:59:00,181 INFO L426 stractBuchiCegarLoop]: Abstraction has 14 states and 18 transitions. [2024-11-12 20:59:00,182 INFO L333 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-11-12 20:59:00,182 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 18 transitions. [2024-11-12 20:59:00,183 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2024-11-12 20:59:00,183 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-12 20:59:00,183 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-12 20:59:00,183 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 20:59:00,184 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2024-11-12 20:59:00,184 INFO L747 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet10#1, main_#t~post11#1, main_~i~1#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet8#1;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;" "assume !(main_~array_size~0#1 < 1);" "call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 18446744073709551616);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~i~1#1 := 0;" "assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet10#1;call write~int#0(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1;" "main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;" "assume !(main_~i~1#1 < main_~array_size~0#1);" "havoc main_~i~1#1;assume { :begin_inline_sort } true;sort_#in~x#1.base, sort_#in~x#1.offset, sort_#in~n#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc sort_#t~mem2#1, sort_#t~mem3#1, sort_#t~mem4#1, sort_#t~mem5#1, sort_~temp~0#1, sort_#t~post6#1, sort_#t~post7#1, sort_~x#1.base, sort_~x#1.offset, sort_~n#1, sort_~pass~0#1, sort_~i~0#1;sort_~x#1.base, sort_~x#1.offset := sort_#in~x#1.base, sort_#in~x#1.offset;sort_~n#1 := sort_#in~n#1;havoc sort_~pass~0#1;havoc sort_~i~0#1;sort_~pass~0#1 := 1;" [2024-11-12 20:59:00,186 INFO L749 eck$LassoCheckResult]: Loop: "assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0;" "assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);" "assume sort_#t~mem2#1 > sort_#t~mem3#1;havoc sort_#t~mem2#1;havoc sort_#t~mem3#1;call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem4#1;havoc sort_#t~mem4#1;call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem5#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem5#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1;" "sort_#t~post6#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post6#1;havoc sort_#t~post6#1;" "assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);" "sort_#t~post7#1 := sort_~pass~0#1;sort_~pass~0#1 := 1 + sort_#t~post7#1;havoc sort_#t~post7#1;" [2024-11-12 20:59:00,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:59:00,186 INFO L85 PathProgramCache]: Analyzing trace with hash 176793839, now seen corresponding path program 1 times [2024-11-12 20:59:00,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:59:00,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484952293] [2024-11-12 20:59:00,187 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:59:00,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:59:00,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 20:59:00,199 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 20:59:00,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 20:59:00,207 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 20:59:00,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:59:00,208 INFO L85 PathProgramCache]: Analyzing trace with hash 1812321306, now seen corresponding path program 2 times [2024-11-12 20:59:00,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:59:00,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103737036] [2024-11-12 20:59:00,208 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:59:00,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:59:00,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 20:59:00,215 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 20:59:00,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 20:59:00,224 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 20:59:00,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:59:00,225 INFO L85 PathProgramCache]: Analyzing trace with hash -256077176, now seen corresponding path program 1 times [2024-11-12 20:59:00,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:59:00,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742879868] [2024-11-12 20:59:00,226 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:59:00,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:59:00,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:59:00,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 20:59:00,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742879868] [2024-11-12 20:59:00,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742879868] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 20:59:00,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [123581694] [2024-11-12 20:59:00,385 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:59:00,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 20:59:00,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:59:00,386 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 20:59:00,387 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-12 20:59:00,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:59:00,450 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-12 20:59:00,452 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 20:59:00,492 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 20:59:00,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [123581694] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 20:59:00,537 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 20:59:00,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2024-11-12 20:59:00,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272533430] [2024-11-12 20:59:00,537 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 20:59:00,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 20:59:00,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-12 20:59:00,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-12 20:59:00,647 INFO L87 Difference]: Start difference. First operand 14 states and 18 transitions. cyclomatic complexity: 6 Second operand has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 0 states have call successors, (0), 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 20:59:00,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 20:59:00,714 INFO L93 Difference]: Finished difference Result 24 states and 29 transitions. [2024-11-12 20:59:00,714 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 29 transitions. [2024-11-12 20:59:00,715 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2024-11-12 20:59:00,718 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 17 states and 20 transitions. [2024-11-12 20:59:00,718 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2024-11-12 20:59:00,718 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2024-11-12 20:59:00,719 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 20 transitions. [2024-11-12 20:59:00,719 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-12 20:59:00,719 INFO L218 hiAutomatonCegarLoop]: Abstraction has 17 states and 20 transitions. [2024-11-12 20:59:00,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 20 transitions. [2024-11-12 20:59:00,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2024-11-12 20:59:00,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.1875) internal successors, (19), 15 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 20:59:00,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2024-11-12 20:59:00,721 INFO L240 hiAutomatonCegarLoop]: Abstraction has 16 states and 19 transitions. [2024-11-12 20:59:00,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-12 20:59:00,722 INFO L426 stractBuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2024-11-12 20:59:00,722 INFO L333 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-11-12 20:59:00,722 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 19 transitions. [2024-11-12 20:59:00,722 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2024-11-12 20:59:00,723 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-12 20:59:00,723 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-12 20:59:00,723 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1] [2024-11-12 20:59:00,723 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2024-11-12 20:59:00,723 INFO L747 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet10#1, main_#t~post11#1, main_~i~1#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet8#1;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;" "assume !(main_~array_size~0#1 < 1);" "call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 18446744073709551616);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~i~1#1 := 0;" "assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet10#1;call write~int#0(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1;" "main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;" "assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet10#1;call write~int#0(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1;" "main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;" "assume !(main_~i~1#1 < main_~array_size~0#1);" "havoc main_~i~1#1;assume { :begin_inline_sort } true;sort_#in~x#1.base, sort_#in~x#1.offset, sort_#in~n#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc sort_#t~mem2#1, sort_#t~mem3#1, sort_#t~mem4#1, sort_#t~mem5#1, sort_~temp~0#1, sort_#t~post6#1, sort_#t~post7#1, sort_~x#1.base, sort_~x#1.offset, sort_~n#1, sort_~pass~0#1, sort_~i~0#1;sort_~x#1.base, sort_~x#1.offset := sort_#in~x#1.base, sort_#in~x#1.offset;sort_~n#1 := sort_#in~n#1;havoc sort_~pass~0#1;havoc sort_~i~0#1;sort_~pass~0#1 := 1;" [2024-11-12 20:59:00,723 INFO L749 eck$LassoCheckResult]: Loop: "assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0;" "assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);" "assume sort_#t~mem2#1 > sort_#t~mem3#1;havoc sort_#t~mem2#1;havoc sort_#t~mem3#1;call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem4#1;havoc sort_#t~mem4#1;call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem5#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem5#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1;" "sort_#t~post6#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post6#1;havoc sort_#t~post6#1;" "assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);" "sort_#t~post7#1 := sort_~pass~0#1;sort_~pass~0#1 := 1 + sort_#t~post7#1;havoc sort_#t~post7#1;" [2024-11-12 20:59:00,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:59:00,724 INFO L85 PathProgramCache]: Analyzing trace with hash -1899756335, now seen corresponding path program 2 times [2024-11-12 20:59:00,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:59:00,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025358943] [2024-11-12 20:59:00,724 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:59:00,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:59:00,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 20:59:00,736 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 20:59:00,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 20:59:00,745 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 20:59:00,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:59:00,745 INFO L85 PathProgramCache]: Analyzing trace with hash 1812321306, now seen corresponding path program 3 times [2024-11-12 20:59:00,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:59:00,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120608924] [2024-11-12 20:59:00,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:59:00,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:59:00,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 20:59:00,752 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 20:59:00,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 20:59:00,757 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 20:59:00,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:59:00,757 INFO L85 PathProgramCache]: Analyzing trace with hash 1808202986, now seen corresponding path program 2 times [2024-11-12 20:59:00,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:59:00,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635582208] [2024-11-12 20:59:00,757 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:59:00,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:59:00,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 20:59:00,796 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 20:59:00,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 20:59:00,810 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 20:59:01,124 INFO L204 LassoAnalysis]: Preferences: [2024-11-12 20:59:01,124 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-12 20:59:01,124 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-12 20:59:01,124 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-12 20:59:01,124 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-12 20:59:01,124 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 20:59:01,124 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-12 20:59:01,124 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-12 20:59:01,124 INFO L132 ssoRankerPreferences]: Filename of dumped script: java_BubbleSort-alloca-2.i_Iteration6_Lasso [2024-11-12 20:59:01,124 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-12 20:59:01,124 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-12 20:59:01,127 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 20:59:01,131 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 20:59:01,134 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 20:59:01,137 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 20:59:01,145 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 20:59:01,149 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 20:59:01,151 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 20:59:01,153 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 20:59:01,155 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 20:59:01,158 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 20:59:01,160 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 20:59:01,162 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 20:59:01,164 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 20:59:01,166 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 20:59:01,168 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 20:59:01,307 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 20:59:01,310 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 20:59:01,313 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 20:59:01,316 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 20:59:01,319 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 20:59:01,321 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 20:59:01,323 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 20:59:01,568 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-12 20:59:01,570 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-12 20:59:01,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 20:59:01,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:59:01,572 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 20:59:01,574 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 20:59:01,575 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 20:59:01,588 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-12 20:59:01,589 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-12 20:59:01,589 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-12 20:59:01,589 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-12 20:59:01,589 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-12 20:59:01,590 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-12 20:59:01,590 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-12 20:59:01,591 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-12 20:59:01,606 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 20:59:01,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 20:59:01,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:59:01,608 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 20:59:01,611 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 20:59:01,612 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 20:59:01,625 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-12 20:59:01,625 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-12 20:59:01,625 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-12 20:59:01,625 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-12 20:59:01,625 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-12 20:59:01,626 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-12 20:59:01,626 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-12 20:59:01,627 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-12 20:59:01,642 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2024-11-12 20:59:01,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 20:59:01,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:59:01,644 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-12 20:59:01,645 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2024-11-12 20:59:01,648 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 20:59:01,661 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-12 20:59:01,661 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-12 20:59:01,661 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-12 20:59:01,661 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-12 20:59:01,661 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-12 20:59:01,662 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-12 20:59:01,662 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-12 20:59:01,664 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-12 20:59:01,679 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2024-11-12 20:59:01,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 20:59:01,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:59:01,684 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-12 20:59:01,686 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2024-11-12 20:59:01,687 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 20:59:01,701 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-12 20:59:01,702 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-12 20:59:01,702 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-12 20:59:01,702 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-12 20:59:01,706 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-12 20:59:01,706 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-12 20:59:01,712 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-12 20:59:01,731 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2024-11-12 20:59:01,731 INFO L444 ModelExtractionUtils]: 0 out of 10 variables were initially zero. Simplification set additionally 7 variables to zero. [2024-11-12 20:59:01,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 20:59:01,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:59:01,734 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 20:59:01,737 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 20:59:01,738 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-12 20:59:01,753 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-12 20:59:01,754 INFO L474 LassoAnalysis]: Proved termination. [2024-11-12 20:59:01,754 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_sort_~n#1, ULTIMATE.start_sort_~pass~0#1) = 1*ULTIMATE.start_sort_~n#1 - 1*ULTIMATE.start_sort_~pass~0#1 Supporting invariants [] [2024-11-12 20:59:01,769 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2024-11-12 20:59:01,786 INFO L156 tatePredicateManager]: 7 out of 7 supporting invariants were superfluous and have been removed [2024-11-12 20:59:01,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:59:01,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:59:01,821 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-12 20:59:01,821 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 20:59:01,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:59:01,842 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-12 20:59:01,842 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 20:59:01,876 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-12 20:59:01,876 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 20:59:01,876 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states and 19 transitions. cyclomatic complexity: 5 Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 20:59:01,897 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states and 19 transitions. cyclomatic complexity: 5. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 22 states and 28 transitions. Complement of second has 4 states. [2024-11-12 20:59:01,898 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 20:59:01,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 20:59:01,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 15 transitions. [2024-11-12 20:59:01,899 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 10 letters. Loop has 6 letters. [2024-11-12 20:59:01,900 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-12 20:59:01,900 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 16 letters. Loop has 6 letters. [2024-11-12 20:59:01,900 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-12 20:59:01,900 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 10 letters. Loop has 12 letters. [2024-11-12 20:59:01,900 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-12 20:59:01,900 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 28 transitions. [2024-11-12 20:59:01,901 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-12 20:59:01,901 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 21 states and 27 transitions. [2024-11-12 20:59:01,901 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2024-11-12 20:59:01,901 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2024-11-12 20:59:01,901 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 27 transitions. [2024-11-12 20:59:01,901 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-12 20:59:01,902 INFO L218 hiAutomatonCegarLoop]: Abstraction has 21 states and 27 transitions. [2024-11-12 20:59:01,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 27 transitions. [2024-11-12 20:59:01,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2024-11-12 20:59:01,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.3) internal successors, (26), 19 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 20:59:01,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 26 transitions. [2024-11-12 20:59:01,904 INFO L240 hiAutomatonCegarLoop]: Abstraction has 20 states and 26 transitions. [2024-11-12 20:59:01,904 INFO L426 stractBuchiCegarLoop]: Abstraction has 20 states and 26 transitions. [2024-11-12 20:59:01,904 INFO L333 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-11-12 20:59:01,904 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 26 transitions. [2024-11-12 20:59:01,905 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-12 20:59:01,905 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-12 20:59:01,905 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-12 20:59:01,905 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 20:59:01,905 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-12 20:59:01,905 INFO L747 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet10#1, main_#t~post11#1, main_~i~1#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet8#1;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;" "assume !(main_~array_size~0#1 < 1);" "call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 18446744073709551616);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~i~1#1 := 0;" "assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet10#1;call write~int#0(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1;" "main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;" "assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet10#1;call write~int#0(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1;" "main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;" "assume !(main_~i~1#1 < main_~array_size~0#1);" "havoc main_~i~1#1;assume { :begin_inline_sort } true;sort_#in~x#1.base, sort_#in~x#1.offset, sort_#in~n#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc sort_#t~mem2#1, sort_#t~mem3#1, sort_#t~mem4#1, sort_#t~mem5#1, sort_~temp~0#1, sort_#t~post6#1, sort_#t~post7#1, sort_~x#1.base, sort_~x#1.offset, sort_~n#1, sort_~pass~0#1, sort_~i~0#1;sort_~x#1.base, sort_~x#1.offset := sort_#in~x#1.base, sort_#in~x#1.offset;sort_~n#1 := sort_#in~n#1;havoc sort_~pass~0#1;havoc sort_~i~0#1;sort_~pass~0#1 := 1;" "assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0;" [2024-11-12 20:59:01,905 INFO L749 eck$LassoCheckResult]: Loop: "assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);" "assume sort_#t~mem2#1 > sort_#t~mem3#1;havoc sort_#t~mem2#1;havoc sort_#t~mem3#1;call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem4#1;havoc sort_#t~mem4#1;call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem5#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem5#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1;" "sort_#t~post6#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post6#1;havoc sort_#t~post6#1;" [2024-11-12 20:59:01,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:59:01,906 INFO L85 PathProgramCache]: Analyzing trace with hash 1237095790, now seen corresponding path program 1 times [2024-11-12 20:59:01,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:59:01,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930175618] [2024-11-12 20:59:01,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:59:01,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:59:01,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 20:59:01,926 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 20:59:01,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 20:59:01,934 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 20:59:01,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:59:01,934 INFO L85 PathProgramCache]: Analyzing trace with hash 68618, now seen corresponding path program 1 times [2024-11-12 20:59:01,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:59:01,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324524253] [2024-11-12 20:59:01,935 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:59:01,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:59:01,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 20:59:01,939 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 20:59:01,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 20:59:01,943 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 20:59:01,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:59:01,943 INFO L85 PathProgramCache]: Analyzing trace with hash -793648259, now seen corresponding path program 1 times [2024-11-12 20:59:01,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:59:01,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732233314] [2024-11-12 20:59:01,943 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:59:01,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:59:01,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 20:59:01,964 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 20:59:01,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 20:59:01,981 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 20:59:02,125 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2024-11-12 20:59:02,304 INFO L204 LassoAnalysis]: Preferences: [2024-11-12 20:59:02,304 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-12 20:59:02,304 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-12 20:59:02,304 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-12 20:59:02,304 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-12 20:59:02,305 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 20:59:02,305 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-12 20:59:02,305 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-12 20:59:02,305 INFO L132 ssoRankerPreferences]: Filename of dumped script: java_BubbleSort-alloca-2.i_Iteration7_Lasso [2024-11-12 20:59:02,305 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-12 20:59:02,305 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-12 20:59:02,308 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 20:59:02,312 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 20:59:02,496 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 20:59:02,498 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 20:59:02,500 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 20:59:02,502 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 20:59:02,504 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 20:59:02,505 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 20:59:02,508 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 20:59:02,509 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 20:59:02,514 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 20:59:02,516 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 20:59:02,519 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 20:59:02,520 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 20:59:02,522 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 20:59:02,524 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 20:59:02,526 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 20:59:02,528 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 20:59:02,530 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 20:59:02,532 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 20:59:02,724 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-12 20:59:02,724 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-12 20:59:02,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 20:59:02,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:59:02,728 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 20:59:02,730 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 20:59:02,731 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 20:59:02,744 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-12 20:59:02,744 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-12 20:59:02,744 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-12 20:59:02,744 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-12 20:59:02,744 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-12 20:59:02,745 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-12 20:59:02,745 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-12 20:59:02,746 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-12 20:59:02,760 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 20:59:02,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 20:59:02,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:59:02,763 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 20:59:02,764 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 20:59:02,766 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 20:59:02,779 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-12 20:59:02,779 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-12 20:59:02,779 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-12 20:59:02,779 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-12 20:59:02,781 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-12 20:59:02,781 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-12 20:59:02,784 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-12 20:59:02,799 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 20:59:02,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 20:59:02,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:59:02,802 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 20:59:02,803 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 20:59:02,804 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-12 20:59:02,816 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-12 20:59:02,817 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-12 20:59:02,817 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-12 20:59:02,817 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-12 20:59:02,824 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-12 20:59:02,824 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-12 20:59:02,834 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-12 20:59:02,850 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2024-11-12 20:59:02,850 INFO L444 ModelExtractionUtils]: 10 out of 22 variables were initially zero. Simplification set additionally 8 variables to zero. [2024-11-12 20:59:02,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 20:59:02,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:59:02,852 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 20:59:02,854 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 20:59:02,854 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-12 20:59:02,868 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-12 20:59:02,869 INFO L474 LassoAnalysis]: Proved termination. [2024-11-12 20:59:02,869 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_sort_~pass~0#1, ULTIMATE.start_sort_~i~0#1, ULTIMATE.start_sort_~n#1) = -1*ULTIMATE.start_sort_~pass~0#1 - 1*ULTIMATE.start_sort_~i~0#1 + 1*ULTIMATE.start_sort_~n#1 Supporting invariants [] [2024-11-12 20:59:02,884 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2024-11-12 20:59:02,895 INFO L156 tatePredicateManager]: 5 out of 5 supporting invariants were superfluous and have been removed [2024-11-12 20:59:02,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:59:02,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:59:02,925 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-12 20:59:02,926 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 20:59:02,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:59:02,947 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-12 20:59:02,947 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 20:59:02,966 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 20:59:02,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 20:59:02,967 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 26 transitions. cyclomatic complexity: 9 Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 20:59:02,988 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 26 transitions. cyclomatic complexity: 9. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 32 states and 45 transitions. Complement of second has 5 states. [2024-11-12 20:59:02,989 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 20:59:02,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 20:59:02,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 13 transitions. [2024-11-12 20:59:02,990 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 11 letters. Loop has 3 letters. [2024-11-12 20:59:02,990 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-12 20:59:02,990 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 14 letters. Loop has 3 letters. [2024-11-12 20:59:02,990 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-12 20:59:02,991 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 11 letters. Loop has 6 letters. [2024-11-12 20:59:02,991 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-12 20:59:02,991 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 45 transitions. [2024-11-12 20:59:02,991 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-12 20:59:02,992 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 24 states and 31 transitions. [2024-11-12 20:59:02,992 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2024-11-12 20:59:02,992 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2024-11-12 20:59:02,992 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 31 transitions. [2024-11-12 20:59:02,992 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-12 20:59:02,992 INFO L218 hiAutomatonCegarLoop]: Abstraction has 24 states and 31 transitions. [2024-11-12 20:59:02,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 31 transitions. [2024-11-12 20:59:02,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 20. [2024-11-12 20:59:02,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.25) internal successors, (25), 19 states have internal predecessors, (25), 0 states have call successors, (0), 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 20:59:02,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2024-11-12 20:59:02,995 INFO L240 hiAutomatonCegarLoop]: Abstraction has 20 states and 25 transitions. [2024-11-12 20:59:02,995 INFO L426 stractBuchiCegarLoop]: Abstraction has 20 states and 25 transitions. [2024-11-12 20:59:02,995 INFO L333 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-11-12 20:59:02,995 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 25 transitions. [2024-11-12 20:59:02,996 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-12 20:59:02,996 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-12 20:59:02,996 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-12 20:59:02,998 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 20:59:02,998 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-12 20:59:02,998 INFO L747 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet10#1, main_#t~post11#1, main_~i~1#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet8#1;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;" "assume !(main_~array_size~0#1 < 1);" "call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 18446744073709551616);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~i~1#1 := 0;" "assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet10#1;call write~int#0(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1;" "main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;" "assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet10#1;call write~int#0(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1;" "main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;" "assume !(main_~i~1#1 < main_~array_size~0#1);" "havoc main_~i~1#1;assume { :begin_inline_sort } true;sort_#in~x#1.base, sort_#in~x#1.offset, sort_#in~n#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc sort_#t~mem2#1, sort_#t~mem3#1, sort_#t~mem4#1, sort_#t~mem5#1, sort_~temp~0#1, sort_#t~post6#1, sort_#t~post7#1, sort_~x#1.base, sort_~x#1.offset, sort_~n#1, sort_~pass~0#1, sort_~i~0#1;sort_~x#1.base, sort_~x#1.offset := sort_#in~x#1.base, sort_#in~x#1.offset;sort_~n#1 := sort_#in~n#1;havoc sort_~pass~0#1;havoc sort_~i~0#1;sort_~pass~0#1 := 1;" "assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0;" "assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);" "assume !(sort_#t~mem2#1 > sort_#t~mem3#1);havoc sort_#t~mem2#1;havoc sort_#t~mem3#1;" "sort_#t~post6#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post6#1;havoc sort_#t~post6#1;" "assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);" "sort_#t~post7#1 := sort_~pass~0#1;sort_~pass~0#1 := 1 + sort_#t~post7#1;havoc sort_#t~post7#1;" "assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0;" [2024-11-12 20:59:02,998 INFO L749 eck$LassoCheckResult]: Loop: "assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);" "assume sort_#t~mem2#1 > sort_#t~mem3#1;havoc sort_#t~mem2#1;havoc sort_#t~mem3#1;call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem4#1;havoc sort_#t~mem4#1;call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem5#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem5#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1;" "sort_#t~post6#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post6#1;havoc sort_#t~post6#1;" [2024-11-12 20:59:02,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:59:02,998 INFO L85 PathProgramCache]: Analyzing trace with hash 221564791, now seen corresponding path program 1 times [2024-11-12 20:59:02,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:59:02,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948034179] [2024-11-12 20:59:02,999 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:59:02,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:59:03,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:59:03,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 20:59:03,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948034179] [2024-11-12 20:59:03,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948034179] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 20:59:03,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [20122266] [2024-11-12 20:59:03,111 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:59:03,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 20:59:03,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:59:03,113 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 20:59:03,114 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2024-11-12 20:59:03,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:59:03,173 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-12 20:59:03,174 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 20:59:03,232 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 20:59:03,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [20122266] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 20:59:03,279 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 20:59:03,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2024-11-12 20:59:03,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942949712] [2024-11-12 20:59:03,280 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 20:59:03,281 INFO L752 eck$LassoCheckResult]: stem already infeasible [2024-11-12 20:59:03,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:59:03,281 INFO L85 PathProgramCache]: Analyzing trace with hash 68618, now seen corresponding path program 2 times [2024-11-12 20:59:03,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:59:03,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633022946] [2024-11-12 20:59:03,282 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:59:03,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:59:03,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 20:59:03,287 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 20:59:03,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 20:59:03,292 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 20:59:03,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 20:59:03,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-12 20:59:03,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2024-11-12 20:59:03,372 INFO L87 Difference]: Start difference. First operand 20 states and 25 transitions. cyclomatic complexity: 8 Second operand has 12 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 12 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 20:59:03,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 20:59:03,431 INFO L93 Difference]: Finished difference Result 31 states and 38 transitions. [2024-11-12 20:59:03,431 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 38 transitions. [2024-11-12 20:59:03,432 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-12 20:59:03,433 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 23 states and 28 transitions. [2024-11-12 20:59:03,433 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2024-11-12 20:59:03,433 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2024-11-12 20:59:03,433 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 28 transitions. [2024-11-12 20:59:03,433 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-12 20:59:03,433 INFO L218 hiAutomatonCegarLoop]: Abstraction has 23 states and 28 transitions. [2024-11-12 20:59:03,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 28 transitions. [2024-11-12 20:59:03,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2024-11-12 20:59:03,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 21 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 20:59:03,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2024-11-12 20:59:03,436 INFO L240 hiAutomatonCegarLoop]: Abstraction has 22 states and 27 transitions. [2024-11-12 20:59:03,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-12 20:59:03,437 INFO L426 stractBuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2024-11-12 20:59:03,439 INFO L333 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2024-11-12 20:59:03,439 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 27 transitions. [2024-11-12 20:59:03,440 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-12 20:59:03,440 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-12 20:59:03,440 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-12 20:59:03,440 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 20:59:03,440 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-12 20:59:03,440 INFO L747 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet10#1, main_#t~post11#1, main_~i~1#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet8#1;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;" "assume !(main_~array_size~0#1 < 1);" "call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 18446744073709551616);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~i~1#1 := 0;" "assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet10#1;call write~int#0(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1;" "main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;" "assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet10#1;call write~int#0(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1;" "main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;" "assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet10#1;call write~int#0(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1;" "main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;" "assume !(main_~i~1#1 < main_~array_size~0#1);" "havoc main_~i~1#1;assume { :begin_inline_sort } true;sort_#in~x#1.base, sort_#in~x#1.offset, sort_#in~n#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc sort_#t~mem2#1, sort_#t~mem3#1, sort_#t~mem4#1, sort_#t~mem5#1, sort_~temp~0#1, sort_#t~post6#1, sort_#t~post7#1, sort_~x#1.base, sort_~x#1.offset, sort_~n#1, sort_~pass~0#1, sort_~i~0#1;sort_~x#1.base, sort_~x#1.offset := sort_#in~x#1.base, sort_#in~x#1.offset;sort_~n#1 := sort_#in~n#1;havoc sort_~pass~0#1;havoc sort_~i~0#1;sort_~pass~0#1 := 1;" "assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0;" "assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);" "assume !(sort_#t~mem2#1 > sort_#t~mem3#1);havoc sort_#t~mem2#1;havoc sort_#t~mem3#1;" "sort_#t~post6#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post6#1;havoc sort_#t~post6#1;" "assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);" "sort_#t~post7#1 := sort_~pass~0#1;sort_~pass~0#1 := 1 + sort_#t~post7#1;havoc sort_#t~post7#1;" "assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0;" [2024-11-12 20:59:03,440 INFO L749 eck$LassoCheckResult]: Loop: "assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);" "assume sort_#t~mem2#1 > sort_#t~mem3#1;havoc sort_#t~mem2#1;havoc sort_#t~mem3#1;call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem4#1;havoc sort_#t~mem4#1;call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem5#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem5#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1;" "sort_#t~post6#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post6#1;havoc sort_#t~post6#1;" [2024-11-12 20:59:03,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:59:03,441 INFO L85 PathProgramCache]: Analyzing trace with hash 1850126805, now seen corresponding path program 2 times [2024-11-12 20:59:03,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:59:03,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696671547] [2024-11-12 20:59:03,441 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:59:03,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:59:03,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:59:03,534 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 20:59:03,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 20:59:03,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696671547] [2024-11-12 20:59:03,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696671547] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 20:59:03,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1855435491] [2024-11-12 20:59:03,627 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-12 20:59:03,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 20:59:03,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:59:03,629 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 20:59:03,630 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2024-11-12 20:59:03,682 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-12 20:59:03,682 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-12 20:59:03,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2024-11-12 20:59:03,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930612284] [2024-11-12 20:59:03,682 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-12 20:59:03,683 INFO L752 eck$LassoCheckResult]: stem already infeasible [2024-11-12 20:59:03,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:59:03,683 INFO L85 PathProgramCache]: Analyzing trace with hash 68618, now seen corresponding path program 3 times [2024-11-12 20:59:03,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:59:03,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759825485] [2024-11-12 20:59:03,683 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:59:03,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:59:03,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 20:59:03,688 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 20:59:03,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 20:59:03,692 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 20:59:03,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 20:59:03,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-12 20:59:03,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-12 20:59:03,770 INFO L87 Difference]: Start difference. First operand 22 states and 27 transitions. cyclomatic complexity: 8 Second operand has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 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 20:59:03,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 20:59:03,861 INFO L93 Difference]: Finished difference Result 30 states and 38 transitions. [2024-11-12 20:59:03,861 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 38 transitions. [2024-11-12 20:59:03,862 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-12 20:59:03,862 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 30 states and 38 transitions. [2024-11-12 20:59:03,862 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2024-11-12 20:59:03,862 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2024-11-12 20:59:03,863 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 38 transitions. [2024-11-12 20:59:03,863 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-12 20:59:03,863 INFO L218 hiAutomatonCegarLoop]: Abstraction has 30 states and 38 transitions. [2024-11-12 20:59:03,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 38 transitions. [2024-11-12 20:59:03,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 25. [2024-11-12 20:59:03,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.24) internal successors, (31), 24 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 20:59:03,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 31 transitions. [2024-11-12 20:59:03,864 INFO L240 hiAutomatonCegarLoop]: Abstraction has 25 states and 31 transitions. [2024-11-12 20:59:03,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-12 20:59:03,865 INFO L426 stractBuchiCegarLoop]: Abstraction has 25 states and 31 transitions. [2024-11-12 20:59:03,865 INFO L333 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2024-11-12 20:59:03,866 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 31 transitions. [2024-11-12 20:59:03,866 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-12 20:59:03,866 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-12 20:59:03,866 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-12 20:59:03,866 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 20:59:03,866 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-12 20:59:03,867 INFO L747 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet10#1, main_#t~post11#1, main_~i~1#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet8#1;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;" "assume !(main_~array_size~0#1 < 1);" "call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 18446744073709551616);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~i~1#1 := 0;" "assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet10#1;call write~int#0(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1;" "main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;" "assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet10#1;call write~int#0(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1;" "main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;" "assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet10#1;call write~int#0(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1;" "main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;" "assume !(main_~i~1#1 < main_~array_size~0#1);" "havoc main_~i~1#1;assume { :begin_inline_sort } true;sort_#in~x#1.base, sort_#in~x#1.offset, sort_#in~n#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc sort_#t~mem2#1, sort_#t~mem3#1, sort_#t~mem4#1, sort_#t~mem5#1, sort_~temp~0#1, sort_#t~post6#1, sort_#t~post7#1, sort_~x#1.base, sort_~x#1.offset, sort_~n#1, sort_~pass~0#1, sort_~i~0#1;sort_~x#1.base, sort_~x#1.offset := sort_#in~x#1.base, sort_#in~x#1.offset;sort_~n#1 := sort_#in~n#1;havoc sort_~pass~0#1;havoc sort_~i~0#1;sort_~pass~0#1 := 1;" "assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0;" "assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);" "assume !(sort_#t~mem2#1 > sort_#t~mem3#1);havoc sort_#t~mem2#1;havoc sort_#t~mem3#1;" "sort_#t~post6#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post6#1;havoc sort_#t~post6#1;" "assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);" "assume !(sort_#t~mem2#1 > sort_#t~mem3#1);havoc sort_#t~mem2#1;havoc sort_#t~mem3#1;" "sort_#t~post6#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post6#1;havoc sort_#t~post6#1;" "assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);" "sort_#t~post7#1 := sort_~pass~0#1;sort_~pass~0#1 := 1 + sort_#t~post7#1;havoc sort_#t~post7#1;" "assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0;" [2024-11-12 20:59:03,867 INFO L749 eck$LassoCheckResult]: Loop: "assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);" "assume sort_#t~mem2#1 > sort_#t~mem3#1;havoc sort_#t~mem2#1;havoc sort_#t~mem3#1;call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem4#1;havoc sort_#t~mem4#1;call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem5#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem5#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1;" "sort_#t~post6#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post6#1;havoc sort_#t~post6#1;" [2024-11-12 20:59:03,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:59:03,867 INFO L85 PathProgramCache]: Analyzing trace with hash -135460634, now seen corresponding path program 3 times [2024-11-12 20:59:03,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:59:03,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762695027] [2024-11-12 20:59:03,868 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:59:03,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:59:03,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 20:59:03,882 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 20:59:03,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 20:59:03,893 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 20:59:03,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:59:03,894 INFO L85 PathProgramCache]: Analyzing trace with hash 68618, now seen corresponding path program 4 times [2024-11-12 20:59:03,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:59:03,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323690152] [2024-11-12 20:59:03,894 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:59:03,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:59:03,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 20:59:03,899 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 20:59:03,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 20:59:03,902 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 20:59:03,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:59:03,902 INFO L85 PathProgramCache]: Analyzing trace with hash 1761549573, now seen corresponding path program 1 times [2024-11-12 20:59:03,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:59:03,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970000537] [2024-11-12 20:59:03,903 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:59:03,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:59:03,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:59:04,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 20:59:04,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970000537] [2024-11-12 20:59:04,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970000537] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 20:59:04,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1686088005] [2024-11-12 20:59:04,560 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:59:04,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 20:59:04,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:59:04,562 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 20:59:04,563 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2024-11-12 20:59:04,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:59:04,632 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-12 20:59:04,634 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 20:59:04,727 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 20:59:04,728 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 10 [2024-11-12 20:59:04,741 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 20:59:04,854 INFO L349 Elim1Store]: treesize reduction 13, result has 62.9 percent of original size [2024-11-12 20:59:04,854 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 36 treesize of output 30 [2024-11-12 20:59:04,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1686088005] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 20:59:04,887 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 20:59:04,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 7, 7] total 20 [2024-11-12 20:59:04,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866292151] [2024-11-12 20:59:04,888 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 20:59:04,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 20:59:04,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-12 20:59:04,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=303, Unknown=0, NotChecked=0, Total=380 [2024-11-12 20:59:04,974 INFO L87 Difference]: Start difference. First operand 25 states and 31 transitions. cyclomatic complexity: 9 Second operand has 20 states, 20 states have (on average 2.3) internal successors, (46), 20 states have internal predecessors, (46), 0 states have call successors, (0), 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 20:59:05,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 20:59:05,147 INFO L93 Difference]: Finished difference Result 49 states and 64 transitions. [2024-11-12 20:59:05,147 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 64 transitions. [2024-11-12 20:59:05,147 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2024-11-12 20:59:05,149 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 49 states and 64 transitions. [2024-11-12 20:59:05,149 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2024-11-12 20:59:05,149 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2024-11-12 20:59:05,149 INFO L73 IsDeterministic]: Start isDeterministic. Operand 49 states and 64 transitions. [2024-11-12 20:59:05,150 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-12 20:59:05,150 INFO L218 hiAutomatonCegarLoop]: Abstraction has 49 states and 64 transitions. [2024-11-12 20:59:05,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states and 64 transitions. [2024-11-12 20:59:05,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 36. [2024-11-12 20:59:05,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 36 states have (on average 1.2777777777777777) internal successors, (46), 35 states have internal predecessors, (46), 0 states have call successors, (0), 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 20:59:05,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 46 transitions. [2024-11-12 20:59:05,153 INFO L240 hiAutomatonCegarLoop]: Abstraction has 36 states and 46 transitions. [2024-11-12 20:59:05,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-12 20:59:05,154 INFO L426 stractBuchiCegarLoop]: Abstraction has 36 states and 46 transitions. [2024-11-12 20:59:05,154 INFO L333 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2024-11-12 20:59:05,154 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 46 transitions. [2024-11-12 20:59:05,155 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-12 20:59:05,155 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-12 20:59:05,155 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-12 20:59:05,155 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 20:59:05,155 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-12 20:59:05,156 INFO L747 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet10#1, main_#t~post11#1, main_~i~1#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet8#1;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;" "assume !(main_~array_size~0#1 < 1);" "call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 18446744073709551616);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~i~1#1 := 0;" "assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet10#1;call write~int#0(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1;" "main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;" "assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet10#1;call write~int#0(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1;" "main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;" "assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet10#1;call write~int#0(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1;" "main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;" "assume !(main_~i~1#1 < main_~array_size~0#1);" "havoc main_~i~1#1;assume { :begin_inline_sort } true;sort_#in~x#1.base, sort_#in~x#1.offset, sort_#in~n#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc sort_#t~mem2#1, sort_#t~mem3#1, sort_#t~mem4#1, sort_#t~mem5#1, sort_~temp~0#1, sort_#t~post6#1, sort_#t~post7#1, sort_~x#1.base, sort_~x#1.offset, sort_~n#1, sort_~pass~0#1, sort_~i~0#1;sort_~x#1.base, sort_~x#1.offset := sort_#in~x#1.base, sort_#in~x#1.offset;sort_~n#1 := sort_#in~n#1;havoc sort_~pass~0#1;havoc sort_~i~0#1;sort_~pass~0#1 := 1;" "assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0;" "assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);" "assume !(sort_#t~mem2#1 > sort_#t~mem3#1);havoc sort_#t~mem2#1;havoc sort_#t~mem3#1;" "sort_#t~post6#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post6#1;havoc sort_#t~post6#1;" "assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);" "assume sort_#t~mem2#1 > sort_#t~mem3#1;havoc sort_#t~mem2#1;havoc sort_#t~mem3#1;call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem4#1;havoc sort_#t~mem4#1;call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem5#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem5#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1;" "sort_#t~post6#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post6#1;havoc sort_#t~post6#1;" "assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);" "sort_#t~post7#1 := sort_~pass~0#1;sort_~pass~0#1 := 1 + sort_#t~post7#1;havoc sort_#t~post7#1;" "assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0;" [2024-11-12 20:59:05,156 INFO L749 eck$LassoCheckResult]: Loop: "assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);" "assume sort_#t~mem2#1 > sort_#t~mem3#1;havoc sort_#t~mem2#1;havoc sort_#t~mem3#1;call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem4#1;havoc sort_#t~mem4#1;call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem5#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem5#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1;" "sort_#t~post6#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post6#1;havoc sort_#t~post6#1;" [2024-11-12 20:59:05,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:59:05,156 INFO L85 PathProgramCache]: Analyzing trace with hash -137307676, now seen corresponding path program 2 times [2024-11-12 20:59:05,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:59:05,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907640705] [2024-11-12 20:59:05,157 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:59:05,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:59:05,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 20:59:05,182 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 20:59:05,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 20:59:05,198 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 20:59:05,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:59:05,199 INFO L85 PathProgramCache]: Analyzing trace with hash 68618, now seen corresponding path program 5 times [2024-11-12 20:59:05,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:59:05,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597994483] [2024-11-12 20:59:05,199 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:59:05,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:59:05,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 20:59:05,204 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 20:59:05,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 20:59:05,208 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 20:59:05,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:59:05,209 INFO L85 PathProgramCache]: Analyzing trace with hash -1724071097, now seen corresponding path program 3 times [2024-11-12 20:59:05,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:59:05,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553678742] [2024-11-12 20:59:05,209 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:59:05,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:59:05,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 20:59:05,230 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 20:59:05,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 20:59:05,252 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 20:59:06,047 INFO L204 LassoAnalysis]: Preferences: [2024-11-12 20:59:06,048 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-12 20:59:06,048 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-12 20:59:06,048 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-12 20:59:06,048 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-12 20:59:06,048 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 20:59:06,048 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-12 20:59:06,048 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-12 20:59:06,048 INFO L132 ssoRankerPreferences]: Filename of dumped script: java_BubbleSort-alloca-2.i_Iteration11_Lasso [2024-11-12 20:59:06,049 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-12 20:59:06,049 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-12 20:59:06,052 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 20:59:06,055 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 20:59:06,057 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 20:59:06,059 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 20:59:06,061 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 20:59:06,062 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 20:59:06,064 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 20:59:06,066 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 20:59:06,070 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 20:59:06,072 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 20:59:06,074 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 20:59:06,076 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 20:59:06,358 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 20:59:06,362 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 20:59:06,364 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 20:59:06,367 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 20:59:06,368 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 20:59:06,370 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 20:59:06,372 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 20:59:06,376 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 20:59:06,636 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-12 20:59:06,636 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-12 20:59:06,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 20:59:06,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:59:06,639 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 20:59:06,640 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 20:59:06,642 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 20:59:06,652 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-12 20:59:06,652 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-12 20:59:06,652 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-12 20:59:06,652 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-12 20:59:06,652 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-12 20:59:06,653 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-12 20:59:06,653 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-12 20:59:06,656 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-12 20:59:06,670 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 20:59:06,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 20:59:06,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:59:06,672 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 20:59:06,673 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 20:59:06,673 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 20:59:06,683 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-12 20:59:06,683 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-12 20:59:06,683 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-12 20:59:06,683 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-12 20:59:06,684 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-12 20:59:06,684 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-12 20:59:06,684 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-12 20:59:06,685 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-12 20:59:06,695 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 20:59:06,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 20:59:06,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:59:06,698 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 20:59:06,699 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 20:59:06,699 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 20:59:06,709 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-12 20:59:06,709 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-12 20:59:06,709 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-12 20:59:06,709 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-12 20:59:06,709 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-12 20:59:06,710 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-12 20:59:06,710 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-12 20:59:06,714 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-12 20:59:06,729 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2024-11-12 20:59:06,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 20:59:06,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:59:06,733 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-12 20:59:06,735 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2024-11-12 20:59:06,736 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 20:59:06,749 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-12 20:59:06,749 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-12 20:59:06,749 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-12 20:59:06,749 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-12 20:59:06,749 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-12 20:59:06,750 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-12 20:59:06,750 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-12 20:59:06,753 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-12 20:59:06,767 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2024-11-12 20:59:06,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 20:59:06,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:59:06,769 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 20:59:06,770 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 20:59:06,771 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 20:59:06,781 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-12 20:59:06,781 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-12 20:59:06,781 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-12 20:59:06,781 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-12 20:59:06,781 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-12 20:59:06,781 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-12 20:59:06,781 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-12 20:59:06,783 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-12 20:59:06,793 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 20:59:06,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 20:59:06,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:59:06,795 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 20:59:06,796 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 20:59:06,796 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 20:59:06,807 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-12 20:59:06,807 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-12 20:59:06,807 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-12 20:59:06,807 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-12 20:59:06,808 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-12 20:59:06,808 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-12 20:59:06,808 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-12 20:59:06,809 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-12 20:59:06,823 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 20:59:06,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 20:59:06,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:59:06,824 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 20:59:06,825 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 20:59:06,826 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 20:59:06,835 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-12 20:59:06,835 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-12 20:59:06,835 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-12 20:59:06,836 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-12 20:59:06,836 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-12 20:59:06,836 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-12 20:59:06,836 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-12 20:59:06,839 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-12 20:59:06,852 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2024-11-12 20:59:06,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 20:59:06,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:59:06,853 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 20:59:06,854 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 20:59:06,855 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 20:59:06,868 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-12 20:59:06,868 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-12 20:59:06,868 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-12 20:59:06,868 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-12 20:59:06,869 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-12 20:59:06,869 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-12 20:59:06,889 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-12 20:59:06,904 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 20:59:06,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 20:59:06,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:59:06,906 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 20:59:06,907 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 20:59:06,908 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 20:59:06,920 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-12 20:59:06,921 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-12 20:59:06,921 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-12 20:59:06,921 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-12 20:59:06,921 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-12 20:59:06,922 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-12 20:59:06,922 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-12 20:59:06,924 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-12 20:59:06,938 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 20:59:06,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 20:59:06,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:59:06,941 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 20:59:06,942 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 20:59:06,943 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 20:59:06,955 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-12 20:59:06,955 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-12 20:59:06,955 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-12 20:59:06,955 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-12 20:59:06,955 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-12 20:59:06,956 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-12 20:59:06,956 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-12 20:59:06,957 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-12 20:59:06,971 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Ended with exit code 0 [2024-11-12 20:59:06,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 20:59:06,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:59:06,973 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 20:59:06,975 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 20:59:06,976 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 20:59:06,988 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-12 20:59:06,988 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-12 20:59:06,989 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-12 20:59:06,989 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-12 20:59:06,989 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-12 20:59:06,989 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-12 20:59:06,989 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-12 20:59:06,992 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-12 20:59:07,005 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 20:59:07,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 20:59:07,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:59:07,006 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 20:59:07,007 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 20:59:07,008 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 20:59:07,018 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-12 20:59:07,018 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-12 20:59:07,018 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-12 20:59:07,018 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-12 20:59:07,020 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-12 20:59:07,021 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-12 20:59:07,027 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-12 20:59:07,041 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Ended with exit code 0 [2024-11-12 20:59:07,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 20:59:07,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:59:07,043 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 20:59:07,045 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 20:59:07,046 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 20:59:07,059 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-12 20:59:07,059 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-12 20:59:07,060 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-12 20:59:07,060 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-12 20:59:07,066 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-12 20:59:07,066 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-12 20:59:07,077 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-12 20:59:07,101 INFO L443 ModelExtractionUtils]: Simplification made 15 calls to the SMT solver. [2024-11-12 20:59:07,101 INFO L444 ModelExtractionUtils]: 7 out of 22 variables were initially zero. Simplification set additionally 9 variables to zero. [2024-11-12 20:59:07,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 20:59:07,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:59:07,104 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 20:59:07,107 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 20:59:07,107 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-12 20:59:07,121 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2024-11-12 20:59:07,121 INFO L474 LassoAnalysis]: Proved termination. [2024-11-12 20:59:07,121 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_sort_~i~0#1) = -4*ULTIMATE.start_sort_~i~0#1 + 5 Supporting invariants [1*ULTIMATE.start_sort_~x#1.offset - 1*v_rep(select #length ULTIMATE.start_sort_~x#1.base)_3 + 12 >= 0] [2024-11-12 20:59:07,137 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 20:59:07,152 INFO L156 tatePredicateManager]: 5 out of 6 supporting invariants were superfluous and have been removed [2024-11-12 20:59:07,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:59:07,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:59:07,248 INFO L256 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-12 20:59:07,250 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 20:59:07,275 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2024-11-12 20:59:07,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:59:07,712 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-12 20:59:07,712 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 20:59:07,745 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 20:59:07,746 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.8 stem predicates 2 loop predicates [2024-11-12 20:59:07,746 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 36 states and 46 transitions. cyclomatic complexity: 13 Second operand has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 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 20:59:07,936 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 36 states and 46 transitions. cyclomatic complexity: 13. Second operand has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 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 57 states and 77 transitions. Complement of second has 13 states. [2024-11-12 20:59:07,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 8 stem states 1 non-accepting loop states 2 accepting loop states [2024-11-12 20:59:07,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 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 20:59:07,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 24 transitions. [2024-11-12 20:59:07,937 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 24 transitions. Stem has 22 letters. Loop has 3 letters. [2024-11-12 20:59:07,938 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-12 20:59:07,938 INFO L683 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-12 20:59:07,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:59:07,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:59:07,985 INFO L256 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-12 20:59:07,986 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 20:59:08,004 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-12 20:59:08,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:59:08,233 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-12 20:59:08,233 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 20:59:08,262 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 20:59:08,262 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.8 stem predicates 2 loop predicates [2024-11-12 20:59:08,262 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 36 states and 46 transitions. cyclomatic complexity: 13 Second operand has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 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 20:59:08,398 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 36 states and 46 transitions. cyclomatic complexity: 13. Second operand has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 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 57 states and 77 transitions. Complement of second has 13 states. [2024-11-12 20:59:08,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 8 stem states 1 non-accepting loop states 2 accepting loop states [2024-11-12 20:59:08,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 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 20:59:08,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 24 transitions. [2024-11-12 20:59:08,399 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 24 transitions. Stem has 22 letters. Loop has 3 letters. [2024-11-12 20:59:08,399 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-12 20:59:08,399 INFO L683 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-12 20:59:08,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:59:08,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:59:08,449 INFO L256 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-12 20:59:08,450 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 20:59:08,477 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2024-11-12 20:59:08,750 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 20:59:08,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:59:08,930 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-12 20:59:08,931 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 20:59:08,960 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 20:59:08,961 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.8 stem predicates 2 loop predicates [2024-11-12 20:59:08,961 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 36 states and 46 transitions. cyclomatic complexity: 13 Second operand has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 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 20:59:09,166 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 36 states and 46 transitions. cyclomatic complexity: 13. Second operand has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 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 78 states and 109 transitions. Complement of second has 12 states. [2024-11-12 20:59:09,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 8 stem states 1 non-accepting loop states 2 accepting loop states [2024-11-12 20:59:09,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 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 20:59:09,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 38 transitions. [2024-11-12 20:59:09,167 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 38 transitions. Stem has 22 letters. Loop has 3 letters. [2024-11-12 20:59:09,167 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-12 20:59:09,168 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 38 transitions. Stem has 25 letters. Loop has 3 letters. [2024-11-12 20:59:09,168 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-12 20:59:09,168 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 38 transitions. Stem has 22 letters. Loop has 6 letters. [2024-11-12 20:59:09,168 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-12 20:59:09,168 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 78 states and 109 transitions. [2024-11-12 20:59:09,169 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-12 20:59:09,170 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 78 states to 41 states and 52 transitions. [2024-11-12 20:59:09,170 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2024-11-12 20:59:09,170 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2024-11-12 20:59:09,170 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 52 transitions. [2024-11-12 20:59:09,170 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-12 20:59:09,170 INFO L218 hiAutomatonCegarLoop]: Abstraction has 41 states and 52 transitions. [2024-11-12 20:59:09,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 52 transitions. [2024-11-12 20:59:09,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 38. [2024-11-12 20:59:09,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 38 states have (on average 1.263157894736842) internal successors, (48), 37 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 20:59:09,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 48 transitions. [2024-11-12 20:59:09,173 INFO L240 hiAutomatonCegarLoop]: Abstraction has 38 states and 48 transitions. [2024-11-12 20:59:09,173 INFO L426 stractBuchiCegarLoop]: Abstraction has 38 states and 48 transitions. [2024-11-12 20:59:09,173 INFO L333 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2024-11-12 20:59:09,173 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 48 transitions. [2024-11-12 20:59:09,173 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-12 20:59:09,173 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-12 20:59:09,174 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-12 20:59:09,175 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 20:59:09,175 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-12 20:59:09,176 INFO L747 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet10#1, main_#t~post11#1, main_~i~1#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet8#1;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;" "assume !(main_~array_size~0#1 < 1);" "call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 18446744073709551616);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~i~1#1 := 0;" "assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet10#1;call write~int#0(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1;" "main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;" "assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet10#1;call write~int#0(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1;" "main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;" "assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet10#1;call write~int#0(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1;" "main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;" "assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet10#1;call write~int#0(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1;" "main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;" "assume !(main_~i~1#1 < main_~array_size~0#1);" "havoc main_~i~1#1;assume { :begin_inline_sort } true;sort_#in~x#1.base, sort_#in~x#1.offset, sort_#in~n#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc sort_#t~mem2#1, sort_#t~mem3#1, sort_#t~mem4#1, sort_#t~mem5#1, sort_~temp~0#1, sort_#t~post6#1, sort_#t~post7#1, sort_~x#1.base, sort_~x#1.offset, sort_~n#1, sort_~pass~0#1, sort_~i~0#1;sort_~x#1.base, sort_~x#1.offset := sort_#in~x#1.base, sort_#in~x#1.offset;sort_~n#1 := sort_#in~n#1;havoc sort_~pass~0#1;havoc sort_~i~0#1;sort_~pass~0#1 := 1;" "assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0;" "assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);" "assume !(sort_#t~mem2#1 > sort_#t~mem3#1);havoc sort_#t~mem2#1;havoc sort_#t~mem3#1;" "sort_#t~post6#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post6#1;havoc sort_#t~post6#1;" "assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);" "assume sort_#t~mem2#1 > sort_#t~mem3#1;havoc sort_#t~mem2#1;havoc sort_#t~mem3#1;call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem4#1;havoc sort_#t~mem4#1;call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem5#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem5#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1;" "sort_#t~post6#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post6#1;havoc sort_#t~post6#1;" "assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);" "sort_#t~post7#1 := sort_~pass~0#1;sort_~pass~0#1 := 1 + sort_#t~post7#1;havoc sort_#t~post7#1;" "assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0;" [2024-11-12 20:59:09,176 INFO L749 eck$LassoCheckResult]: Loop: "assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);" "assume sort_#t~mem2#1 > sort_#t~mem3#1;havoc sort_#t~mem2#1;havoc sort_#t~mem3#1;call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem4#1;havoc sort_#t~mem4#1;call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem5#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem5#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1;" "sort_#t~post6#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post6#1;havoc sort_#t~post6#1;" [2024-11-12 20:59:09,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:59:09,176 INFO L85 PathProgramCache]: Analyzing trace with hash -519847354, now seen corresponding path program 4 times [2024-11-12 20:59:09,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:59:09,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226224144] [2024-11-12 20:59:09,176 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:59:09,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:59:09,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:59:09,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 20:59:09,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226224144] [2024-11-12 20:59:09,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226224144] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 20:59:09,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1028411581] [2024-11-12 20:59:09,331 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-12 20:59:09,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 20:59:09,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:59:09,333 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 20:59:09,334 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process [2024-11-12 20:59:09,392 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-12 20:59:09,392 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-12 20:59:09,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2024-11-12 20:59:09,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468882566] [2024-11-12 20:59:09,392 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-12 20:59:09,392 INFO L752 eck$LassoCheckResult]: stem already infeasible [2024-11-12 20:59:09,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:59:09,393 INFO L85 PathProgramCache]: Analyzing trace with hash 68618, now seen corresponding path program 6 times [2024-11-12 20:59:09,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:59:09,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433389110] [2024-11-12 20:59:09,393 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:59:09,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:59:09,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 20:59:09,401 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 20:59:09,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 20:59:09,405 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 20:59:09,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 20:59:09,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-12 20:59:09,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-11-12 20:59:09,483 INFO L87 Difference]: Start difference. First operand 38 states and 48 transitions. cyclomatic complexity: 13 Second operand has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 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 20:59:09,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 20:59:09,600 INFO L93 Difference]: Finished difference Result 51 states and 66 transitions. [2024-11-12 20:59:09,600 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 66 transitions. [2024-11-12 20:59:09,601 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-12 20:59:09,601 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 51 states and 66 transitions. [2024-11-12 20:59:09,601 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2024-11-12 20:59:09,601 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2024-11-12 20:59:09,602 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 66 transitions. [2024-11-12 20:59:09,602 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-12 20:59:09,602 INFO L218 hiAutomatonCegarLoop]: Abstraction has 51 states and 66 transitions. [2024-11-12 20:59:09,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states and 66 transitions. [2024-11-12 20:59:09,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 43. [2024-11-12 20:59:09,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 43 states have (on average 1.255813953488372) internal successors, (54), 42 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 20:59:09,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 54 transitions. [2024-11-12 20:59:09,604 INFO L240 hiAutomatonCegarLoop]: Abstraction has 43 states and 54 transitions. [2024-11-12 20:59:09,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-12 20:59:09,605 INFO L426 stractBuchiCegarLoop]: Abstraction has 43 states and 54 transitions. [2024-11-12 20:59:09,605 INFO L333 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2024-11-12 20:59:09,605 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states and 54 transitions. [2024-11-12 20:59:09,606 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-12 20:59:09,606 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-12 20:59:09,606 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-12 20:59:09,607 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 20:59:09,607 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-12 20:59:09,607 INFO L747 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet10#1, main_#t~post11#1, main_~i~1#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet8#1;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;" "assume !(main_~array_size~0#1 < 1);" "call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 18446744073709551616);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~i~1#1 := 0;" "assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet10#1;call write~int#0(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1;" "main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;" "assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet10#1;call write~int#0(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1;" "main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;" "assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet10#1;call write~int#0(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1;" "main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;" "assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet10#1;call write~int#0(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1;" "main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;" "assume !(main_~i~1#1 < main_~array_size~0#1);" "havoc main_~i~1#1;assume { :begin_inline_sort } true;sort_#in~x#1.base, sort_#in~x#1.offset, sort_#in~n#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc sort_#t~mem2#1, sort_#t~mem3#1, sort_#t~mem4#1, sort_#t~mem5#1, sort_~temp~0#1, sort_#t~post6#1, sort_#t~post7#1, sort_~x#1.base, sort_~x#1.offset, sort_~n#1, sort_~pass~0#1, sort_~i~0#1;sort_~x#1.base, sort_~x#1.offset := sort_#in~x#1.base, sort_#in~x#1.offset;sort_~n#1 := sort_#in~n#1;havoc sort_~pass~0#1;havoc sort_~i~0#1;sort_~pass~0#1 := 1;" "assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0;" "assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);" "assume !(sort_#t~mem2#1 > sort_#t~mem3#1);havoc sort_#t~mem2#1;havoc sort_#t~mem3#1;" "sort_#t~post6#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post6#1;havoc sort_#t~post6#1;" "assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);" "assume sort_#t~mem2#1 > sort_#t~mem3#1;havoc sort_#t~mem2#1;havoc sort_#t~mem3#1;call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem4#1;havoc sort_#t~mem4#1;call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem5#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem5#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1;" "sort_#t~post6#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post6#1;havoc sort_#t~post6#1;" "assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);" "assume !(sort_#t~mem2#1 > sort_#t~mem3#1);havoc sort_#t~mem2#1;havoc sort_#t~mem3#1;" "sort_#t~post6#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post6#1;havoc sort_#t~post6#1;" "assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);" "sort_#t~post7#1 := sort_~pass~0#1;sort_~pass~0#1 := 1 + sort_#t~post7#1;havoc sort_#t~post7#1;" "assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0;" [2024-11-12 20:59:09,607 INFO L749 eck$LassoCheckResult]: Loop: "assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);" "assume sort_#t~mem2#1 > sort_#t~mem3#1;havoc sort_#t~mem2#1;havoc sort_#t~mem3#1;call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem4#1;havoc sort_#t~mem4#1;call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem5#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem5#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1;" "sort_#t~post6#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post6#1;havoc sort_#t~post6#1;" [2024-11-12 20:59:09,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:59:09,607 INFO L85 PathProgramCache]: Analyzing trace with hash 931747541, now seen corresponding path program 5 times [2024-11-12 20:59:09,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:59:09,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519000671] [2024-11-12 20:59:09,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:59:09,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:59:09,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 20:59:09,625 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 20:59:09,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 20:59:09,638 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 20:59:09,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:59:09,638 INFO L85 PathProgramCache]: Analyzing trace with hash 68618, now seen corresponding path program 7 times [2024-11-12 20:59:09,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:59:09,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666273563] [2024-11-12 20:59:09,639 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:59:09,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:59:09,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 20:59:09,650 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 20:59:09,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 20:59:09,653 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 20:59:09,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:59:09,656 INFO L85 PathProgramCache]: Analyzing trace with hash -682601290, now seen corresponding path program 6 times [2024-11-12 20:59:09,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:59:09,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587928072] [2024-11-12 20:59:09,657 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:59:09,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:59:09,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 20:59:09,676 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 20:59:09,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 20:59:09,700 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 20:59:11,265 INFO L204 LassoAnalysis]: Preferences: [2024-11-12 20:59:11,265 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-12 20:59:11,265 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-12 20:59:11,265 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-12 20:59:11,265 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-12 20:59:11,265 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 20:59:11,265 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-12 20:59:11,265 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-12 20:59:11,265 INFO L132 ssoRankerPreferences]: Filename of dumped script: java_BubbleSort-alloca-2.i_Iteration13_Lasso [2024-11-12 20:59:11,265 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-12 20:59:11,265 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-12 20:59:11,267 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 20:59:11,270 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 20:59:11,271 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 20:59:11,273 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 20:59:11,275 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 20:59:11,277 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 20:59:11,280 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 20:59:11,887 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 20:59:11,889 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 20:59:11,891 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 20:59:11,893 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 20:59:11,895 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 20:59:11,897 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 20:59:11,899 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 20:59:11,901 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 20:59:11,903 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 20:59:11,905 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 20:59:11,907 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 20:59:11,909 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 20:59:11,912 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 20:59:12,342 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-12 20:59:12,342 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-12 20:59:12,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 20:59:12,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:59:12,344 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-12 20:59:12,346 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2024-11-12 20:59:12,347 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 20:59:12,359 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-12 20:59:12,359 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-12 20:59:12,359 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-12 20:59:12,359 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-12 20:59:12,359 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-12 20:59:12,360 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-12 20:59:12,360 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-12 20:59:12,362 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-12 20:59:12,376 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Forceful destruction successful, exit code 0 [2024-11-12 20:59:12,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 20:59:12,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:59:12,378 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-12 20:59:12,380 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2024-11-12 20:59:12,380 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 20:59:12,390 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-12 20:59:12,390 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-12 20:59:12,390 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-12 20:59:12,391 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-12 20:59:12,391 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-12 20:59:12,391 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-12 20:59:12,391 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-12 20:59:12,392 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-12 20:59:12,403 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Forceful destruction successful, exit code 0 [2024-11-12 20:59:12,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 20:59:12,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:59:12,404 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 20:59:12,405 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 20:59:12,406 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 20:59:12,416 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-12 20:59:12,416 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-12 20:59:12,416 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-12 20:59:12,416 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-12 20:59:12,416 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-12 20:59:12,417 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-12 20:59:12,417 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-12 20:59:12,418 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-12 20:59:12,428 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 20:59:12,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 20:59:12,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:59:12,430 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 20:59:12,431 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 20:59:12,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 20:59:12,442 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-12 20:59:12,442 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-12 20:59:12,443 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-12 20:59:12,443 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-12 20:59:12,443 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-12 20:59:12,443 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-12 20:59:12,443 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-12 20:59:12,444 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-12 20:59:12,458 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Ended with exit code 0 [2024-11-12 20:59:12,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 20:59:12,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:59:12,459 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 20:59:12,460 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 20:59:12,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 20:59:12,470 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-12 20:59:12,470 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-12 20:59:12,471 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-12 20:59:12,471 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-12 20:59:12,472 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-12 20:59:12,472 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-12 20:59:12,474 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-12 20:59:12,484 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Forceful destruction successful, exit code 0 [2024-11-12 20:59:12,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 20:59:12,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:59:12,485 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 20:59:12,486 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 20:59:12,486 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 20:59:12,496 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-12 20:59:12,496 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-12 20:59:12,496 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-12 20:59:12,496 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-12 20:59:12,496 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-12 20:59:12,497 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-12 20:59:12,497 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-12 20:59:12,498 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-12 20:59:12,507 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Ended with exit code 0 [2024-11-12 20:59:12,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 20:59:12,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:59:12,509 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 20:59:12,510 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 20:59:12,511 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-12 20:59:12,520 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-12 20:59:12,520 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-12 20:59:12,520 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-12 20:59:12,520 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-12 20:59:12,522 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-12 20:59:12,522 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-12 20:59:12,524 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-12 20:59:12,534 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 20:59:12,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 20:59:12,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:59:12,536 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 20:59:12,537 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 20:59:12,537 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 20:59:12,548 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-12 20:59:12,548 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-12 20:59:12,548 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-12 20:59:12,548 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-12 20:59:12,550 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-12 20:59:12,550 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-12 20:59:12,557 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-12 20:59:12,570 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 20:59:12,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 20:59:12,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:59:12,572 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 20:59:12,572 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 20:59:12,573 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 20:59:12,583 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-12 20:59:12,583 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-12 20:59:12,583 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-12 20:59:12,583 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-12 20:59:12,585 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-12 20:59:12,585 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-12 20:59:12,587 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-12 20:59:12,597 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 20:59:12,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 20:59:12,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:59:12,599 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 20:59:12,600 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 20:59:12,601 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 20:59:12,610 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-12 20:59:12,610 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-12 20:59:12,611 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-12 20:59:12,611 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-12 20:59:12,612 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-12 20:59:12,612 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-12 20:59:12,616 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-12 20:59:12,630 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Ended with exit code 0 [2024-11-12 20:59:12,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 20:59:12,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:59:12,631 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 20:59:12,632 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 20:59:12,633 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 20:59:12,643 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-12 20:59:12,643 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-12 20:59:12,643 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-12 20:59:12,643 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-12 20:59:12,653 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-12 20:59:12,653 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-12 20:59:12,666 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-12 20:59:12,680 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Ended with exit code 0 [2024-11-12 20:59:12,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 20:59:12,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:59:12,682 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 20:59:12,683 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 20:59:12,684 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 20:59:12,697 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-12 20:59:12,698 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-12 20:59:12,698 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-12 20:59:12,698 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-12 20:59:12,703 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-12 20:59:12,703 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-12 20:59:12,718 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-12 20:59:12,758 INFO L443 ModelExtractionUtils]: Simplification made 11 calls to the SMT solver. [2024-11-12 20:59:12,759 INFO L444 ModelExtractionUtils]: 1 out of 22 variables were initially zero. Simplification set additionally 17 variables to zero. [2024-11-12 20:59:12,759 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 20:59:12,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:59:12,761 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 20:59:12,763 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 20:59:12,763 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-12 20:59:12,777 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-12 20:59:12,777 INFO L474 LassoAnalysis]: Proved termination. [2024-11-12 20:59:12,778 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_sort_~x#1.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc9#1.base)_5, ULTIMATE.start_sort_~i~0#1) = -1*ULTIMATE.start_sort_~x#1.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc9#1.base)_5 - 4*ULTIMATE.start_sort_~i~0#1 Supporting invariants [] [2024-11-12 20:59:12,792 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Forceful destruction successful, exit code 0 [2024-11-12 20:59:12,828 INFO L156 tatePredicateManager]: 10 out of 11 supporting invariants were superfluous and have been removed [2024-11-12 20:59:12,830 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~x!offset [2024-11-12 20:59:12,832 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-12 20:59:12,832 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-12 20:59:12,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:59:12,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:59:12,883 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-12 20:59:12,884 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 20:59:12,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:59:12,967 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-12 20:59:12,968 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 20:59:12,992 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 20:59:12,993 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates [2024-11-12 20:59:12,993 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 43 states and 54 transitions. cyclomatic complexity: 14 Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 20:59:13,035 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 43 states and 54 transitions. cyclomatic complexity: 14. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 58 states and 78 transitions. Complement of second has 7 states. [2024-11-12 20:59:13,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 3 stem states 1 non-accepting loop states 1 accepting loop states [2024-11-12 20:59:13,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 20:59:13,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 13 transitions. [2024-11-12 20:59:13,036 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 27 letters. Loop has 3 letters. [2024-11-12 20:59:13,037 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-12 20:59:13,037 INFO L683 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-12 20:59:13,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:59:13,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:59:13,086 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-12 20:59:13,087 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 20:59:13,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:59:13,169 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-12 20:59:13,170 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 20:59:13,196 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 20:59:13,196 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.3 stem predicates 2 loop predicates [2024-11-12 20:59:13,197 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 43 states and 54 transitions. cyclomatic complexity: 14 Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 20:59:13,239 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 43 states and 54 transitions. cyclomatic complexity: 14. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 58 states and 78 transitions. Complement of second has 7 states. [2024-11-12 20:59:13,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 3 stem states 1 non-accepting loop states 1 accepting loop states [2024-11-12 20:59:13,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 20:59:13,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 13 transitions. [2024-11-12 20:59:13,240 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 27 letters. Loop has 3 letters. [2024-11-12 20:59:13,240 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-12 20:59:13,240 INFO L683 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-12 20:59:13,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:59:13,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:59:13,286 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-12 20:59:13,287 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 20:59:13,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:59:13,384 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-12 20:59:13,385 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 20:59:13,413 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 20:59:13,414 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates [2024-11-12 20:59:13,414 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 43 states and 54 transitions. cyclomatic complexity: 14 Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 20:59:13,461 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 43 states and 54 transitions. cyclomatic complexity: 14. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 58 states and 80 transitions. Complement of second has 6 states. [2024-11-12 20:59:13,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 3 stem states 1 non-accepting loop states 1 accepting loop states [2024-11-12 20:59:13,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 20:59:13,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 20 transitions. [2024-11-12 20:59:13,463 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 27 letters. Loop has 3 letters. [2024-11-12 20:59:13,463 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-12 20:59:13,463 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 30 letters. Loop has 3 letters. [2024-11-12 20:59:13,463 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-12 20:59:13,463 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 27 letters. Loop has 6 letters. [2024-11-12 20:59:13,463 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-12 20:59:13,464 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 58 states and 80 transitions. [2024-11-12 20:59:13,464 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-11-12 20:59:13,464 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 58 states to 0 states and 0 transitions. [2024-11-12 20:59:13,464 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2024-11-12 20:59:13,465 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2024-11-12 20:59:13,465 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2024-11-12 20:59:13,465 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-12 20:59:13,465 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-12 20:59:13,465 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-12 20:59:13,465 INFO L426 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-12 20:59:13,465 INFO L333 stractBuchiCegarLoop]: ======== Iteration 14 ============ [2024-11-12 20:59:13,465 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2024-11-12 20:59:13,465 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-11-12 20:59:13,466 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2024-11-12 20:59:13,471 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 12.11 08:59:13 BoogieIcfgContainer [2024-11-12 20:59:13,472 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-11-12 20:59:13,472 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 20:59:13,472 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 20:59:13,472 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 20:59:13,473 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 08:58:57" (3/4) ... [2024-11-12 20:59:13,474 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-12 20:59:13,475 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 20:59:13,476 INFO L158 Benchmark]: Toolchain (without parser) took 16648.48ms. Allocated memory was 205.5MB in the beginning and 297.8MB in the end (delta: 92.3MB). Free memory was 136.8MB in the beginning and 136.3MB in the end (delta: 549.8kB). Peak memory consumption was 93.3MB. Max. memory is 16.1GB. [2024-11-12 20:59:13,476 INFO L158 Benchmark]: CDTParser took 0.45ms. Allocated memory is still 113.2MB. Free memory was 80.5MB in the beginning and 80.4MB in the end (delta: 118.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 20:59:13,476 INFO L158 Benchmark]: CACSL2BoogieTranslator took 461.67ms. Allocated memory is still 205.5MB. Free memory was 136.6MB in the beginning and 118.0MB in the end (delta: 18.6MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-12 20:59:13,476 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.03ms. Allocated memory is still 205.5MB. Free memory was 118.0MB in the beginning and 116.1MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 20:59:13,476 INFO L158 Benchmark]: Boogie Preprocessor took 42.45ms. Allocated memory is still 205.5MB. Free memory was 116.1MB in the beginning and 114.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 20:59:13,477 INFO L158 Benchmark]: RCFGBuilder took 347.36ms. Allocated memory is still 205.5MB. Free memory was 114.0MB in the beginning and 169.5MB in the end (delta: -55.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-12 20:59:13,477 INFO L158 Benchmark]: BuchiAutomizer took 15743.84ms. Allocated memory was 205.5MB in the beginning and 297.8MB in the end (delta: 92.3MB). Free memory was 169.5MB in the beginning and 137.3MB in the end (delta: 32.2MB). Peak memory consumption was 126.4MB. Max. memory is 16.1GB. [2024-11-12 20:59:13,477 INFO L158 Benchmark]: Witness Printer took 3.12ms. Allocated memory is still 297.8MB. Free memory was 137.3MB in the beginning and 136.3MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 20:59:13,478 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.45ms. Allocated memory is still 113.2MB. Free memory was 80.5MB in the beginning and 80.4MB in the end (delta: 118.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 461.67ms. Allocated memory is still 205.5MB. Free memory was 136.6MB in the beginning and 118.0MB in the end (delta: 18.6MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.03ms. Allocated memory is still 205.5MB. Free memory was 118.0MB in the beginning and 116.1MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 42.45ms. Allocated memory is still 205.5MB. Free memory was 116.1MB in the beginning and 114.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 347.36ms. Allocated memory is still 205.5MB. Free memory was 114.0MB in the beginning and 169.5MB in the end (delta: -55.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * BuchiAutomizer took 15743.84ms. Allocated memory was 205.5MB in the beginning and 297.8MB in the end (delta: 92.3MB). Free memory was 169.5MB in the beginning and 137.3MB in the end (delta: 32.2MB). Peak memory consumption was 126.4MB. Max. memory is 16.1GB. * Witness Printer took 3.12ms. Allocated memory is still 297.8MB. Free memory was 137.3MB in the beginning and 136.3MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~x!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 13 terminating modules (8 trivial, 3 deterministic, 2 nondeterministic). One deterministic module has affine ranking function (array_size + ((long) -1 * i)) and consists of 4 locations. One deterministic module has affine ranking function (((long) -1 * pass) + n) and consists of 3 locations. One deterministic module has affine ranking function ((((long) -1 * pass) + n) + ((long) -1 * i)) and consists of 3 locations. One nondeterministic module has affine ranking function (((long) -4 * i) + 5) and consists of 11 locations. One nondeterministic module has affine ranking function null and consists of 5 locations. 8 modules have a trivial ranking function, the largest among these consists of 20 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 15.6s and 14 iterations. TraceHistogramMax:4. Analysis of lassos took 11.9s. Construction of modules took 0.6s. Büchi inclusion checks took 3.0s. Highest rank in rank-based complementation 3. Minimization of det autom 6. Minimization of nondet autom 7. Automata minimization 0.0s AutomataMinimizationTime, 12 MinimizatonAttempts, 39 StatesRemovedByMinimization, 10 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [3, 0, 2, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 1/1 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 269 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 266 mSDsluCounter, 480 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 327 mSDsCounter, 67 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 884 IncrementalHoareTripleChecker+Invalid, 951 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 67 mSolverCounterUnsat, 153 mSDtfsCounter, 884 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc2 concLT0 SILN0 SILU4 SILI2 SILT0 lasso5 LassoPreprocessingBenchmarks: Lassos: inital248 mio100 ax110 hnf100 lsp88 ukn56 mio100 lsp46 div125 bol100 ite100 ukn100 eq174 hnf90 smp90 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 20ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s 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 20:59:13,498 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Ended with exit code 0 [2024-11-12 20:59:13,699 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Forceful destruction successful, exit code 0 [2024-11-12 20:59:13,900 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2024-11-12 20:59:14,100 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2024-11-12 20:59:14,300 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2024-11-12 20:59:14,501 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-11-12 20:59:14,701 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-11-12 20:59:14,900 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-12 20:59:15,101 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-11-12 20:59:15,301 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-12 20:59:15,501 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-12 20:59:15,703 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE