./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 906a4fb5 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.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.graphml --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 a2eb39e0d0d0fa911fcf8a16c5f9511be1d37325 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis No suitable file found in config dir /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config using search string *Termination*32bit*_Bitvector*.epf No suitable settings file found using Termination*32bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: MapEliminator tries to combine Int and (Array Int Int) --- Real Ultimate output --- This is Ultimate 0.1.25-906a4fb [2020-10-19 20:25:05,796 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-19 20:25:05,799 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-19 20:25:05,837 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-19 20:25:05,838 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-19 20:25:05,839 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-19 20:25:05,840 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-19 20:25:05,842 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-19 20:25:05,844 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-19 20:25:05,845 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-19 20:25:05,846 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-19 20:25:05,847 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-19 20:25:05,847 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-19 20:25:05,848 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-19 20:25:05,850 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-19 20:25:05,851 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-19 20:25:05,852 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-19 20:25:05,853 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-19 20:25:05,855 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-19 20:25:05,857 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-19 20:25:05,858 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-19 20:25:05,859 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-19 20:25:05,861 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-19 20:25:05,861 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-19 20:25:05,864 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-19 20:25:05,864 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-19 20:25:05,865 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-19 20:25:05,866 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-19 20:25:05,866 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-19 20:25:05,867 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-19 20:25:05,867 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-19 20:25:05,868 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-19 20:25:05,869 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-19 20:25:05,870 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-19 20:25:05,871 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-19 20:25:05,871 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-19 20:25:05,872 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-19 20:25:05,872 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-19 20:25:05,872 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-19 20:25:05,873 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-19 20:25:05,874 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-19 20:25:05,875 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2020-10-19 20:25:05,900 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-19 20:25:05,900 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-19 20:25:05,902 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-19 20:25:05,902 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-19 20:25:05,902 INFO L138 SettingsManager]: * Use SBE=true [2020-10-19 20:25:05,903 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-10-19 20:25:05,903 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-10-19 20:25:05,903 INFO L138 SettingsManager]: * Use old map elimination=false [2020-10-19 20:25:05,903 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-10-19 20:25:05,904 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-10-19 20:25:05,904 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-10-19 20:25:05,904 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-19 20:25:05,905 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-19 20:25:05,905 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-10-19 20:25:05,905 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-19 20:25:05,905 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-19 20:25:05,906 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-19 20:25:05,906 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-10-19 20:25:05,906 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-10-19 20:25:05,907 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-10-19 20:25:05,907 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-19 20:25:05,907 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-19 20:25:05,907 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-10-19 20:25:05,908 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-19 20:25:05,908 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-10-19 20:25:05,908 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-19 20:25:05,909 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-19 20:25:05,909 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-10-19 20:25:05,909 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-19 20:25:05,909 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-19 20:25:05,910 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-19 20:25:05,910 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-10-19 20:25:05,911 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-10-19 20:25:05,911 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR 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.graphml 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 -> a2eb39e0d0d0fa911fcf8a16c5f9511be1d37325 [2020-10-19 20:25:06,259 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-19 20:25:06,278 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-19 20:25:06,282 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-19 20:25:06,283 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-19 20:25:06,284 INFO L275 PluginConnector]: CDTParser initialized [2020-10-19 20:25:06,284 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-memsafety/bubblesort-alloca-2.i [2020-10-19 20:25:06,341 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b77ee6b97/aabb0bafc0bf464b8da12d3dd71a4a9e/FLAG6836124af [2020-10-19 20:25:06,822 INFO L306 CDTParser]: Found 1 translation units. [2020-10-19 20:25:06,823 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/bubblesort-alloca-2.i [2020-10-19 20:25:06,835 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b77ee6b97/aabb0bafc0bf464b8da12d3dd71a4a9e/FLAG6836124af [2020-10-19 20:25:07,155 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b77ee6b97/aabb0bafc0bf464b8da12d3dd71a4a9e [2020-10-19 20:25:07,158 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-19 20:25:07,165 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-19 20:25:07,166 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-19 20:25:07,166 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-19 20:25:07,170 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-19 20:25:07,171 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.10 08:25:07" (1/1) ... [2020-10-19 20:25:07,174 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26b3f46b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:25:07, skipping insertion in model container [2020-10-19 20:25:07,174 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.10 08:25:07" (1/1) ... [2020-10-19 20:25:07,182 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-19 20:25:07,216 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-19 20:25:07,590 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-19 20:25:07,604 INFO L203 MainTranslator]: Completed pre-run [2020-10-19 20:25:07,679 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-19 20:25:07,743 INFO L208 MainTranslator]: Completed translation [2020-10-19 20:25:07,744 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:25:07 WrapperNode [2020-10-19 20:25:07,745 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-19 20:25:07,747 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-19 20:25:07,747 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-19 20:25:07,748 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-19 20:25:07,756 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:25:07" (1/1) ... [2020-10-19 20:25:07,775 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:25:07" (1/1) ... [2020-10-19 20:25:07,799 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-19 20:25:07,800 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-19 20:25:07,800 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-19 20:25:07,800 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-19 20:25:07,809 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:25:07" (1/1) ... [2020-10-19 20:25:07,810 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:25:07" (1/1) ... [2020-10-19 20:25:07,813 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:25:07" (1/1) ... [2020-10-19 20:25:07,813 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:25:07" (1/1) ... [2020-10-19 20:25:07,819 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:25:07" (1/1) ... [2020-10-19 20:25:07,824 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:25:07" (1/1) ... [2020-10-19 20:25:07,826 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:25:07" (1/1) ... [2020-10-19 20:25:07,829 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-19 20:25:07,829 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-19 20:25:07,829 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-19 20:25:07,830 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-19 20:25:07,830 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:25:07" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:25:07,901 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-19 20:25:07,902 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-19 20:25:07,902 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-19 20:25:07,902 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-19 20:25:07,902 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-19 20:25:07,903 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-19 20:25:08,237 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-19 20:25:08,238 INFO L298 CfgBuilder]: Removed 9 assume(true) statements. [2020-10-19 20:25:08,240 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.10 08:25:08 BoogieIcfgContainer [2020-10-19 20:25:08,240 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-19 20:25:08,240 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-10-19 20:25:08,241 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-10-19 20:25:08,244 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-10-19 20:25:08,245 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-19 20:25:08,245 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 19.10 08:25:07" (1/3) ... [2020-10-19 20:25:08,246 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@217a3cfe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.10 08:25:08, skipping insertion in model container [2020-10-19 20:25:08,247 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-19 20:25:08,247 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:25:07" (2/3) ... [2020-10-19 20:25:08,247 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@217a3cfe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.10 08:25:08, skipping insertion in model container [2020-10-19 20:25:08,248 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-19 20:25:08,248 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.10 08:25:08" (3/3) ... [2020-10-19 20:25:08,249 INFO L373 chiAutomizerObserver]: Analyzing ICFG bubblesort-alloca-2.i [2020-10-19 20:25:08,294 INFO L359 BuchiCegarLoop]: Interprodecural is true [2020-10-19 20:25:08,294 INFO L360 BuchiCegarLoop]: Hoare is false [2020-10-19 20:25:08,294 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-10-19 20:25:08,294 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-19 20:25:08,294 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-19 20:25:08,294 INFO L364 BuchiCegarLoop]: Difference is false [2020-10-19 20:25:08,294 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-19 20:25:08,295 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-10-19 20:25:08,309 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states. [2020-10-19 20:25:08,328 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2020-10-19 20:25:08,328 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 20:25:08,328 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 20:25:08,334 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-10-19 20:25:08,334 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-19 20:25:08,334 INFO L427 BuchiCegarLoop]: ======== Iteration 1============ [2020-10-19 20:25:08,334 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states. [2020-10-19 20:25:08,336 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2020-10-19 20:25:08,336 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 20:25:08,336 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 20:25:08,336 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-10-19 20:25:08,336 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-19 20:25:08,343 INFO L794 eck$LassoCheckResult]: Stem: 10#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 9#L-1true havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~k~0, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 18#L527true assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 3#L527-2true call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;main_~k~0 := 0; 13#L532-3true [2020-10-19 20:25:08,344 INFO L796 eck$LassoCheckResult]: Loop: 13#L532-3true assume !!(main_~k~0 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~k~0, 4);havoc main_#t~nondet11; 11#L532-2true main_#t~post10 := main_~k~0;main_~k~0 := 1 + main_#t~post10;havoc main_#t~post10; 13#L532-3true [2020-10-19 20:25:08,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:25:08,349 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2020-10-19 20:25:08,356 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:25:08,356 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322983766] [2020-10-19 20:25:08,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:25:08,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:25:08,447 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:25:08,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:25:08,458 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:25:08,478 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:25:08,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:25:08,479 INFO L82 PathProgramCache]: Analyzing trace with hash 1507, now seen corresponding path program 1 times [2020-10-19 20:25:08,480 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:25:08,480 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100337633] [2020-10-19 20:25:08,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:25:08,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:25:08,490 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:25:08,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:25:08,497 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:25:08,499 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:25:08,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:25:08,501 INFO L82 PathProgramCache]: Analyzing trace with hash 889568455, now seen corresponding path program 1 times [2020-10-19 20:25:08,501 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:25:08,502 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488362052] [2020-10-19 20:25:08,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:25:08,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:25:08,536 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:25:08,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:25:08,550 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:25:08,554 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:25:08,785 INFO L210 LassoAnalysis]: Preferences: [2020-10-19 20:25:08,786 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-19 20:25:08,786 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-19 20:25:08,786 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-19 20:25:08,787 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-19 20:25:08,787 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:25:08,787 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-19 20:25:08,787 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-19 20:25:08,787 INFO L133 ssoRankerPreferences]: Filename of dumped script: bubblesort-alloca-2.i_Iteration1_Lasso [2020-10-19 20:25:08,788 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-19 20:25:08,788 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-19 20:25:08,812 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:25:08,819 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:25:08,823 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:25:08,827 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:25:08,831 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:25:08,835 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:25:08,839 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:25:08,843 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:25:08,980 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:25:09,246 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-19 20:25:09,251 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:25:09,262 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:25:09,265 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:25:09,265 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:25:09,266 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:25:09,266 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:25:09,267 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:25:09,270 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:25:09,270 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:25:09,273 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 20:25:09,308 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:25:09,310 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:25:09,310 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:25:09,311 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:25:09,311 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:25:09,311 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:25:09,312 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:25:09,312 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:25:09,318 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:25:09,357 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:25:09,359 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:25:09,359 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:25:09,359 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:25:09,360 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:25:09,366 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:25:09,366 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:25:09,371 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 20:25:09,412 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:25:09,414 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:25:09,415 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:25:09,415 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:25:09,415 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:25:09,419 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:25:09,420 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:25:09,425 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 20:25:09,463 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:25:09,465 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:25:09,465 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:25:09,465 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:25:09,466 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:25:09,466 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:25:09,468 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:25:09,468 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:25:09,471 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 20:25:09,508 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:25:09,510 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:25:09,510 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:25:09,510 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:25:09,510 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:25:09,519 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:25:09,520 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:25:09,526 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:25:09,553 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:25:09,555 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:25:09,555 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:25:09,556 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:25:09,556 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:25:09,559 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:25:09,559 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:25:09,570 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 20:25:09,609 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:25:09,611 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:25:09,611 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:25:09,611 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:25:09,612 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:25:09,612 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:25:09,613 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:25:09,613 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:25:09,617 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:25:09,641 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:25:09,644 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:25:09,644 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:25:09,644 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:25:09,644 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:25:09,649 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:25:09,649 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:25:09,663 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:25:09,699 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:25:09,702 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:25:09,702 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:25:09,702 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:25:09,703 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:25:09,709 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:25:09,710 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:25:09,715 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 20:25:09,758 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:25:09,760 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:25:09,760 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:25:09,760 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:25:09,761 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:25:09,767 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:25:09,767 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:25:09,774 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:25:09,810 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:25:09,812 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:25:09,812 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:25:09,812 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:25:09,813 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:25:09,813 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:25:09,814 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:25:09,814 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:25:09,816 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 20:25:09,873 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:25:09,877 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:25:09,877 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:25:09,877 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:25:09,878 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:25:09,890 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:25:09,891 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:25:09,910 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-19 20:25:09,969 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2020-10-19 20:25:09,969 INFO L444 ModelExtractionUtils]: 8 out of 22 variables were initially zero. Simplification set additionally 10 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 20:25:09,977 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:25:09,982 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2020-10-19 20:25:09,983 INFO L510 LassoAnalysis]: Proved termination. [2020-10-19 20:25:09,983 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~k~0, v_rep(select #length ULTIMATE.start_main_~numbers~0.base)_1) = -4*ULTIMATE.start_main_~k~0 + 1*v_rep(select #length ULTIMATE.start_main_~numbers~0.base)_1 Supporting invariants [1*ULTIMATE.start_main_~numbers~0.offset >= 0] [2020-10-19 20:25:10,030 INFO L297 tatePredicateManager]: 3 out of 4 supporting invariants were superfluous and have been removed [2020-10-19 20:25:10,041 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-10-19 20:25:10,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:25:10,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:25:10,094 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-19 20:25:10,096 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 20:25:10,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:25:10,110 INFO L263 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 5 conjunts are in the unsatisfiable core [2020-10-19 20:25:10,111 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 20:25:10,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 20:25:10,148 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2020-10-19 20:25:10,150 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states. Second operand 3 states. [2020-10-19 20:25:10,231 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states.. Second operand 3 states. Result 38 states and 56 transitions. Complement of second has 7 states. [2020-10-19 20:25:10,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-10-19 20:25:10,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-19 20:25:10,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 37 transitions. [2020-10-19 20:25:10,236 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 37 transitions. Stem has 4 letters. Loop has 2 letters. [2020-10-19 20:25:10,237 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 20:25:10,237 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 37 transitions. Stem has 6 letters. Loop has 2 letters. [2020-10-19 20:25:10,238 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 20:25:10,238 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 37 transitions. Stem has 4 letters. Loop has 4 letters. [2020-10-19 20:25:10,238 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 20:25:10,239 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 56 transitions. [2020-10-19 20:25:10,243 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-10-19 20:25:10,247 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 13 states and 18 transitions. [2020-10-19 20:25:10,248 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2020-10-19 20:25:10,248 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2020-10-19 20:25:10,249 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 18 transitions. [2020-10-19 20:25:10,249 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 20:25:10,250 INFO L691 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2020-10-19 20:25:10,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 18 transitions. [2020-10-19 20:25:10,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2020-10-19 20:25:10,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-10-19 20:25:10,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 18 transitions. [2020-10-19 20:25:10,278 INFO L714 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2020-10-19 20:25:10,278 INFO L594 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2020-10-19 20:25:10,279 INFO L427 BuchiCegarLoop]: ======== Iteration 2============ [2020-10-19 20:25:10,279 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 18 transitions. [2020-10-19 20:25:10,280 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-10-19 20:25:10,280 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 20:25:10,280 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 20:25:10,280 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2020-10-19 20:25:10,281 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-19 20:25:10,281 INFO L794 eck$LassoCheckResult]: Stem: 122#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 120#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~k~0, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 121#L527 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 123#L527-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;main_~k~0 := 0; 124#L532-3 assume !(main_~k~0 < main_~array_size~0); 132#L532-4 bubbleSort_#in~numbers.base, bubbleSort_#in~numbers.offset, bubbleSort_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc bubbleSort_#t~mem4, bubbleSort_#t~mem5, bubbleSort_#t~mem6, bubbleSort_#t~mem7, bubbleSort_#t~post3, bubbleSort_#t~post2, bubbleSort_~numbers.base, bubbleSort_~numbers.offset, bubbleSort_~array_size, bubbleSort_~i~0, bubbleSort_~j~0, bubbleSort_~temp~0;bubbleSort_~numbers.base, bubbleSort_~numbers.offset := bubbleSort_#in~numbers.base, bubbleSort_#in~numbers.offset;bubbleSort_~array_size := bubbleSort_#in~array_size;havoc bubbleSort_~i~0;havoc bubbleSort_~j~0;havoc bubbleSort_~temp~0;bubbleSort_~i~0 := bubbleSort_~array_size - 1; 131#L515-3 [2020-10-19 20:25:10,281 INFO L796 eck$LassoCheckResult]: Loop: 131#L515-3 assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 128#L516-3 assume !(bubbleSort_~j~0 <= bubbleSort_~i~0); 129#L515-2 bubbleSort_#t~post2 := bubbleSort_~i~0;bubbleSort_~i~0 := bubbleSort_#t~post2 - 1;havoc bubbleSort_#t~post2; 131#L515-3 [2020-10-19 20:25:10,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:25:10,282 INFO L82 PathProgramCache]: Analyzing trace with hash 889568397, now seen corresponding path program 1 times [2020-10-19 20:25:10,282 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:25:10,282 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850436381] [2020-10-19 20:25:10,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:25:10,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:25:10,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 20:25:10,375 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850436381] [2020-10-19 20:25:10,376 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-19 20:25:10,376 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-19 20:25:10,377 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144827784] [2020-10-19 20:25:10,380 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-19 20:25:10,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:25:10,381 INFO L82 PathProgramCache]: Analyzing trace with hash 60779, now seen corresponding path program 1 times [2020-10-19 20:25:10,381 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:25:10,381 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694284843] [2020-10-19 20:25:10,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:25:10,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:25:10,401 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:25:10,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:25:10,404 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:25:10,405 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:25:10,456 INFO L210 LassoAnalysis]: Preferences: [2020-10-19 20:25:10,456 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-19 20:25:10,456 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-19 20:25:10,456 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-19 20:25:10,457 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-10-19 20:25:10,457 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:25:10,457 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-19 20:25:10,457 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-19 20:25:10,457 INFO L133 ssoRankerPreferences]: Filename of dumped script: bubblesort-alloca-2.i_Iteration2_Loop [2020-10-19 20:25:10,457 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-19 20:25:10,457 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-19 20:25:10,459 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:25:10,462 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:25:10,465 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:25:10,469 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:25:10,479 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:25:10,554 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-19 20:25:10,555 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 20:25:10,561 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-19 20:25:10,561 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:25:10,567 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-10-19 20:25:10,567 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_bubbleSort_#t~post2=0} Honda state: {ULTIMATE.start_bubbleSort_#t~post2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 20:25:10,614 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-19 20:25:10,614 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:25:10,618 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-10-19 20:25:10,618 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~P_PID_2=1} Honda state: {v_rep~unnamed0~0~P_PID_2=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 20:25:10,665 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-19 20:25:10,665 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:25:10,669 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-10-19 20:25:10,670 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~P_PGID_2=2} Honda state: {v_rep~unnamed0~0~P_PGID_2=2} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 20:25:10,721 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-19 20:25:10,721 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 20:25:10,767 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-10-19 20:25:10,767 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:25:10,810 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-10-19 20:25:10,812 INFO L210 LassoAnalysis]: Preferences: [2020-10-19 20:25:10,812 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-19 20:25:10,813 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-19 20:25:10,813 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-19 20:25:10,813 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-19 20:25:10,813 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:25:10,813 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-19 20:25:10,813 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-19 20:25:10,813 INFO L133 ssoRankerPreferences]: Filename of dumped script: bubblesort-alloca-2.i_Iteration2_Loop [2020-10-19 20:25:10,815 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-19 20:25:10,816 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-19 20:25:10,817 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:25:10,823 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:25:10,827 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:25:10,837 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:25:10,840 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:25:10,972 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-19 20:25:10,972 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:25:10,981 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:25:10,983 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:25:10,983 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:25:10,983 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:25:10,983 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:25:10,984 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:25:10,984 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:25:10,984 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:25:10,986 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:25:11,010 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:25:11,015 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:25:11,015 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:25:11,015 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:25:11,016 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:25:11,019 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:25:11,019 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:25:11,023 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 20:25:11,064 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:25:11,065 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:25:11,066 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:25:11,066 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:25:11,066 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:25:11,066 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:25:11,068 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:25:11,068 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:25:11,071 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-19 20:25:11,075 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-10-19 20:25:11,076 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 20:25:11,082 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-19 20:25:11,083 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-10-19 20:25:11,083 INFO L510 LassoAnalysis]: Proved termination. [2020-10-19 20:25:11,083 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_bubbleSort_~i~0) = 2*ULTIMATE.start_bubbleSort_~i~0 + 1 Supporting invariants [] Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:25:11,125 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-10-19 20:25:11,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:25:11,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:25:11,152 INFO L263 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-19 20:25:11,153 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 20:25:11,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:25:11,159 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-19 20:25:11,160 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 20:25:11,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 20:25:11,171 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2020-10-19 20:25:11,171 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 18 transitions. cyclomatic complexity: 7 Second operand 3 states. [2020-10-19 20:25:11,188 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 18 transitions. cyclomatic complexity: 7. Second operand 3 states. Result 19 states and 28 transitions. Complement of second has 4 states. [2020-10-19 20:25:11,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2020-10-19 20:25:11,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-19 20:25:11,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 16 transitions. [2020-10-19 20:25:11,190 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 6 letters. Loop has 3 letters. [2020-10-19 20:25:11,191 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 20:25:11,191 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 9 letters. Loop has 3 letters. [2020-10-19 20:25:11,191 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 20:25:11,191 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 6 letters. Loop has 6 letters. [2020-10-19 20:25:11,192 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 20:25:11,192 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 28 transitions. [2020-10-19 20:25:11,193 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-19 20:25:11,194 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 18 states and 26 transitions. [2020-10-19 20:25:11,194 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2020-10-19 20:25:11,194 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2020-10-19 20:25:11,194 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 26 transitions. [2020-10-19 20:25:11,195 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-19 20:25:11,195 INFO L691 BuchiCegarLoop]: Abstraction has 18 states and 26 transitions. [2020-10-19 20:25:11,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 26 transitions. [2020-10-19 20:25:11,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2020-10-19 20:25:11,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-10-19 20:25:11,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 25 transitions. [2020-10-19 20:25:11,198 INFO L714 BuchiCegarLoop]: Abstraction has 17 states and 25 transitions. [2020-10-19 20:25:11,198 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 20:25:11,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-19 20:25:11,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-19 20:25:11,202 INFO L87 Difference]: Start difference. First operand 17 states and 25 transitions. Second operand 4 states. [2020-10-19 20:25:11,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 20:25:11,229 INFO L93 Difference]: Finished difference Result 18 states and 25 transitions. [2020-10-19 20:25:11,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-19 20:25:11,230 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 25 transitions. [2020-10-19 20:25:11,231 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-19 20:25:11,232 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 18 states and 25 transitions. [2020-10-19 20:25:11,232 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2020-10-19 20:25:11,232 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2020-10-19 20:25:11,233 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 25 transitions. [2020-10-19 20:25:11,233 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-19 20:25:11,233 INFO L691 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2020-10-19 20:25:11,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 25 transitions. [2020-10-19 20:25:11,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2020-10-19 20:25:11,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-10-19 20:25:11,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 24 transitions. [2020-10-19 20:25:11,235 INFO L714 BuchiCegarLoop]: Abstraction has 17 states and 24 transitions. [2020-10-19 20:25:11,236 INFO L594 BuchiCegarLoop]: Abstraction has 17 states and 24 transitions. [2020-10-19 20:25:11,236 INFO L427 BuchiCegarLoop]: ======== Iteration 3============ [2020-10-19 20:25:11,236 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 24 transitions. [2020-10-19 20:25:11,237 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-19 20:25:11,237 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 20:25:11,237 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 20:25:11,238 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 20:25:11,238 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-19 20:25:11,238 INFO L794 eck$LassoCheckResult]: Stem: 236#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 234#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~k~0, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 235#L527 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 237#L527-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;main_~k~0 := 0; 238#L532-3 assume !!(main_~k~0 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~k~0, 4);havoc main_#t~nondet11; 243#L532-2 main_#t~post10 := main_~k~0;main_~k~0 := 1 + main_#t~post10;havoc main_#t~post10; 244#L532-3 assume !(main_~k~0 < main_~array_size~0); 249#L532-4 bubbleSort_#in~numbers.base, bubbleSort_#in~numbers.offset, bubbleSort_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc bubbleSort_#t~mem4, bubbleSort_#t~mem5, bubbleSort_#t~mem6, bubbleSort_#t~mem7, bubbleSort_#t~post3, bubbleSort_#t~post2, bubbleSort_~numbers.base, bubbleSort_~numbers.offset, bubbleSort_~array_size, bubbleSort_~i~0, bubbleSort_~j~0, bubbleSort_~temp~0;bubbleSort_~numbers.base, bubbleSort_~numbers.offset := bubbleSort_#in~numbers.base, bubbleSort_#in~numbers.offset;bubbleSort_~array_size := bubbleSort_#in~array_size;havoc bubbleSort_~i~0;havoc bubbleSort_~j~0;havoc bubbleSort_~temp~0;bubbleSort_~i~0 := bubbleSort_~array_size - 1; 250#L515-3 assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 240#L516-3 [2020-10-19 20:25:11,238 INFO L796 eck$LassoCheckResult]: Loop: 240#L516-3 assume !!(bubbleSort_~j~0 <= bubbleSort_~i~0);call bubbleSort_#t~mem4 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);call bubbleSort_#t~mem5 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4); 245#L517 assume bubbleSort_#t~mem4 > bubbleSort_#t~mem5;havoc bubbleSort_#t~mem5;havoc bubbleSort_#t~mem4;call bubbleSort_#t~mem6 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);bubbleSort_~temp~0 := bubbleSort_#t~mem6;havoc bubbleSort_#t~mem6;call bubbleSort_#t~mem7 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4);call write~int(bubbleSort_#t~mem7, bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);havoc bubbleSort_#t~mem7;call write~int(bubbleSort_~temp~0, bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4); 239#L516-2 bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; 240#L516-3 [2020-10-19 20:25:11,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:25:11,239 INFO L82 PathProgramCache]: Analyzing trace with hash 1185641744, now seen corresponding path program 1 times [2020-10-19 20:25:11,239 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:25:11,239 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160728377] [2020-10-19 20:25:11,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:25:11,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:25:11,254 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:25:11,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:25:11,266 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:25:11,270 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:25:11,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:25:11,270 INFO L82 PathProgramCache]: Analyzing trace with hash 68618, now seen corresponding path program 1 times [2020-10-19 20:25:11,271 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:25:11,271 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260440104] [2020-10-19 20:25:11,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:25:11,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:25:11,278 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:25:11,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:25:11,284 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:25:11,286 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:25:11,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:25:11,287 INFO L82 PathProgramCache]: Analyzing trace with hash -357807973, now seen corresponding path program 1 times [2020-10-19 20:25:11,287 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:25:11,287 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151322268] [2020-10-19 20:25:11,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:25:11,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:25:11,351 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 20:25:11,351 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151322268] [2020-10-19 20:25:11,351 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1037037951] [2020-10-19 20:25:11,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-19 20:25:11,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:25:11,394 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-19 20:25:11,395 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 20:25:11,452 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 20:25:11,452 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-19 20:25:11,452 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2020-10-19 20:25:11,453 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162305581] [2020-10-19 20:25:11,537 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 20:25:11,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-19 20:25:11,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-19 20:25:11,538 INFO L87 Difference]: Start difference. First operand 17 states and 24 transitions. cyclomatic complexity: 10 Second operand 9 states. [2020-10-19 20:25:11,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 20:25:11,648 INFO L93 Difference]: Finished difference Result 31 states and 41 transitions. [2020-10-19 20:25:11,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-19 20:25:11,649 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 41 transitions. [2020-10-19 20:25:11,650 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-19 20:25:11,651 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 20 states and 26 transitions. [2020-10-19 20:25:11,651 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2020-10-19 20:25:11,651 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2020-10-19 20:25:11,651 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 26 transitions. [2020-10-19 20:25:11,651 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-19 20:25:11,652 INFO L691 BuchiCegarLoop]: Abstraction has 20 states and 26 transitions. [2020-10-19 20:25:11,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 26 transitions. [2020-10-19 20:25:11,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2020-10-19 20:25:11,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-10-19 20:25:11,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 25 transitions. [2020-10-19 20:25:11,655 INFO L714 BuchiCegarLoop]: Abstraction has 19 states and 25 transitions. [2020-10-19 20:25:11,655 INFO L594 BuchiCegarLoop]: Abstraction has 19 states and 25 transitions. [2020-10-19 20:25:11,655 INFO L427 BuchiCegarLoop]: ======== Iteration 4============ [2020-10-19 20:25:11,655 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 25 transitions. [2020-10-19 20:25:11,656 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-19 20:25:11,656 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 20:25:11,656 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 20:25:11,657 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 20:25:11,657 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-19 20:25:11,657 INFO L794 eck$LassoCheckResult]: Stem: 341#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 339#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~k~0, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 340#L527 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 342#L527-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;main_~k~0 := 0; 343#L532-3 assume !!(main_~k~0 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~k~0, 4);havoc main_#t~nondet11; 344#L532-2 main_#t~post10 := main_~k~0;main_~k~0 := 1 + main_#t~post10;havoc main_#t~post10; 345#L532-3 assume !!(main_~k~0 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~k~0, 4);havoc main_#t~nondet11; 350#L532-2 main_#t~post10 := main_~k~0;main_~k~0 := 1 + main_#t~post10;havoc main_#t~post10; 357#L532-3 assume !(main_~k~0 < main_~array_size~0); 355#L532-4 bubbleSort_#in~numbers.base, bubbleSort_#in~numbers.offset, bubbleSort_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc bubbleSort_#t~mem4, bubbleSort_#t~mem5, bubbleSort_#t~mem6, bubbleSort_#t~mem7, bubbleSort_#t~post3, bubbleSort_#t~post2, bubbleSort_~numbers.base, bubbleSort_~numbers.offset, bubbleSort_~array_size, bubbleSort_~i~0, bubbleSort_~j~0, bubbleSort_~temp~0;bubbleSort_~numbers.base, bubbleSort_~numbers.offset := bubbleSort_#in~numbers.base, bubbleSort_#in~numbers.offset;bubbleSort_~array_size := bubbleSort_#in~array_size;havoc bubbleSort_~i~0;havoc bubbleSort_~j~0;havoc bubbleSort_~temp~0;bubbleSort_~i~0 := bubbleSort_~array_size - 1; 356#L515-3 assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 347#L516-3 [2020-10-19 20:25:11,657 INFO L796 eck$LassoCheckResult]: Loop: 347#L516-3 assume !!(bubbleSort_~j~0 <= bubbleSort_~i~0);call bubbleSort_#t~mem4 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);call bubbleSort_#t~mem5 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4); 351#L517 assume bubbleSort_#t~mem4 > bubbleSort_#t~mem5;havoc bubbleSort_#t~mem5;havoc bubbleSort_#t~mem4;call bubbleSort_#t~mem6 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);bubbleSort_~temp~0 := bubbleSort_#t~mem6;havoc bubbleSort_#t~mem6;call bubbleSort_#t~mem7 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4);call write~int(bubbleSort_#t~mem7, bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);havoc bubbleSort_#t~mem7;call write~int(bubbleSort_~temp~0, bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4); 346#L516-2 bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; 347#L516-3 [2020-10-19 20:25:11,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:25:11,658 INFO L82 PathProgramCache]: Analyzing trace with hash 1237095790, now seen corresponding path program 2 times [2020-10-19 20:25:11,658 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:25:11,658 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944582546] [2020-10-19 20:25:11,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:25:11,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:25:11,671 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:25:11,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:25:11,682 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:25:11,687 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:25:11,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:25:11,687 INFO L82 PathProgramCache]: Analyzing trace with hash 68618, now seen corresponding path program 2 times [2020-10-19 20:25:11,688 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:25:11,688 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025727056] [2020-10-19 20:25:11,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:25:11,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:25:11,694 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:25:11,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:25:11,701 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:25:11,703 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:25:11,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:25:11,704 INFO L82 PathProgramCache]: Analyzing trace with hash -793648259, now seen corresponding path program 2 times [2020-10-19 20:25:11,704 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:25:11,704 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725355772] [2020-10-19 20:25:11,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:25:11,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:25:11,726 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:25:11,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:25:11,742 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:25:11,747 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:25:12,037 WARN L193 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 81 [2020-10-19 20:25:12,123 INFO L210 LassoAnalysis]: Preferences: [2020-10-19 20:25:12,123 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-19 20:25:12,123 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-19 20:25:12,123 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-19 20:25:12,123 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-19 20:25:12,123 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:25:12,124 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-19 20:25:12,124 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-19 20:25:12,124 INFO L133 ssoRankerPreferences]: Filename of dumped script: bubblesort-alloca-2.i_Iteration4_Lasso [2020-10-19 20:25:12,124 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-19 20:25:12,124 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-19 20:25:12,129 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:25:12,132 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:25:12,135 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:25:12,137 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:25:12,140 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:25:12,142 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:25:12,145 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:25:12,148 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:25:12,283 WARN L193 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 49 [2020-10-19 20:25:12,332 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:25:12,335 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:25:12,337 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:25:12,339 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:25:12,342 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:25:12,345 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:25:12,347 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:25:12,350 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:25:12,685 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-19 20:25:12,685 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 20:25:12,697 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:25:12,702 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:25:12,703 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:25:12,703 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:25:12,703 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:25:12,703 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:25:12,704 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:25:12,704 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:25:12,706 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:25:12,730 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:25:12,731 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:25:12,732 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:25:12,732 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:25:12,732 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:25:12,733 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:25:12,733 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:25:12,736 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:25:12,759 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:25:12,760 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:25:12,760 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:25:12,760 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:25:12,760 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:25:12,760 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:25:12,761 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:25:12,761 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:25:12,763 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:25:12,785 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:25:12,787 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:25:12,787 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:25:12,787 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:25:12,787 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:25:12,789 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:25:12,789 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:25:12,796 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 20:25:12,829 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:25:12,832 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:25:12,833 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:25:12,833 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:25:12,833 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:25:12,833 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:25:12,834 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:25:12,834 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:25:12,837 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 20:25:12,865 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:25:12,866 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:25:12,866 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:25:12,866 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:25:12,867 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:25:12,867 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:25:12,867 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:25:12,867 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:25:12,869 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:25:12,893 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:25:12,894 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:25:12,895 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:25:12,895 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:25:12,895 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:25:12,900 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:25:12,900 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:25:12,904 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 20:25:12,937 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:25:12,940 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:25:12,940 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:25:12,940 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:25:12,940 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:25:12,948 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:25:12,948 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:25:12,966 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-19 20:25:12,987 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2020-10-19 20:25:12,987 INFO L444 ModelExtractionUtils]: 10 out of 40 variables were initially zero. Simplification set additionally 26 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 20:25:12,989 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:25:12,992 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-10-19 20:25:12,992 INFO L510 LassoAnalysis]: Proved termination. [2020-10-19 20:25:12,992 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_bubbleSort_~i~0, ULTIMATE.start_bubbleSort_~j~0) = 2*ULTIMATE.start_bubbleSort_~i~0 - 2*ULTIMATE.start_bubbleSort_~j~0 + 1 Supporting invariants [] [2020-10-19 20:25:13,031 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2020-10-19 20:25:13,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:25:13,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:25:13,061 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-19 20:25:13,062 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 20:25:13,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:25:13,071 INFO L263 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-19 20:25:13,072 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 20:25:13,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 20:25:13,083 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2020-10-19 20:25:13,083 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states and 25 transitions. cyclomatic complexity: 9 Second operand 3 states. [2020-10-19 20:25:13,105 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19 states and 25 transitions. cyclomatic complexity: 9. Second operand 3 states. Result 34 states and 47 transitions. Complement of second has 7 states. [2020-10-19 20:25:13,105 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 [2020-10-19 20:25:13,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-19 20:25:13,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2020-10-19 20:25:13,106 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 11 letters. Loop has 3 letters. [2020-10-19 20:25:13,107 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 20:25:13,107 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 14 letters. Loop has 3 letters. [2020-10-19 20:25:13,107 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 20:25:13,107 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 11 letters. Loop has 6 letters. [2020-10-19 20:25:13,108 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 20:25:13,108 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 47 transitions. [2020-10-19 20:25:13,109 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-19 20:25:13,110 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 24 states and 32 transitions. [2020-10-19 20:25:13,110 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2020-10-19 20:25:13,111 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2020-10-19 20:25:13,111 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 32 transitions. [2020-10-19 20:25:13,111 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-19 20:25:13,111 INFO L691 BuchiCegarLoop]: Abstraction has 24 states and 32 transitions. [2020-10-19 20:25:13,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 32 transitions. [2020-10-19 20:25:13,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 19. [2020-10-19 20:25:13,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-10-19 20:25:13,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2020-10-19 20:25:13,114 INFO L714 BuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2020-10-19 20:25:13,114 INFO L594 BuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2020-10-19 20:25:13,114 INFO L427 BuchiCegarLoop]: ======== Iteration 5============ [2020-10-19 20:25:13,115 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 24 transitions. [2020-10-19 20:25:13,115 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-19 20:25:13,115 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 20:25:13,115 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 20:25:13,116 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 20:25:13,116 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-19 20:25:13,117 INFO L794 eck$LassoCheckResult]: Stem: 476#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 474#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~k~0, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 475#L527 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 477#L527-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;main_~k~0 := 0; 478#L532-3 assume !!(main_~k~0 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~k~0, 4);havoc main_#t~nondet11; 483#L532-2 main_#t~post10 := main_~k~0;main_~k~0 := 1 + main_#t~post10;havoc main_#t~post10; 484#L532-3 assume !!(main_~k~0 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~k~0, 4);havoc main_#t~nondet11; 487#L532-2 main_#t~post10 := main_~k~0;main_~k~0 := 1 + main_#t~post10;havoc main_#t~post10; 492#L532-3 assume !(main_~k~0 < main_~array_size~0); 491#L532-4 bubbleSort_#in~numbers.base, bubbleSort_#in~numbers.offset, bubbleSort_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc bubbleSort_#t~mem4, bubbleSort_#t~mem5, bubbleSort_#t~mem6, bubbleSort_#t~mem7, bubbleSort_#t~post3, bubbleSort_#t~post2, bubbleSort_~numbers.base, bubbleSort_~numbers.offset, bubbleSort_~array_size, bubbleSort_~i~0, bubbleSort_~j~0, bubbleSort_~temp~0;bubbleSort_~numbers.base, bubbleSort_~numbers.offset := bubbleSort_#in~numbers.base, bubbleSort_#in~numbers.offset;bubbleSort_~array_size := bubbleSort_#in~array_size;havoc bubbleSort_~i~0;havoc bubbleSort_~j~0;havoc bubbleSort_~temp~0;bubbleSort_~i~0 := bubbleSort_~array_size - 1; 490#L515-3 assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 482#L516-3 assume !(bubbleSort_~j~0 <= bubbleSort_~i~0); 485#L515-2 bubbleSort_#t~post2 := bubbleSort_~i~0;bubbleSort_~i~0 := bubbleSort_#t~post2 - 1;havoc bubbleSort_#t~post2; 486#L515-3 assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 480#L516-3 [2020-10-19 20:25:13,117 INFO L796 eck$LassoCheckResult]: Loop: 480#L516-3 assume !!(bubbleSort_~j~0 <= bubbleSort_~i~0);call bubbleSort_#t~mem4 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);call bubbleSort_#t~mem5 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4); 488#L517 assume bubbleSort_#t~mem4 > bubbleSort_#t~mem5;havoc bubbleSort_#t~mem5;havoc bubbleSort_#t~mem4;call bubbleSort_#t~mem6 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);bubbleSort_~temp~0 := bubbleSort_#t~mem6;havoc bubbleSort_#t~mem6;call bubbleSort_#t~mem7 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4);call write~int(bubbleSort_#t~mem7, bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);havoc bubbleSort_#t~mem7;call write~int(bubbleSort_~temp~0, bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4); 479#L516-2 bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; 480#L516-3 [2020-10-19 20:25:13,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:25:13,117 INFO L82 PathProgramCache]: Analyzing trace with hash -793649948, now seen corresponding path program 1 times [2020-10-19 20:25:13,118 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:25:13,118 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955348327] [2020-10-19 20:25:13,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:25:13,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:25:13,168 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 20:25:13,169 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955348327] [2020-10-19 20:25:13,169 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1951634348] [2020-10-19 20:25:13,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-19 20:25:13,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:25:13,207 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-19 20:25:13,209 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 20:25:13,254 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 20:25:13,254 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-19 20:25:13,255 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2020-10-19 20:25:13,255 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898250048] [2020-10-19 20:25:13,255 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-19 20:25:13,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:25:13,255 INFO L82 PathProgramCache]: Analyzing trace with hash 68618, now seen corresponding path program 3 times [2020-10-19 20:25:13,256 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:25:13,256 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265460019] [2020-10-19 20:25:13,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:25:13,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:25:13,261 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:25:13,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:25:13,265 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:25:13,267 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:25:13,362 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 20:25:13,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-19 20:25:13,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2020-10-19 20:25:13,363 INFO L87 Difference]: Start difference. First operand 19 states and 24 transitions. cyclomatic complexity: 8 Second operand 9 states. [2020-10-19 20:25:13,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 20:25:13,459 INFO L93 Difference]: Finished difference Result 26 states and 34 transitions. [2020-10-19 20:25:13,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-19 20:25:13,460 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 34 transitions. [2020-10-19 20:25:13,462 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-19 20:25:13,463 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 26 states and 34 transitions. [2020-10-19 20:25:13,463 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2020-10-19 20:25:13,463 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2020-10-19 20:25:13,463 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 34 transitions. [2020-10-19 20:25:13,463 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-19 20:25:13,464 INFO L691 BuchiCegarLoop]: Abstraction has 26 states and 34 transitions. [2020-10-19 20:25:13,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 34 transitions. [2020-10-19 20:25:13,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 20. [2020-10-19 20:25:13,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-10-19 20:25:13,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2020-10-19 20:25:13,466 INFO L714 BuchiCegarLoop]: Abstraction has 20 states and 25 transitions. [2020-10-19 20:25:13,466 INFO L594 BuchiCegarLoop]: Abstraction has 20 states and 25 transitions. [2020-10-19 20:25:13,466 INFO L427 BuchiCegarLoop]: ======== Iteration 6============ [2020-10-19 20:25:13,466 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 25 transitions. [2020-10-19 20:25:13,467 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-19 20:25:13,467 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 20:25:13,467 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 20:25:13,468 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 20:25:13,468 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-19 20:25:13,468 INFO L794 eck$LassoCheckResult]: Stem: 578#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 576#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~k~0, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 577#L527 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 579#L527-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;main_~k~0 := 0; 580#L532-3 assume !!(main_~k~0 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~k~0, 4);havoc main_#t~nondet11; 587#L532-2 main_#t~post10 := main_~k~0;main_~k~0 := 1 + main_#t~post10;havoc main_#t~post10; 588#L532-3 assume !!(main_~k~0 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~k~0, 4);havoc main_#t~nondet11; 581#L532-2 main_#t~post10 := main_~k~0;main_~k~0 := 1 + main_#t~post10;havoc main_#t~post10; 582#L532-3 assume !(main_~k~0 < main_~array_size~0); 594#L532-4 bubbleSort_#in~numbers.base, bubbleSort_#in~numbers.offset, bubbleSort_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc bubbleSort_#t~mem4, bubbleSort_#t~mem5, bubbleSort_#t~mem6, bubbleSort_#t~mem7, bubbleSort_#t~post3, bubbleSort_#t~post2, bubbleSort_~numbers.base, bubbleSort_~numbers.offset, bubbleSort_~array_size, bubbleSort_~i~0, bubbleSort_~j~0, bubbleSort_~temp~0;bubbleSort_~numbers.base, bubbleSort_~numbers.offset := bubbleSort_#in~numbers.base, bubbleSort_#in~numbers.offset;bubbleSort_~array_size := bubbleSort_#in~array_size;havoc bubbleSort_~i~0;havoc bubbleSort_~j~0;havoc bubbleSort_~temp~0;bubbleSort_~i~0 := bubbleSort_~array_size - 1; 595#L515-3 assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 590#L516-3 assume !!(bubbleSort_~j~0 <= bubbleSort_~i~0);call bubbleSort_#t~mem4 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);call bubbleSort_#t~mem5 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4); 591#L517 assume !(bubbleSort_#t~mem4 > bubbleSort_#t~mem5);havoc bubbleSort_#t~mem5;havoc bubbleSort_#t~mem4; 585#L516-2 bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; 586#L516-3 assume !(bubbleSort_~j~0 <= bubbleSort_~i~0); 592#L515-2 bubbleSort_#t~post2 := bubbleSort_~i~0;bubbleSort_~i~0 := bubbleSort_#t~post2 - 1;havoc bubbleSort_#t~post2; 593#L515-3 assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 584#L516-3 [2020-10-19 20:25:13,468 INFO L796 eck$LassoCheckResult]: Loop: 584#L516-3 assume !!(bubbleSort_~j~0 <= bubbleSort_~i~0);call bubbleSort_#t~mem4 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);call bubbleSort_#t~mem5 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4); 589#L517 assume bubbleSort_#t~mem4 > bubbleSort_#t~mem5;havoc bubbleSort_#t~mem5;havoc bubbleSort_#t~mem4;call bubbleSort_#t~mem6 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);bubbleSort_~temp~0 := bubbleSort_#t~mem6;havoc bubbleSort_#t~mem6;call bubbleSort_#t~mem7 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4);call write~int(bubbleSort_#t~mem7, bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);havoc bubbleSort_#t~mem7;call write~int(bubbleSort_~temp~0, bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4); 583#L516-2 bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; 584#L516-3 [2020-10-19 20:25:13,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:25:13,469 INFO L82 PathProgramCache]: Analyzing trace with hash 221564791, now seen corresponding path program 1 times [2020-10-19 20:25:13,469 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:25:13,469 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509241027] [2020-10-19 20:25:13,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:25:13,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:25:13,484 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:25:13,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:25:13,496 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:25:13,500 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:25:13,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:25:13,501 INFO L82 PathProgramCache]: Analyzing trace with hash 68618, now seen corresponding path program 4 times [2020-10-19 20:25:13,501 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:25:13,501 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834206653] [2020-10-19 20:25:13,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:25:13,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:25:13,506 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:25:13,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:25:13,510 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:25:13,511 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:25:13,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:25:13,512 INFO L82 PathProgramCache]: Analyzing trace with hash -728006444, now seen corresponding path program 1 times [2020-10-19 20:25:13,512 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:25:13,512 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727740891] [2020-10-19 20:25:13,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:25:13,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:25:13,619 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-19 20:25:13,620 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727740891] [2020-10-19 20:25:13,620 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [456010511] [2020-10-19 20:25:13,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-19 20:25:13,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:25:13,669 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 10 conjunts are in the unsatisfiable core [2020-10-19 20:25:13,670 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 20:25:13,716 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-19 20:25:13,716 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-19 20:25:13,716 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2020-10-19 20:25:13,717 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032279653] [2020-10-19 20:25:13,809 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 20:25:13,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-19 20:25:13,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2020-10-19 20:25:13,810 INFO L87 Difference]: Start difference. First operand 20 states and 25 transitions. cyclomatic complexity: 8 Second operand 11 states. [2020-10-19 20:25:13,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 20:25:13,920 INFO L93 Difference]: Finished difference Result 35 states and 44 transitions. [2020-10-19 20:25:13,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-19 20:25:13,921 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 44 transitions. [2020-10-19 20:25:13,922 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-19 20:25:13,922 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 23 states and 28 transitions. [2020-10-19 20:25:13,923 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2020-10-19 20:25:13,923 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2020-10-19 20:25:13,923 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 28 transitions. [2020-10-19 20:25:13,923 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-19 20:25:13,923 INFO L691 BuchiCegarLoop]: Abstraction has 23 states and 28 transitions. [2020-10-19 20:25:13,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 28 transitions. [2020-10-19 20:25:13,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2020-10-19 20:25:13,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-10-19 20:25:13,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2020-10-19 20:25:13,925 INFO L714 BuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2020-10-19 20:25:13,925 INFO L594 BuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2020-10-19 20:25:13,926 INFO L427 BuchiCegarLoop]: ======== Iteration 7============ [2020-10-19 20:25:13,926 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 27 transitions. [2020-10-19 20:25:13,926 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-19 20:25:13,926 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 20:25:13,926 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 20:25:13,927 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 20:25:13,927 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-19 20:25:13,927 INFO L794 eck$LassoCheckResult]: Stem: 714#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 712#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~k~0, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 713#L527 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 715#L527-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;main_~k~0 := 0; 716#L532-3 assume !!(main_~k~0 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~k~0, 4);havoc main_#t~nondet11; 723#L532-2 main_#t~post10 := main_~k~0;main_~k~0 := 1 + main_#t~post10;havoc main_#t~post10; 724#L532-3 assume !!(main_~k~0 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~k~0, 4);havoc main_#t~nondet11; 717#L532-2 main_#t~post10 := main_~k~0;main_~k~0 := 1 + main_#t~post10;havoc main_#t~post10; 718#L532-3 assume !!(main_~k~0 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~k~0, 4);havoc main_#t~nondet11; 733#L532-2 main_#t~post10 := main_~k~0;main_~k~0 := 1 + main_#t~post10;havoc main_#t~post10; 732#L532-3 assume !(main_~k~0 < main_~array_size~0); 731#L532-4 bubbleSort_#in~numbers.base, bubbleSort_#in~numbers.offset, bubbleSort_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc bubbleSort_#t~mem4, bubbleSort_#t~mem5, bubbleSort_#t~mem6, bubbleSort_#t~mem7, bubbleSort_#t~post3, bubbleSort_#t~post2, bubbleSort_~numbers.base, bubbleSort_~numbers.offset, bubbleSort_~array_size, bubbleSort_~i~0, bubbleSort_~j~0, bubbleSort_~temp~0;bubbleSort_~numbers.base, bubbleSort_~numbers.offset := bubbleSort_#in~numbers.base, bubbleSort_#in~numbers.offset;bubbleSort_~array_size := bubbleSort_#in~array_size;havoc bubbleSort_~i~0;havoc bubbleSort_~j~0;havoc bubbleSort_~temp~0;bubbleSort_~i~0 := bubbleSort_~array_size - 1; 730#L515-3 assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 726#L516-3 assume !!(bubbleSort_~j~0 <= bubbleSort_~i~0);call bubbleSort_#t~mem4 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);call bubbleSort_#t~mem5 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4); 727#L517 assume !(bubbleSort_#t~mem4 > bubbleSort_#t~mem5);havoc bubbleSort_#t~mem5;havoc bubbleSort_#t~mem4; 721#L516-2 bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; 722#L516-3 assume !(bubbleSort_~j~0 <= bubbleSort_~i~0); 728#L515-2 bubbleSort_#t~post2 := bubbleSort_~i~0;bubbleSort_~i~0 := bubbleSort_#t~post2 - 1;havoc bubbleSort_#t~post2; 729#L515-3 assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 720#L516-3 [2020-10-19 20:25:13,927 INFO L796 eck$LassoCheckResult]: Loop: 720#L516-3 assume !!(bubbleSort_~j~0 <= bubbleSort_~i~0);call bubbleSort_#t~mem4 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);call bubbleSort_#t~mem5 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4); 725#L517 assume bubbleSort_#t~mem4 > bubbleSort_#t~mem5;havoc bubbleSort_#t~mem5;havoc bubbleSort_#t~mem4;call bubbleSort_#t~mem6 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);bubbleSort_~temp~0 := bubbleSort_#t~mem6;havoc bubbleSort_#t~mem6;call bubbleSort_#t~mem7 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4);call write~int(bubbleSort_#t~mem7, bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);havoc bubbleSort_#t~mem7;call write~int(bubbleSort_~temp~0, bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4); 719#L516-2 bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; 720#L516-3 [2020-10-19 20:25:13,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:25:13,928 INFO L82 PathProgramCache]: Analyzing trace with hash 1850126805, now seen corresponding path program 2 times [2020-10-19 20:25:13,928 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:25:13,928 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133549581] [2020-10-19 20:25:13,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:25:13,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:25:13,990 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 20:25:13,990 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133549581] [2020-10-19 20:25:13,990 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1220403405] [2020-10-19 20:25:13,991 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-19 20:25:14,029 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-19 20:25:14,030 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-19 20:25:14,030 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 10 conjunts are in the unsatisfiable core [2020-10-19 20:25:14,032 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 20:25:14,084 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 20:25:14,085 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-19 20:25:14,085 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2020-10-19 20:25:14,085 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787162640] [2020-10-19 20:25:14,085 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-19 20:25:14,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:25:14,086 INFO L82 PathProgramCache]: Analyzing trace with hash 68618, now seen corresponding path program 5 times [2020-10-19 20:25:14,086 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:25:14,086 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748221198] [2020-10-19 20:25:14,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:25:14,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:25:14,091 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:25:14,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:25:14,093 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:25:14,095 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:25:14,176 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 20:25:14,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-19 20:25:14,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2020-10-19 20:25:14,177 INFO L87 Difference]: Start difference. First operand 22 states and 27 transitions. cyclomatic complexity: 8 Second operand 12 states. [2020-10-19 20:25:14,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 20:25:14,364 INFO L93 Difference]: Finished difference Result 31 states and 40 transitions. [2020-10-19 20:25:14,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-19 20:25:14,365 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 40 transitions. [2020-10-19 20:25:14,367 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-19 20:25:14,368 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 31 states and 40 transitions. [2020-10-19 20:25:14,368 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2020-10-19 20:25:14,368 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2020-10-19 20:25:14,368 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 40 transitions. [2020-10-19 20:25:14,369 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-19 20:25:14,369 INFO L691 BuchiCegarLoop]: Abstraction has 31 states and 40 transitions. [2020-10-19 20:25:14,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 40 transitions. [2020-10-19 20:25:14,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 25. [2020-10-19 20:25:14,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-10-19 20:25:14,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 31 transitions. [2020-10-19 20:25:14,371 INFO L714 BuchiCegarLoop]: Abstraction has 25 states and 31 transitions. [2020-10-19 20:25:14,372 INFO L594 BuchiCegarLoop]: Abstraction has 25 states and 31 transitions. [2020-10-19 20:25:14,372 INFO L427 BuchiCegarLoop]: ======== Iteration 8============ [2020-10-19 20:25:14,372 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 31 transitions. [2020-10-19 20:25:14,372 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-19 20:25:14,372 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 20:25:14,373 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 20:25:14,373 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 20:25:14,373 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-19 20:25:14,374 INFO L794 eck$LassoCheckResult]: Stem: 848#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 846#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~k~0, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 847#L527 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 849#L527-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;main_~k~0 := 0; 850#L532-3 assume !!(main_~k~0 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~k~0, 4);havoc main_#t~nondet11; 855#L532-2 main_#t~post10 := main_~k~0;main_~k~0 := 1 + main_#t~post10;havoc main_#t~post10; 856#L532-3 assume !!(main_~k~0 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~k~0, 4);havoc main_#t~nondet11; 862#L532-2 main_#t~post10 := main_~k~0;main_~k~0 := 1 + main_#t~post10;havoc main_#t~post10; 868#L532-3 assume !!(main_~k~0 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~k~0, 4);havoc main_#t~nondet11; 867#L532-2 main_#t~post10 := main_~k~0;main_~k~0 := 1 + main_#t~post10;havoc main_#t~post10; 866#L532-3 assume !(main_~k~0 < main_~array_size~0); 865#L532-4 bubbleSort_#in~numbers.base, bubbleSort_#in~numbers.offset, bubbleSort_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc bubbleSort_#t~mem4, bubbleSort_#t~mem5, bubbleSort_#t~mem6, bubbleSort_#t~mem7, bubbleSort_#t~post3, bubbleSort_#t~post2, bubbleSort_~numbers.base, bubbleSort_~numbers.offset, bubbleSort_~array_size, bubbleSort_~i~0, bubbleSort_~j~0, bubbleSort_~temp~0;bubbleSort_~numbers.base, bubbleSort_~numbers.offset := bubbleSort_#in~numbers.base, bubbleSort_#in~numbers.offset;bubbleSort_~array_size := bubbleSort_#in~array_size;havoc bubbleSort_~i~0;havoc bubbleSort_~j~0;havoc bubbleSort_~temp~0;bubbleSort_~i~0 := bubbleSort_~array_size - 1; 863#L515-3 assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 864#L516-3 assume !!(bubbleSort_~j~0 <= bubbleSort_~i~0);call bubbleSort_#t~mem4 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);call bubbleSort_#t~mem5 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4); 870#L517 assume !(bubbleSort_#t~mem4 > bubbleSort_#t~mem5);havoc bubbleSort_#t~mem5;havoc bubbleSort_#t~mem4; 869#L516-2 bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; 858#L516-3 assume !!(bubbleSort_~j~0 <= bubbleSort_~i~0);call bubbleSort_#t~mem4 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);call bubbleSort_#t~mem5 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4); 859#L517 assume !(bubbleSort_#t~mem4 > bubbleSort_#t~mem5);havoc bubbleSort_#t~mem5;havoc bubbleSort_#t~mem4; 853#L516-2 bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; 854#L516-3 assume !(bubbleSort_~j~0 <= bubbleSort_~i~0); 860#L515-2 bubbleSort_#t~post2 := bubbleSort_~i~0;bubbleSort_~i~0 := bubbleSort_#t~post2 - 1;havoc bubbleSort_#t~post2; 861#L515-3 assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 852#L516-3 [2020-10-19 20:25:14,374 INFO L796 eck$LassoCheckResult]: Loop: 852#L516-3 assume !!(bubbleSort_~j~0 <= bubbleSort_~i~0);call bubbleSort_#t~mem4 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);call bubbleSort_#t~mem5 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4); 857#L517 assume bubbleSort_#t~mem4 > bubbleSort_#t~mem5;havoc bubbleSort_#t~mem5;havoc bubbleSort_#t~mem4;call bubbleSort_#t~mem6 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);bubbleSort_~temp~0 := bubbleSort_#t~mem6;havoc bubbleSort_#t~mem6;call bubbleSort_#t~mem7 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4);call write~int(bubbleSort_#t~mem7, bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);havoc bubbleSort_#t~mem7;call write~int(bubbleSort_~temp~0, bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4); 851#L516-2 bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; 852#L516-3 [2020-10-19 20:25:14,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:25:14,374 INFO L82 PathProgramCache]: Analyzing trace with hash -135460634, now seen corresponding path program 3 times [2020-10-19 20:25:14,374 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:25:14,374 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021947076] [2020-10-19 20:25:14,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:25:14,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:25:14,391 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:25:14,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:25:14,406 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:25:14,413 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:25:14,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:25:14,414 INFO L82 PathProgramCache]: Analyzing trace with hash 68618, now seen corresponding path program 6 times [2020-10-19 20:25:14,414 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:25:14,414 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313635496] [2020-10-19 20:25:14,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:25:14,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:25:14,418 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:25:14,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:25:14,421 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:25:14,422 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:25:14,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:25:14,423 INFO L82 PathProgramCache]: Analyzing trace with hash 1761549573, now seen corresponding path program 2 times [2020-10-19 20:25:14,423 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:25:14,423 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713140947] [2020-10-19 20:25:14,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:25:14,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:25:14,669 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-10-19 20:25:14,670 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713140947] [2020-10-19 20:25:14,670 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [78844093] [2020-10-19 20:25:14,670 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-19 20:25:14,719 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-19 20:25:14,719 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-19 20:25:14,720 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 20 conjunts are in the unsatisfiable core [2020-10-19 20:25:14,722 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 20:25:14,848 INFO L350 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2020-10-19 20:25:14,848 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 10 [2020-10-19 20:25:14,851 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-19 20:25:14,861 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-19 20:25:14,861 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-19 20:25:14,862 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:3 [2020-10-19 20:25:14,867 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-10-19 20:25:14,867 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-19 20:25:14,868 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 15 [2020-10-19 20:25:14,868 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639259193] [2020-10-19 20:25:14,950 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 20:25:14,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-10-19 20:25:14,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2020-10-19 20:25:14,951 INFO L87 Difference]: Start difference. First operand 25 states and 31 transitions. cyclomatic complexity: 9 Second operand 15 states. [2020-10-19 20:25:15,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 20:25:15,194 INFO L93 Difference]: Finished difference Result 47 states and 63 transitions. [2020-10-19 20:25:15,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-19 20:25:15,195 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 47 states and 63 transitions. [2020-10-19 20:25:15,196 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2020-10-19 20:25:15,197 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 47 states to 47 states and 63 transitions. [2020-10-19 20:25:15,197 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2020-10-19 20:25:15,197 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2020-10-19 20:25:15,197 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 63 transitions. [2020-10-19 20:25:15,198 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-19 20:25:15,198 INFO L691 BuchiCegarLoop]: Abstraction has 47 states and 63 transitions. [2020-10-19 20:25:15,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states and 63 transitions. [2020-10-19 20:25:15,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 36. [2020-10-19 20:25:15,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-10-19 20:25:15,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 48 transitions. [2020-10-19 20:25:15,201 INFO L714 BuchiCegarLoop]: Abstraction has 36 states and 48 transitions. [2020-10-19 20:25:15,201 INFO L594 BuchiCegarLoop]: Abstraction has 36 states and 48 transitions. [2020-10-19 20:25:15,201 INFO L427 BuchiCegarLoop]: ======== Iteration 9============ [2020-10-19 20:25:15,201 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 48 transitions. [2020-10-19 20:25:15,202 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-19 20:25:15,202 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 20:25:15,202 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 20:25:15,202 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 20:25:15,203 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-19 20:25:15,203 INFO L794 eck$LassoCheckResult]: Stem: 1025#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1023#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~k~0, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 1024#L527 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 1026#L527-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;main_~k~0 := 0; 1027#L532-3 assume !!(main_~k~0 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~k~0, 4);havoc main_#t~nondet11; 1034#L532-2 main_#t~post10 := main_~k~0;main_~k~0 := 1 + main_#t~post10;havoc main_#t~post10; 1035#L532-3 assume !!(main_~k~0 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~k~0, 4);havoc main_#t~nondet11; 1028#L532-2 main_#t~post10 := main_~k~0;main_~k~0 := 1 + main_#t~post10;havoc main_#t~post10; 1029#L532-3 assume !!(main_~k~0 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~k~0, 4);havoc main_#t~nondet11; 1047#L532-2 main_#t~post10 := main_~k~0;main_~k~0 := 1 + main_#t~post10;havoc main_#t~post10; 1046#L532-3 assume !(main_~k~0 < main_~array_size~0); 1042#L532-4 bubbleSort_#in~numbers.base, bubbleSort_#in~numbers.offset, bubbleSort_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc bubbleSort_#t~mem4, bubbleSort_#t~mem5, bubbleSort_#t~mem6, bubbleSort_#t~mem7, bubbleSort_#t~post3, bubbleSort_#t~post2, bubbleSort_~numbers.base, bubbleSort_~numbers.offset, bubbleSort_~array_size, bubbleSort_~i~0, bubbleSort_~j~0, bubbleSort_~temp~0;bubbleSort_~numbers.base, bubbleSort_~numbers.offset := bubbleSort_#in~numbers.base, bubbleSort_#in~numbers.offset;bubbleSort_~array_size := bubbleSort_#in~array_size;havoc bubbleSort_~i~0;havoc bubbleSort_~j~0;havoc bubbleSort_~temp~0;bubbleSort_~i~0 := bubbleSort_~array_size - 1; 1043#L515-3 assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 1038#L516-3 assume !!(bubbleSort_~j~0 <= bubbleSort_~i~0);call bubbleSort_#t~mem4 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);call bubbleSort_#t~mem5 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4); 1039#L517 assume !(bubbleSort_#t~mem4 > bubbleSort_#t~mem5);havoc bubbleSort_#t~mem5;havoc bubbleSort_#t~mem4; 1055#L516-2 bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; 1056#L516-3 assume !!(bubbleSort_~j~0 <= bubbleSort_~i~0);call bubbleSort_#t~mem4 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);call bubbleSort_#t~mem5 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4); 1058#L517 assume bubbleSort_#t~mem4 > bubbleSort_#t~mem5;havoc bubbleSort_#t~mem5;havoc bubbleSort_#t~mem4;call bubbleSort_#t~mem6 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);bubbleSort_~temp~0 := bubbleSort_#t~mem6;havoc bubbleSort_#t~mem6;call bubbleSort_#t~mem7 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4);call write~int(bubbleSort_#t~mem7, bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);havoc bubbleSort_#t~mem7;call write~int(bubbleSort_~temp~0, bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4); 1032#L516-2 bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; 1033#L516-3 assume !(bubbleSort_~j~0 <= bubbleSort_~i~0); 1040#L515-2 bubbleSort_#t~post2 := bubbleSort_~i~0;bubbleSort_~i~0 := bubbleSort_#t~post2 - 1;havoc bubbleSort_#t~post2; 1041#L515-3 assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 1031#L516-3 [2020-10-19 20:25:15,203 INFO L796 eck$LassoCheckResult]: Loop: 1031#L516-3 assume !!(bubbleSort_~j~0 <= bubbleSort_~i~0);call bubbleSort_#t~mem4 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);call bubbleSort_#t~mem5 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4); 1048#L517 assume bubbleSort_#t~mem4 > bubbleSort_#t~mem5;havoc bubbleSort_#t~mem5;havoc bubbleSort_#t~mem4;call bubbleSort_#t~mem6 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);bubbleSort_~temp~0 := bubbleSort_#t~mem6;havoc bubbleSort_#t~mem6;call bubbleSort_#t~mem7 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4);call write~int(bubbleSort_#t~mem7, bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);havoc bubbleSort_#t~mem7;call write~int(bubbleSort_~temp~0, bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4); 1030#L516-2 bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; 1031#L516-3 [2020-10-19 20:25:15,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:25:15,203 INFO L82 PathProgramCache]: Analyzing trace with hash -137307676, now seen corresponding path program 3 times [2020-10-19 20:25:15,203 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:25:15,204 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135044141] [2020-10-19 20:25:15,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:25:15,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:25:15,218 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:25:15,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:25:15,230 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:25:15,235 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:25:15,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:25:15,235 INFO L82 PathProgramCache]: Analyzing trace with hash 68618, now seen corresponding path program 7 times [2020-10-19 20:25:15,236 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:25:15,236 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815281546] [2020-10-19 20:25:15,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:25:15,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:25:15,239 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:25:15,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:25:15,242 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:25:15,243 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:25:15,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:25:15,244 INFO L82 PathProgramCache]: Analyzing trace with hash -1724071097, now seen corresponding path program 4 times [2020-10-19 20:25:15,244 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:25:15,244 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422090648] [2020-10-19 20:25:15,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:25:15,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:25:15,258 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:25:15,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:25:15,272 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:25:15,277 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:25:16,264 WARN L193 SmtUtils]: Spent 905.00 ms on a formula simplification. DAG size of input: 183 DAG size of output: 140 [2020-10-19 20:25:16,436 WARN L193 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2020-10-19 20:25:16,438 INFO L210 LassoAnalysis]: Preferences: [2020-10-19 20:25:16,438 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-19 20:25:16,438 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-19 20:25:16,438 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-19 20:25:16,438 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-19 20:25:16,438 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:25:16,438 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-19 20:25:16,438 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-19 20:25:16,439 INFO L133 ssoRankerPreferences]: Filename of dumped script: bubblesort-alloca-2.i_Iteration9_Lasso [2020-10-19 20:25:16,439 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-19 20:25:16,439 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-19 20:25:16,442 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:25:16,446 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:25:16,448 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:25:16,451 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:25:16,453 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:25:16,455 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:25:16,535 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError: MapEliminator tries to combine Int and (Array Int Int) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.indexEqualityInequalityImpliesValueEquality(MapEliminator.java:850) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.replaceSelectStoreTerm(MapEliminator.java:592) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.replaceStoreTerms(MapEliminator.java:542) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.getRewrittenTransFormula(MapEliminator.java:330) at de.uni_freiburg.informatik.ultimate.lassoranker.preprocessors.MapEliminationLassoPreprocessor.process(MapEliminationLassoPreprocessor.java:109) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.applyPreprocessor(LassoBuilder.java:154) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.preprocess(LassoBuilder.java:262) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.preprocess(LassoAnalysis.java:278) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.(LassoAnalysis.java:229) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.synthesize(LassoCheck.java:612) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.access$16(LassoCheck.java:539) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkLassoTermination(LassoCheck.java:957) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:865) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:461) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:382) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2020-10-19 20:25:16,539 INFO L168 Benchmark]: Toolchain (without parser) took 9379.80 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 327.7 MB). Free memory was 960.0 MB in the beginning and 920.2 MB in the end (delta: 39.8 MB). Peak memory consumption was 367.4 MB. Max. memory is 11.5 GB. [2020-10-19 20:25:16,543 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-10-19 20:25:16,544 INFO L168 Benchmark]: CACSL2BoogieTranslator took 579.71 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.1 MB). Free memory was 954.6 MB in the beginning and 1.1 GB in the end (delta: -170.1 MB). Peak memory consumption was 21.0 MB. Max. memory is 11.5 GB. [2020-10-19 20:25:16,545 INFO L168 Benchmark]: Boogie Procedure Inliner took 52.68 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. [2020-10-19 20:25:16,548 INFO L168 Benchmark]: Boogie Preprocessor took 29.33 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2020-10-19 20:25:16,549 INFO L168 Benchmark]: RCFGBuilder took 410.79 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.2 MB). Peak memory consumption was 19.2 MB. Max. memory is 11.5 GB. [2020-10-19 20:25:16,549 INFO L168 Benchmark]: BuchiAutomizer took 8297.44 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 184.5 MB). Free memory was 1.1 GB in the beginning and 920.2 MB in the end (delta: 176.7 MB). Peak memory consumption was 361.2 MB. Max. memory is 11.5 GB. [2020-10-19 20:25:16,556 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 579.71 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.1 MB). Free memory was 954.6 MB in the beginning and 1.1 GB in the end (delta: -170.1 MB). Peak memory consumption was 21.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 52.68 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 29.33 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 410.79 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.2 MB). Peak memory consumption was 19.2 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 8297.44 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 184.5 MB). Free memory was 1.1 GB in the beginning and 920.2 MB in the end (delta: 176.7 MB). Peak memory consumption was 361.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: AssertionError: MapEliminator tries to combine Int and (Array Int Int) de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: AssertionError: MapEliminator tries to combine Int and (Array Int Int): de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.indexEqualityInequalityImpliesValueEquality(MapEliminator.java:850) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...