./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-memory-alloca/bubblesort-alloca-1.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-memory-alloca/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.fs.icfgbuilder-eval-3289d67-m [2024-11-17 08:07:44,928 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-17 08:07:44,988 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2024-11-17 08:07:44,992 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-17 08:07:44,992 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-17 08:07:44,992 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2024-11-17 08:07:45,025 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-17 08:07:45,026 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-17 08:07:45,026 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-17 08:07:45,027 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-17 08:07:45,027 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-17 08:07:45,028 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-17 08:07:45,028 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-17 08:07:45,028 INFO L153 SettingsManager]: * Use SBE=true [2024-11-17 08:07:45,037 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-17 08:07:45,037 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-17 08:07:45,038 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-17 08:07:45,038 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-17 08:07:45,038 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-17 08:07:45,039 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-17 08:07:45,039 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-17 08:07:45,040 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-17 08:07:45,040 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-17 08:07:45,041 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-17 08:07:45,041 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-17 08:07:45,041 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-17 08:07:45,042 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-17 08:07:45,042 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-17 08:07:45,042 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-17 08:07:45,043 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-17 08:07:45,043 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-17 08:07:45,043 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-17 08:07:45,044 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-17 08:07:45,044 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-17 08:07:45,044 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-17 08:07:45,044 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-17 08:07:45,045 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-17 08:07:45,045 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-11-17 08:07:45,298 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-17 08:07:45,329 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-17 08:07:45,332 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-17 08:07:45,335 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-17 08:07:45,335 INFO L274 PluginConnector]: CDTParser initialized [2024-11-17 08:07:45,337 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-alloca/bubblesort-alloca-1.i [2024-11-17 08:07:46,813 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-17 08:07:47,051 INFO L384 CDTParser]: Found 1 translation units. [2024-11-17 08:07:47,052 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/bubblesort-alloca-1.i [2024-11-17 08:07:47,066 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/315a1d2a7/87a581dea1644d9eb43a0321d9a24177/FLAG12b0f273c [2024-11-17 08:07:47,082 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/315a1d2a7/87a581dea1644d9eb43a0321d9a24177 [2024-11-17 08:07:47,084 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-17 08:07:47,086 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-17 08:07:47,087 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-17 08:07:47,087 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-17 08:07:47,092 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-17 08:07:47,093 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 08:07:47" (1/1) ... [2024-11-17 08:07:47,093 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14889309 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:07:47, skipping insertion in model container [2024-11-17 08:07:47,094 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 08:07:47" (1/1) ... [2024-11-17 08:07:47,132 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-17 08:07:47,436 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 08:07:47,449 INFO L200 MainTranslator]: Completed pre-run [2024-11-17 08:07:47,485 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 08:07:47,517 INFO L204 MainTranslator]: Completed translation [2024-11-17 08:07:47,517 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:07:47 WrapperNode [2024-11-17 08:07:47,518 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-17 08:07:47,519 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-17 08:07:47,519 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-17 08:07:47,519 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-17 08:07:47,525 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:07:47" (1/1) ... [2024-11-17 08:07:47,536 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:07:47" (1/1) ... [2024-11-17 08:07:47,554 INFO L138 Inliner]: procedures = 111, calls = 12, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 51 [2024-11-17 08:07:47,555 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-17 08:07:47,555 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-17 08:07:47,555 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-17 08:07:47,555 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-17 08:07:47,565 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:07:47" (1/1) ... [2024-11-17 08:07:47,566 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:07:47" (1/1) ... [2024-11-17 08:07:47,568 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:07:47" (1/1) ... [2024-11-17 08:07:47,581 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-11-17 08:07:47,581 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:07:47" (1/1) ... [2024-11-17 08:07:47,581 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:07:47" (1/1) ... [2024-11-17 08:07:47,588 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:07:47" (1/1) ... [2024-11-17 08:07:47,589 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:07:47" (1/1) ... [2024-11-17 08:07:47,590 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:07:47" (1/1) ... [2024-11-17 08:07:47,592 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:07:47" (1/1) ... [2024-11-17 08:07:47,594 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-17 08:07:47,598 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-17 08:07:47,598 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-17 08:07:47,598 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-17 08:07:47,599 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:07:47" (1/1) ... [2024-11-17 08:07:47,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:07:47,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:07:47,653 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:07:47,657 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-11-17 08:07:47,712 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-17 08:07:47,712 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-17 08:07:47,713 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-17 08:07:47,713 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-17 08:07:47,714 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-17 08:07:47,714 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-17 08:07:47,840 INFO L256 CfgBuilder]: Building ICFG [2024-11-17 08:07:47,843 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-17 08:07:47,972 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L565: call ULTIMATE.dealloc(main_#t~malloc9#1.base, main_#t~malloc9#1.offset);havoc main_#t~malloc9#1.base, main_#t~malloc9#1.offset; [2024-11-17 08:07:47,983 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2024-11-17 08:07:47,983 INFO L307 CfgBuilder]: Performing block encoding [2024-11-17 08:07:47,999 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-17 08:07:47,999 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-17 08:07:48,000 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 08:07:47 BoogieIcfgContainer [2024-11-17 08:07:48,000 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-17 08:07:48,001 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-17 08:07:48,001 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-17 08:07:48,005 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-17 08:07:48,007 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-17 08:07:48,008 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 17.11 08:07:47" (1/3) ... [2024-11-17 08:07:48,009 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@22bb9c2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.11 08:07:48, skipping insertion in model container [2024-11-17 08:07:48,010 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-17 08:07:48,010 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:07:47" (2/3) ... [2024-11-17 08:07:48,010 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@22bb9c2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.11 08:07:48, skipping insertion in model container [2024-11-17 08:07:48,010 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-17 08:07:48,011 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 08:07:47" (3/3) ... [2024-11-17 08:07:48,012 INFO L332 chiAutomizerObserver]: Analyzing ICFG bubblesort-alloca-1.i [2024-11-17 08:07:48,075 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-11-17 08:07:48,075 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-11-17 08:07:48,075 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-17 08:07:48,075 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-17 08:07:48,075 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-17 08:07:48,076 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-11-17 08:07:48,076 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-17 08:07:48,077 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-17 08:07:48,081 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 15 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:07:48,099 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2024-11-17 08:07:48,099 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:07:48,099 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:07:48,104 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2024-11-17 08:07:48,105 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-17 08:07:48,105 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-17 08:07:48,105 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 15 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:07:48,108 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2024-11-17 08:07:48,108 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:07:48,109 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:07:48,109 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2024-11-17 08:07:48,109 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-17 08:07:48,114 INFO L745 eck$LassoCheckResult]: Stem: 3#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 6#ULTIMATE.init_returnLabel#1true assume true;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); 12#L565-1true 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; 14#L550true [2024-11-17 08:07:48,115 INFO L747 eck$LassoCheckResult]: Loop: 14#L550true assume true; 15#L550-2true assume !!(bubbleSort_~i~0#1 >= 0);bubbleSort_~j~0#1 := 1; 10#L551true assume !true; 13#L550-1true bubbleSort_#t~post7#1 := bubbleSort_~i~0#1;bubbleSort_~i~0#1 := bubbleSort_#t~post7#1 - 1;havoc bubbleSort_#t~post7#1; 14#L550true [2024-11-17 08:07:48,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:07:48,123 INFO L85 PathProgramCache]: Analyzing trace with hash 1661310, now seen corresponding path program 1 times [2024-11-17 08:07:48,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:07:48,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030467267] [2024-11-17 08:07:48,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:07:48,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:07:48,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:07:48,246 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:07:48,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:07:48,275 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:07:48,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:07:48,278 INFO L85 PathProgramCache]: Analyzing trace with hash 1476503, now seen corresponding path program 1 times [2024-11-17 08:07:48,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:07:48,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008399580] [2024-11-17 08:07:48,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:07:48,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:07:48,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:07:48,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:07:48,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:07:48,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008399580] [2024-11-17 08:07:48,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008399580] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 08:07:48,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 08:07:48,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 08:07:48,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206011181] [2024-11-17 08:07:48,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 08:07:48,321 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-17 08:07:48,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:07:48,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-17 08:07:48,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-17 08:07:48,349 INFO L87 Difference]: Start difference. First operand has 15 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 0 states have call successors, (0), 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 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:07:48,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:07:48,354 INFO L93 Difference]: Finished difference Result 15 states and 18 transitions. [2024-11-17 08:07:48,355 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 18 transitions. [2024-11-17 08:07:48,356 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2024-11-17 08:07:48,359 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 11 states and 14 transitions. [2024-11-17 08:07:48,360 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2024-11-17 08:07:48,360 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2024-11-17 08:07:48,360 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 14 transitions. [2024-11-17 08:07:48,361 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-17 08:07:48,361 INFO L218 hiAutomatonCegarLoop]: Abstraction has 11 states and 14 transitions. [2024-11-17 08:07:48,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 14 transitions. [2024-11-17 08:07:48,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2024-11-17 08:07:48,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 10 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:07:48,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 14 transitions. [2024-11-17 08:07:48,385 INFO L240 hiAutomatonCegarLoop]: Abstraction has 11 states and 14 transitions. [2024-11-17 08:07:48,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-17 08:07:48,389 INFO L425 stractBuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2024-11-17 08:07:48,389 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-17 08:07:48,413 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 14 transitions. [2024-11-17 08:07:48,414 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2024-11-17 08:07:48,415 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:07:48,416 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:07:48,416 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2024-11-17 08:07:48,416 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2024-11-17 08:07:48,416 INFO L745 eck$LassoCheckResult]: Stem: 38#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 39#ULTIMATE.init_returnLabel#1 assume true;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); 46#L565-1 call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 18446744073709551616);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;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; 47#L550 [2024-11-17 08:07:48,417 INFO L747 eck$LassoCheckResult]: Loop: 47#L550 assume true; 48#L550-2 assume !!(bubbleSort_~i~0#1 >= 0);bubbleSort_~j~0#1 := 1; 45#L551 assume true; 41#L551-2 assume !(bubbleSort_~j~0#1 <= bubbleSort_~i~0#1); 42#L550-1 bubbleSort_#t~post7#1 := bubbleSort_~i~0#1;bubbleSort_~i~0#1 := bubbleSort_#t~post7#1 - 1;havoc bubbleSort_#t~post7#1; 47#L550 [2024-11-17 08:07:48,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:07:48,417 INFO L85 PathProgramCache]: Analyzing trace with hash 1661310, now seen corresponding path program 2 times [2024-11-17 08:07:48,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:07:48,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760054421] [2024-11-17 08:07:48,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:07:48,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:07:48,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:07:48,454 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:07:48,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:07:48,490 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:07:48,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:07:48,493 INFO L85 PathProgramCache]: Analyzing trace with hash 45770791, now seen corresponding path program 1 times [2024-11-17 08:07:48,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:07:48,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997591611] [2024-11-17 08:07:48,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:07:48,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:07:48,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:07:48,501 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:07:48,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:07:48,513 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:07:48,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:07:48,516 INFO L85 PathProgramCache]: Analyzing trace with hash -555846454, now seen corresponding path program 1 times [2024-11-17 08:07:48,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:07:48,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626125817] [2024-11-17 08:07:48,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:07:48,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:07:48,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:07:48,547 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:07:48,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:07:48,569 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:07:48,636 INFO L204 LassoAnalysis]: Preferences: [2024-11-17 08:07:48,637 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-17 08:07:48,637 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-17 08:07:48,637 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-17 08:07:48,637 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-17 08:07:48,637 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:07:48,637 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-17 08:07:48,638 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-17 08:07:48,638 INFO L132 ssoRankerPreferences]: Filename of dumped script: bubblesort-alloca-1.i_Iteration2_Loop [2024-11-17 08:07:48,638 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-17 08:07:48,638 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-17 08:07:48,657 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:07:48,667 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:07:48,672 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:07:48,685 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:07:48,692 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:07:48,700 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:07:48,790 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-17 08:07:48,791 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-17 08:07:48,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:07:48,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:07:48,795 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:07:48,797 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2024-11-17 08:07:48,798 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-17 08:07:48,798 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-17 08:07:48,816 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-17 08:07:48,816 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-11-17 08:07:48,831 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2024-11-17 08:07:48,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:07:48,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:07:48,835 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:07:48,837 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2024-11-17 08:07:48,839 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-17 08:07:48,839 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-17 08:07:48,856 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-17 08:07:48,857 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-11-17 08:07:48,872 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2024-11-17 08:07:48,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:07:48,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:07:48,876 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:07:48,877 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2024-11-17 08:07:48,878 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-17 08:07:48,878 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-17 08:07:48,910 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2024-11-17 08:07:48,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:07:48,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:07:48,913 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:07:48,915 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2024-11-17 08:07:48,916 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-17 08:07:48,916 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-17 08:07:48,934 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-17 08:07:48,949 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2024-11-17 08:07:48,949 INFO L204 LassoAnalysis]: Preferences: [2024-11-17 08:07:48,950 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-17 08:07:48,950 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-17 08:07:48,950 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-17 08:07:48,950 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-17 08:07:48,950 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:07:48,950 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-17 08:07:48,951 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-17 08:07:48,951 INFO L132 ssoRankerPreferences]: Filename of dumped script: bubblesort-alloca-1.i_Iteration2_Loop [2024-11-17 08:07:48,951 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-17 08:07:48,951 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-17 08:07:48,955 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:07:48,959 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:07:48,963 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:07:48,971 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:07:48,976 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:07:48,981 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:07:49,045 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-17 08:07:49,050 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-17 08:07:49,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:07:49,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:07:49,053 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:07:49,055 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2024-11-17 08:07:49,056 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:07:49,068 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:07:49,069 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:07:49,069 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:07:49,069 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:07:49,070 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:07:49,072 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:07:49,072 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:07:49,077 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:07:49,092 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2024-11-17 08:07:49,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:07:49,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:07:49,095 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:07:49,098 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2024-11-17 08:07:49,099 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:07:49,112 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:07:49,112 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:07:49,113 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:07:49,113 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:07:49,113 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:07:49,114 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:07:49,114 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:07:49,116 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:07:49,131 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-11-17 08:07:49,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:07:49,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:07:49,135 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:07:49,136 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2024-11-17 08:07:49,137 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:07:49,151 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:07:49,151 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:07:49,151 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:07:49,151 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:07:49,151 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:07:49,153 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:07:49,153 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:07:49,156 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-17 08:07:49,159 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-17 08:07:49,159 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-11-17 08:07:49,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:07:49,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:07:49,183 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:07:49,185 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2024-11-17 08:07:49,186 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-17 08:07:49,186 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-17 08:07:49,186 INFO L474 LassoAnalysis]: Proved termination. [2024-11-17 08:07:49,187 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-11-17 08:07:49,202 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2024-11-17 08:07:49,205 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-17 08:07:49,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:07:49,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:07:49,281 INFO L255 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-17 08:07:49,283 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:07:49,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:07:49,297 INFO L255 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-17 08:07:49,298 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:07:49,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-11-17 08:07:49,341 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-11-17 08:07:49,343 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 14 transitions. cyclomatic complexity: 4 Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:07:49,394 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 14 transitions. cyclomatic complexity: 4. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 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 18 states and 24 transitions. Complement of second has 6 states. [2024-11-17 08:07:49,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-11-17 08:07:49,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:07:49,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2024-11-17 08:07:49,398 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 4 letters. Loop has 5 letters. [2024-11-17 08:07:49,399 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:07:49,399 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 9 letters. Loop has 5 letters. [2024-11-17 08:07:49,400 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:07:49,400 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 4 letters. Loop has 10 letters. [2024-11-17 08:07:49,401 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:07:49,401 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 24 transitions. [2024-11-17 08:07:49,403 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-11-17 08:07:49,405 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 17 states and 23 transitions. [2024-11-17 08:07:49,405 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2024-11-17 08:07:49,405 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2024-11-17 08:07:49,405 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 23 transitions. [2024-11-17 08:07:49,406 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:07:49,406 INFO L218 hiAutomatonCegarLoop]: Abstraction has 17 states and 23 transitions. [2024-11-17 08:07:49,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 23 transitions. [2024-11-17 08:07:49,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2024-11-17 08:07:49,407 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-11-17 08:07:49,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 23 transitions. [2024-11-17 08:07:49,408 INFO L240 hiAutomatonCegarLoop]: Abstraction has 17 states and 23 transitions. [2024-11-17 08:07:49,408 INFO L425 stractBuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2024-11-17 08:07:49,408 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-11-17 08:07:49,409 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 23 transitions. [2024-11-17 08:07:49,409 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-11-17 08:07:49,409 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:07:49,410 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:07:49,410 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2024-11-17 08:07:49,410 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-17 08:07:49,410 INFO L745 eck$LassoCheckResult]: Stem: 116#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 117#ULTIMATE.init_returnLabel#1 assume true;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; 118#L562 assume !(main_~array_size~0#1 < 1); 128#L565-1 call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 18446744073709551616);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;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; 130#L550 assume true; 132#L550-2 assume !!(bubbleSort_~i~0#1 >= 0);bubbleSort_~j~0#1 := 1; 125#L551 [2024-11-17 08:07:49,411 INFO L747 eck$LassoCheckResult]: Loop: 125#L551 assume true; 119#L551-2 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); 120#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); 124#L551-1 bubbleSort_#t~post6#1 := bubbleSort_~j~0#1;bubbleSort_~j~0#1 := 1 + bubbleSort_#t~post6#1;havoc bubbleSort_#t~post6#1; 125#L551 [2024-11-17 08:07:49,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:07:49,411 INFO L85 PathProgramCache]: Analyzing trace with hash 1596519485, now seen corresponding path program 1 times [2024-11-17 08:07:49,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:07:49,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108457092] [2024-11-17 08:07:49,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:07:49,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:07:49,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:07:49,427 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:07:49,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:07:49,436 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:07:49,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:07:49,437 INFO L85 PathProgramCache]: Analyzing trace with hash 1291775, now seen corresponding path program 1 times [2024-11-17 08:07:49,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:07:49,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027500334] [2024-11-17 08:07:49,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:07:49,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:07:49,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:07:49,448 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:07:49,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:07:49,459 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:07:49,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:07:49,459 INFO L85 PathProgramCache]: Analyzing trace with hash -51368901, now seen corresponding path program 1 times [2024-11-17 08:07:49,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:07:49,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260633781] [2024-11-17 08:07:49,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:07:49,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:07:49,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:07:49,492 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:07:49,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:07:49,517 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:07:49,814 INFO L204 LassoAnalysis]: Preferences: [2024-11-17 08:07:49,814 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-17 08:07:49,814 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-17 08:07:49,815 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-17 08:07:49,815 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-17 08:07:49,815 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:07:49,815 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-17 08:07:49,815 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-17 08:07:49,815 INFO L132 ssoRankerPreferences]: Filename of dumped script: bubblesort-alloca-1.i_Iteration3_Lasso [2024-11-17 08:07:49,815 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-17 08:07:49,815 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-17 08:07:49,818 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:07:49,822 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:07:49,824 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:07:50,025 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:07:50,028 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:07:50,035 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:07:50,038 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:07:50,040 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:07:50,043 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:07:50,045 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:07:50,047 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:07:50,049 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:07:50,051 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:07:50,053 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:07:50,055 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:07:50,058 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:07:50,061 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:07:50,110 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2024-11-17 08:07:50,368 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-17 08:07:50,368 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-17 08:07:50,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:07:50,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:07:50,372 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:07:50,374 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2024-11-17 08:07:50,375 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:07:50,388 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:07:50,388 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:07:50,389 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:07:50,389 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:07:50,389 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:07:50,390 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:07:50,390 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:07:50,394 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:07:50,409 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2024-11-17 08:07:50,410 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:07:50,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:07:50,412 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:07:50,413 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2024-11-17 08:07:50,417 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:07:50,431 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:07:50,432 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:07:50,432 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:07:50,432 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:07:50,432 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:07:50,433 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:07:50,433 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:07:50,435 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:07:50,450 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2024-11-17 08:07:50,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:07:50,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:07:50,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-11-17 08:07:50,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-11-17 08:07:50,455 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:07:50,467 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:07:50,468 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:07:50,468 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:07:50,468 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:07:50,471 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:07:50,471 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:07:50,476 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:07:50,491 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2024-11-17 08:07:50,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:07:50,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:07:50,493 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:07:50,494 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2024-11-17 08:07:50,495 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:07:50,508 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:07:50,509 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:07:50,509 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:07:50,509 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:07:50,509 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:07:50,510 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:07:50,510 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:07:50,512 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:07:50,522 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2024-11-17 08:07:50,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:07:50,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:07:50,524 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:07:50,525 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2024-11-17 08:07:50,526 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:07:50,536 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:07:50,536 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:07:50,536 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:07:50,536 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:07:50,540 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:07:50,540 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:07:50,545 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:07:50,560 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2024-11-17 08:07:50,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:07:50,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:07:50,562 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:07:50,564 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2024-11-17 08:07:50,565 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:07:50,578 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:07:50,579 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:07:50,579 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:07:50,579 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:07:50,592 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:07:50,592 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:07:50,610 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-17 08:07:50,643 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2024-11-17 08:07:50,643 INFO L444 ModelExtractionUtils]: 5 out of 19 variables were initially zero. Simplification set additionally 10 variables to zero. [2024-11-17 08:07:50,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:07:50,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:07:50,646 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:07:50,647 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2024-11-17 08:07:50,648 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-17 08:07:50,662 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-17 08:07:50,663 INFO L474 LassoAnalysis]: Proved termination. [2024-11-17 08:07:50,663 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_bubbleSort_~numbers#1.base)_1, ULTIMATE.start_bubbleSort_~i~0#1, ULTIMATE.start_bubbleSort_~j~0#1) = 1*v_rep(select #length ULTIMATE.start_bubbleSort_~numbers#1.base)_1 + 16*ULTIMATE.start_bubbleSort_~i~0#1 - 16*ULTIMATE.start_bubbleSort_~j~0#1 Supporting invariants [] [2024-11-17 08:07:50,679 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2024-11-17 08:07:50,689 INFO L156 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2024-11-17 08:07:50,691 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-17 08:07:50,692 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-17 08:07:50,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:07:50,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:07:50,718 INFO L255 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-17 08:07:50,718 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:07:50,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:07:50,736 INFO L255 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-17 08:07:50,737 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:07:50,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:07:50,784 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-11-17 08:07:50,784 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 23 transitions. cyclomatic complexity: 8 Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:07:50,815 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 23 transitions. cyclomatic complexity: 8. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 34 states and 46 transitions. Complement of second has 7 states. [2024-11-17 08:07:50,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-11-17 08:07:50,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:07:50,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2024-11-17 08:07:50,818 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 6 letters. Loop has 4 letters. [2024-11-17 08:07:50,819 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:07:50,819 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 10 letters. Loop has 4 letters. [2024-11-17 08:07:50,819 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:07:50,819 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 6 letters. Loop has 8 letters. [2024-11-17 08:07:50,819 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:07:50,819 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 46 transitions. [2024-11-17 08:07:50,820 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-11-17 08:07:50,822 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 23 states and 30 transitions. [2024-11-17 08:07:50,822 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2024-11-17 08:07:50,822 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2024-11-17 08:07:50,822 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 30 transitions. [2024-11-17 08:07:50,822 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:07:50,823 INFO L218 hiAutomatonCegarLoop]: Abstraction has 23 states and 30 transitions. [2024-11-17 08:07:50,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 30 transitions. [2024-11-17 08:07:50,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2024-11-17 08:07:50,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 22 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:07:50,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 30 transitions. [2024-11-17 08:07:50,824 INFO L240 hiAutomatonCegarLoop]: Abstraction has 23 states and 30 transitions. [2024-11-17 08:07:50,825 INFO L425 stractBuchiCegarLoop]: Abstraction has 23 states and 30 transitions. [2024-11-17 08:07:50,825 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-11-17 08:07:50,825 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 30 transitions. [2024-11-17 08:07:50,829 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-11-17 08:07:50,830 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:07:50,830 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:07:50,830 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:07:50,832 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-17 08:07:50,832 INFO L745 eck$LassoCheckResult]: Stem: 236#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 237#ULTIMATE.init_returnLabel#1 assume true;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; 238#L562 assume !(main_~array_size~0#1 < 1); 248#L565-1 call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 18446744073709551616);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;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; 249#L550 assume true; 254#L550-2 assume !!(bubbleSort_~i~0#1 >= 0);bubbleSort_~j~0#1 := 1; 257#L551 assume true; 256#L551-2 assume !(bubbleSort_~j~0#1 <= bubbleSort_~i~0#1); 250#L550-1 bubbleSort_#t~post7#1 := bubbleSort_~i~0#1;bubbleSort_~i~0#1 := bubbleSort_#t~post7#1 - 1;havoc bubbleSort_#t~post7#1; 251#L550 assume true; 252#L550-2 assume !!(bubbleSort_~i~0#1 >= 0);bubbleSort_~j~0#1 := 1; 244#L551 [2024-11-17 08:07:50,832 INFO L747 eck$LassoCheckResult]: Loop: 244#L551 assume true; 239#L551-2 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); 240#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); 243#L551-1 bubbleSort_#t~post6#1 := bubbleSort_~j~0#1;bubbleSort_~j~0#1 := 1 + bubbleSort_#t~post6#1;havoc bubbleSort_#t~post6#1; 244#L551 [2024-11-17 08:07:50,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:07:50,833 INFO L85 PathProgramCache]: Analyzing trace with hash -1592497015, now seen corresponding path program 2 times [2024-11-17 08:07:50,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:07:50,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723290244] [2024-11-17 08:07:50,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:07:50,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:07:50,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:07:50,939 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:07:50,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:07:50,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723290244] [2024-11-17 08:07:50,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723290244] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 08:07:50,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 08:07:50,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 08:07:50,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095577026] [2024-11-17 08:07:50,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 08:07:50,941 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-17 08:07:50,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:07:50,941 INFO L85 PathProgramCache]: Analyzing trace with hash 1291775, now seen corresponding path program 2 times [2024-11-17 08:07:50,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:07:50,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800359354] [2024-11-17 08:07:50,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:07:50,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:07:50,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:07:50,955 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:07:50,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:07:50,965 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:07:51,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:07:51,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 08:07:51,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-17 08:07:51,063 INFO L87 Difference]: Start difference. First operand 23 states and 30 transitions. cyclomatic complexity: 10 Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:07:51,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:07:51,095 INFO L93 Difference]: Finished difference Result 40 states and 51 transitions. [2024-11-17 08:07:51,096 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 51 transitions. [2024-11-17 08:07:51,097 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-11-17 08:07:51,098 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 35 states and 45 transitions. [2024-11-17 08:07:51,099 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2024-11-17 08:07:51,099 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2024-11-17 08:07:51,099 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 45 transitions. [2024-11-17 08:07:51,099 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:07:51,099 INFO L218 hiAutomatonCegarLoop]: Abstraction has 35 states and 45 transitions. [2024-11-17 08:07:51,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 45 transitions. [2024-11-17 08:07:51,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 26. [2024-11-17 08:07:51,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 25 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:07:51,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2024-11-17 08:07:51,104 INFO L240 hiAutomatonCegarLoop]: Abstraction has 26 states and 33 transitions. [2024-11-17 08:07:51,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 08:07:51,106 INFO L425 stractBuchiCegarLoop]: Abstraction has 26 states and 33 transitions. [2024-11-17 08:07:51,107 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-11-17 08:07:51,107 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 33 transitions. [2024-11-17 08:07:51,108 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-11-17 08:07:51,108 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:07:51,108 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:07:51,109 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:07:51,109 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-17 08:07:51,111 INFO L745 eck$LassoCheckResult]: Stem: 307#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 308#ULTIMATE.init_returnLabel#1 assume true;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; 309#L562 assume !(main_~array_size~0#1 < 1); 319#L565-1 call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 18446744073709551616);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;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; 320#L550 assume true; 323#L550-2 assume !!(bubbleSort_~i~0#1 >= 0);bubbleSort_~j~0#1 := 1; 318#L551 assume true; 312#L551-2 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); 313#L552 assume !(bubbleSort_#t~mem2#1 > bubbleSort_#t~mem3#1);havoc bubbleSort_#t~mem2#1;havoc bubbleSort_#t~mem3#1; 316#L551-1 bubbleSort_#t~post6#1 := bubbleSort_~j~0#1;bubbleSort_~j~0#1 := 1 + bubbleSort_#t~post6#1;havoc bubbleSort_#t~post6#1; 317#L551 assume true; 327#L551-2 assume !(bubbleSort_~j~0#1 <= bubbleSort_~i~0#1); 321#L550-1 bubbleSort_#t~post7#1 := bubbleSort_~i~0#1;bubbleSort_~i~0#1 := bubbleSort_#t~post7#1 - 1;havoc bubbleSort_#t~post7#1; 322#L550 assume true; 324#L550-2 assume !!(bubbleSort_~i~0#1 >= 0);bubbleSort_~j~0#1 := 1; 315#L551 [2024-11-17 08:07:51,111 INFO L747 eck$LassoCheckResult]: Loop: 315#L551 assume true; 310#L551-2 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); 311#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); 314#L551-1 bubbleSort_#t~post6#1 := bubbleSort_~j~0#1;bubbleSort_~j~0#1 := 1 + bubbleSort_#t~post6#1;havoc bubbleSort_#t~post6#1; 315#L551 [2024-11-17 08:07:51,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:07:51,111 INFO L85 PathProgramCache]: Analyzing trace with hash 1217183372, now seen corresponding path program 1 times [2024-11-17 08:07:51,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:07:51,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597782196] [2024-11-17 08:07:51,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:07:51,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:07:51,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:07:51,140 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:07:51,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:07:51,151 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:07:51,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:07:51,151 INFO L85 PathProgramCache]: Analyzing trace with hash 1291775, now seen corresponding path program 3 times [2024-11-17 08:07:51,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:07:51,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157635034] [2024-11-17 08:07:51,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:07:51,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:07:51,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:07:51,157 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:07:51,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:07:51,162 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:07:51,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:07:51,162 INFO L85 PathProgramCache]: Analyzing trace with hash -1615317238, now seen corresponding path program 1 times [2024-11-17 08:07:51,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:07:51,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665697935] [2024-11-17 08:07:51,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:07:51,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:07:51,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:07:51,307 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:07:51,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:07:51,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665697935] [2024-11-17 08:07:51,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665697935] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 08:07:51,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [762441401] [2024-11-17 08:07:51,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:07:51,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 08:07:51,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:07:51,311 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 08:07:51,312 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-11-17 08:07:51,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:07:51,370 INFO L255 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-17 08:07:51,371 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:07:51,406 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:07:51,406 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 08:07:51,459 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:07:51,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [762441401] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 08:07:51,460 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 08:07:51,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 9 [2024-11-17 08:07:51,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673428062] [2024-11-17 08:07:51,460 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 08:07:51,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:07:51,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-17 08:07:51,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-11-17 08:07:51,555 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. cyclomatic complexity: 10 Second operand has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:07:51,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:07:51,603 INFO L93 Difference]: Finished difference Result 56 states and 70 transitions. [2024-11-17 08:07:51,603 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 56 states and 70 transitions. [2024-11-17 08:07:51,604 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-11-17 08:07:51,604 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 56 states to 47 states and 60 transitions. [2024-11-17 08:07:51,605 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2024-11-17 08:07:51,605 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2024-11-17 08:07:51,605 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 60 transitions. [2024-11-17 08:07:51,605 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:07:51,605 INFO L218 hiAutomatonCegarLoop]: Abstraction has 47 states and 60 transitions. [2024-11-17 08:07:51,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states and 60 transitions. [2024-11-17 08:07:51,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 34. [2024-11-17 08:07:51,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 1.2647058823529411) internal successors, (43), 33 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:07:51,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 43 transitions. [2024-11-17 08:07:51,614 INFO L240 hiAutomatonCegarLoop]: Abstraction has 34 states and 43 transitions. [2024-11-17 08:07:51,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-17 08:07:51,615 INFO L425 stractBuchiCegarLoop]: Abstraction has 34 states and 43 transitions. [2024-11-17 08:07:51,615 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-11-17 08:07:51,615 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 43 transitions. [2024-11-17 08:07:51,615 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-11-17 08:07:51,615 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:07:51,615 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:07:51,616 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-11-17 08:07:51,616 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-17 08:07:51,616 INFO L745 eck$LassoCheckResult]: Stem: 511#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 512#ULTIMATE.init_returnLabel#1 assume true;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; 513#L562 assume !(main_~array_size~0#1 < 1); 523#L565-1 call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 18446744073709551616);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;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; 524#L550 assume true; 527#L550-2 assume !!(bubbleSort_~i~0#1 >= 0);bubbleSort_~j~0#1 := 1; 544#L551 assume true; 543#L551-2 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); 542#L552 assume !(bubbleSort_#t~mem2#1 > bubbleSort_#t~mem3#1);havoc bubbleSort_#t~mem2#1;havoc bubbleSort_#t~mem3#1; 541#L551-1 bubbleSort_#t~post6#1 := bubbleSort_~j~0#1;bubbleSort_~j~0#1 := 1 + bubbleSort_#t~post6#1;havoc bubbleSort_#t~post6#1; 522#L551 assume true; 516#L551-2 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); 517#L552 assume !(bubbleSort_#t~mem2#1 > bubbleSort_#t~mem3#1);havoc bubbleSort_#t~mem2#1;havoc bubbleSort_#t~mem3#1; 531#L551-1 bubbleSort_#t~post6#1 := bubbleSort_~j~0#1;bubbleSort_~j~0#1 := 1 + bubbleSort_#t~post6#1;havoc bubbleSort_#t~post6#1; 535#L551 assume true; 532#L551-2 assume !(bubbleSort_~j~0#1 <= bubbleSort_~i~0#1); 525#L550-1 bubbleSort_#t~post7#1 := bubbleSort_~i~0#1;bubbleSort_~i~0#1 := bubbleSort_#t~post7#1 - 1;havoc bubbleSort_#t~post7#1; 526#L550 assume true; 528#L550-2 assume !!(bubbleSort_~i~0#1 >= 0);bubbleSort_~j~0#1 := 1; 519#L551 [2024-11-17 08:07:51,616 INFO L747 eck$LassoCheckResult]: Loop: 519#L551 assume true; 514#L551-2 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); 515#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); 518#L551-1 bubbleSort_#t~post6#1 := bubbleSort_~j~0#1;bubbleSort_~j~0#1 := 1 + bubbleSort_#t~post6#1;havoc bubbleSort_#t~post6#1; 519#L551 [2024-11-17 08:07:51,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:07:51,618 INFO L85 PathProgramCache]: Analyzing trace with hash -139045105, now seen corresponding path program 2 times [2024-11-17 08:07:51,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:07:51,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788351065] [2024-11-17 08:07:51,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:07:51,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:07:51,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:07:51,641 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:07:51,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:07:51,651 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:07:51,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:07:51,652 INFO L85 PathProgramCache]: Analyzing trace with hash 1291775, now seen corresponding path program 4 times [2024-11-17 08:07:51,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:07:51,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745231223] [2024-11-17 08:07:51,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:07:51,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:07:51,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:07:51,657 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:07:51,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:07:51,660 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:07:51,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:07:51,661 INFO L85 PathProgramCache]: Analyzing trace with hash -141830643, now seen corresponding path program 2 times [2024-11-17 08:07:51,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:07:51,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69705477] [2024-11-17 08:07:51,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:07:51,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:07:51,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:07:51,743 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2024-11-17 08:07:52,138 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:07:52,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:07:52,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69705477] [2024-11-17 08:07:52,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69705477] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 08:07:52,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1178160887] [2024-11-17 08:07:52,139 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-17 08:07:52,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 08:07:52,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:07:52,143 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 08:07:52,146 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-11-17 08:07:52,211 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-17 08:07:52,211 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 08:07:52,212 INFO L255 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-17 08:07:52,214 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:07:52,346 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 08:07:52,346 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-11-17 08:07:52,357 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-17 08:07:52,358 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 08:07:52,464 INFO L349 Elim1Store]: treesize reduction 13, result has 60.6 percent of original size [2024-11-17 08:07:52,464 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-11-17 08:07:52,509 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 5 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-17 08:07:52,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1178160887] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 08:07:52,510 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 08:07:52,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 7] total 16 [2024-11-17 08:07:52,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743440032] [2024-11-17 08:07:52,512 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 08:07:52,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:07:52,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-17 08:07:52,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2024-11-17 08:07:52,612 INFO L87 Difference]: Start difference. First operand 34 states and 43 transitions. cyclomatic complexity: 12 Second operand has 16 states, 16 states have (on average 2.875) internal successors, (46), 16 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:07:52,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:07:52,711 INFO L93 Difference]: Finished difference Result 70 states and 89 transitions. [2024-11-17 08:07:52,712 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 70 states and 89 transitions. [2024-11-17 08:07:52,713 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2024-11-17 08:07:52,715 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 70 states to 70 states and 89 transitions. [2024-11-17 08:07:52,715 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2024-11-17 08:07:52,718 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2024-11-17 08:07:52,718 INFO L73 IsDeterministic]: Start isDeterministic. Operand 70 states and 89 transitions. [2024-11-17 08:07:52,719 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:07:52,719 INFO L218 hiAutomatonCegarLoop]: Abstraction has 70 states and 89 transitions. [2024-11-17 08:07:52,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states and 89 transitions. [2024-11-17 08:07:52,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 53. [2024-11-17 08:07:52,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 53 states have (on average 1.2641509433962264) internal successors, (67), 52 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:07:52,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 67 transitions. [2024-11-17 08:07:52,724 INFO L240 hiAutomatonCegarLoop]: Abstraction has 53 states and 67 transitions. [2024-11-17 08:07:52,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-17 08:07:52,725 INFO L425 stractBuchiCegarLoop]: Abstraction has 53 states and 67 transitions. [2024-11-17 08:07:52,725 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-11-17 08:07:52,725 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states and 67 transitions. [2024-11-17 08:07:52,732 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-11-17 08:07:52,732 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:07:52,732 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:07:52,733 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:07:52,733 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-17 08:07:52,733 INFO L745 eck$LassoCheckResult]: Stem: 770#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 771#ULTIMATE.init_returnLabel#1 assume true;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; 772#L562 assume !(main_~array_size~0#1 < 1); 782#L565-1 call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 18446744073709551616);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;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; 783#L550 assume true; 786#L550-2 assume !!(bubbleSort_~i~0#1 >= 0);bubbleSort_~j~0#1 := 1; 791#L551 assume true; 775#L551-2 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); 776#L552 assume !(bubbleSort_#t~mem2#1 > bubbleSort_#t~mem3#1);havoc bubbleSort_#t~mem2#1;havoc bubbleSort_#t~mem3#1; 779#L551-1 bubbleSort_#t~post6#1 := bubbleSort_~j~0#1;bubbleSort_~j~0#1 := 1 + bubbleSort_#t~post6#1;havoc bubbleSort_#t~post6#1; 780#L551 assume true; 781#L551-2 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); 811#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); 810#L551-1 bubbleSort_#t~post6#1 := bubbleSort_~j~0#1;bubbleSort_~j~0#1 := 1 + bubbleSort_#t~post6#1;havoc bubbleSort_#t~post6#1; 809#L551 assume true; 800#L551-2 assume !(bubbleSort_~j~0#1 <= bubbleSort_~i~0#1); 784#L550-1 bubbleSort_#t~post7#1 := bubbleSort_~i~0#1;bubbleSort_~i~0#1 := bubbleSort_#t~post7#1 - 1;havoc bubbleSort_#t~post7#1; 785#L550 assume true; 790#L550-2 assume !!(bubbleSort_~i~0#1 >= 0);bubbleSort_~j~0#1 := 1; 778#L551 [2024-11-17 08:07:52,733 INFO L747 eck$LassoCheckResult]: Loop: 778#L551 assume true; 773#L551-2 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); 774#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); 777#L551-1 bubbleSort_#t~post6#1 := bubbleSort_~j~0#1;bubbleSort_~j~0#1 := 1 + bubbleSort_#t~post6#1;havoc bubbleSort_#t~post6#1; 778#L551 [2024-11-17 08:07:52,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:07:52,739 INFO L85 PathProgramCache]: Analyzing trace with hash -1026548786, now seen corresponding path program 3 times [2024-11-17 08:07:52,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:07:52,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313758486] [2024-11-17 08:07:52,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:07:52,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:07:52,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:07:52,761 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:07:52,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:07:52,776 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:07:52,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:07:52,777 INFO L85 PathProgramCache]: Analyzing trace with hash 1291775, now seen corresponding path program 5 times [2024-11-17 08:07:52,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:07:52,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900832104] [2024-11-17 08:07:52,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:07:52,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:07:52,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:07:52,784 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:07:52,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:07:52,787 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:07:52,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:07:52,788 INFO L85 PathProgramCache]: Analyzing trace with hash 1655120716, now seen corresponding path program 4 times [2024-11-17 08:07:52,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:07:52,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408092917] [2024-11-17 08:07:52,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:07:52,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:07:52,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:07:52,816 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:07:52,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:07:52,839 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:07:53,287 INFO L204 LassoAnalysis]: Preferences: [2024-11-17 08:07:53,288 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-17 08:07:53,288 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-17 08:07:53,288 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-17 08:07:53,288 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-17 08:07:53,288 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:07:53,288 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-17 08:07:53,288 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-17 08:07:53,288 INFO L132 ssoRankerPreferences]: Filename of dumped script: bubblesort-alloca-1.i_Iteration7_Lasso [2024-11-17 08:07:53,288 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-17 08:07:53,288 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-17 08:07:53,290 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:07:53,293 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:07:53,295 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:07:53,297 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:07:53,299 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:07:53,521 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:07:53,524 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:07:53,527 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:07:53,529 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:07:53,530 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:07:53,532 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:07:53,534 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:07:53,536 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:07:53,538 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:07:53,540 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:07:53,543 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:07:53,546 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:07:53,771 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-17 08:07:53,772 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-17 08:07:53,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:07:53,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:07:53,774 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:07:53,775 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2024-11-17 08:07:53,777 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:07:53,789 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:07:53,790 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:07:53,790 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:07:53,790 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:07:53,790 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:07:53,790 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:07:53,790 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:07:53,793 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:07:53,809 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2024-11-17 08:07:53,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:07:53,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:07:53,811 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:07:53,814 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2024-11-17 08:07:53,814 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:07:53,827 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:07:53,827 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:07:53,827 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:07:53,827 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:07:53,827 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:07:53,827 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:07:53,827 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:07:53,831 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:07:53,847 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2024-11-17 08:07:53,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:07:53,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:07:53,849 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:07:53,850 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2024-11-17 08:07:53,852 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:07:53,864 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:07:53,864 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:07:53,864 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:07:53,864 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:07:53,865 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:07:53,865 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:07:53,865 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:07:53,866 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:07:53,879 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-11-17 08:07:53,880 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:07:53,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:07:53,881 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:07:53,882 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2024-11-17 08:07:53,882 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:07:53,892 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:07:53,892 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:07:53,892 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:07:53,892 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:07:53,892 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:07:53,893 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:07:53,893 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:07:53,894 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:07:53,905 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2024-11-17 08:07:53,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:07:53,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:07:53,906 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:07:53,907 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2024-11-17 08:07:53,908 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:07:53,917 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:07:53,918 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:07:53,918 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:07:53,918 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:07:53,920 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:07:53,920 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:07:53,924 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:07:53,939 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2024-11-17 08:07:53,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:07:53,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:07:53,953 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:07:53,955 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2024-11-17 08:07:53,956 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:07:53,968 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:07:53,968 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:07:53,968 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:07:53,968 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:07:53,970 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:07:53,970 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:07:53,973 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:07:53,984 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2024-11-17 08:07:53,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:07:53,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:07:53,985 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:07:53,986 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2024-11-17 08:07:53,987 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:07:53,997 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:07:53,997 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:07:53,997 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:07:53,997 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:07:54,001 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:07:54,001 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:07:54,008 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:07:54,021 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2024-11-17 08:07:54,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:07:54,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:07:54,023 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:07:54,024 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2024-11-17 08:07:54,025 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:07:54,035 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:07:54,035 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:07:54,035 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:07:54,035 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:07:54,037 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:07:54,037 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:07:54,039 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:07:54,049 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2024-11-17 08:07:54,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:07:54,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:07:54,051 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:07:54,052 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2024-11-17 08:07:54,052 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:07:54,062 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:07:54,063 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:07:54,063 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:07:54,063 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:07:54,068 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:07:54,068 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:07:54,079 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-17 08:07:54,109 INFO L443 ModelExtractionUtils]: Simplification made 13 calls to the SMT solver. [2024-11-17 08:07:54,109 INFO L444 ModelExtractionUtils]: 5 out of 19 variables were initially zero. Simplification set additionally 10 variables to zero. [2024-11-17 08:07:54,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:07:54,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:07:54,112 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:07:54,113 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2024-11-17 08:07:54,114 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-17 08:07:54,131 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-17 08:07:54,131 INFO L474 LassoAnalysis]: Proved termination. [2024-11-17 08:07:54,132 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_bubbleSort_~numbers#1.base)_2, ULTIMATE.start_bubbleSort_~numbers#1.offset, ULTIMATE.start_bubbleSort_~j~0#1) = 1*v_rep(select #length ULTIMATE.start_bubbleSort_~numbers#1.base)_2 - 1*ULTIMATE.start_bubbleSort_~numbers#1.offset - 4*ULTIMATE.start_bubbleSort_~j~0#1 Supporting invariants [] [2024-11-17 08:07:54,147 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2024-11-17 08:07:54,163 INFO L156 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2024-11-17 08:07:54,165 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~numbers!offset [2024-11-17 08:07:54,165 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-17 08:07:54,165 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-17 08:07:54,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:07:54,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:07:54,205 INFO L255 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-17 08:07:54,206 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:07:54,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:07:54,243 INFO L255 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-17 08:07:54,245 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:07:54,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:07:54,270 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-11-17 08:07:54,271 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 53 states and 67 transitions. cyclomatic complexity: 18 Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:07:54,293 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 53 states and 67 transitions. cyclomatic complexity: 18. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 64 states and 82 transitions. Complement of second has 7 states. [2024-11-17 08:07:54,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-11-17 08:07:54,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:07:54,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2024-11-17 08:07:54,296 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 19 letters. Loop has 4 letters. [2024-11-17 08:07:54,297 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:07:54,297 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-17 08:07:54,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:07:54,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:07:54,329 INFO L255 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-17 08:07:54,330 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:07:54,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:07:54,366 INFO L255 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-17 08:07:54,366 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:07:54,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:07:54,394 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-11-17 08:07:54,394 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 53 states and 67 transitions. cyclomatic complexity: 18 Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:07:54,415 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 53 states and 67 transitions. cyclomatic complexity: 18. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 64 states and 82 transitions. Complement of second has 7 states. [2024-11-17 08:07:54,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-11-17 08:07:54,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:07:54,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2024-11-17 08:07:54,416 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 19 letters. Loop has 4 letters. [2024-11-17 08:07:54,416 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:07:54,416 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-17 08:07:54,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:07:54,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:07:54,450 INFO L255 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-17 08:07:54,451 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:07:54,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:07:54,484 INFO L255 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-17 08:07:54,485 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:07:54,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:07:54,511 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-11-17 08:07:54,511 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 53 states and 67 transitions. cyclomatic complexity: 18 Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:07:54,535 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 53 states and 67 transitions. cyclomatic complexity: 18. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 82 states and 108 transitions. Complement of second has 6 states. [2024-11-17 08:07:54,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-11-17 08:07:54,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:07:54,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 20 transitions. [2024-11-17 08:07:54,538 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 19 letters. Loop has 4 letters. [2024-11-17 08:07:54,539 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:07:54,539 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 23 letters. Loop has 4 letters. [2024-11-17 08:07:54,539 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:07:54,539 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 19 letters. Loop has 8 letters. [2024-11-17 08:07:54,539 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:07:54,539 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 82 states and 108 transitions. [2024-11-17 08:07:54,541 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-11-17 08:07:54,541 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 82 states to 0 states and 0 transitions. [2024-11-17 08:07:54,543 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2024-11-17 08:07:54,543 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2024-11-17 08:07:54,543 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2024-11-17 08:07:54,543 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-17 08:07:54,543 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-17 08:07:54,543 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-17 08:07:54,543 INFO L425 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-17 08:07:54,543 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-11-17 08:07:54,543 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2024-11-17 08:07:54,543 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-11-17 08:07:54,544 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2024-11-17 08:07:54,549 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 17.11 08:07:54 BoogieIcfgContainer [2024-11-17 08:07:54,550 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-11-17 08:07:54,551 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-17 08:07:54,551 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-17 08:07:54,551 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-17 08:07:54,551 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 08:07:47" (3/4) ... [2024-11-17 08:07:54,553 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-17 08:07:54,555 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-17 08:07:54,556 INFO L158 Benchmark]: Toolchain (without parser) took 7470.35ms. Allocated memory was 163.6MB in the beginning and 207.6MB in the end (delta: 44.0MB). Free memory was 112.5MB in the beginning and 123.0MB in the end (delta: -10.5MB). Peak memory consumption was 35.1MB. Max. memory is 16.1GB. [2024-11-17 08:07:54,556 INFO L158 Benchmark]: CDTParser took 0.60ms. Allocated memory is still 163.6MB. Free memory is still 132.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-17 08:07:54,557 INFO L158 Benchmark]: CACSL2BoogieTranslator took 431.05ms. Allocated memory is still 163.6MB. Free memory was 112.1MB in the beginning and 93.8MB in the end (delta: 18.3MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-17 08:07:54,558 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.06ms. Allocated memory is still 163.6MB. Free memory was 93.8MB in the beginning and 92.0MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-17 08:07:54,558 INFO L158 Benchmark]: Boogie Preprocessor took 39.08ms. Allocated memory is still 163.6MB. Free memory was 92.0MB in the beginning and 90.4MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-17 08:07:54,559 INFO L158 Benchmark]: IcfgBuilder took 402.16ms. Allocated memory is still 163.6MB. Free memory was 90.0MB in the beginning and 78.1MB in the end (delta: 11.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-17 08:07:54,559 INFO L158 Benchmark]: BuchiAutomizer took 6549.65ms. Allocated memory was 163.6MB in the beginning and 207.6MB in the end (delta: 44.0MB). Free memory was 78.1MB in the beginning and 124.0MB in the end (delta: -45.9MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-17 08:07:54,559 INFO L158 Benchmark]: Witness Printer took 4.82ms. Allocated memory is still 207.6MB. Free memory was 124.0MB in the beginning and 123.0MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-17 08:07:54,561 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.60ms. Allocated memory is still 163.6MB. Free memory is still 132.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 431.05ms. Allocated memory is still 163.6MB. Free memory was 112.1MB in the beginning and 93.8MB in the end (delta: 18.3MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.06ms. Allocated memory is still 163.6MB. Free memory was 93.8MB in the beginning and 92.0MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 39.08ms. Allocated memory is still 163.6MB. Free memory was 92.0MB in the beginning and 90.4MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 402.16ms. Allocated memory is still 163.6MB. Free memory was 90.0MB in the beginning and 78.1MB in the end (delta: 11.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * BuchiAutomizer took 6549.65ms. Allocated memory was 163.6MB in the beginning and 207.6MB in the end (delta: 44.0MB). Free memory was 78.1MB in the beginning and 124.0MB in the end (delta: -45.9MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 4.82ms. Allocated memory is still 207.6MB. Free memory was 124.0MB in the beginning and 123.0MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~numbers!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 7 terminating modules (4 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function (((long) 2 * i) + 1) and consists of 4 locations. One deterministic module has affine ranking function null and consists of 4 locations. One nondeterministic module has affine ranking function null and consists of 4 locations. 4 modules have a trivial ranking function, the largest among these consists of 16 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.4s and 8 iterations. TraceHistogramMax:3. Analysis of lassos took 5.3s. Construction of modules took 0.1s. Büchi inclusion checks took 0.8s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 5. Automata minimization 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 39 StatesRemovedByMinimization, 3 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, 114 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 109 mSDsluCounter, 269 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 161 mSDsCounter, 17 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 193 IncrementalHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 17 mSolverCounterUnsat, 108 mSDtfsCounter, 193 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: 25ms VariablesStem: 1 VariablesLoop: 1 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-11-17 08:07:54,587 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2024-11-17 08:07:54,789 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2024-11-17 08:07:54,989 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2024-11-17 08:07:55,190 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