./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/termination.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/bubblesort-alloca-1.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/bubblesort-alloca-1.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 ec853311f8b6ef97341e01f0f96194e2f46c161d2727bd3a328a96a4ccf3856f --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 17:01:47,139 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 17:01:47,219 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2024-10-13 17:01:47,226 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 17:01:47,227 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 17:01:47,259 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 17:01:47,259 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 17:01:47,260 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 17:01:47,261 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 17:01:47,262 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 17:01:47,263 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 17:01:47,263 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 17:01:47,263 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 17:01:47,264 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-10-13 17:01:47,264 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-10-13 17:01:47,267 INFO L153 SettingsManager]: * Use old map elimination=false [2024-10-13 17:01:47,267 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-10-13 17:01:47,267 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-10-13 17:01:47,268 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-10-13 17:01:47,268 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 17:01:47,268 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-10-13 17:01:47,269 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 17:01:47,269 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 17:01:47,269 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-10-13 17:01:47,269 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-10-13 17:01:47,270 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-10-13 17:01:47,270 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 17:01:47,270 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 17:01:47,271 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 17:01:47,271 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-10-13 17:01:47,271 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 17:01:47,271 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 17:01:47,272 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 17:01:47,272 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 17:01:47,272 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 17:01:47,273 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-10-13 17:01:47,273 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 -> ec853311f8b6ef97341e01f0f96194e2f46c161d2727bd3a328a96a4ccf3856f [2024-10-13 17:01:47,518 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 17:01:47,542 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 17:01:47,544 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 17:01:47,545 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 17:01:47,546 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 17:01:47,547 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/bubblesort-alloca-1.i [2024-10-13 17:01:49,007 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 17:01:49,228 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 17:01:49,228 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/bubblesort-alloca-1.i [2024-10-13 17:01:49,246 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ba954b76/fd93edcd938b44e6afa0a568d280b8c3/FLAG2beae6687 [2024-10-13 17:01:49,264 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ba954b76/fd93edcd938b44e6afa0a568d280b8c3 [2024-10-13 17:01:49,266 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 17:01:49,268 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 17:01:49,271 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 17:01:49,272 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 17:01:49,278 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 17:01:49,278 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 05:01:49" (1/1) ... [2024-10-13 17:01:49,279 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3bc7beeb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:01:49, skipping insertion in model container [2024-10-13 17:01:49,280 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 05:01:49" (1/1) ... [2024-10-13 17:01:49,330 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 17:01:49,632 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 17:01:49,643 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 17:01:49,676 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 17:01:49,701 INFO L204 MainTranslator]: Completed translation [2024-10-13 17:01:49,702 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:01:49 WrapperNode [2024-10-13 17:01:49,702 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 17:01:49,703 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 17:01:49,703 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 17:01:49,703 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 17:01:49,710 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:01:49" (1/1) ... [2024-10-13 17:01:49,724 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:01:49" (1/1) ... [2024-10-13 17:01:49,738 INFO L138 Inliner]: procedures = 111, calls = 12, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 53 [2024-10-13 17:01:49,739 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 17:01:49,739 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 17:01:49,739 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 17:01:49,740 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 17:01:49,753 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:01:49" (1/1) ... [2024-10-13 17:01:49,753 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:01:49" (1/1) ... [2024-10-13 17:01:49,756 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:01:49" (1/1) ... [2024-10-13 17:01:49,766 INFO L175 MemorySlicer]: Split 6 memory accesses to 1 slices as follows [6]. 100 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0]. The 2 writes are split as follows [2]. [2024-10-13 17:01:49,766 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:01:49" (1/1) ... [2024-10-13 17:01:49,766 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:01:49" (1/1) ... [2024-10-13 17:01:49,770 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:01:49" (1/1) ... [2024-10-13 17:01:49,773 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:01:49" (1/1) ... [2024-10-13 17:01:49,773 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:01:49" (1/1) ... [2024-10-13 17:01:49,774 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:01:49" (1/1) ... [2024-10-13 17:01:49,776 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 17:01:49,778 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 17:01:49,778 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 17:01:49,778 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 17:01:49,779 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:01:49" (1/1) ... [2024-10-13 17:01:49,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:01:49,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:01:49,828 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-10-13 17:01:49,834 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-10-13 17:01:49,884 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-13 17:01:49,884 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-13 17:01:49,885 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-13 17:01:49,885 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-13 17:01:49,885 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 17:01:49,885 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 17:01:50,014 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 17:01:50,016 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 17:01:50,139 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2024-10-13 17:01:50,140 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 17:01:50,152 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 17:01:50,152 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-13 17:01:50,152 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 05:01:50 BoogieIcfgContainer [2024-10-13 17:01:50,153 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 17:01:50,154 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-10-13 17:01:50,154 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-10-13 17:01:50,159 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-10-13 17:01:50,159 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-13 17:01:50,160 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 13.10 05:01:49" (1/3) ... [2024-10-13 17:01:50,161 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@382dce45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.10 05:01:50, skipping insertion in model container [2024-10-13 17:01:50,161 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-13 17:01:50,161 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:01:49" (2/3) ... [2024-10-13 17:01:50,161 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@382dce45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.10 05:01:50, skipping insertion in model container [2024-10-13 17:01:50,161 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-13 17:01:50,161 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 05:01:50" (3/3) ... [2024-10-13 17:01:50,162 INFO L332 chiAutomizerObserver]: Analyzing ICFG bubblesort-alloca-1.i [2024-10-13 17:01:50,223 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-10-13 17:01:50,224 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-10-13 17:01:50,224 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-10-13 17:01:50,224 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-10-13 17:01:50,224 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-10-13 17:01:50,224 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-10-13 17:01:50,225 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-10-13 17:01:50,225 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-10-13 17:01:50,232 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 13 states, 12 states have (on average 1.5) 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-10-13 17:01:50,251 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-10-13 17:01:50,251 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 17:01:50,251 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 17:01:50,256 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2024-10-13 17:01:50,256 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-10-13 17:01:50,256 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-10-13 17:01:50,257 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 13 states, 12 states have (on average 1.5) 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-10-13 17:01:50,258 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-10-13 17:01:50,258 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 17:01:50,258 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 17:01:50,258 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2024-10-13 17:01:50,259 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-10-13 17:01:50,266 INFO L745 eck$LassoCheckResult]: Stem: 10#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 6#L-1true 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_~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; 11#L562true assume !(main_~array_size~0#1 < 1); 13#L562-2true 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;assume { :begin_inline_bubbleSort } true;bubbleSort_#in~numbers#1.base, bubbleSort_#in~numbers#1.offset, bubbleSort_#in~array_size#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc bubbleSort_#t~mem2#1, bubbleSort_#t~mem3#1, bubbleSort_#t~mem4#1, bubbleSort_#t~mem5#1, bubbleSort_#t~post6#1, bubbleSort_#t~post7#1, bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset, bubbleSort_~array_size#1, bubbleSort_~i~0#1, bubbleSort_~j~0#1, bubbleSort_~temp~0#1;bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset := bubbleSort_#in~numbers#1.base, bubbleSort_#in~numbers#1.offset;bubbleSort_~array_size#1 := bubbleSort_#in~array_size#1;havoc bubbleSort_~i~0#1;havoc bubbleSort_~j~0#1;havoc bubbleSort_~temp~0#1;bubbleSort_~i~0#1 := bubbleSort_~array_size#1 - 1; 5#L550-3true [2024-10-13 17:01:50,267 INFO L747 eck$LassoCheckResult]: Loop: 5#L550-3true assume !!(bubbleSort_~i~0#1 >= 0);bubbleSort_~j~0#1 := 1; 4#L551-3true assume !true; 12#L550-2true bubbleSort_#t~post7#1 := bubbleSort_~i~0#1;bubbleSort_~i~0#1 := bubbleSort_#t~post7#1 - 1;havoc bubbleSort_#t~post7#1; 5#L550-3true [2024-10-13 17:01:50,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:01:50,277 INFO L85 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2024-10-13 17:01:50,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:01:50,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088195727] [2024-10-13 17:01:50,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:01:50,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:01:50,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:01:50,425 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:01:50,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:01:50,453 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:01:50,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:01:50,456 INFO L85 PathProgramCache]: Analyzing trace with hash 47218, now seen corresponding path program 1 times [2024-10-13 17:01:50,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:01:50,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134543512] [2024-10-13 17:01:50,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:01:50,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:01:50,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:01:50,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 17:01:50,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 17:01:50,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134543512] [2024-10-13 17:01:50,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134543512] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 17:01:50,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 17:01:50,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 17:01:50,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755199054] [2024-10-13 17:01:50,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 17:01:50,494 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-13 17:01:50,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 17:01:50,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 17:01:50,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 17:01:50,525 INFO L87 Difference]: Start difference. First operand has 13 states, 12 states have (on average 1.5) 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) 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-10-13 17:01:50,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 17:01:50,529 INFO L93 Difference]: Finished difference Result 13 states and 16 transitions. [2024-10-13 17:01:50,530 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 16 transitions. [2024-10-13 17:01:50,531 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-10-13 17:01:50,534 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 9 states and 12 transitions. [2024-10-13 17:01:50,534 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2024-10-13 17:01:50,535 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2024-10-13 17:01:50,535 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 12 transitions. [2024-10-13 17:01:50,535 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-13 17:01:50,535 INFO L218 hiAutomatonCegarLoop]: Abstraction has 9 states and 12 transitions. [2024-10-13 17:01:50,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 12 transitions. [2024-10-13 17:01:50,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2024-10-13 17:01:50,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 8 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-10-13 17:01:50,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 12 transitions. [2024-10-13 17:01:50,555 INFO L240 hiAutomatonCegarLoop]: Abstraction has 9 states and 12 transitions. [2024-10-13 17:01:50,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 17:01:50,572 INFO L425 stractBuchiCegarLoop]: Abstraction has 9 states and 12 transitions. [2024-10-13 17:01:50,572 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-10-13 17:01:50,572 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 12 transitions. [2024-10-13 17:01:50,573 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-10-13 17:01:50,573 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 17:01:50,573 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 17:01:50,573 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2024-10-13 17:01:50,573 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-10-13 17:01:50,573 INFO L745 eck$LassoCheckResult]: Stem: 36#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 37#L-1 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_~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; 40#L562 assume !(main_~array_size~0#1 < 1); 41#L562-2 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;assume { :begin_inline_bubbleSort } true;bubbleSort_#in~numbers#1.base, bubbleSort_#in~numbers#1.offset, bubbleSort_#in~array_size#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc bubbleSort_#t~mem2#1, bubbleSort_#t~mem3#1, bubbleSort_#t~mem4#1, bubbleSort_#t~mem5#1, bubbleSort_#t~post6#1, bubbleSort_#t~post7#1, bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset, bubbleSort_~array_size#1, bubbleSort_~i~0#1, bubbleSort_~j~0#1, bubbleSort_~temp~0#1;bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset := bubbleSort_#in~numbers#1.base, bubbleSort_#in~numbers#1.offset;bubbleSort_~array_size#1 := bubbleSort_#in~array_size#1;havoc bubbleSort_~i~0#1;havoc bubbleSort_~j~0#1;havoc bubbleSort_~temp~0#1;bubbleSort_~i~0#1 := bubbleSort_~array_size#1 - 1; 42#L550-3 [2024-10-13 17:01:50,573 INFO L747 eck$LassoCheckResult]: Loop: 42#L550-3 assume !!(bubbleSort_~i~0#1 >= 0);bubbleSort_~j~0#1 := 1; 35#L551-3 assume !(bubbleSort_~j~0#1 <= bubbleSort_~i~0#1); 38#L550-2 bubbleSort_#t~post7#1 := bubbleSort_~i~0#1;bubbleSort_~i~0#1 := bubbleSort_#t~post7#1 - 1;havoc bubbleSort_#t~post7#1; 42#L550-3 [2024-10-13 17:01:50,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:01:50,575 INFO L85 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 2 times [2024-10-13 17:01:50,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:01:50,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077080529] [2024-10-13 17:01:50,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:01:50,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:01:50,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:01:50,603 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:01:50,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:01:50,636 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:01:50,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:01:50,641 INFO L85 PathProgramCache]: Analyzing trace with hash 46877, now seen corresponding path program 1 times [2024-10-13 17:01:50,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:01:50,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055435639] [2024-10-13 17:01:50,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:01:50,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:01:50,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:01:50,654 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:01:50,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:01:50,663 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:01:50,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:01:50,664 INFO L85 PathProgramCache]: Analyzing trace with hash 1806818489, now seen corresponding path program 1 times [2024-10-13 17:01:50,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:01:50,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496190546] [2024-10-13 17:01:50,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:01:50,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:01:50,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:01:50,684 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:01:50,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:01:50,704 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:01:50,758 INFO L204 LassoAnalysis]: Preferences: [2024-10-13 17:01:50,759 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-13 17:01:50,759 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-13 17:01:50,759 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-13 17:01:50,759 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-10-13 17:01:50,759 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:01:50,759 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-13 17:01:50,760 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-13 17:01:50,760 INFO L132 ssoRankerPreferences]: Filename of dumped script: bubblesort-alloca-1.i_Iteration2_Loop [2024-10-13 17:01:50,760 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-13 17:01:50,760 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-13 17:01:50,773 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:01:50,783 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:01:50,786 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:01:50,798 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:01:50,803 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:01:50,807 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:01:50,885 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-13 17:01:50,886 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-10-13 17:01:50,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:01:50,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:01:50,892 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-10-13 17:01:50,894 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-10-13 17:01:50,895 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-13 17:01:50,895 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-13 17:01:50,916 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-13 17:01:50,917 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_bubbleSort_#t~post7#1=0} Honda state: {ULTIMATE.start_bubbleSort_#t~post7#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-10-13 17:01:50,934 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2024-10-13 17:01:50,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:01:50,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:01:50,936 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-10-13 17:01:50,938 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-10-13 17:01:50,938 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-13 17:01:50,939 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-13 17:01:50,954 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-13 17:01:50,955 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_bubbleSort_~j~0#1=0} Honda state: {ULTIMATE.start_bubbleSort_~j~0#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-10-13 17:01:50,970 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-10-13 17:01:50,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:01:50,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:01:50,972 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-10-13 17:01:50,974 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-10-13 17:01:50,975 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-13 17:01:50,975 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-13 17:01:51,004 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2024-10-13 17:01:51,004 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:01:51,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:01:51,006 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-10-13 17:01:51,008 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-10-13 17:01:51,009 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-10-13 17:01:51,009 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-13 17:01:51,026 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-10-13 17:01:51,036 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-10-13 17:01:51,037 INFO L204 LassoAnalysis]: Preferences: [2024-10-13 17:01:51,037 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-13 17:01:51,037 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-13 17:01:51,037 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-13 17:01:51,037 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-13 17:01:51,037 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:01:51,038 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-13 17:01:51,038 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-13 17:01:51,038 INFO L132 ssoRankerPreferences]: Filename of dumped script: bubblesort-alloca-1.i_Iteration2_Loop [2024-10-13 17:01:51,038 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-13 17:01:51,038 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-13 17:01:51,040 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:01:51,044 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:01:51,047 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:01:51,053 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:01:51,056 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:01:51,060 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:01:51,128 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-13 17:01:51,132 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-13 17:01:51,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:01:51,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:01:51,134 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-10-13 17:01:51,135 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-10-13 17:01:51,136 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:01:51,146 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:01:51,146 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:01:51,147 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:01:51,147 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:01:51,147 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:01:51,148 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:01:51,149 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:01:51,150 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:01:51,162 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2024-10-13 17:01:51,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:01:51,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:01:51,163 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-10-13 17:01:51,164 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-10-13 17:01:51,165 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-10-13 17:01:51,175 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:01:51,175 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:01:51,175 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:01:51,175 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:01:51,175 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:01:51,176 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:01:51,176 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:01:51,178 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:01:51,189 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2024-10-13 17:01:51,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:01:51,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:01:51,191 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-10-13 17:01:51,192 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-10-13 17:01:51,192 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-10-13 17:01:51,202 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:01:51,202 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:01:51,202 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:01:51,203 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:01:51,203 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:01:51,204 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:01:51,204 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:01:51,206 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-13 17:01:51,209 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-10-13 17:01:51,209 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-10-13 17:01:51,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:01:51,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:01:51,213 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:01:51,214 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2024-10-13 17:01:51,214 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-13 17:01:51,214 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-10-13 17:01:51,214 INFO L474 LassoAnalysis]: Proved termination. [2024-10-13 17:01:51,215 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_bubbleSort_~i~0#1) = 2*ULTIMATE.start_bubbleSort_~i~0#1 + 1 Supporting invariants [] [2024-10-13 17:01:51,225 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-10-13 17:01:51,228 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-10-13 17:01:51,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:01:51,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:01:51,284 INFO L255 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 17:01:51,285 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:01:51,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:01:51,303 WARN L253 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 17:01:51,304 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:01:51,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 17:01:51,340 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-10-13 17:01:51,342 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 9 states and 12 transitions. cyclomatic complexity: 4 Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 17:01:51,383 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 9 states and 12 transitions. cyclomatic complexity: 4. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 15 states and 22 transitions. Complement of second has 4 states. [2024-10-13 17:01:51,384 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-10-13 17:01:51,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 17:01:51,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 12 transitions. [2024-10-13 17:01:51,387 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 4 letters. Loop has 3 letters. [2024-10-13 17:01:51,387 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 17:01:51,387 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 7 letters. Loop has 3 letters. [2024-10-13 17:01:51,388 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 17:01:51,388 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 4 letters. Loop has 6 letters. [2024-10-13 17:01:51,388 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 17:01:51,388 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 22 transitions. [2024-10-13 17:01:51,389 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-10-13 17:01:51,391 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 14 states and 20 transitions. [2024-10-13 17:01:51,391 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2024-10-13 17:01:51,391 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2024-10-13 17:01:51,392 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 20 transitions. [2024-10-13 17:01:51,393 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 17:01:51,394 INFO L218 hiAutomatonCegarLoop]: Abstraction has 14 states and 20 transitions. [2024-10-13 17:01:51,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 20 transitions. [2024-10-13 17:01:51,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2024-10-13 17:01:51,395 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-10-13 17:01:51,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 19 transitions. [2024-10-13 17:01:51,396 INFO L240 hiAutomatonCegarLoop]: Abstraction has 13 states and 19 transitions. [2024-10-13 17:01:51,396 INFO L425 stractBuchiCegarLoop]: Abstraction has 13 states and 19 transitions. [2024-10-13 17:01:51,396 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-10-13 17:01:51,396 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 19 transitions. [2024-10-13 17:01:51,396 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-10-13 17:01:51,396 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 17:01:51,396 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 17:01:51,397 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2024-10-13 17:01:51,397 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-10-13 17:01:51,397 INFO L745 eck$LassoCheckResult]: Stem: 105#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 106#L-1 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_~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; 107#L562 assume !(main_~array_size~0#1 < 1); 108#L562-2 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;assume { :begin_inline_bubbleSort } true;bubbleSort_#in~numbers#1.base, bubbleSort_#in~numbers#1.offset, bubbleSort_#in~array_size#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc bubbleSort_#t~mem2#1, bubbleSort_#t~mem3#1, bubbleSort_#t~mem4#1, bubbleSort_#t~mem5#1, bubbleSort_#t~post6#1, bubbleSort_#t~post7#1, bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset, bubbleSort_~array_size#1, bubbleSort_~i~0#1, bubbleSort_~j~0#1, bubbleSort_~temp~0#1;bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset := bubbleSort_#in~numbers#1.base, bubbleSort_#in~numbers#1.offset;bubbleSort_~array_size#1 := bubbleSort_#in~array_size#1;havoc bubbleSort_~i~0#1;havoc bubbleSort_~j~0#1;havoc bubbleSort_~temp~0#1;bubbleSort_~i~0#1 := bubbleSort_~array_size#1 - 1; 109#L550-3 assume !!(bubbleSort_~i~0#1 >= 0);bubbleSort_~j~0#1 := 1; 99#L551-3 [2024-10-13 17:01:51,397 INFO L747 eck$LassoCheckResult]: Loop: 99#L551-3 assume !!(bubbleSort_~j~0#1 <= bubbleSort_~i~0#1);call bubbleSort_#t~mem2#1 := read~int#0(bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * (bubbleSort_~j~0#1 - 1), 4);call bubbleSort_#t~mem3#1 := read~int#0(bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * bubbleSort_~j~0#1, 4); 102#L552 assume bubbleSort_#t~mem2#1 > bubbleSort_#t~mem3#1;havoc bubbleSort_#t~mem2#1;havoc bubbleSort_#t~mem3#1;call bubbleSort_#t~mem4#1 := read~int#0(bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * (bubbleSort_~j~0#1 - 1), 4);bubbleSort_~temp~0#1 := bubbleSort_#t~mem4#1;havoc bubbleSort_#t~mem4#1;call bubbleSort_#t~mem5#1 := read~int#0(bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * bubbleSort_~j~0#1, 4);call write~int#0(bubbleSort_#t~mem5#1, bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * (bubbleSort_~j~0#1 - 1), 4);havoc bubbleSort_#t~mem5#1;call write~int#0(bubbleSort_~temp~0#1, bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * bubbleSort_~j~0#1, 4); 98#L551-2 bubbleSort_#t~post6#1 := bubbleSort_~j~0#1;bubbleSort_~j~0#1 := 1 + bubbleSort_#t~post6#1;havoc bubbleSort_#t~post6#1; 99#L551-3 [2024-10-13 17:01:51,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:01:51,398 INFO L85 PathProgramCache]: Analyzing trace with hash 28695756, now seen corresponding path program 1 times [2024-10-13 17:01:51,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:01:51,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181444573] [2024-10-13 17:01:51,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:01:51,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:01:51,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:01:51,427 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:01:51,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:01:51,437 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:01:51,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:01:51,438 INFO L85 PathProgramCache]: Analyzing trace with hash 54716, now seen corresponding path program 1 times [2024-10-13 17:01:51,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:01:51,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654625835] [2024-10-13 17:01:51,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:01:51,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:01:51,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:01:51,448 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:01:51,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:01:51,455 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:01:51,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:01:51,455 INFO L85 PathProgramCache]: Analyzing trace with hash 176800017, now seen corresponding path program 1 times [2024-10-13 17:01:51,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:01:51,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81889502] [2024-10-13 17:01:51,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:01:51,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:01:51,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:01:51,488 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:01:51,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:01:51,517 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:01:51,809 INFO L204 LassoAnalysis]: Preferences: [2024-10-13 17:01:51,810 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-13 17:01:51,810 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-13 17:01:51,810 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-13 17:01:51,810 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-13 17:01:51,810 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:01:51,810 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-13 17:01:51,810 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-13 17:01:51,810 INFO L132 ssoRankerPreferences]: Filename of dumped script: bubblesort-alloca-1.i_Iteration3_Lasso [2024-10-13 17:01:51,810 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-13 17:01:51,810 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-13 17:01:51,813 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:01:51,818 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:01:51,820 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:01:51,823 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:01:51,826 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:01:51,828 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:01:51,831 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:01:51,834 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:01:51,939 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2024-10-13 17:01:52,068 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:01:52,072 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:01:52,075 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:01:52,077 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:01:52,080 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:01:52,083 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:01:52,086 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:01:52,089 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:01:52,092 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:01:52,380 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-13 17:01:52,380 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-13 17:01:52,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:01:52,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:01:52,384 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:01:52,385 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2024-10-13 17:01:52,386 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-10-13 17:01:52,399 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:01:52,399 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:01:52,399 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:01:52,399 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:01:52,399 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:01:52,400 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:01:52,400 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:01:52,403 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:01:52,418 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2024-10-13 17:01:52,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:01:52,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:01:52,423 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:01:52,426 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2024-10-13 17:01:52,426 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-10-13 17:01:52,438 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:01:52,438 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:01:52,439 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:01:52,439 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:01:52,439 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:01:52,439 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:01:52,439 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:01:52,441 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:01:52,451 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2024-10-13 17:01:52,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:01:52,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:01:52,453 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:01:52,454 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2024-10-13 17:01:52,455 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:01:52,464 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:01:52,464 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:01:52,464 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:01:52,464 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:01:52,465 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:01:52,465 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:01:52,465 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:01:52,466 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:01:52,477 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2024-10-13 17:01:52,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:01:52,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:01:52,478 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:01:52,479 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2024-10-13 17:01:52,480 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:01:52,489 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:01:52,490 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:01:52,490 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:01:52,490 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:01:52,493 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:01:52,493 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:01:52,497 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:01:52,512 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2024-10-13 17:01:52,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:01:52,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:01:52,515 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:01:52,519 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2024-10-13 17:01:52,520 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:01:52,535 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:01:52,536 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:01:52,536 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:01:52,536 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:01:52,536 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:01:52,537 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:01:52,537 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:01:52,540 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:01:52,556 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2024-10-13 17:01:52,556 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:01:52,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:01:52,558 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:01:52,560 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2024-10-13 17:01:52,561 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:01:52,573 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:01:52,574 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:01:52,574 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:01:52,574 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:01:52,576 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:01:52,576 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:01:52,582 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:01:52,597 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-10-13 17:01:52,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:01:52,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:01:52,599 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-10-13 17:01:52,601 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-10-13 17:01:52,602 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-10-13 17:01:52,614 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:01:52,614 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:01:52,614 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:01:52,614 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:01:52,615 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:01:52,615 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:01:52,615 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:01:52,618 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:01:52,632 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-10-13 17:01:52,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:01:52,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:01:52,635 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-10-13 17:01:52,637 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-10-13 17:01:52,637 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-10-13 17:01:52,650 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:01:52,650 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:01:52,650 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:01:52,650 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:01:52,654 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:01:52,654 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:01:52,661 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:01:52,677 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2024-10-13 17:01:52,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:01:52,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:01:52,679 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-10-13 17:01:52,682 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-10-13 17:01:52,683 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-10-13 17:01:52,695 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:01:52,695 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:01:52,695 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:01:52,695 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:01:52,699 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:01:52,699 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:01:52,707 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:01:52,722 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2024-10-13 17:01:52,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:01:52,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:01:52,724 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-10-13 17:01:52,725 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-10-13 17:01:52,726 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-10-13 17:01:52,738 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:01:52,739 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:01:52,739 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:01:52,739 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:01:52,739 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:01:52,740 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:01:52,740 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:01:52,743 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:01:52,758 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-10-13 17:01:52,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:01:52,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:01:52,760 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-10-13 17:01:52,763 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-10-13 17:01:52,764 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-10-13 17:01:52,777 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:01:52,777 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:01:52,777 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:01:52,777 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:01:52,779 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:01:52,779 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:01:52,783 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:01:52,797 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-10-13 17:01:52,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:01:52,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:01:52,799 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-10-13 17:01:52,800 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-10-13 17:01:52,801 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-10-13 17:01:52,814 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:01:52,815 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:01:52,815 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:01:52,815 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:01:52,821 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:01:52,821 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:01:52,832 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-13 17:01:52,853 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2024-10-13 17:01:52,853 INFO L444 ModelExtractionUtils]: 3 out of 19 variables were initially zero. Simplification set additionally 11 variables to zero. [2024-10-13 17:01:52,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:01:52,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:01:52,855 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-10-13 17:01:52,857 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-10-13 17:01:52,858 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-13 17:01:52,870 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2024-10-13 17:01:52,870 INFO L474 LassoAnalysis]: Proved termination. [2024-10-13 17:01:52,870 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_bubbleSort_~i~0#1, ULTIMATE.start_bubbleSort_~j~0#1) = 3*ULTIMATE.start_bubbleSort_~i~0#1 - 2*ULTIMATE.start_bubbleSort_~j~0#1 Supporting invariants [1*ULTIMATE.start_bubbleSort_~j~0#1 - 1 >= 0] [2024-10-13 17:01:52,880 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2024-10-13 17:01:52,896 INFO L156 tatePredicateManager]: 4 out of 5 supporting invariants were superfluous and have been removed [2024-10-13 17:01:52,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:01:52,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:01:52,933 INFO L255 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 17:01:52,934 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:01:52,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:01:52,958 INFO L255 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-13 17:01:52,959 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:01:52,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 17:01:52,988 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-10-13 17:01:52,988 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 19 transitions. cyclomatic complexity: 8 Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 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-10-13 17:01:53,038 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 19 transitions. cyclomatic complexity: 8. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 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 24 states and 36 transitions. Complement of second has 5 states. [2024-10-13 17:01:53,040 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-10-13 17:01:53,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 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-10-13 17:01:53,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 10 transitions. [2024-10-13 17:01:53,042 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 5 letters. Loop has 3 letters. [2024-10-13 17:01:53,042 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 17:01:53,042 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 8 letters. Loop has 3 letters. [2024-10-13 17:01:53,042 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 17:01:53,042 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 5 letters. Loop has 6 letters. [2024-10-13 17:01:53,042 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 17:01:53,042 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 36 transitions. [2024-10-13 17:01:53,043 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-10-13 17:01:53,044 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 16 states and 23 transitions. [2024-10-13 17:01:53,044 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2024-10-13 17:01:53,044 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2024-10-13 17:01:53,044 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 23 transitions. [2024-10-13 17:01:53,044 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 17:01:53,044 INFO L218 hiAutomatonCegarLoop]: Abstraction has 16 states and 23 transitions. [2024-10-13 17:01:53,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 23 transitions. [2024-10-13 17:01:53,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 13. [2024-10-13 17:01:53,049 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-10-13 17:01:53,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 18 transitions. [2024-10-13 17:01:53,049 INFO L240 hiAutomatonCegarLoop]: Abstraction has 13 states and 18 transitions. [2024-10-13 17:01:53,049 INFO L425 stractBuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2024-10-13 17:01:53,049 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-10-13 17:01:53,050 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 18 transitions. [2024-10-13 17:01:53,050 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-10-13 17:01:53,050 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 17:01:53,050 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 17:01:53,050 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1] [2024-10-13 17:01:53,051 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-10-13 17:01:53,051 INFO L745 eck$LassoCheckResult]: Stem: 211#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 212#L-1 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_~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; 215#L562 assume !(main_~array_size~0#1 < 1); 216#L562-2 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;assume { :begin_inline_bubbleSort } true;bubbleSort_#in~numbers#1.base, bubbleSort_#in~numbers#1.offset, bubbleSort_#in~array_size#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc bubbleSort_#t~mem2#1, bubbleSort_#t~mem3#1, bubbleSort_#t~mem4#1, bubbleSort_#t~mem5#1, bubbleSort_#t~post6#1, bubbleSort_#t~post7#1, bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset, bubbleSort_~array_size#1, bubbleSort_~i~0#1, bubbleSort_~j~0#1, bubbleSort_~temp~0#1;bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset := bubbleSort_#in~numbers#1.base, bubbleSort_#in~numbers#1.offset;bubbleSort_~array_size#1 := bubbleSort_#in~array_size#1;havoc bubbleSort_~i~0#1;havoc bubbleSort_~j~0#1;havoc bubbleSort_~temp~0#1;bubbleSort_~i~0#1 := bubbleSort_~array_size#1 - 1; 213#L550-3 assume !!(bubbleSort_~i~0#1 >= 0);bubbleSort_~j~0#1 := 1; 207#L551-3 assume !(bubbleSort_~j~0#1 <= bubbleSort_~i~0#1); 209#L550-2 bubbleSort_#t~post7#1 := bubbleSort_~i~0#1;bubbleSort_~i~0#1 := bubbleSort_#t~post7#1 - 1;havoc bubbleSort_#t~post7#1; 214#L550-3 assume !!(bubbleSort_~i~0#1 >= 0);bubbleSort_~j~0#1 := 1; 205#L551-3 [2024-10-13 17:01:53,051 INFO L747 eck$LassoCheckResult]: Loop: 205#L551-3 assume !!(bubbleSort_~j~0#1 <= bubbleSort_~i~0#1);call bubbleSort_#t~mem2#1 := read~int#0(bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * (bubbleSort_~j~0#1 - 1), 4);call bubbleSort_#t~mem3#1 := read~int#0(bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * bubbleSort_~j~0#1, 4); 208#L552 assume bubbleSort_#t~mem2#1 > bubbleSort_#t~mem3#1;havoc bubbleSort_#t~mem2#1;havoc bubbleSort_#t~mem3#1;call bubbleSort_#t~mem4#1 := read~int#0(bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * (bubbleSort_~j~0#1 - 1), 4);bubbleSort_~temp~0#1 := bubbleSort_#t~mem4#1;havoc bubbleSort_#t~mem4#1;call bubbleSort_#t~mem5#1 := read~int#0(bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * bubbleSort_~j~0#1, 4);call write~int#0(bubbleSort_#t~mem5#1, bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * (bubbleSort_~j~0#1 - 1), 4);havoc bubbleSort_#t~mem5#1;call write~int#0(bubbleSort_~temp~0#1, bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * bubbleSort_~j~0#1, 4); 204#L551-2 bubbleSort_#t~post6#1 := bubbleSort_~j~0#1;bubbleSort_~j~0#1 := 1 + bubbleSort_#t~post6#1;havoc bubbleSort_#t~post6#1; 205#L551-3 [2024-10-13 17:01:53,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:01:53,054 INFO L85 PathProgramCache]: Analyzing trace with hash 176798328, now seen corresponding path program 2 times [2024-10-13 17:01:53,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:01:53,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459383773] [2024-10-13 17:01:53,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:01:53,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:01:53,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:01:53,162 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 17:01:53,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 17:01:53,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459383773] [2024-10-13 17:01:53,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459383773] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 17:01:53,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 17:01:53,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 17:01:53,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387695549] [2024-10-13 17:01:53,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 17:01:53,163 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-13 17:01:53,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:01:53,164 INFO L85 PathProgramCache]: Analyzing trace with hash 54716, now seen corresponding path program 2 times [2024-10-13 17:01:53,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:01:53,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199216698] [2024-10-13 17:01:53,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:01:53,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:01:53,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:01:53,178 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:01:53,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:01:53,190 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:01:53,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 17:01:53,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 17:01:53,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-13 17:01:53,280 INFO L87 Difference]: Start difference. First operand 13 states and 18 transitions. cyclomatic complexity: 7 Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 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-10-13 17:01:53,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 17:01:53,313 INFO L93 Difference]: Finished difference Result 21 states and 28 transitions. [2024-10-13 17:01:53,314 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 28 transitions. [2024-10-13 17:01:53,315 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-10-13 17:01:53,318 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 19 states and 26 transitions. [2024-10-13 17:01:53,318 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2024-10-13 17:01:53,318 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2024-10-13 17:01:53,318 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 26 transitions. [2024-10-13 17:01:53,318 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 17:01:53,318 INFO L218 hiAutomatonCegarLoop]: Abstraction has 19 states and 26 transitions. [2024-10-13 17:01:53,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 26 transitions. [2024-10-13 17:01:53,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 14. [2024-10-13 17:01:53,321 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-10-13 17:01:53,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 19 transitions. [2024-10-13 17:01:53,322 INFO L240 hiAutomatonCegarLoop]: Abstraction has 14 states and 19 transitions. [2024-10-13 17:01:53,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 17:01:53,323 INFO L425 stractBuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2024-10-13 17:01:53,324 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-10-13 17:01:53,324 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 19 transitions. [2024-10-13 17:01:53,325 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-10-13 17:01:53,325 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 17:01:53,325 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 17:01:53,326 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 17:01:53,326 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-10-13 17:01:53,328 INFO L745 eck$LassoCheckResult]: Stem: 250#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 251#L-1 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_~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; 255#L562 assume !(main_~array_size~0#1 < 1); 256#L562-2 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;assume { :begin_inline_bubbleSort } true;bubbleSort_#in~numbers#1.base, bubbleSort_#in~numbers#1.offset, bubbleSort_#in~array_size#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc bubbleSort_#t~mem2#1, bubbleSort_#t~mem3#1, bubbleSort_#t~mem4#1, bubbleSort_#t~mem5#1, bubbleSort_#t~post6#1, bubbleSort_#t~post7#1, bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset, bubbleSort_~array_size#1, bubbleSort_~i~0#1, bubbleSort_~j~0#1, bubbleSort_~temp~0#1;bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset := bubbleSort_#in~numbers#1.base, bubbleSort_#in~numbers#1.offset;bubbleSort_~array_size#1 := bubbleSort_#in~array_size#1;havoc bubbleSort_~i~0#1;havoc bubbleSort_~j~0#1;havoc bubbleSort_~temp~0#1;bubbleSort_~i~0#1 := bubbleSort_~array_size#1 - 1; 257#L550-3 assume !!(bubbleSort_~i~0#1 >= 0);bubbleSort_~j~0#1 := 1; 253#L551-3 assume !!(bubbleSort_~j~0#1 <= bubbleSort_~i~0#1);call bubbleSort_#t~mem2#1 := read~int#0(bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * (bubbleSort_~j~0#1 - 1), 4);call bubbleSort_#t~mem3#1 := read~int#0(bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * bubbleSort_~j~0#1, 4); 254#L552 assume !(bubbleSort_#t~mem2#1 > bubbleSort_#t~mem3#1);havoc bubbleSort_#t~mem2#1;havoc bubbleSort_#t~mem3#1; 248#L551-2 bubbleSort_#t~post6#1 := bubbleSort_~j~0#1;bubbleSort_~j~0#1 := 1 + bubbleSort_#t~post6#1;havoc bubbleSort_#t~post6#1; 249#L551-3 assume !(bubbleSort_~j~0#1 <= bubbleSort_~i~0#1); 259#L550-2 bubbleSort_#t~post7#1 := bubbleSort_~i~0#1;bubbleSort_~i~0#1 := bubbleSort_#t~post7#1 - 1;havoc bubbleSort_#t~post7#1; 258#L550-3 assume !!(bubbleSort_~i~0#1 >= 0);bubbleSort_~j~0#1 := 1; 247#L551-3 [2024-10-13 17:01:53,328 INFO L747 eck$LassoCheckResult]: Loop: 247#L551-3 assume !!(bubbleSort_~j~0#1 <= bubbleSort_~i~0#1);call bubbleSort_#t~mem2#1 := read~int#0(bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * (bubbleSort_~j~0#1 - 1), 4);call bubbleSort_#t~mem3#1 := read~int#0(bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * bubbleSort_~j~0#1, 4); 252#L552 assume bubbleSort_#t~mem2#1 > bubbleSort_#t~mem3#1;havoc bubbleSort_#t~mem2#1;havoc bubbleSort_#t~mem3#1;call bubbleSort_#t~mem4#1 := read~int#0(bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * (bubbleSort_~j~0#1 - 1), 4);bubbleSort_~temp~0#1 := bubbleSort_#t~mem4#1;havoc bubbleSort_#t~mem4#1;call bubbleSort_#t~mem5#1 := read~int#0(bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * bubbleSort_~j~0#1, 4);call write~int#0(bubbleSort_#t~mem5#1, bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * (bubbleSort_~j~0#1 - 1), 4);havoc bubbleSort_#t~mem5#1;call write~int#0(bubbleSort_~temp~0#1, bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * bubbleSort_~j~0#1, 4); 246#L551-2 bubbleSort_#t~post6#1 := bubbleSort_~j~0#1;bubbleSort_~j~0#1 := 1 + bubbleSort_#t~post6#1;havoc bubbleSort_#t~post6#1; 247#L551-3 [2024-10-13 17:01:53,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:01:53,328 INFO L85 PathProgramCache]: Analyzing trace with hash 1421271829, now seen corresponding path program 1 times [2024-10-13 17:01:53,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:01:53,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659692183] [2024-10-13 17:01:53,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:01:53,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:01:53,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:01:53,352 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:01:53,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:01:53,372 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:01:53,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:01:53,377 INFO L85 PathProgramCache]: Analyzing trace with hash 54716, now seen corresponding path program 3 times [2024-10-13 17:01:53,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:01:53,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206704391] [2024-10-13 17:01:53,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:01:53,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:01:53,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:01:53,389 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:01:53,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:01:53,396 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:01:53,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:01:53,398 INFO L85 PathProgramCache]: Analyzing trace with hash 1321478696, now seen corresponding path program 1 times [2024-10-13 17:01:53,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:01:53,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237923663] [2024-10-13 17:01:53,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:01:53,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:01:53,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:01:53,516 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-10-13 17:01:53,563 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 17:01:53,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 17:01:53,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237923663] [2024-10-13 17:01:53,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237923663] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 17:01:53,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1454457917] [2024-10-13 17:01:53,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:01:53,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 17:01:53,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:01:53,567 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 17:01:53,568 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2024-10-13 17:01:53,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:01:53,623 INFO L255 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 17:01:53,623 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:01:53,664 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 17:01:53,664 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 17:01:53,706 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 17:01:53,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1454457917] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 17:01:53,707 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 17:01:53,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 10 [2024-10-13 17:01:53,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303350847] [2024-10-13 17:01:53,707 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 17:01:53,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 17:01:53,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-13 17:01:53,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2024-10-13 17:01:53,795 INFO L87 Difference]: Start difference. First operand 14 states and 19 transitions. cyclomatic complexity: 7 Second operand has 10 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 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-10-13 17:01:53,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 17:01:53,830 INFO L93 Difference]: Finished difference Result 29 states and 38 transitions. [2024-10-13 17:01:53,830 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 38 transitions. [2024-10-13 17:01:53,831 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-10-13 17:01:53,831 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 25 states and 34 transitions. [2024-10-13 17:01:53,832 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2024-10-13 17:01:53,832 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2024-10-13 17:01:53,832 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 34 transitions. [2024-10-13 17:01:53,832 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 17:01:53,832 INFO L218 hiAutomatonCegarLoop]: Abstraction has 25 states and 34 transitions. [2024-10-13 17:01:53,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 34 transitions. [2024-10-13 17:01:53,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 17. [2024-10-13 17:01:53,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 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-10-13 17:01:53,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 23 transitions. [2024-10-13 17:01:53,834 INFO L240 hiAutomatonCegarLoop]: Abstraction has 17 states and 23 transitions. [2024-10-13 17:01:53,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 17:01:53,834 INFO L425 stractBuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2024-10-13 17:01:53,835 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-10-13 17:01:53,835 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 23 transitions. [2024-10-13 17:01:53,835 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-10-13 17:01:53,835 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 17:01:53,835 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 17:01:53,836 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-10-13 17:01:53,836 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-10-13 17:01:53,836 INFO L745 eck$LassoCheckResult]: Stem: 386#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 387#L-1 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_~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; 390#L562 assume !(main_~array_size~0#1 < 1); 391#L562-2 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;assume { :begin_inline_bubbleSort } true;bubbleSort_#in~numbers#1.base, bubbleSort_#in~numbers#1.offset, bubbleSort_#in~array_size#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc bubbleSort_#t~mem2#1, bubbleSort_#t~mem3#1, bubbleSort_#t~mem4#1, bubbleSort_#t~mem5#1, bubbleSort_#t~post6#1, bubbleSort_#t~post7#1, bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset, bubbleSort_~array_size#1, bubbleSort_~i~0#1, bubbleSort_~j~0#1, bubbleSort_~temp~0#1;bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset := bubbleSort_#in~numbers#1.base, bubbleSort_#in~numbers#1.offset;bubbleSort_~array_size#1 := bubbleSort_#in~array_size#1;havoc bubbleSort_~i~0#1;havoc bubbleSort_~j~0#1;havoc bubbleSort_~temp~0#1;bubbleSort_~i~0#1 := bubbleSort_~array_size#1 - 1; 392#L550-3 assume !!(bubbleSort_~i~0#1 >= 0);bubbleSort_~j~0#1 := 1; 393#L551-3 assume !!(bubbleSort_~j~0#1 <= bubbleSort_~i~0#1);call bubbleSort_#t~mem2#1 := read~int#0(bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * (bubbleSort_~j~0#1 - 1), 4);call bubbleSort_#t~mem3#1 := read~int#0(bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * bubbleSort_~j~0#1, 4); 398#L552 assume !(bubbleSort_#t~mem2#1 > bubbleSort_#t~mem3#1);havoc bubbleSort_#t~mem2#1;havoc bubbleSort_#t~mem3#1; 384#L551-2 bubbleSort_#t~post6#1 := bubbleSort_~j~0#1;bubbleSort_~j~0#1 := 1 + bubbleSort_#t~post6#1;havoc bubbleSort_#t~post6#1; 385#L551-3 assume !!(bubbleSort_~j~0#1 <= bubbleSort_~i~0#1);call bubbleSort_#t~mem2#1 := read~int#0(bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * (bubbleSort_~j~0#1 - 1), 4);call bubbleSort_#t~mem3#1 := read~int#0(bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * bubbleSort_~j~0#1, 4); 389#L552 assume !(bubbleSort_#t~mem2#1 > bubbleSort_#t~mem3#1);havoc bubbleSort_#t~mem2#1;havoc bubbleSort_#t~mem3#1; 395#L551-2 bubbleSort_#t~post6#1 := bubbleSort_~j~0#1;bubbleSort_~j~0#1 := 1 + bubbleSort_#t~post6#1;havoc bubbleSort_#t~post6#1; 397#L551-3 assume !(bubbleSort_~j~0#1 <= bubbleSort_~i~0#1); 396#L550-2 bubbleSort_#t~post7#1 := bubbleSort_~i~0#1;bubbleSort_~i~0#1 := bubbleSort_#t~post7#1 - 1;havoc bubbleSort_#t~post7#1; 394#L550-3 assume !!(bubbleSort_~i~0#1 >= 0);bubbleSort_~j~0#1 := 1; 383#L551-3 [2024-10-13 17:01:53,836 INFO L747 eck$LassoCheckResult]: Loop: 383#L551-3 assume !!(bubbleSort_~j~0#1 <= bubbleSort_~i~0#1);call bubbleSort_#t~mem2#1 := read~int#0(bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * (bubbleSort_~j~0#1 - 1), 4);call bubbleSort_#t~mem3#1 := read~int#0(bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * bubbleSort_~j~0#1, 4); 388#L552 assume bubbleSort_#t~mem2#1 > bubbleSort_#t~mem3#1;havoc bubbleSort_#t~mem2#1;havoc bubbleSort_#t~mem3#1;call bubbleSort_#t~mem4#1 := read~int#0(bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * (bubbleSort_~j~0#1 - 1), 4);bubbleSort_~temp~0#1 := bubbleSort_#t~mem4#1;havoc bubbleSort_#t~mem4#1;call bubbleSort_#t~mem5#1 := read~int#0(bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * bubbleSort_~j~0#1, 4);call write~int#0(bubbleSort_#t~mem5#1, bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * (bubbleSort_~j~0#1 - 1), 4);havoc bubbleSort_#t~mem5#1;call write~int#0(bubbleSort_~temp~0#1, bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * bubbleSort_~j~0#1, 4); 382#L551-2 bubbleSort_#t~post6#1 := bubbleSort_~j~0#1;bubbleSort_~j~0#1 := 1 + bubbleSort_#t~post6#1;havoc bubbleSort_#t~post6#1; 383#L551-3 [2024-10-13 17:01:53,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:01:53,836 INFO L85 PathProgramCache]: Analyzing trace with hash 1373641048, now seen corresponding path program 2 times [2024-10-13 17:01:53,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:01:53,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890038739] [2024-10-13 17:01:53,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:01:53,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:01:53,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:01:53,853 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:01:53,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:01:53,870 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:01:53,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:01:53,871 INFO L85 PathProgramCache]: Analyzing trace with hash 54716, now seen corresponding path program 4 times [2024-10-13 17:01:53,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:01:53,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379258830] [2024-10-13 17:01:53,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:01:53,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:01:53,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:01:53,877 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:01:53,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:01:53,883 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:01:53,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:01:53,885 INFO L85 PathProgramCache]: Analyzing trace with hash -307910395, now seen corresponding path program 2 times [2024-10-13 17:01:53,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:01:53,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707886064] [2024-10-13 17:01:53,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:01:53,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:01:53,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:01:54,327 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 17:01:54,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 17:01:54,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707886064] [2024-10-13 17:01:54,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707886064] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 17:01:54,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [703457431] [2024-10-13 17:01:54,328 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-13 17:01:54,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 17:01:54,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:01:54,330 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-10-13 17:01:54,331 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-10-13 17:01:54,395 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-13 17:01:54,395 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 17:01:54,396 INFO L255 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-10-13 17:01:54,397 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:01:54,488 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 17:01:54,489 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 10 [2024-10-13 17:01:54,500 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-13 17:01:54,501 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 17:01:54,600 INFO L349 Elim1Store]: treesize reduction 13, result has 60.6 percent of original size [2024-10-13 17:01:54,601 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 28 [2024-10-13 17:01:54,645 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-13 17:01:54,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [703457431] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 17:01:54,656 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 17:01:54,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 7] total 16 [2024-10-13 17:01:54,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664542741] [2024-10-13 17:01:54,656 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 17:01:54,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 17:01:54,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-13 17:01:54,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2024-10-13 17:01:54,738 INFO L87 Difference]: Start difference. First operand 17 states and 23 transitions. cyclomatic complexity: 8 Second operand has 16 states, 16 states have (on average 2.1875) internal successors, (35), 16 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-10-13 17:01:54,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 17:01:54,839 INFO L93 Difference]: Finished difference Result 37 states and 50 transitions. [2024-10-13 17:01:54,839 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 50 transitions. [2024-10-13 17:01:54,840 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2024-10-13 17:01:54,843 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 37 states and 50 transitions. [2024-10-13 17:01:54,843 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2024-10-13 17:01:54,843 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2024-10-13 17:01:54,843 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 50 transitions. [2024-10-13 17:01:54,844 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 17:01:54,844 INFO L218 hiAutomatonCegarLoop]: Abstraction has 37 states and 50 transitions. [2024-10-13 17:01:54,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 50 transitions. [2024-10-13 17:01:54,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 26. [2024-10-13 17:01:54,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 25 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-10-13 17:01:54,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 35 transitions. [2024-10-13 17:01:54,847 INFO L240 hiAutomatonCegarLoop]: Abstraction has 26 states and 35 transitions. [2024-10-13 17:01:54,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 17:01:54,849 INFO L425 stractBuchiCegarLoop]: Abstraction has 26 states and 35 transitions. [2024-10-13 17:01:54,850 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-10-13 17:01:54,850 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 35 transitions. [2024-10-13 17:01:54,850 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-10-13 17:01:54,852 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 17:01:54,852 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 17:01:54,852 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 17:01:54,852 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-10-13 17:01:54,852 INFO L745 eck$LassoCheckResult]: Stem: 559#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 560#L-1 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_~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; 564#L562 assume !(main_~array_size~0#1 < 1); 565#L562-2 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;assume { :begin_inline_bubbleSort } true;bubbleSort_#in~numbers#1.base, bubbleSort_#in~numbers#1.offset, bubbleSort_#in~array_size#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc bubbleSort_#t~mem2#1, bubbleSort_#t~mem3#1, bubbleSort_#t~mem4#1, bubbleSort_#t~mem5#1, bubbleSort_#t~post6#1, bubbleSort_#t~post7#1, bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset, bubbleSort_~array_size#1, bubbleSort_~i~0#1, bubbleSort_~j~0#1, bubbleSort_~temp~0#1;bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset := bubbleSort_#in~numbers#1.base, bubbleSort_#in~numbers#1.offset;bubbleSort_~array_size#1 := bubbleSort_#in~array_size#1;havoc bubbleSort_~i~0#1;havoc bubbleSort_~j~0#1;havoc bubbleSort_~temp~0#1;bubbleSort_~i~0#1 := bubbleSort_~array_size#1 - 1; 566#L550-3 assume !!(bubbleSort_~i~0#1 >= 0);bubbleSort_~j~0#1 := 1; 567#L551-3 assume !!(bubbleSort_~j~0#1 <= bubbleSort_~i~0#1);call bubbleSort_#t~mem2#1 := read~int#0(bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * (bubbleSort_~j~0#1 - 1), 4);call bubbleSort_#t~mem3#1 := read~int#0(bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * bubbleSort_~j~0#1, 4); 577#L552 assume !(bubbleSort_#t~mem2#1 > bubbleSort_#t~mem3#1);havoc bubbleSort_#t~mem2#1;havoc bubbleSort_#t~mem3#1; 557#L551-2 bubbleSort_#t~post6#1 := bubbleSort_~j~0#1;bubbleSort_~j~0#1 := 1 + bubbleSort_#t~post6#1;havoc bubbleSort_#t~post6#1; 558#L551-3 assume !!(bubbleSort_~j~0#1 <= bubbleSort_~i~0#1);call bubbleSort_#t~mem2#1 := read~int#0(bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * (bubbleSort_~j~0#1 - 1), 4);call bubbleSort_#t~mem3#1 := read~int#0(bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * bubbleSort_~j~0#1, 4); 563#L552 assume bubbleSort_#t~mem2#1 > bubbleSort_#t~mem3#1;havoc bubbleSort_#t~mem2#1;havoc bubbleSort_#t~mem3#1;call bubbleSort_#t~mem4#1 := read~int#0(bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * (bubbleSort_~j~0#1 - 1), 4);bubbleSort_~temp~0#1 := bubbleSort_#t~mem4#1;havoc bubbleSort_#t~mem4#1;call bubbleSort_#t~mem5#1 := read~int#0(bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * bubbleSort_~j~0#1, 4);call write~int#0(bubbleSort_#t~mem5#1, bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * (bubbleSort_~j~0#1 - 1), 4);havoc bubbleSort_#t~mem5#1;call write~int#0(bubbleSort_~temp~0#1, bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * bubbleSort_~j~0#1, 4); 570#L551-2 bubbleSort_#t~post6#1 := bubbleSort_~j~0#1;bubbleSort_~j~0#1 := 1 + bubbleSort_#t~post6#1;havoc bubbleSort_#t~post6#1; 576#L551-3 assume !(bubbleSort_~j~0#1 <= bubbleSort_~i~0#1); 572#L550-2 bubbleSort_#t~post7#1 := bubbleSort_~i~0#1;bubbleSort_~i~0#1 := bubbleSort_#t~post7#1 - 1;havoc bubbleSort_#t~post7#1; 573#L550-3 assume !!(bubbleSort_~i~0#1 >= 0);bubbleSort_~j~0#1 := 1; 556#L551-3 [2024-10-13 17:01:54,852 INFO L747 eck$LassoCheckResult]: Loop: 556#L551-3 assume !!(bubbleSort_~j~0#1 <= bubbleSort_~i~0#1);call bubbleSort_#t~mem2#1 := read~int#0(bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * (bubbleSort_~j~0#1 - 1), 4);call bubbleSort_#t~mem3#1 := read~int#0(bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * bubbleSort_~j~0#1, 4); 580#L552 assume bubbleSort_#t~mem2#1 > bubbleSort_#t~mem3#1;havoc bubbleSort_#t~mem2#1;havoc bubbleSort_#t~mem3#1;call bubbleSort_#t~mem4#1 := read~int#0(bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * (bubbleSort_~j~0#1 - 1), 4);bubbleSort_~temp~0#1 := bubbleSort_#t~mem4#1;havoc bubbleSort_#t~mem4#1;call bubbleSort_#t~mem5#1 := read~int#0(bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * bubbleSort_~j~0#1, 4);call write~int#0(bubbleSort_#t~mem5#1, bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * (bubbleSort_~j~0#1 - 1), 4);havoc bubbleSort_#t~mem5#1;call write~int#0(bubbleSort_~temp~0#1, bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * bubbleSort_~j~0#1, 4); 555#L551-2 bubbleSort_#t~post6#1 := bubbleSort_~j~0#1;bubbleSort_~j~0#1 := 1 + bubbleSort_#t~post6#1;havoc bubbleSort_#t~post6#1; 556#L551-3 [2024-10-13 17:01:54,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:01:54,853 INFO L85 PathProgramCache]: Analyzing trace with hash 1371794006, now seen corresponding path program 3 times [2024-10-13 17:01:54,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:01:54,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851207376] [2024-10-13 17:01:54,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:01:54,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:01:54,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:01:54,866 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:01:54,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:01:54,879 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:01:54,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:01:54,881 INFO L85 PathProgramCache]: Analyzing trace with hash 54716, now seen corresponding path program 5 times [2024-10-13 17:01:54,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:01:54,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485052190] [2024-10-13 17:01:54,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:01:54,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:01:54,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:01:54,888 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:01:54,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:01:54,892 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:01:54,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:01:54,894 INFO L85 PathProgramCache]: Analyzing trace with hash 501436231, now seen corresponding path program 4 times [2024-10-13 17:01:54,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:01:54,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779757053] [2024-10-13 17:01:54,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:01:54,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:01:54,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:01:54,916 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:01:54,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:01:54,927 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:01:55,393 INFO L204 LassoAnalysis]: Preferences: [2024-10-13 17:01:55,393 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-13 17:01:55,394 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-13 17:01:55,394 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-13 17:01:55,394 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-13 17:01:55,394 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:01:55,394 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-13 17:01:55,394 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-13 17:01:55,394 INFO L132 ssoRankerPreferences]: Filename of dumped script: bubblesort-alloca-1.i_Iteration7_Lasso [2024-10-13 17:01:55,394 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-13 17:01:55,394 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-13 17:01:55,397 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:01:55,402 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:01:55,404 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:01:55,635 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:01:55,638 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:01:55,640 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:01:55,643 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:01:55,645 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:01:55,647 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:01:55,649 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:01:55,651 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:01:55,653 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:01:55,655 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:01:55,657 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:01:55,659 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:01:55,661 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:01:55,663 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:01:55,897 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-13 17:01:55,897 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-13 17:01:55,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:01:55,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:01:55,899 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:01:55,901 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2024-10-13 17:01:55,902 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-10-13 17:01:55,914 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:01:55,914 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:01:55,914 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:01:55,914 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:01:55,915 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:01:55,915 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:01:55,915 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:01:55,917 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:01:55,932 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2024-10-13 17:01:55,932 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:01:55,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:01:55,934 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:01:55,935 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2024-10-13 17:01:55,936 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-10-13 17:01:55,947 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:01:55,947 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:01:55,948 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:01:55,948 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:01:55,948 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:01:55,948 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:01:55,948 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:01:55,951 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:01:55,966 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2024-10-13 17:01:55,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:01:55,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:01:55,968 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-10-13 17:01:55,969 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-10-13 17:01:55,970 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-10-13 17:01:55,980 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:01:55,981 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:01:55,981 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:01:55,981 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:01:55,982 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:01:55,983 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:01:55,986 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:01:55,998 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-10-13 17:01:55,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:01:55,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:01:55,999 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-10-13 17:01:56,000 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-10-13 17:01:56,001 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-10-13 17:01:56,011 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:01:56,011 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:01:56,011 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:01:56,011 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:01:56,014 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:01:56,014 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:01:56,019 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:01:56,033 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-10-13 17:01:56,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:01:56,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:01:56,035 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-10-13 17:01:56,037 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-10-13 17:01:56,038 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-10-13 17:01:56,050 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:01:56,050 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:01:56,050 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:01:56,050 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:01:56,052 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:01:56,052 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:01:56,056 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:01:56,070 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2024-10-13 17:01:56,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:01:56,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:01:56,072 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-10-13 17:01:56,074 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-10-13 17:01:56,074 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:01:56,087 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:01:56,087 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:01:56,087 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:01:56,088 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:01:56,099 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:01:56,100 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:01:56,106 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:01:56,120 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2024-10-13 17:01:56,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:01:56,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:01:56,123 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-10-13 17:01:56,124 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-10-13 17:01:56,126 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-10-13 17:01:56,135 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:01:56,136 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:01:56,136 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:01:56,136 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:01:56,137 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:01:56,137 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:01:56,140 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:01:56,152 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2024-10-13 17:01:56,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:01:56,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:01:56,154 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-10-13 17:01:56,155 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-10-13 17:01:56,156 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-10-13 17:01:56,168 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:01:56,169 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:01:56,169 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:01:56,169 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:01:56,174 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:01:56,174 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:01:56,183 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-13 17:01:56,200 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2024-10-13 17:01:56,200 INFO L444 ModelExtractionUtils]: 8 out of 19 variables were initially zero. Simplification set additionally 7 variables to zero. [2024-10-13 17:01:56,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:01:56,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:01:56,202 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-10-13 17:01:56,203 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-10-13 17:01:56,204 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-13 17:01:56,217 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-10-13 17:01:56,218 INFO L474 LassoAnalysis]: Proved termination. [2024-10-13 17:01:56,218 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_bubbleSort_~i~0#1, ULTIMATE.start_bubbleSort_~j~0#1) = 2*ULTIMATE.start_bubbleSort_~i~0#1 - 2*ULTIMATE.start_bubbleSort_~j~0#1 + 1 Supporting invariants [] [2024-10-13 17:01:56,232 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-10-13 17:01:56,243 INFO L156 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2024-10-13 17:01:56,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:01:56,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:01:56,280 INFO L255 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 17:01:56,281 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:01:56,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:01:56,306 INFO L255 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 17:01:56,306 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:01:56,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 17:01:56,324 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-10-13 17:01:56,325 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 26 states and 35 transitions. cyclomatic complexity: 11 Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 17:01:56,348 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 26 states and 35 transitions. cyclomatic complexity: 11. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 42 states and 60 transitions. Complement of second has 5 states. [2024-10-13 17:01:56,350 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-10-13 17:01:56,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 17:01:56,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 10 transitions. [2024-10-13 17:01:56,351 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 14 letters. Loop has 3 letters. [2024-10-13 17:01:56,351 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 17:01:56,351 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-13 17:01:56,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:01:56,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:01:56,386 INFO L255 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 17:01:56,387 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:01:56,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:01:56,409 INFO L255 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 17:01:56,410 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:01:56,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 17:01:56,428 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2024-10-13 17:01:56,428 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 26 states and 35 transitions. cyclomatic complexity: 11 Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 17:01:56,445 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 26 states and 35 transitions. cyclomatic complexity: 11. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 42 states and 60 transitions. Complement of second has 5 states. [2024-10-13 17:01:56,445 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-10-13 17:01:56,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 17:01:56,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 10 transitions. [2024-10-13 17:01:56,446 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 14 letters. Loop has 3 letters. [2024-10-13 17:01:56,447 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 17:01:56,447 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-13 17:01:56,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:01:56,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:01:56,478 INFO L255 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 17:01:56,479 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:01:56,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:01:56,502 INFO L255 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 17:01:56,503 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:01:56,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 17:01:56,519 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-10-13 17:01:56,519 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 26 states and 35 transitions. cyclomatic complexity: 11 Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 17:01:56,537 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 26 states and 35 transitions. cyclomatic complexity: 11. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 37 states and 54 transitions. Complement of second has 4 states. [2024-10-13 17:01:56,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2024-10-13 17:01:56,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 17:01:56,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 17 transitions. [2024-10-13 17:01:56,539 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 14 letters. Loop has 3 letters. [2024-10-13 17:01:56,539 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 17:01:56,539 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 17 letters. Loop has 3 letters. [2024-10-13 17:01:56,539 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 17:01:56,540 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 14 letters. Loop has 6 letters. [2024-10-13 17:01:56,540 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 17:01:56,540 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 54 transitions. [2024-10-13 17:01:56,541 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-10-13 17:01:56,541 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 0 states and 0 transitions. [2024-10-13 17:01:56,541 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2024-10-13 17:01:56,541 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2024-10-13 17:01:56,541 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2024-10-13 17:01:56,541 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-13 17:01:56,541 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-13 17:01:56,541 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-13 17:01:56,542 INFO L425 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-13 17:01:56,542 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-10-13 17:01:56,542 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2024-10-13 17:01:56,542 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-10-13 17:01:56,542 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2024-10-13 17:01:56,550 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 13.10 05:01:56 BoogieIcfgContainer [2024-10-13 17:01:56,550 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-10-13 17:01:56,551 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 17:01:56,551 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 17:01:56,551 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 17:01:56,551 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 05:01:50" (3/4) ... [2024-10-13 17:01:56,553 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-13 17:01:56,554 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 17:01:56,554 INFO L158 Benchmark]: Toolchain (without parser) took 7286.30ms. Allocated memory was 138.4MB in the beginning and 234.9MB in the end (delta: 96.5MB). Free memory was 67.1MB in the beginning and 157.1MB in the end (delta: -90.0MB). Peak memory consumption was 8.5MB. Max. memory is 16.1GB. [2024-10-13 17:01:56,555 INFO L158 Benchmark]: CDTParser took 0.45ms. Allocated memory is still 138.4MB. Free memory is still 101.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 17:01:56,555 INFO L158 Benchmark]: CACSL2BoogieTranslator took 431.10ms. Allocated memory was 138.4MB in the beginning and 195.0MB in the end (delta: 56.6MB). Free memory was 66.9MB in the beginning and 158.0MB in the end (delta: -91.1MB). Peak memory consumption was 20.3MB. Max. memory is 16.1GB. [2024-10-13 17:01:56,555 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.95ms. Allocated memory is still 195.0MB. Free memory was 158.0MB in the beginning and 156.8MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 17:01:56,555 INFO L158 Benchmark]: Boogie Preprocessor took 36.65ms. Allocated memory is still 195.0MB. Free memory was 156.8MB in the beginning and 154.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 17:01:56,555 INFO L158 Benchmark]: RCFGBuilder took 374.81ms. Allocated memory is still 195.0MB. Free memory was 154.7MB in the beginning and 142.4MB in the end (delta: 12.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-13 17:01:56,556 INFO L158 Benchmark]: BuchiAutomizer took 6396.56ms. Allocated memory was 195.0MB in the beginning and 234.9MB in the end (delta: 39.8MB). Free memory was 142.4MB in the beginning and 157.1MB in the end (delta: -14.7MB). Peak memory consumption was 26.0MB. Max. memory is 16.1GB. [2024-10-13 17:01:56,556 INFO L158 Benchmark]: Witness Printer took 3.34ms. Allocated memory is still 234.9MB. Free memory is still 157.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 17:01:56,557 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 138.4MB. Free memory is still 101.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 431.10ms. Allocated memory was 138.4MB in the beginning and 195.0MB in the end (delta: 56.6MB). Free memory was 66.9MB in the beginning and 158.0MB in the end (delta: -91.1MB). Peak memory consumption was 20.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.95ms. Allocated memory is still 195.0MB. Free memory was 158.0MB in the beginning and 156.8MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 36.65ms. Allocated memory is still 195.0MB. Free memory was 156.8MB in the beginning and 154.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 374.81ms. Allocated memory is still 195.0MB. Free memory was 154.7MB in the beginning and 142.4MB in the end (delta: 12.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * BuchiAutomizer took 6396.56ms. Allocated memory was 195.0MB in the beginning and 234.9MB in the end (delta: 39.8MB). Free memory was 142.4MB in the beginning and 157.1MB in the end (delta: -14.7MB). Peak memory consumption was 26.0MB. Max. memory is 16.1GB. * Witness Printer took 3.34ms. Allocated memory is still 234.9MB. Free memory is still 157.1MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 7 terminating modules (4 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function (((long) 2 * i) + 1) and consists of 3 locations. One deterministic module has affine ranking function (((long) 3 * i) + ((long) -2 * j)) and consists of 3 locations. One nondeterministic module has affine ranking function ((((long) 2 * i) + ((long) -2 * j)) + 1) and consists of 3 locations. 4 modules have a trivial ranking function, the largest among these consists of 16 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.3s and 8 iterations. TraceHistogramMax:2. Analysis of lassos took 5.3s. Construction of modules took 0.1s. Büchi inclusion checks took 0.7s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 5. Automata minimization 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 28 StatesRemovedByMinimization, 5 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 [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 101 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 97 mSDsluCounter, 178 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 95 mSDsCounter, 22 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 188 IncrementalHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 22 mSolverCounterUnsat, 83 mSDtfsCounter, 188 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT1 conc2 concLT0 SILN0 SILU1 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital94 mio100 ax195 hnf100 lsp63 ukn79 mio100 lsp77 div133 bol100 ite100 ukn100 eq175 hnf92 smp84 dnf100 smp100 tf105 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 19ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 2 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.1s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2024-10-13 17:01:56,584 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-10-13 17:01:56,782 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-10-13 17:01:56,982 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2024-10-13 17:01:57,183 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