./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/array-memsafety/bubblesort-alloca-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- 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/array-memsafety/bubblesort-alloca-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 71daa4447a811360729951159d42c752715aafb50c3ad4dcb2ed5d242a4f4a78 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-17 08:13:05,859 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-17 08:13:05,930 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2024-11-17 08:13:05,936 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-17 08:13:05,938 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-17 08:13:05,939 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2024-11-17 08:13:05,962 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-17 08:13:05,963 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-17 08:13:05,963 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-17 08:13:05,964 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-17 08:13:05,964 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-17 08:13:05,965 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-17 08:13:05,965 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-17 08:13:05,966 INFO L153 SettingsManager]: * Use SBE=true [2024-11-17 08:13:05,966 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-17 08:13:05,966 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-17 08:13:05,967 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-17 08:13:05,967 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-17 08:13:05,967 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-17 08:13:05,968 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-17 08:13:05,968 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-17 08:13:05,969 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-17 08:13:05,970 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-17 08:13:05,970 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-17 08:13:05,970 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-17 08:13:05,971 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-17 08:13:05,971 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-17 08:13:05,971 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-17 08:13:05,971 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-17 08:13:05,972 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-17 08:13:05,972 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-17 08:13:05,972 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-17 08:13:05,973 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-17 08:13:05,973 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-17 08:13:05,975 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-17 08:13:05,975 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-17 08:13:05,976 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-17 08:13:05,976 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-17 08:13:05,976 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-17 08:13:05,977 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-17 08:13:05,977 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 71daa4447a811360729951159d42c752715aafb50c3ad4dcb2ed5d242a4f4a78 [2024-11-17 08:13:06,227 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-17 08:13:06,252 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-17 08:13:06,255 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-17 08:13:06,256 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-17 08:13:06,257 INFO L274 PluginConnector]: CDTParser initialized [2024-11-17 08:13:06,258 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-memsafety/bubblesort-alloca-2.i [2024-11-17 08:13:07,690 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-17 08:13:07,909 INFO L384 CDTParser]: Found 1 translation units. [2024-11-17 08:13:07,910 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/bubblesort-alloca-2.i [2024-11-17 08:13:07,923 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb5e6ac6c/3b4e7e3c3698468fb5d6b8068e6747fc/FLAG0e257e2d5 [2024-11-17 08:13:07,935 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb5e6ac6c/3b4e7e3c3698468fb5d6b8068e6747fc [2024-11-17 08:13:07,939 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-17 08:13:07,940 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-17 08:13:07,941 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-17 08:13:07,941 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-17 08:13:07,946 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-17 08:13:07,946 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 08:13:07" (1/1) ... [2024-11-17 08:13:07,947 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40f0a8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:13:07, skipping insertion in model container [2024-11-17 08:13:07,947 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 08:13:07" (1/1) ... [2024-11-17 08:13:07,985 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-17 08:13:08,268 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 08:13:08,277 INFO L200 MainTranslator]: Completed pre-run [2024-11-17 08:13:08,317 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 08:13:08,346 INFO L204 MainTranslator]: Completed translation [2024-11-17 08:13:08,346 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:13:08 WrapperNode [2024-11-17 08:13:08,346 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-17 08:13:08,347 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-17 08:13:08,347 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-17 08:13:08,347 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-17 08:13:08,353 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:13:08" (1/1) ... [2024-11-17 08:13:08,367 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:13:08" (1/1) ... [2024-11-17 08:13:08,385 INFO L138 Inliner]: procedures = 116, calls = 13, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 62 [2024-11-17 08:13:08,386 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-17 08:13:08,388 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-17 08:13:08,388 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-17 08:13:08,388 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-17 08:13:08,397 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:13:08" (1/1) ... [2024-11-17 08:13:08,397 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:13:08" (1/1) ... [2024-11-17 08:13:08,400 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:13:08" (1/1) ... [2024-11-17 08:13:08,412 INFO L175 MemorySlicer]: Split 7 memory accesses to 1 slices as follows [7]. 100 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0]. The 3 writes are split as follows [3]. [2024-11-17 08:13:08,413 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:13:08" (1/1) ... [2024-11-17 08:13:08,413 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:13:08" (1/1) ... [2024-11-17 08:13:08,418 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:13:08" (1/1) ... [2024-11-17 08:13:08,418 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:13:08" (1/1) ... [2024-11-17 08:13:08,419 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:13:08" (1/1) ... [2024-11-17 08:13:08,420 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:13:08" (1/1) ... [2024-11-17 08:13:08,422 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-17 08:13:08,423 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-17 08:13:08,423 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-17 08:13:08,423 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-17 08:13:08,424 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:13:08" (1/1) ... [2024-11-17 08:13:08,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:13:08,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:13:08,462 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:13:08,466 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:13:08,516 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-17 08:13:08,516 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-17 08:13:08,516 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-17 08:13:08,516 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-17 08:13:08,516 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-17 08:13:08,517 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-17 08:13:08,625 INFO L256 CfgBuilder]: Building ICFG [2024-11-17 08:13:08,628 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-17 08:13:08,773 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L530: 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:13:08,791 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-17 08:13:08,791 INFO L307 CfgBuilder]: Performing block encoding [2024-11-17 08:13:08,807 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-17 08:13:08,808 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-17 08:13:08,810 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 08:13:08 BoogieIcfgContainer [2024-11-17 08:13:08,810 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-17 08:13:08,812 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-17 08:13:08,812 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-17 08:13:08,815 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-17 08:13:08,816 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-17 08:13:08,816 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 17.11 08:13:07" (1/3) ... [2024-11-17 08:13:08,817 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2242562d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.11 08:13:08, skipping insertion in model container [2024-11-17 08:13:08,817 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-17 08:13:08,818 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:13:08" (2/3) ... [2024-11-17 08:13:08,818 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2242562d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.11 08:13:08, skipping insertion in model container [2024-11-17 08:13:08,819 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-17 08:13:08,819 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 08:13:08" (3/3) ... [2024-11-17 08:13:08,821 INFO L332 chiAutomizerObserver]: Analyzing ICFG bubblesort-alloca-2.i [2024-11-17 08:13:08,874 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-11-17 08:13:08,874 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-11-17 08:13:08,875 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-17 08:13:08,875 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-17 08:13:08,876 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-17 08:13:08,876 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-11-17 08:13:08,876 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-17 08:13:08,877 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-17 08:13:08,881 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 18 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 17 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:13:08,899 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2024-11-17 08:13:08,899 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:13:08,899 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:13:08,904 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2024-11-17 08:13:08,904 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-17 08:13:08,905 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-17 08:13:08,906 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 18 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 17 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:13:08,908 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2024-11-17 08:13:08,908 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:13:08,908 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:13:08,908 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2024-11-17 08:13:08,908 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-17 08:13:08,914 INFO L745 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 13#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_#t~nondet10#1, main_#t~post11#1, main_~k~0#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet8#1;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 11#L527true assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 15#L530-1true call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~k~0#1 := 0; 2#L532-1true [2024-11-17 08:13:08,914 INFO L747 eck$LassoCheckResult]: Loop: 2#L532-1true assume true; 5#L532-2true assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet10#1;call write~int#0(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1;main_#t~post11#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 2#L532-1true [2024-11-17 08:13:08,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:13:08,923 INFO L85 PathProgramCache]: Analyzing trace with hash 1876798, now seen corresponding path program 1 times [2024-11-17 08:13:08,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:13:08,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573205623] [2024-11-17 08:13:08,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:13:08,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:13:09,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:13:09,050 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:13:09,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:13:09,086 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:13:09,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:13:09,090 INFO L85 PathProgramCache]: Analyzing trace with hash 1760, now seen corresponding path program 1 times [2024-11-17 08:13:09,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:13:09,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108689837] [2024-11-17 08:13:09,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:13:09,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:13:09,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:13:09,109 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:13:09,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:13:09,124 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:13:09,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:13:09,130 INFO L85 PathProgramCache]: Analyzing trace with hash 1803603677, now seen corresponding path program 1 times [2024-11-17 08:13:09,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:13:09,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221446970] [2024-11-17 08:13:09,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:13:09,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:13:09,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:13:09,160 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:13:09,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:13:09,183 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:13:09,505 INFO L204 LassoAnalysis]: Preferences: [2024-11-17 08:13:09,506 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-17 08:13:09,506 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-17 08:13:09,507 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-17 08:13:09,507 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-17 08:13:09,507 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:13:09,508 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-17 08:13:09,508 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-17 08:13:09,508 INFO L132 ssoRankerPreferences]: Filename of dumped script: bubblesort-alloca-2.i_Iteration1_Lasso [2024-11-17 08:13:09,508 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-17 08:13:09,509 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-17 08:13:09,527 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:13:09,537 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:13:09,541 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:13:09,547 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:13:09,701 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:13:09,705 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:13:09,708 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:13:09,710 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:13:09,714 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:13:10,035 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-17 08:13:10,040 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-17 08:13:10,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:13:10,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:13:10,044 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:13:10,046 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:13:10,047 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:13:10,061 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:13:10,061 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:13:10,062 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:13:10,062 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:13:10,062 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:13:10,064 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:13:10,064 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:13:10,067 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:13:10,082 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:13:10,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:13:10,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:13:10,085 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:13:10,087 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:13:10,088 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:13:10,101 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:13:10,101 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:13:10,101 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:13:10,102 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:13:10,102 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:13:10,102 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:13:10,102 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:13:10,104 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:13:10,118 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2024-11-17 08:13:10,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:13:10,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:13:10,119 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:13:10,120 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:13:10,121 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:13:10,134 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:13:10,134 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:13:10,134 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:13:10,135 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:13:10,137 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:13:10,137 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:13:10,141 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:13:10,155 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2024-11-17 08:13:10,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:13:10,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:13:10,158 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:13:10,160 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:13:10,161 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:13:10,174 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:13:10,174 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:13:10,174 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:13:10,174 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:13:10,183 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:13:10,183 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:13:10,195 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-17 08:13:10,229 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2024-11-17 08:13:10,229 INFO L444 ModelExtractionUtils]: 3 out of 19 variables were initially zero. Simplification set additionally 13 variables to zero. [2024-11-17 08:13:10,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:13:10,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:13:10,330 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:13:10,332 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:13:10,334 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-17 08:13:10,352 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-17 08:13:10,352 INFO L474 LassoAnalysis]: Proved termination. [2024-11-17 08:13:10,353 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~array_size~0#1, ULTIMATE.start_main_~k~0#1) = 1*ULTIMATE.start_main_~array_size~0#1 - 1*ULTIMATE.start_main_~k~0#1 Supporting invariants [] [2024-11-17 08:13:10,371 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2024-11-17 08:13:10,381 INFO L156 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2024-11-17 08:13:10,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:13:10,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:13:10,437 INFO L255 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-17 08:13:10,439 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:13:10,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:13:10,457 INFO L255 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-17 08:13:10,457 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:13:10,460 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:13:10,485 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2024-11-17 08:13:10,487 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 18 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 17 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) Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:13:10,512 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 18 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 17 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). Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 32 states and 45 transitions. Complement of second has 6 states. [2024-11-17 08:13:10,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2024-11-17 08:13:10,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:13:10,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 24 transitions. [2024-11-17 08:13:10,520 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 24 transitions. Stem has 4 letters. Loop has 2 letters. [2024-11-17 08:13:10,521 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:13:10,521 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 24 transitions. Stem has 6 letters. Loop has 2 letters. [2024-11-17 08:13:10,521 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:13:10,522 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 24 transitions. Stem has 4 letters. Loop has 4 letters. [2024-11-17 08:13:10,522 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:13:10,522 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 45 transitions. [2024-11-17 08:13:10,524 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2024-11-17 08:13:10,527 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 16 states and 22 transitions. [2024-11-17 08:13:10,528 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2024-11-17 08:13:10,528 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2024-11-17 08:13:10,529 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 22 transitions. [2024-11-17 08:13:10,529 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:13:10,529 INFO L218 hiAutomatonCegarLoop]: Abstraction has 16 states and 22 transitions. [2024-11-17 08:13:10,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 22 transitions. [2024-11-17 08:13:10,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2024-11-17 08:13:10,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.375) internal successors, (22), 15 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:13:10,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 22 transitions. [2024-11-17 08:13:10,554 INFO L240 hiAutomatonCegarLoop]: Abstraction has 16 states and 22 transitions. [2024-11-17 08:13:10,554 INFO L425 stractBuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2024-11-17 08:13:10,554 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-17 08:13:10,554 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 22 transitions. [2024-11-17 08:13:10,556 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2024-11-17 08:13:10,556 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:13:10,557 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:13:10,557 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:13:10,557 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-17 08:13:10,558 INFO L745 eck$LassoCheckResult]: Stem: 107#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 108#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_#t~nondet10#1, main_#t~post11#1, main_~k~0#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet8#1;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 114#L527 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 115#L530-1 call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~k~0#1 := 0; 103#L532-1 assume true; 105#L532-2 assume !(main_~k~0#1 < main_~array_size~0#1); 109#L532 havoc main_~k~0#1;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; 111#L515 [2024-11-17 08:13:10,558 INFO L747 eck$LassoCheckResult]: Loop: 111#L515 assume true; 112#L515-2 assume !!(bubbleSort_~i~0#1 >= 0);bubbleSort_~j~0#1 := 1; 113#L516 assume !true; 110#L515-1 bubbleSort_#t~post7#1 := bubbleSort_~i~0#1;bubbleSort_~i~0#1 := bubbleSort_#t~post7#1 - 1;havoc bubbleSort_#t~post7#1; 111#L515 [2024-11-17 08:13:10,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:13:10,561 INFO L85 PathProgramCache]: Analyzing trace with hash 77139097, now seen corresponding path program 1 times [2024-11-17 08:13:10,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:13:10,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578803795] [2024-11-17 08:13:10,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:13:10,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:13:10,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:13:10,685 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:13:10,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:13:10,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578803795] [2024-11-17 08:13:10,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578803795] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 08:13:10,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 08:13:10,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 08:13:10,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779856702] [2024-11-17 08:13:10,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 08:13:10,689 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-17 08:13:10,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:13:10,690 INFO L85 PathProgramCache]: Analyzing trace with hash 1476503, now seen corresponding path program 1 times [2024-11-17 08:13:10,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:13:10,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698003809] [2024-11-17 08:13:10,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:13:10,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:13:10,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:13:10,700 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:13:10,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:13:10,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698003809] [2024-11-17 08:13:10,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698003809] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 08:13:10,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 08:13:10,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 08:13:10,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398621072] [2024-11-17 08:13:10,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 08:13:10,705 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-17 08:13:10,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:13:10,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-17 08:13:10,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-17 08:13:10,708 INFO L87 Difference]: Start difference. First operand 16 states and 22 transitions. cyclomatic complexity: 8 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:13:10,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:13:10,713 INFO L93 Difference]: Finished difference Result 16 states and 21 transitions. [2024-11-17 08:13:10,713 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 21 transitions. [2024-11-17 08:13:10,714 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2024-11-17 08:13:10,715 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 16 states and 21 transitions. [2024-11-17 08:13:10,716 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2024-11-17 08:13:10,716 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2024-11-17 08:13:10,716 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 21 transitions. [2024-11-17 08:13:10,716 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:13:10,716 INFO L218 hiAutomatonCegarLoop]: Abstraction has 16 states and 21 transitions. [2024-11-17 08:13:10,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 21 transitions. [2024-11-17 08:13:10,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2024-11-17 08:13:10,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.3125) internal successors, (21), 15 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:13:10,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 21 transitions. [2024-11-17 08:13:10,719 INFO L240 hiAutomatonCegarLoop]: Abstraction has 16 states and 21 transitions. [2024-11-17 08:13:10,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-17 08:13:10,720 INFO L425 stractBuchiCegarLoop]: Abstraction has 16 states and 21 transitions. [2024-11-17 08:13:10,722 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-11-17 08:13:10,722 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 21 transitions. [2024-11-17 08:13:10,722 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2024-11-17 08:13:10,723 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:13:10,723 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:13:10,723 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:13:10,723 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2024-11-17 08:13:10,724 INFO L745 eck$LassoCheckResult]: Stem: 146#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 147#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_#t~nondet10#1, main_#t~post11#1, main_~k~0#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet8#1;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 153#L527 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 154#L530-1 call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~k~0#1 := 0; 142#L532-1 assume true; 144#L532-2 assume !(main_~k~0#1 < main_~array_size~0#1); 148#L532 havoc main_~k~0#1;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; 150#L515 [2024-11-17 08:13:10,725 INFO L747 eck$LassoCheckResult]: Loop: 150#L515 assume true; 151#L515-2 assume !!(bubbleSort_~i~0#1 >= 0);bubbleSort_~j~0#1 := 1; 152#L516 assume true; 156#L516-2 assume !(bubbleSort_~j~0#1 <= bubbleSort_~i~0#1); 149#L515-1 bubbleSort_#t~post7#1 := bubbleSort_~i~0#1;bubbleSort_~i~0#1 := bubbleSort_#t~post7#1 - 1;havoc bubbleSort_#t~post7#1; 150#L515 [2024-11-17 08:13:10,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:13:10,725 INFO L85 PathProgramCache]: Analyzing trace with hash 77139097, now seen corresponding path program 2 times [2024-11-17 08:13:10,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:13:10,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685817285] [2024-11-17 08:13:10,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:13:10,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:13:10,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:13:10,832 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:13:10,851 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:13:10,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:13:10,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685817285] [2024-11-17 08:13:10,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685817285] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 08:13:10,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 08:13:10,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 08:13:10,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732527241] [2024-11-17 08:13:10,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 08:13:10,852 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-17 08:13:10,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:13:10,853 INFO L85 PathProgramCache]: Analyzing trace with hash 45770791, now seen corresponding path program 1 times [2024-11-17 08:13:10,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:13:10,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130102980] [2024-11-17 08:13:10,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:13:10,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:13:10,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:13:10,878 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:13:10,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:13:10,884 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:13:10,908 INFO L204 LassoAnalysis]: Preferences: [2024-11-17 08:13:10,908 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-17 08:13:10,908 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-17 08:13:10,908 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-17 08:13:10,908 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-17 08:13:10,908 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:13:10,908 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-17 08:13:10,908 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-17 08:13:10,909 INFO L132 ssoRankerPreferences]: Filename of dumped script: bubblesort-alloca-2.i_Iteration3_Loop [2024-11-17 08:13:10,909 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-17 08:13:10,909 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-17 08:13:10,909 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:13:10,912 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:13:10,919 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:13:10,925 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:13:10,928 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:13:10,932 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:13:10,983 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-17 08:13:10,983 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-17 08:13:10,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:13:10,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:13:10,991 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:13:10,992 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:13:10,993 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-17 08:13:10,993 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-17 08:13:11,008 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-17 08:13:11,008 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:13:11,018 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2024-11-17 08:13:11,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:13:11,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:13:11,020 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:13:11,021 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:13:11,022 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-17 08:13:11,022 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-17 08:13:11,033 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-17 08:13:11,033 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:13:11,043 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:13:11,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:13:11,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:13:11,045 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:13:11,046 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:13:11,046 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-17 08:13:11,046 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-17 08:13:11,073 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:13:11,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:13:11,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:13:11,075 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:13:11,077 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:13:11,078 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-17 08:13:11,078 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-17 08:13:11,095 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-17 08:13:11,110 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:13:11,111 INFO L204 LassoAnalysis]: Preferences: [2024-11-17 08:13:11,111 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-17 08:13:11,111 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-17 08:13:11,111 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-17 08:13:11,111 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-17 08:13:11,111 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:13:11,111 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-17 08:13:11,111 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-17 08:13:11,112 INFO L132 ssoRankerPreferences]: Filename of dumped script: bubblesort-alloca-2.i_Iteration3_Loop [2024-11-17 08:13:11,112 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-17 08:13:11,112 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-17 08:13:11,113 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:13:11,117 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:13:11,119 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:13:11,125 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:13:11,128 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:13:11,130 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:13:11,188 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-17 08:13:11,188 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-17 08:13:11,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:13:11,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:13:11,191 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:13:11,193 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:13:11,194 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:13:11,207 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:13:11,207 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:13:11,207 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:13:11,207 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:13:11,207 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:13:11,208 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:13:11,208 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:13:11,213 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:13:11,228 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2024-11-17 08:13:11,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:13:11,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:13:11,232 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:13:11,234 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:13:11,235 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:13:11,247 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:13:11,247 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:13:11,247 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:13:11,247 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:13:11,247 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:13:11,248 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:13:11,248 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:13:11,249 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:13:11,260 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2024-11-17 08:13:11,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:13:11,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:13:11,261 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:13:11,262 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:13:11,263 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:13:11,273 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:13:11,273 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:13:11,273 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:13:11,273 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:13:11,273 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:13:11,274 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:13:11,274 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:13:11,276 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-17 08:13:11,279 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-17 08:13:11,279 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-11-17 08:13:11,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:13:11,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:13:11,281 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:13:11,282 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:13:11,283 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-17 08:13:11,283 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-17 08:13:11,283 INFO L474 LassoAnalysis]: Proved termination. [2024-11-17 08:13:11,284 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:13:11,297 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:13:11,298 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-17 08:13:11,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:13:11,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:13:11,328 INFO L255 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-17 08:13:11,328 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:13:11,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:13:11,341 INFO L255 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-17 08:13:11,342 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:13:11,375 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:13:11,375 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:13:11,376 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states and 21 transitions. cyclomatic complexity: 7 Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:13:11,401 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states and 21 transitions. cyclomatic complexity: 7. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 23 states and 31 transitions. Complement of second has 6 states. [2024-11-17 08:13:11,403 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:13:11,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:13:11,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2024-11-17 08:13:11,404 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 7 letters. Loop has 5 letters. [2024-11-17 08:13:11,404 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:13:11,405 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 12 letters. Loop has 5 letters. [2024-11-17 08:13:11,405 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:13:11,405 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 7 letters. Loop has 10 letters. [2024-11-17 08:13:11,405 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:13:11,405 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 31 transitions. [2024-11-17 08:13:11,406 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-11-17 08:13:11,406 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 22 states and 30 transitions. [2024-11-17 08:13:11,406 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2024-11-17 08:13:11,406 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2024-11-17 08:13:11,407 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 30 transitions. [2024-11-17 08:13:11,407 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:13:11,407 INFO L218 hiAutomatonCegarLoop]: Abstraction has 22 states and 30 transitions. [2024-11-17 08:13:11,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 30 transitions. [2024-11-17 08:13:11,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2024-11-17 08:13:11,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 21 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:13:11,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 30 transitions. [2024-11-17 08:13:11,413 INFO L240 hiAutomatonCegarLoop]: Abstraction has 22 states and 30 transitions. [2024-11-17 08:13:11,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:13:11,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 08:13:11,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-17 08:13:11,415 INFO L87 Difference]: Start difference. First operand 22 states and 30 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:13:11,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:13:11,435 INFO L93 Difference]: Finished difference Result 24 states and 31 transitions. [2024-11-17 08:13:11,435 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 31 transitions. [2024-11-17 08:13:11,435 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-11-17 08:13:11,436 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 23 states and 30 transitions. [2024-11-17 08:13:11,436 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2024-11-17 08:13:11,436 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2024-11-17 08:13:11,436 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 30 transitions. [2024-11-17 08:13:11,436 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:13:11,437 INFO L218 hiAutomatonCegarLoop]: Abstraction has 23 states and 30 transitions. [2024-11-17 08:13:11,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 30 transitions. [2024-11-17 08:13:11,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2024-11-17 08:13:11,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 21 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:13:11,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 29 transitions. [2024-11-17 08:13:11,438 INFO L240 hiAutomatonCegarLoop]: Abstraction has 22 states and 29 transitions. [2024-11-17 08:13:11,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 08:13:11,439 INFO L425 stractBuchiCegarLoop]: Abstraction has 22 states and 29 transitions. [2024-11-17 08:13:11,440 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-11-17 08:13:11,440 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 29 transitions. [2024-11-17 08:13:11,440 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-11-17 08:13:11,440 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:13:11,441 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:13:11,441 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:13:11,441 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-17 08:13:11,441 INFO L745 eck$LassoCheckResult]: Stem: 289#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 290#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_#t~nondet10#1, main_#t~post11#1, main_~k~0#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet8#1;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 299#L527 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 300#L530-1 call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~k~0#1 := 0; 285#L532-1 assume true; 286#L532-2 assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet10#1;call write~int#0(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1;main_#t~post11#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 287#L532-1 assume true; 288#L532-2 assume !(main_~k~0#1 < main_~array_size~0#1); 291#L532 havoc main_~k~0#1;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; 298#L515 assume true; 294#L515-2 assume !!(bubbleSort_~i~0#1 >= 0);bubbleSort_~j~0#1 := 1; 295#L516 [2024-11-17 08:13:11,442 INFO L747 eck$LassoCheckResult]: Loop: 295#L516 assume true; 303#L516-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); 304#L517 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); 301#L516-1 bubbleSort_#t~post6#1 := bubbleSort_~j~0#1;bubbleSort_~j~0#1 := 1 + bubbleSort_#t~post6#1;havoc bubbleSort_#t~post6#1; 295#L516 [2024-11-17 08:13:11,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:13:11,442 INFO L85 PathProgramCache]: Analyzing trace with hash -983987111, now seen corresponding path program 1 times [2024-11-17 08:13:11,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:13:11,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459429881] [2024-11-17 08:13:11,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:13:11,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:13:11,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:13:11,461 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:13:11,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:13:11,485 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:13:11,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:13:11,486 INFO L85 PathProgramCache]: Analyzing trace with hash 1291775, now seen corresponding path program 1 times [2024-11-17 08:13:11,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:13:11,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466048171] [2024-11-17 08:13:11,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:13:11,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:13:11,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:13:11,497 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:13:11,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:13:11,504 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:13:11,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:13:11,507 INFO L85 PathProgramCache]: Analyzing trace with hash 715085399, now seen corresponding path program 1 times [2024-11-17 08:13:11,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:13:11,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250315370] [2024-11-17 08:13:11,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:13:11,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:13:11,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:13:11,709 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:13:11,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:13:11,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250315370] [2024-11-17 08:13:11,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250315370] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 08:13:11,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [80510056] [2024-11-17 08:13:11,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:13:11,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 08:13:11,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:13:11,713 INFO L229 MonitoredProcess]: Starting monitored process 15 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:13:11,716 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-17 08:13:11,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:13:11,773 INFO L255 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-17 08:13:11,774 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:13:11,844 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:13:11,844 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 08:13:11,899 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:13:11,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [80510056] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 08:13:11,901 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 08:13:11,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 10 [2024-11-17 08:13:11,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951844507] [2024-11-17 08:13:11,901 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 08:13:11,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:13:11,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-17 08:13:11,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-11-17 08:13:11,997 INFO L87 Difference]: Start difference. First operand 22 states and 29 transitions. cyclomatic complexity: 10 Second operand has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:13:12,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:13:12,066 INFO L93 Difference]: Finished difference Result 42 states and 52 transitions. [2024-11-17 08:13:12,066 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 52 transitions. [2024-11-17 08:13:12,068 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-11-17 08:13:12,068 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 25 states and 31 transitions. [2024-11-17 08:13:12,068 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2024-11-17 08:13:12,068 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2024-11-17 08:13:12,068 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 31 transitions. [2024-11-17 08:13:12,068 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:13:12,068 INFO L218 hiAutomatonCegarLoop]: Abstraction has 25 states and 31 transitions. [2024-11-17 08:13:12,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 31 transitions. [2024-11-17 08:13:12,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2024-11-17 08:13:12,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.25) internal successors, (30), 23 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:13:12,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 30 transitions. [2024-11-17 08:13:12,071 INFO L240 hiAutomatonCegarLoop]: Abstraction has 24 states and 30 transitions. [2024-11-17 08:13:12,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-17 08:13:12,072 INFO L425 stractBuchiCegarLoop]: Abstraction has 24 states and 30 transitions. [2024-11-17 08:13:12,072 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-11-17 08:13:12,073 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 30 transitions. [2024-11-17 08:13:12,073 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-11-17 08:13:12,073 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:13:12,073 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:13:12,074 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:13:12,074 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-17 08:13:12,074 INFO L745 eck$LassoCheckResult]: Stem: 456#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 457#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_#t~nondet10#1, main_#t~post11#1, main_~k~0#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet8#1;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 469#L527 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 470#L530-1 call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~k~0#1 := 0; 452#L532-1 assume true; 453#L532-2 assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet10#1;call write~int#0(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1;main_#t~post11#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 454#L532-1 assume true; 455#L532-2 assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet10#1;call write~int#0(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1;main_#t~post11#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 475#L532-1 assume true; 458#L532-2 assume !(main_~k~0#1 < main_~array_size~0#1); 459#L532 havoc main_~k~0#1;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; 466#L515 assume true; 462#L515-2 assume !!(bubbleSort_~i~0#1 >= 0);bubbleSort_~j~0#1 := 1; 463#L516 [2024-11-17 08:13:12,074 INFO L747 eck$LassoCheckResult]: Loop: 463#L516 assume true; 471#L516-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); 472#L517 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); 467#L516-1 bubbleSort_#t~post6#1 := bubbleSort_~j~0#1;bubbleSort_~j~0#1 := 1 + bubbleSort_#t~post6#1;havoc bubbleSort_#t~post6#1; 463#L516 [2024-11-17 08:13:12,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:13:12,075 INFO L85 PathProgramCache]: Analyzing trace with hash -656810022, now seen corresponding path program 2 times [2024-11-17 08:13:12,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:13:12,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124273189] [2024-11-17 08:13:12,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:13:12,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:13:12,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:13:12,093 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:13:12,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:13:12,107 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:13:12,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:13:12,107 INFO L85 PathProgramCache]: Analyzing trace with hash 1291775, now seen corresponding path program 2 times [2024-11-17 08:13:12,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:13:12,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533764268] [2024-11-17 08:13:12,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:13:12,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:13:12,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:13:12,115 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:13:12,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:13:12,121 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:13:12,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:13:12,122 INFO L85 PathProgramCache]: Analyzing trace with hash 383254872, now seen corresponding path program 2 times [2024-11-17 08:13:12,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:13:12,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858056033] [2024-11-17 08:13:12,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:13:12,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:13:12,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:13:12,152 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:13:12,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:13:12,163 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:13:12,381 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2024-11-17 08:13:12,504 INFO L204 LassoAnalysis]: Preferences: [2024-11-17 08:13:12,504 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-17 08:13:12,504 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-17 08:13:12,504 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-17 08:13:12,505 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-17 08:13:12,505 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:13:12,505 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-17 08:13:12,505 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-17 08:13:12,505 INFO L132 ssoRankerPreferences]: Filename of dumped script: bubblesort-alloca-2.i_Iteration5_Lasso [2024-11-17 08:13:12,505 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-17 08:13:12,505 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-17 08:13:12,507 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:13:12,509 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:13:12,511 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:13:12,514 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:13:12,515 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:13:12,517 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:13:12,692 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:13:12,694 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:13:12,696 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:13:12,698 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:13:12,700 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:13:12,702 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:13:12,705 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:13:12,707 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:13:12,709 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:13:12,711 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:13:12,712 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:13:12,721 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:13:12,723 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:13:12,725 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:13:12,909 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-17 08:13:12,910 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-17 08:13:12,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:13:12,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:13:12,914 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:13:12,915 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:13:12,916 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:13:12,929 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:13:12,929 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:13:12,930 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:13:12,930 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:13:12,930 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:13:12,930 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:13:12,930 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:13:12,932 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:13:12,947 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:13:12,948 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:13:12,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:13:12,949 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:13:12,951 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2024-11-17 08:13:12,953 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:13:12,965 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:13:12,966 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:13:12,966 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:13:12,966 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:13:12,966 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:13:12,966 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:13:12,966 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:13:12,969 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:13:12,979 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2024-11-17 08:13:12,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:13:12,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:13:12,981 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:13:12,982 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2024-11-17 08:13:12,983 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:13:12,992 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:13:12,993 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:13:12,993 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:13:12,993 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:13:12,993 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:13:12,993 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:13:12,993 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:13:12,995 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:13:13,005 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2024-11-17 08:13:13,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:13:13,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:13:13,007 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:13:13,008 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:13:13,009 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:13:13,018 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:13:13,019 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:13:13,019 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:13:13,019 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:13:13,019 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:13:13,019 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:13:13,019 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:13:13,020 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:13:13,031 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2024-11-17 08:13:13,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:13:13,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:13:13,032 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:13:13,033 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:13:13,034 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:13:13,044 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:13:13,044 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:13:13,044 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:13:13,044 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:13:13,044 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:13:13,045 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:13:13,045 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:13:13,046 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:13:13,056 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2024-11-17 08:13:13,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:13:13,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:13:13,057 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:13:13,059 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:13:13,059 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:13:13,069 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:13:13,070 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:13:13,070 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:13:13,070 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:13:13,073 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:13:13,073 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:13:13,079 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:13:13,090 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:13:13,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:13:13,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:13:13,092 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:13:13,095 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:13:13,097 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:13:13,107 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:13:13,107 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:13:13,107 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:13:13,107 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:13:13,112 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:13:13,112 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:13:13,121 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-17 08:13:13,139 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2024-11-17 08:13:13,140 INFO L444 ModelExtractionUtils]: 2 out of 19 variables were initially zero. Simplification set additionally 11 variables to zero. [2024-11-17 08:13:13,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:13:13,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:13:13,143 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:13:13,144 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:13:13,147 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-17 08:13:13,158 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2024-11-17 08:13:13,158 INFO L474 LassoAnalysis]: Proved termination. [2024-11-17 08:13:13,159 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_bubbleSort_~j~0#1) = -4*ULTIMATE.start_bubbleSort_~j~0#1 + 5 Supporting invariants [-1*v_rep(select #length ULTIMATE.start_main_#t~malloc9#1.base)_2 + 1*ULTIMATE.start_bubbleSort_~numbers#1.offset + 8 >= 0] [2024-11-17 08:13:13,170 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:13:13,186 INFO L156 tatePredicateManager]: 4 out of 6 supporting invariants were superfluous and have been removed [2024-11-17 08:13:13,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:13:13,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:13:13,231 INFO L255 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-17 08:13:13,232 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:13:13,277 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-17 08:13:13,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:13:13,474 INFO L255 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-17 08:13:13,474 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:13:13,522 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:13:13,523 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.6 stem predicates 2 loop predicates [2024-11-17 08:13:13,523 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 30 transitions. cyclomatic complexity: 9 Second operand has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:13:13,572 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2024-11-17 08:13:13,653 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states and 30 transitions. cyclomatic complexity: 9. Second operand has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 52 states and 66 transitions. Complement of second has 13 states. [2024-11-17 08:13:13,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 6 stem states 2 non-accepting loop states 2 accepting loop states [2024-11-17 08:13:13,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:13:13,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 25 transitions. [2024-11-17 08:13:13,656 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 25 transitions. Stem has 13 letters. Loop has 4 letters. [2024-11-17 08:13:13,656 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:13:13,656 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 25 transitions. Stem has 17 letters. Loop has 4 letters. [2024-11-17 08:13:13,656 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:13:13,656 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 25 transitions. Stem has 13 letters. Loop has 8 letters. [2024-11-17 08:13:13,656 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:13:13,656 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 52 states and 66 transitions. [2024-11-17 08:13:13,657 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-11-17 08:13:13,658 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 52 states to 41 states and 50 transitions. [2024-11-17 08:13:13,658 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2024-11-17 08:13:13,660 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2024-11-17 08:13:13,661 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 50 transitions. [2024-11-17 08:13:13,661 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:13:13,661 INFO L218 hiAutomatonCegarLoop]: Abstraction has 41 states and 50 transitions. [2024-11-17 08:13:13,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 50 transitions. [2024-11-17 08:13:13,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 35. [2024-11-17 08:13:13,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 35 states have (on average 1.2571428571428571) internal successors, (44), 34 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:13:13,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 44 transitions. [2024-11-17 08:13:13,664 INFO L240 hiAutomatonCegarLoop]: Abstraction has 35 states and 44 transitions. [2024-11-17 08:13:13,664 INFO L425 stractBuchiCegarLoop]: Abstraction has 35 states and 44 transitions. [2024-11-17 08:13:13,664 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-11-17 08:13:13,664 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 44 transitions. [2024-11-17 08:13:13,665 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-11-17 08:13:13,665 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:13:13,665 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:13:13,666 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:13:13,666 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-17 08:13:13,666 INFO L745 eck$LassoCheckResult]: Stem: 655#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 656#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_#t~nondet10#1, main_#t~post11#1, main_~k~0#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet8#1;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 669#L527 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 670#L530-1 call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~k~0#1 := 0; 650#L532-1 assume true; 651#L532-2 assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet10#1;call write~int#0(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1;main_#t~post11#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 684#L532-1 assume true; 658#L532-2 assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet10#1;call write~int#0(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1;main_#t~post11#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 652#L532-1 assume true; 653#L532-2 assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet10#1;call write~int#0(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1;main_#t~post11#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 683#L532-1 assume true; 681#L532-2 assume !(main_~k~0#1 < main_~array_size~0#1); 680#L532 havoc main_~k~0#1;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; 678#L515 assume true; 661#L515-2 assume !!(bubbleSort_~i~0#1 >= 0);bubbleSort_~j~0#1 := 1; 662#L516 [2024-11-17 08:13:13,666 INFO L747 eck$LassoCheckResult]: Loop: 662#L516 assume true; 671#L516-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); 672#L517 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); 667#L516-1 bubbleSort_#t~post6#1 := bubbleSort_~j~0#1;bubbleSort_~j~0#1 := 1 + bubbleSort_#t~post6#1;havoc bubbleSort_#t~post6#1; 662#L516 [2024-11-17 08:13:13,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:13:13,667 INFO L85 PathProgramCache]: Analyzing trace with hash 227759899, now seen corresponding path program 3 times [2024-11-17 08:13:13,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:13:13,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539228780] [2024-11-17 08:13:13,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:13:13,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:13:13,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:13:13,681 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:13:13,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:13:13,695 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:13:13,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:13:13,697 INFO L85 PathProgramCache]: Analyzing trace with hash 1291775, now seen corresponding path program 3 times [2024-11-17 08:13:13,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:13:13,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583845625] [2024-11-17 08:13:13,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:13:13,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:13:13,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:13:13,706 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:13:13,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:13:13,714 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:13:13,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:13:13,715 INFO L85 PathProgramCache]: Analyzing trace with hash -678301671, now seen corresponding path program 3 times [2024-11-17 08:13:13,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:13:13,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598263793] [2024-11-17 08:13:13,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:13:13,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:13:13,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:13:13,736 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:13:13,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:13:13,753 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:13:14,101 INFO L204 LassoAnalysis]: Preferences: [2024-11-17 08:13:14,101 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-17 08:13:14,101 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-17 08:13:14,101 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-17 08:13:14,101 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-17 08:13:14,101 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:13:14,102 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-17 08:13:14,102 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-17 08:13:14,102 INFO L132 ssoRankerPreferences]: Filename of dumped script: bubblesort-alloca-2.i_Iteration6_Lasso [2024-11-17 08:13:14,102 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-17 08:13:14,102 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-17 08:13:14,104 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:13:14,110 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:13:14,113 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:13:14,312 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:13:14,314 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:13:14,319 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:13:14,324 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:13:14,326 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:13:14,328 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:13:14,330 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:13:14,331 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:13:14,334 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:13:14,335 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:13:14,337 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:13:14,338 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:13:14,341 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:13:14,342 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:13:14,344 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:13:14,345 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:13:14,346 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:13:14,552 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-17 08:13:14,552 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-17 08:13:14,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:13:14,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:13:14,558 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:13:14,560 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:13:14,561 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:13:14,571 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:13:14,571 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:13:14,572 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:13:14,572 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:13:14,572 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:13:14,572 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:13:14,572 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:13:14,573 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:13:14,583 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2024-11-17 08:13:14,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:13:14,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:13:14,585 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:13:14,585 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:13:14,586 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:13:14,596 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:13:14,596 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:13:14,596 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:13:14,596 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:13:14,597 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:13:14,598 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:13:14,600 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:13:14,610 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2024-11-17 08:13:14,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:13:14,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:13:14,611 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:13:14,613 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:13:14,613 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:13:14,623 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:13:14,623 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:13:14,623 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:13:14,623 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:13:14,624 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:13:14,624 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:13:14,627 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:13:14,637 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:13:14,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:13:14,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:13:14,638 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:13:14,639 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:13:14,639 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:13:14,649 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:13:14,649 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:13:14,649 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:13:14,649 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:13:14,649 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:13:14,650 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:13:14,650 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:13:14,651 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:13:14,661 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2024-11-17 08:13:14,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:13:14,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:13:14,662 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:13:14,663 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:13:14,664 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:13:14,673 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:13:14,673 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:13:14,673 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:13:14,674 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:13:14,678 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:13:14,678 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:13:14,686 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-17 08:13:14,694 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2024-11-17 08:13:14,694 INFO L444 ModelExtractionUtils]: 6 out of 19 variables were initially zero. Simplification set additionally 9 variables to zero. [2024-11-17 08:13:14,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:13:14,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:13:14,696 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:13:14,697 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2024-11-17 08:13:14,697 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-17 08:13:14,708 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-17 08:13:14,708 INFO L474 LassoAnalysis]: Proved termination. [2024-11-17 08:13:14,708 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_bubbleSort_~numbers#1.base)_2, ULTIMATE.start_bubbleSort_~j~0#1, ULTIMATE.start_bubbleSort_~numbers#1.offset) = 1*v_rep(select #length ULTIMATE.start_bubbleSort_~numbers#1.base)_2 - 4*ULTIMATE.start_bubbleSort_~j~0#1 - 1*ULTIMATE.start_bubbleSort_~numbers#1.offset Supporting invariants [] [2024-11-17 08:13:14,719 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:13:14,727 INFO L156 tatePredicateManager]: 5 out of 5 supporting invariants were superfluous and have been removed [2024-11-17 08:13:14,729 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~numbers!offset [2024-11-17 08:13:14,730 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-17 08:13:14,730 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-17 08:13:14,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:13:14,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:13:14,756 INFO L255 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-17 08:13:14,757 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:13:14,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:13:14,786 INFO L255 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-17 08:13:14,787 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:13:14,811 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:13:14,812 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:13:14,812 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 35 states and 44 transitions. cyclomatic complexity: 13 Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 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:13:14,832 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 35 states and 44 transitions. cyclomatic complexity: 13. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 56 states and 72 transitions. Complement of second has 7 states. [2024-11-17 08:13:14,832 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:13:14,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 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:13:14,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2024-11-17 08:13:14,833 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 15 letters. Loop has 4 letters. [2024-11-17 08:13:14,833 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:13:14,833 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 19 letters. Loop has 4 letters. [2024-11-17 08:13:14,834 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:13:14,834 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 15 letters. Loop has 8 letters. [2024-11-17 08:13:14,834 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:13:14,834 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 56 states and 72 transitions. [2024-11-17 08:13:14,835 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-11-17 08:13:14,836 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 56 states to 41 states and 51 transitions. [2024-11-17 08:13:14,836 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2024-11-17 08:13:14,836 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2024-11-17 08:13:14,837 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 51 transitions. [2024-11-17 08:13:14,837 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:13:14,837 INFO L218 hiAutomatonCegarLoop]: Abstraction has 41 states and 51 transitions. [2024-11-17 08:13:14,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 51 transitions. [2024-11-17 08:13:14,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 30. [2024-11-17 08:13:14,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 29 states have internal predecessors, (37), 0 states have call successors, (0), 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:13:14,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2024-11-17 08:13:14,839 INFO L240 hiAutomatonCegarLoop]: Abstraction has 30 states and 37 transitions. [2024-11-17 08:13:14,839 INFO L425 stractBuchiCegarLoop]: Abstraction has 30 states and 37 transitions. [2024-11-17 08:13:14,839 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-11-17 08:13:14,839 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 37 transitions. [2024-11-17 08:13:14,840 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-11-17 08:13:14,840 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:13:14,840 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:13:14,841 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:13:14,841 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-17 08:13:14,841 INFO L745 eck$LassoCheckResult]: Stem: 845#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 846#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_#t~nondet10#1, main_#t~post11#1, main_~k~0#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet8#1;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 859#L527 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 860#L530-1 call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~k~0#1 := 0; 841#L532-1 assume true; 842#L532-2 assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet10#1;call write~int#0(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1;main_#t~post11#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 843#L532-1 assume true; 844#L532-2 assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet10#1;call write~int#0(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1;main_#t~post11#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 870#L532-1 assume true; 847#L532-2 assume !(main_~k~0#1 < main_~array_size~0#1); 848#L532 havoc main_~k~0#1;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; 855#L515 assume true; 856#L515-2 assume !!(bubbleSort_~i~0#1 >= 0);bubbleSort_~j~0#1 := 1; 868#L516 assume true; 867#L516-2 assume !(bubbleSort_~j~0#1 <= bubbleSort_~i~0#1); 849#L515-1 bubbleSort_#t~post7#1 := bubbleSort_~i~0#1;bubbleSort_~i~0#1 := bubbleSort_#t~post7#1 - 1;havoc bubbleSort_#t~post7#1; 850#L515 assume true; 851#L515-2 assume !!(bubbleSort_~i~0#1 >= 0);bubbleSort_~j~0#1 := 1; 852#L516 [2024-11-17 08:13:14,862 INFO L747 eck$LassoCheckResult]: Loop: 852#L516 assume true; 861#L516-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); 862#L517 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); 857#L516-1 bubbleSort_#t~post6#1 := bubbleSort_~j~0#1;bubbleSort_~j~0#1 := 1 + bubbleSort_#t~post6#1;havoc bubbleSort_#t~post6#1; 852#L516 [2024-11-17 08:13:14,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:13:14,863 INFO L85 PathProgramCache]: Analyzing trace with hash -1004061940, now seen corresponding path program 1 times [2024-11-17 08:13:14,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:13:14,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512526584] [2024-11-17 08:13:14,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:13:14,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:13:14,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:13:14,900 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2024-11-17 08:13:15,000 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:13:15,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:13:15,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512526584] [2024-11-17 08:13:15,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512526584] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 08:13:15,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [203087300] [2024-11-17 08:13:15,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:13:15,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 08:13:15,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:13:15,004 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 08:13:15,006 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2024-11-17 08:13:15,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:13:15,076 INFO L255 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-17 08:13:15,077 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:13:15,118 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:13:15,119 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 08:13:15,170 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:13:15,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [203087300] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 08:13:15,171 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 08:13:15,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 9 [2024-11-17 08:13:15,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658897000] [2024-11-17 08:13:15,171 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 08:13:15,172 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-17 08:13:15,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:13:15,172 INFO L85 PathProgramCache]: Analyzing trace with hash 1291775, now seen corresponding path program 4 times [2024-11-17 08:13:15,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:13:15,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075805603] [2024-11-17 08:13:15,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:13:15,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:13:15,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:13:15,178 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:13:15,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:13:15,183 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:13:15,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:13:15,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-17 08:13:15,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-17 08:13:15,260 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. cyclomatic complexity: 11 Second operand has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:13:15,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:13:15,317 INFO L93 Difference]: Finished difference Result 37 states and 45 transitions. [2024-11-17 08:13:15,317 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 45 transitions. [2024-11-17 08:13:15,318 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-11-17 08:13:15,318 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 36 states and 44 transitions. [2024-11-17 08:13:15,318 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2024-11-17 08:13:15,318 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2024-11-17 08:13:15,318 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 44 transitions. [2024-11-17 08:13:15,319 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:13:15,319 INFO L218 hiAutomatonCegarLoop]: Abstraction has 36 states and 44 transitions. [2024-11-17 08:13:15,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 44 transitions. [2024-11-17 08:13:15,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 31. [2024-11-17 08:13:15,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 30 states have internal predecessors, (38), 0 states have call successors, (0), 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:13:15,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 38 transitions. [2024-11-17 08:13:15,320 INFO L240 hiAutomatonCegarLoop]: Abstraction has 31 states and 38 transitions. [2024-11-17 08:13:15,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-17 08:13:15,325 INFO L425 stractBuchiCegarLoop]: Abstraction has 31 states and 38 transitions. [2024-11-17 08:13:15,325 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-11-17 08:13:15,325 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 38 transitions. [2024-11-17 08:13:15,326 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-11-17 08:13:15,326 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:13:15,326 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:13:15,327 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:13:15,327 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-17 08:13:15,327 INFO L745 eck$LassoCheckResult]: Stem: 1030#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1031#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_#t~nondet10#1, main_#t~post11#1, main_~k~0#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet8#1;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 1044#L527 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 1045#L530-1 call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~k~0#1 := 0; 1026#L532-1 assume true; 1027#L532-2 assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet10#1;call write~int#0(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1;main_#t~post11#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 1028#L532-1 assume true; 1029#L532-2 assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet10#1;call write~int#0(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1;main_#t~post11#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 1052#L532-1 assume true; 1032#L532-2 assume !(main_~k~0#1 < main_~array_size~0#1); 1033#L532 havoc main_~k~0#1;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; 1040#L515 assume true; 1041#L515-2 assume !!(bubbleSort_~i~0#1 >= 0);bubbleSort_~j~0#1 := 1; 1050#L516 assume true; 1048#L516-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); 1049#L517 assume !(bubbleSort_#t~mem2#1 > bubbleSort_#t~mem3#1);havoc bubbleSort_#t~mem2#1;havoc bubbleSort_#t~mem3#1; 1051#L516-1 bubbleSort_#t~post6#1 := bubbleSort_~j~0#1;bubbleSort_~j~0#1 := 1 + bubbleSort_#t~post6#1;havoc bubbleSort_#t~post6#1; 1055#L516 assume true; 1053#L516-2 assume !(bubbleSort_~j~0#1 <= bubbleSort_~i~0#1); 1034#L515-1 bubbleSort_#t~post7#1 := bubbleSort_~i~0#1;bubbleSort_~i~0#1 := bubbleSort_#t~post7#1 - 1;havoc bubbleSort_#t~post7#1; 1035#L515 assume true; 1036#L515-2 assume !!(bubbleSort_~i~0#1 >= 0);bubbleSort_~j~0#1 := 1; 1037#L516 [2024-11-17 08:13:15,327 INFO L747 eck$LassoCheckResult]: Loop: 1037#L516 assume true; 1046#L516-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); 1047#L517 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); 1042#L516-1 bubbleSort_#t~post6#1 := bubbleSort_~j~0#1;bubbleSort_~j~0#1 := 1 + bubbleSort_#t~post6#1;havoc bubbleSort_#t~post6#1; 1037#L516 [2024-11-17 08:13:15,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:13:15,328 INFO L85 PathProgramCache]: Analyzing trace with hash -255945841, now seen corresponding path program 1 times [2024-11-17 08:13:15,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:13:15,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377903316] [2024-11-17 08:13:15,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:13:15,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:13:15,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:13:15,340 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:13:15,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:13:15,349 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:13:15,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:13:15,350 INFO L85 PathProgramCache]: Analyzing trace with hash 1291775, now seen corresponding path program 5 times [2024-11-17 08:13:15,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:13:15,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530591594] [2024-11-17 08:13:15,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:13:15,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:13:15,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:13:15,355 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:13:15,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:13:15,357 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:13:15,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:13:15,358 INFO L85 PathProgramCache]: Analyzing trace with hash -2128489843, now seen corresponding path program 1 times [2024-11-17 08:13:15,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:13:15,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799486017] [2024-11-17 08:13:15,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:13:15,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:13:15,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:13:15,473 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-17 08:13:15,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:13:15,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799486017] [2024-11-17 08:13:15,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799486017] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 08:13:15,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1203832345] [2024-11-17 08:13:15,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:13:15,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 08:13:15,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:13:15,476 INFO L229 MonitoredProcess]: Starting monitored process 31 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:13:15,477 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2024-11-17 08:13:15,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:13:15,547 INFO L255 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-17 08:13:15,548 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:13:15,603 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-17 08:13:15,604 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 08:13:15,663 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-17 08:13:15,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1203832345] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 08:13:15,664 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 08:13:15,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 12 [2024-11-17 08:13:15,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156220709] [2024-11-17 08:13:15,664 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 08:13:15,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:13:15,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-17 08:13:15,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2024-11-17 08:13:15,739 INFO L87 Difference]: Start difference. First operand 31 states and 38 transitions. cyclomatic complexity: 11 Second operand has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 12 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:13:15,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:13:15,792 INFO L93 Difference]: Finished difference Result 53 states and 63 transitions. [2024-11-17 08:13:15,792 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 53 states and 63 transitions. [2024-11-17 08:13:15,793 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-11-17 08:13:15,794 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 53 states to 34 states and 41 transitions. [2024-11-17 08:13:15,794 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2024-11-17 08:13:15,794 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2024-11-17 08:13:15,794 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 41 transitions. [2024-11-17 08:13:15,795 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:13:15,795 INFO L218 hiAutomatonCegarLoop]: Abstraction has 34 states and 41 transitions. [2024-11-17 08:13:15,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 41 transitions. [2024-11-17 08:13:15,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2024-11-17 08:13:15,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 33 states have (on average 1.2121212121212122) internal successors, (40), 32 states have internal predecessors, (40), 0 states have call successors, (0), 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:13:15,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 40 transitions. [2024-11-17 08:13:15,797 INFO L240 hiAutomatonCegarLoop]: Abstraction has 33 states and 40 transitions. [2024-11-17 08:13:15,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-17 08:13:15,798 INFO L425 stractBuchiCegarLoop]: Abstraction has 33 states and 40 transitions. [2024-11-17 08:13:15,798 INFO L332 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2024-11-17 08:13:15,799 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 40 transitions. [2024-11-17 08:13:15,799 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-11-17 08:13:15,799 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:13:15,799 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:13:15,800 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:13:15,800 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-17 08:13:15,800 INFO L745 eck$LassoCheckResult]: Stem: 1281#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1282#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_#t~nondet10#1, main_#t~post11#1, main_~k~0#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet8#1;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 1293#L527 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 1294#L530-1 call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~k~0#1 := 0; 1277#L532-1 assume true; 1278#L532-2 assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet10#1;call write~int#0(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1;main_#t~post11#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 1279#L532-1 assume true; 1280#L532-2 assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet10#1;call write~int#0(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1;main_#t~post11#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 1309#L532-1 assume true; 1304#L532-2 assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet10#1;call write~int#0(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1;main_#t~post11#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 1303#L532-1 assume true; 1283#L532-2 assume !(main_~k~0#1 < main_~array_size~0#1); 1284#L532 havoc main_~k~0#1;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; 1291#L515 assume true; 1292#L515-2 assume !!(bubbleSort_~i~0#1 >= 0);bubbleSort_~j~0#1 := 1; 1306#L516 assume true; 1299#L516-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); 1300#L517 assume !(bubbleSort_#t~mem2#1 > bubbleSort_#t~mem3#1);havoc bubbleSort_#t~mem2#1;havoc bubbleSort_#t~mem3#1; 1307#L516-1 bubbleSort_#t~post6#1 := bubbleSort_~j~0#1;bubbleSort_~j~0#1 := 1 + bubbleSort_#t~post6#1;havoc bubbleSort_#t~post6#1; 1308#L516 assume true; 1305#L516-2 assume !(bubbleSort_~j~0#1 <= bubbleSort_~i~0#1); 1285#L515-1 bubbleSort_#t~post7#1 := bubbleSort_~i~0#1;bubbleSort_~i~0#1 := bubbleSort_#t~post7#1 - 1;havoc bubbleSort_#t~post7#1; 1286#L515 assume true; 1287#L515-2 assume !!(bubbleSort_~i~0#1 >= 0);bubbleSort_~j~0#1 := 1; 1288#L516 [2024-11-17 08:13:15,800 INFO L747 eck$LassoCheckResult]: Loop: 1288#L516 assume true; 1297#L516-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); 1298#L517 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); 1295#L516-1 bubbleSort_#t~post6#1 := bubbleSort_~j~0#1;bubbleSort_~j~0#1 := 1 + bubbleSort_#t~post6#1;havoc bubbleSort_#t~post6#1; 1288#L516 [2024-11-17 08:13:15,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:13:15,801 INFO L85 PathProgramCache]: Analyzing trace with hash 643872110, now seen corresponding path program 2 times [2024-11-17 08:13:15,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:13:15,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144830887] [2024-11-17 08:13:15,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:13:15,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:13:15,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:13:15,894 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:13:15,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:13:15,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144830887] [2024-11-17 08:13:15,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144830887] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 08:13:15,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [59910042] [2024-11-17 08:13:15,895 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-17 08:13:15,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 08:13:15,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:13:15,896 INFO L229 MonitoredProcess]: Starting monitored process 32 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:13:15,897 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2024-11-17 08:13:15,973 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-17 08:13:15,973 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 08:13:15,973 INFO L255 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-17 08:13:15,975 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:13:16,047 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:13:16,048 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 08:13:16,109 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:13:16,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [59910042] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 08:13:16,109 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 08:13:16,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 13 [2024-11-17 08:13:16,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176290692] [2024-11-17 08:13:16,110 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 08:13:16,110 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-17 08:13:16,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:13:16,110 INFO L85 PathProgramCache]: Analyzing trace with hash 1291775, now seen corresponding path program 6 times [2024-11-17 08:13:16,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:13:16,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367852892] [2024-11-17 08:13:16,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:13:16,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:13:16,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:13:16,115 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:13:16,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:13:16,119 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:13:16,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:13:16,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-17 08:13:16,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2024-11-17 08:13:16,201 INFO L87 Difference]: Start difference. First operand 33 states and 40 transitions. cyclomatic complexity: 11 Second operand has 13 states, 13 states have (on average 3.0) internal successors, (39), 13 states have internal predecessors, (39), 0 states have call successors, (0), 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:13:16,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:13:16,264 INFO L93 Difference]: Finished difference Result 43 states and 52 transitions. [2024-11-17 08:13:16,264 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 52 transitions. [2024-11-17 08:13:16,264 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-11-17 08:13:16,265 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 42 states and 51 transitions. [2024-11-17 08:13:16,265 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2024-11-17 08:13:16,265 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2024-11-17 08:13:16,265 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 51 transitions. [2024-11-17 08:13:16,265 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:13:16,265 INFO L218 hiAutomatonCegarLoop]: Abstraction has 42 states and 51 transitions. [2024-11-17 08:13:16,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 51 transitions. [2024-11-17 08:13:16,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 37. [2024-11-17 08:13:16,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 37 states have (on average 1.2162162162162162) internal successors, (45), 36 states have internal predecessors, (45), 0 states have call successors, (0), 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:13:16,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 45 transitions. [2024-11-17 08:13:16,268 INFO L240 hiAutomatonCegarLoop]: Abstraction has 37 states and 45 transitions. [2024-11-17 08:13:16,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-17 08:13:16,270 INFO L425 stractBuchiCegarLoop]: Abstraction has 37 states and 45 transitions. [2024-11-17 08:13:16,270 INFO L332 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2024-11-17 08:13:16,270 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states and 45 transitions. [2024-11-17 08:13:16,270 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-11-17 08:13:16,270 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:13:16,270 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:13:16,271 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:13:16,271 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-17 08:13:16,271 INFO L745 eck$LassoCheckResult]: Stem: 1515#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1516#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_#t~nondet10#1, main_#t~post11#1, main_~k~0#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet8#1;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 1531#L527 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 1532#L530-1 call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~k~0#1 := 0; 1511#L532-1 assume true; 1512#L532-2 assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet10#1;call write~int#0(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1;main_#t~post11#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 1539#L532-1 assume true; 1519#L532-2 assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet10#1;call write~int#0(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1;main_#t~post11#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 1513#L532-1 assume true; 1514#L532-2 assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet10#1;call write~int#0(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1;main_#t~post11#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 1538#L532-1 assume true; 1517#L532-2 assume !(main_~k~0#1 < main_~array_size~0#1); 1518#L532 havoc main_~k~0#1;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; 1526#L515 assume true; 1524#L515-2 assume !!(bubbleSort_~i~0#1 >= 0);bubbleSort_~j~0#1 := 1; 1525#L516 assume true; 1545#L516-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); 1544#L517 assume !(bubbleSort_#t~mem2#1 > bubbleSort_#t~mem3#1);havoc bubbleSort_#t~mem2#1;havoc bubbleSort_#t~mem3#1; 1529#L516-1 bubbleSort_#t~post6#1 := bubbleSort_~j~0#1;bubbleSort_~j~0#1 := 1 + bubbleSort_#t~post6#1;havoc bubbleSort_#t~post6#1; 1530#L516 assume true; 1535#L516-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); 1536#L517 assume !(bubbleSort_#t~mem2#1 > bubbleSort_#t~mem3#1);havoc bubbleSort_#t~mem2#1;havoc bubbleSort_#t~mem3#1; 1537#L516-1 bubbleSort_#t~post6#1 := bubbleSort_~j~0#1;bubbleSort_~j~0#1 := 1 + bubbleSort_#t~post6#1;havoc bubbleSort_#t~post6#1; 1543#L516 assume true; 1540#L516-2 assume !(bubbleSort_~j~0#1 <= bubbleSort_~i~0#1); 1520#L515-1 bubbleSort_#t~post7#1 := bubbleSort_~i~0#1;bubbleSort_~i~0#1 := bubbleSort_#t~post7#1 - 1;havoc bubbleSort_#t~post7#1; 1521#L515 assume true; 1522#L515-2 assume !!(bubbleSort_~i~0#1 >= 0);bubbleSort_~j~0#1 := 1; 1523#L516 [2024-11-17 08:13:16,271 INFO L747 eck$LassoCheckResult]: Loop: 1523#L516 assume true; 1533#L516-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); 1534#L517 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); 1528#L516-1 bubbleSort_#t~post6#1 := bubbleSort_~j~0#1;bubbleSort_~j~0#1 := 1 + bubbleSort_#t~post6#1;havoc bubbleSort_#t~post6#1; 1523#L516 [2024-11-17 08:13:16,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:13:16,272 INFO L85 PathProgramCache]: Analyzing trace with hash 1259343089, now seen corresponding path program 3 times [2024-11-17 08:13:16,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:13:16,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354308352] [2024-11-17 08:13:16,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:13:16,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:13:16,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:13:16,285 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:13:16,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:13:16,297 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:13:16,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:13:16,298 INFO L85 PathProgramCache]: Analyzing trace with hash 1291775, now seen corresponding path program 7 times [2024-11-17 08:13:16,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:13:16,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493886576] [2024-11-17 08:13:16,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:13:16,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:13:16,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:13:16,303 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:13:16,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:13:16,305 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:13:16,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:13:16,306 INFO L85 PathProgramCache]: Analyzing trace with hash -109851921, now seen corresponding path program 2 times [2024-11-17 08:13:16,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:13:16,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456290206] [2024-11-17 08:13:16,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:13:16,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:13:16,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:13:16,830 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 10 proven. 18 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-17 08:13:16,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:13:16,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456290206] [2024-11-17 08:13:16,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456290206] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 08:13:16,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1363224510] [2024-11-17 08:13:16,833 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-17 08:13:16,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 08:13:16,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:13:16,835 INFO L229 MonitoredProcess]: Starting monitored process 33 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:13:16,838 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2024-11-17 08:13:16,902 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-17 08:13:16,902 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 08:13:16,903 INFO L255 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-17 08:13:16,904 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:13:17,013 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 08:13:17,013 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:13:17,021 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 10 proven. 13 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-17 08:13:17,021 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 08:13:17,106 INFO L349 Elim1Store]: treesize reduction 13, result has 60.6 percent of original size [2024-11-17 08:13:17,107 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:13:17,141 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 12 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-17 08:13:17,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1363224510] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 08:13:17,141 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 08:13:17,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 7] total 17 [2024-11-17 08:13:17,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253577324] [2024-11-17 08:13:17,141 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 08:13:17,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:13:17,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-17 08:13:17,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2024-11-17 08:13:17,205 INFO L87 Difference]: Start difference. First operand 37 states and 45 transitions. cyclomatic complexity: 12 Second operand has 17 states, 17 states have (on average 3.235294117647059) internal successors, (55), 17 states have internal predecessors, (55), 0 states have call successors, (0), 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:13:17,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:13:17,310 INFO L93 Difference]: Finished difference Result 68 states and 86 transitions. [2024-11-17 08:13:17,310 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 68 states and 86 transitions. [2024-11-17 08:13:17,311 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2024-11-17 08:13:17,311 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 68 states to 68 states and 86 transitions. [2024-11-17 08:13:17,311 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2024-11-17 08:13:17,311 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2024-11-17 08:13:17,312 INFO L73 IsDeterministic]: Start isDeterministic. Operand 68 states and 86 transitions. [2024-11-17 08:13:17,312 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:13:17,312 INFO L218 hiAutomatonCegarLoop]: Abstraction has 68 states and 86 transitions. [2024-11-17 08:13:17,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states and 86 transitions. [2024-11-17 08:13:17,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 59. [2024-11-17 08:13:17,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 59 states have (on average 1.271186440677966) internal successors, (75), 58 states have internal predecessors, (75), 0 states have call successors, (0), 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:13:17,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 75 transitions. [2024-11-17 08:13:17,315 INFO L240 hiAutomatonCegarLoop]: Abstraction has 59 states and 75 transitions. [2024-11-17 08:13:17,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-17 08:13:17,316 INFO L425 stractBuchiCegarLoop]: Abstraction has 59 states and 75 transitions. [2024-11-17 08:13:17,317 INFO L332 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2024-11-17 08:13:17,317 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 59 states and 75 transitions. [2024-11-17 08:13:17,317 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-11-17 08:13:17,317 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:13:17,317 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:13:17,318 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:13:17,318 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-17 08:13:17,318 INFO L745 eck$LassoCheckResult]: Stem: 1830#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1831#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_#t~nondet10#1, main_#t~post11#1, main_~k~0#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet8#1;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 1848#L527 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 1849#L530-1 call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~k~0#1 := 0; 1826#L532-1 assume true; 1827#L532-2 assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet10#1;call write~int#0(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1;main_#t~post11#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 1828#L532-1 assume true; 1829#L532-2 assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet10#1;call write~int#0(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1;main_#t~post11#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 1834#L532-1 assume true; 1859#L532-2 assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet10#1;call write~int#0(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1;main_#t~post11#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 1858#L532-1 assume true; 1832#L532-2 assume !(main_~k~0#1 < main_~array_size~0#1); 1833#L532 havoc main_~k~0#1;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; 1841#L515 assume true; 1842#L515-2 assume !!(bubbleSort_~i~0#1 >= 0);bubbleSort_~j~0#1 := 1; 1870#L516 assume true; 1852#L516-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); 1853#L517 assume !(bubbleSort_#t~mem2#1 > bubbleSort_#t~mem3#1);havoc bubbleSort_#t~mem2#1;havoc bubbleSort_#t~mem3#1; 1883#L516-1 bubbleSort_#t~post6#1 := bubbleSort_~j~0#1;bubbleSort_~j~0#1 := 1 + bubbleSort_#t~post6#1;havoc bubbleSort_#t~post6#1; 1875#L516 assume true; 1874#L516-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); 1872#L517 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); 1871#L516-1 bubbleSort_#t~post6#1 := bubbleSort_~j~0#1;bubbleSort_~j~0#1 := 1 + bubbleSort_#t~post6#1;havoc bubbleSort_#t~post6#1; 1868#L516 assume true; 1865#L516-2 assume !(bubbleSort_~j~0#1 <= bubbleSort_~i~0#1); 1835#L515-1 bubbleSort_#t~post7#1 := bubbleSort_~i~0#1;bubbleSort_~i~0#1 := bubbleSort_#t~post7#1 - 1;havoc bubbleSort_#t~post7#1; 1836#L515 assume true; 1837#L515-2 assume !!(bubbleSort_~i~0#1 >= 0);bubbleSort_~j~0#1 := 1; 1838#L516 [2024-11-17 08:13:17,318 INFO L747 eck$LassoCheckResult]: Loop: 1838#L516 assume true; 1850#L516-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); 1851#L517 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); 1845#L516-1 bubbleSort_#t~post6#1 := bubbleSort_~j~0#1;bubbleSort_~j~0#1 := 1 + bubbleSort_#t~post6#1;havoc bubbleSort_#t~post6#1; 1838#L516 [2024-11-17 08:13:17,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:13:17,319 INFO L85 PathProgramCache]: Analyzing trace with hash 371839408, now seen corresponding path program 3 times [2024-11-17 08:13:17,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:13:17,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010981746] [2024-11-17 08:13:17,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:13:17,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:13:17,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:13:17,332 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:13:17,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:13:17,344 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:13:17,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:13:17,344 INFO L85 PathProgramCache]: Analyzing trace with hash 1291775, now seen corresponding path program 8 times [2024-11-17 08:13:17,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:13:17,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779063861] [2024-11-17 08:13:17,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:13:17,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:13:17,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:13:17,353 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:13:17,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:13:17,360 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:13:17,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:13:17,365 INFO L85 PathProgramCache]: Analyzing trace with hash 1687099438, now seen corresponding path program 4 times [2024-11-17 08:13:17,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:13:17,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419835452] [2024-11-17 08:13:17,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:13:17,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:13:17,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:13:17,394 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:13:17,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:13:17,420 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:13:19,332 INFO L204 LassoAnalysis]: Preferences: [2024-11-17 08:13:19,332 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-17 08:13:19,332 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-17 08:13:19,332 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-17 08:13:19,332 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-17 08:13:19,332 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:13:19,332 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-17 08:13:19,332 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-17 08:13:19,332 INFO L132 ssoRankerPreferences]: Filename of dumped script: bubblesort-alloca-2.i_Iteration11_Lasso [2024-11-17 08:13:19,332 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-17 08:13:19,332 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-17 08:13:19,334 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:13:19,337 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:13:19,339 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:13:19,342 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:13:19,348 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:13:19,350 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:13:19,351 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:13:19,353 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:13:19,620 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:13:19,623 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:13:19,624 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:13:19,626 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:13:19,628 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:13:19,630 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:13:19,632 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:13:19,634 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:13:19,636 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:13:19,638 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:13:19,640 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:13:19,641 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:13:19,841 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-17 08:13:19,842 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-17 08:13:19,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:13:19,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:13:19,844 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:13:19,846 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2024-11-17 08:13:19,847 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:13:19,858 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:13:19,858 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:13:19,858 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:13:19,858 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:13:19,858 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:13:19,859 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:13:19,859 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:13:19,860 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:13:19,870 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2024-11-17 08:13:19,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:13:19,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:13:19,871 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:13:19,872 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2024-11-17 08:13:19,873 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:13:19,883 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:13:19,883 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:13:19,883 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:13:19,883 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:13:19,883 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:13:19,883 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:13:19,883 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:13:19,884 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:13:19,894 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2024-11-17 08:13:19,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:13:19,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:13:19,896 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:13:19,897 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2024-11-17 08:13:19,897 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:13:19,908 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:13:19,908 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:13:19,909 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:13:19,909 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:13:19,909 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:13:19,909 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:13:19,909 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:13:19,910 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:13:19,920 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Forceful destruction successful, exit code 0 [2024-11-17 08:13:19,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:13:19,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:13:19,921 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:13:19,923 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2024-11-17 08:13:19,923 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:13:19,933 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:13:19,933 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:13:19,933 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:13:19,933 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:13:19,934 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:13:19,934 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:13:19,936 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:13:19,947 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2024-11-17 08:13:19,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:13:19,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:13:19,948 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:13:19,949 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2024-11-17 08:13:19,950 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:13:19,960 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:13:19,960 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:13:19,960 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:13:19,960 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:13:19,960 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:13:19,960 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:13:19,960 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:13:19,961 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:13:19,971 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Forceful destruction successful, exit code 0 [2024-11-17 08:13:19,972 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:13:19,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:13:19,973 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:13:19,974 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2024-11-17 08:13:19,974 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:13:19,984 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:13:19,984 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:13:19,984 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:13:19,987 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:13:19,987 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:13:19,988 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:13:19,989 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:13:19,992 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:13:20,002 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Forceful destruction successful, exit code 0 [2024-11-17 08:13:20,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:13:20,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:13:20,004 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:13:20,005 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2024-11-17 08:13:20,006 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:13:20,016 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:13:20,016 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:13:20,016 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:13:20,016 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:13:20,016 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:13:20,016 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:13:20,016 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:13:20,017 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:13:20,027 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Ended with exit code 0 [2024-11-17 08:13:20,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:13:20,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:13:20,029 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:13:20,030 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2024-11-17 08:13:20,030 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:13:20,040 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:13:20,040 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:13:20,040 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:13:20,041 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:13:20,042 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:13:20,042 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:13:20,047 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:13:20,060 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Ended with exit code 0 [2024-11-17 08:13:20,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:13:20,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:13:20,061 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:13:20,062 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2024-11-17 08:13:20,064 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:13:20,074 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:13:20,075 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:13:20,075 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:13:20,075 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:13:20,082 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:13:20,082 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:13:20,092 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:13:20,107 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Forceful destruction successful, exit code 0 [2024-11-17 08:13:20,107 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:13:20,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:13:20,108 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:13:20,109 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2024-11-17 08:13:20,110 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:13:20,119 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:13:20,120 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:13:20,120 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:13:20,120 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:13:20,121 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:13:20,121 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:13:20,123 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:13:20,134 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Forceful destruction successful, exit code 0 [2024-11-17 08:13:20,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:13:20,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:13:20,136 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:13:20,137 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2024-11-17 08:13:20,138 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:13:20,148 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:13:20,163 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:13:20,163 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:13:20,163 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:13:20,168 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:13:20,168 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:13:20,177 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-17 08:13:20,216 INFO L443 ModelExtractionUtils]: Simplification made 20 calls to the SMT solver. [2024-11-17 08:13:20,216 INFO L444 ModelExtractionUtils]: 1 out of 19 variables were initially zero. Simplification set additionally 14 variables to zero. [2024-11-17 08:13:20,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:13:20,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:13:20,218 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:13:20,218 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2024-11-17 08:13:20,219 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-17 08:13:20,230 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-17 08:13:20,230 INFO L474 LassoAnalysis]: Proved termination. [2024-11-17 08:13:20,230 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_bubbleSort_~numbers#1.base)_3, ULTIMATE.start_bubbleSort_~j~0#1, ULTIMATE.start_bubbleSort_~numbers#1.offset) = 2*v_rep(select #length ULTIMATE.start_bubbleSort_~numbers#1.base)_3 - 4*ULTIMATE.start_bubbleSort_~j~0#1 - 1*ULTIMATE.start_bubbleSort_~numbers#1.offset Supporting invariants [] [2024-11-17 08:13:20,240 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Ended with exit code 0 [2024-11-17 08:13:20,247 INFO L156 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2024-11-17 08:13:20,248 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~numbers!offset [2024-11-17 08:13:20,249 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-17 08:13:20,250 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-17 08:13:20,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:13:20,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:13:20,281 INFO L255 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-17 08:13:20,282 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:13:20,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:13:20,310 INFO L255 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-17 08:13:20,311 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:13:20,335 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:13:20,336 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:13:20,336 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 59 states and 75 transitions. cyclomatic complexity: 21 Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:13:20,353 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 59 states and 75 transitions. cyclomatic complexity: 21. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 70 states and 90 transitions. Complement of second has 7 states. [2024-11-17 08:13:20,354 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:13:20,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:13:20,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2024-11-17 08:13:20,355 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 28 letters. Loop has 4 letters. [2024-11-17 08:13:20,355 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:13:20,355 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-17 08:13:20,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:13:20,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:13:20,398 INFO L255 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-17 08:13:20,398 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:13:20,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:13:20,430 INFO L255 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-17 08:13:20,430 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:13:20,462 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:13:20,463 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:13:20,463 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 59 states and 75 transitions. cyclomatic complexity: 21 Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:13:20,479 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 59 states and 75 transitions. cyclomatic complexity: 21. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 70 states and 90 transitions. Complement of second has 7 states. [2024-11-17 08:13:20,479 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:13:20,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:13:20,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2024-11-17 08:13:20,480 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 28 letters. Loop has 4 letters. [2024-11-17 08:13:20,480 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:13:20,480 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-17 08:13:20,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:13:20,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:13:20,523 INFO L255 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-17 08:13:20,523 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:13:20,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:13:20,561 INFO L255 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-17 08:13:20,561 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:13:20,590 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:13:20,591 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:13:20,591 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 59 states and 75 transitions. cyclomatic complexity: 21 Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:13:20,610 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 59 states and 75 transitions. cyclomatic complexity: 21. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 86 states and 114 transitions. Complement of second has 6 states. [2024-11-17 08:13:20,610 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:13:20,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:13:20,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 23 transitions. [2024-11-17 08:13:20,611 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 28 letters. Loop has 4 letters. [2024-11-17 08:13:20,611 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:13:20,611 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 32 letters. Loop has 4 letters. [2024-11-17 08:13:20,611 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:13:20,611 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 28 letters. Loop has 8 letters. [2024-11-17 08:13:20,612 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:13:20,612 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 86 states and 114 transitions. [2024-11-17 08:13:20,613 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-11-17 08:13:20,613 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 86 states to 0 states and 0 transitions. [2024-11-17 08:13:20,613 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2024-11-17 08:13:20,613 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2024-11-17 08:13:20,613 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2024-11-17 08:13:20,613 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-17 08:13:20,613 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-17 08:13:20,613 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-17 08:13:20,613 INFO L425 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-17 08:13:20,613 INFO L332 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2024-11-17 08:13:20,613 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2024-11-17 08:13:20,613 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-11-17 08:13:20,613 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2024-11-17 08:13:20,623 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 17.11 08:13:20 BoogieIcfgContainer [2024-11-17 08:13:20,623 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-11-17 08:13:20,624 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-17 08:13:20,624 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-17 08:13:20,624 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-17 08:13:20,624 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 08:13:08" (3/4) ... [2024-11-17 08:13:20,626 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-17 08:13:20,627 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-17 08:13:20,628 INFO L158 Benchmark]: Toolchain (without parser) took 12688.02ms. Allocated memory was 155.2MB in the beginning and 283.1MB in the end (delta: 127.9MB). Free memory was 99.7MB in the beginning and 190.3MB in the end (delta: -90.6MB). Peak memory consumption was 39.9MB. Max. memory is 16.1GB. [2024-11-17 08:13:20,628 INFO L158 Benchmark]: CDTParser took 0.56ms. Allocated memory is still 155.2MB. Free memory is still 90.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-17 08:13:20,628 INFO L158 Benchmark]: CACSL2BoogieTranslator took 405.22ms. Allocated memory is still 155.2MB. Free memory was 99.7MB in the beginning and 80.8MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-17 08:13:20,628 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.78ms. Allocated memory is still 155.2MB. Free memory was 80.8MB in the beginning and 79.1MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-17 08:13:20,628 INFO L158 Benchmark]: Boogie Preprocessor took 34.47ms. Allocated memory is still 155.2MB. Free memory was 79.1MB in the beginning and 77.1MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-17 08:13:20,629 INFO L158 Benchmark]: IcfgBuilder took 387.97ms. Allocated memory was 155.2MB in the beginning and 195.0MB in the end (delta: 39.8MB). Free memory was 77.1MB in the beginning and 159.8MB in the end (delta: -82.7MB). Peak memory consumption was 19.0MB. Max. memory is 16.1GB. [2024-11-17 08:13:20,629 INFO L158 Benchmark]: BuchiAutomizer took 11811.58ms. Allocated memory was 195.0MB in the beginning and 283.1MB in the end (delta: 88.1MB). Free memory was 159.8MB in the beginning and 191.3MB in the end (delta: -31.5MB). Peak memory consumption was 56.6MB. Max. memory is 16.1GB. [2024-11-17 08:13:20,629 INFO L158 Benchmark]: Witness Printer took 3.72ms. Allocated memory is still 283.1MB. Free memory was 191.3MB in the beginning and 190.3MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-17 08:13:20,630 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.56ms. Allocated memory is still 155.2MB. Free memory is still 90.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 405.22ms. Allocated memory is still 155.2MB. Free memory was 99.7MB in the beginning and 80.8MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.78ms. Allocated memory is still 155.2MB. Free memory was 80.8MB in the beginning and 79.1MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 34.47ms. Allocated memory is still 155.2MB. Free memory was 79.1MB in the beginning and 77.1MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 387.97ms. Allocated memory was 155.2MB in the beginning and 195.0MB in the end (delta: 39.8MB). Free memory was 77.1MB in the beginning and 159.8MB in the end (delta: -82.7MB). Peak memory consumption was 19.0MB. Max. memory is 16.1GB. * BuchiAutomizer took 11811.58ms. Allocated memory was 195.0MB in the beginning and 283.1MB in the end (delta: 88.1MB). Free memory was 159.8MB in the beginning and 191.3MB in the end (delta: -31.5MB). Peak memory consumption was 56.6MB. Max. memory is 16.1GB. * Witness Printer took 3.72ms. Allocated memory is still 283.1MB. Free memory was 191.3MB in the beginning and 190.3MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - 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] - 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 12 terminating modules (7 trivial, 4 deterministic, 1 nondeterministic). One deterministic module has affine ranking function (array_size + ((long long) -1 * k)) and consists of 4 locations. One deterministic module has affine ranking function (((long long) 2 * i) + 1) and consists of 4 locations. One deterministic module has affine ranking function (((long long) -4 * j) + 5) and consists of 10 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. 7 modules have a trivial ranking function, the largest among these consists of 17 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 11.7s and 12 iterations. TraceHistogramMax:4. Analysis of lassos took 10.0s. Construction of modules took 0.3s. Büchi inclusion checks took 1.2s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 11. Automata minimization 0.0s AutomataMinimizationTime, 11 MinimizatonAttempts, 39 StatesRemovedByMinimization, 8 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 [4, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 216 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 210 mSDsluCounter, 615 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 434 mSDsCounter, 42 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 522 IncrementalHoareTripleChecker+Invalid, 564 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 42 mSolverCounterUnsat, 181 mSDtfsCounter, 522 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc3 concLT0 SILN0 SILU2 SILI1 SILT1 lasso4 LassoPreprocessingBenchmarks: Lassos: inital139 mio100 ax167 hnf100 lsp72 ukn71 mio100 lsp67 div132 bol100 ite100 ukn100 eq176 hnf91 smp88 dnf100 smp100 tf103 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 22ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 2 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2024-11-17 08:13:20,659 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Forceful destruction successful, exit code 0 [2024-11-17 08:13:20,858 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2024-11-17 08:13:21,058 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2024-11-17 08:13:21,258 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Ended with exit code 0 [2024-11-17 08:13:21,458 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Ended with exit code 0 [2024-11-17 08:13:21,658 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2024-11-17 08:13:21,859 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