./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/array-memsafety/java_BubbleSort-alloca_true-valid-memsafety_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_f673e1f8-8cd2-4a42-b4b8-ac3f2eb0d615/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_f673e1f8-8cd2-4a42-b4b8-ac3f2eb0d615/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_f673e1f8-8cd2-4a42-b4b8-ac3f2eb0d615/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_f673e1f8-8cd2-4a42-b4b8-ac3f2eb0d615/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/array-memsafety/java_BubbleSort-alloca_true-valid-memsafety_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_f673e1f8-8cd2-4a42-b4b8-ac3f2eb0d615/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_f673e1f8-8cd2-4a42-b4b8-ac3f2eb0d615/bin-2019/uautomizer --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 65401fe061f89bb729dffabf74050dfab9fe7d77 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-09 09:16:10,063 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 09:16:10,064 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 09:16:10,070 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 09:16:10,070 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 09:16:10,071 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 09:16:10,072 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 09:16:10,072 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 09:16:10,073 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 09:16:10,074 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 09:16:10,074 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 09:16:10,074 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 09:16:10,075 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 09:16:10,076 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 09:16:10,076 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 09:16:10,077 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 09:16:10,077 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 09:16:10,078 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 09:16:10,079 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 09:16:10,080 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 09:16:10,080 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 09:16:10,081 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 09:16:10,082 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 09:16:10,082 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 09:16:10,082 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 09:16:10,083 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 09:16:10,084 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 09:16:10,084 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 09:16:10,085 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 09:16:10,085 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 09:16:10,085 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 09:16:10,086 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 09:16:10,086 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 09:16:10,086 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 09:16:10,086 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 09:16:10,087 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 09:16:10,087 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_f673e1f8-8cd2-4a42-b4b8-ac3f2eb0d615/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-12-09 09:16:10,095 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 09:16:10,095 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 09:16:10,096 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-09 09:16:10,096 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-09 09:16:10,096 INFO L133 SettingsManager]: * Use SBE=true [2018-12-09 09:16:10,096 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-12-09 09:16:10,096 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-12-09 09:16:10,096 INFO L133 SettingsManager]: * Use old map elimination=false [2018-12-09 09:16:10,096 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-12-09 09:16:10,097 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-12-09 09:16:10,097 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-12-09 09:16:10,097 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 09:16:10,097 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 09:16:10,097 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-09 09:16:10,097 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 09:16:10,097 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 09:16:10,097 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 09:16:10,097 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-12-09 09:16:10,098 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-12-09 09:16:10,098 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-12-09 09:16:10,098 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 09:16:10,098 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 09:16:10,098 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-12-09 09:16:10,098 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-09 09:16:10,098 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-12-09 09:16:10,098 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 09:16:10,099 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 09:16:10,099 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-12-09 09:16:10,099 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 09:16:10,099 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-09 09:16:10,099 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-12-09 09:16:10,100 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-12-09 09:16:10,100 INFO L133 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 -> /tmp/vcloud-vcloud-master/worker/working_dir_f673e1f8-8cd2-4a42-b4b8-ac3f2eb0d615/bin-2019/uautomizer 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 -> 65401fe061f89bb729dffabf74050dfab9fe7d77 [2018-12-09 09:16:10,117 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 09:16:10,124 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 09:16:10,126 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 09:16:10,127 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 09:16:10,127 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 09:16:10,127 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_f673e1f8-8cd2-4a42-b4b8-ac3f2eb0d615/bin-2019/uautomizer/../../sv-benchmarks/c/array-memsafety/java_BubbleSort-alloca_true-valid-memsafety_true-termination.i [2018-12-09 09:16:10,161 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f673e1f8-8cd2-4a42-b4b8-ac3f2eb0d615/bin-2019/uautomizer/data/8eeb21b9e/151554276f4b41389e29ce41a33f7728/FLAG6b632fd29 [2018-12-09 09:16:10,601 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 09:16:10,601 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_f673e1f8-8cd2-4a42-b4b8-ac3f2eb0d615/sv-benchmarks/c/array-memsafety/java_BubbleSort-alloca_true-valid-memsafety_true-termination.i [2018-12-09 09:16:10,606 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f673e1f8-8cd2-4a42-b4b8-ac3f2eb0d615/bin-2019/uautomizer/data/8eeb21b9e/151554276f4b41389e29ce41a33f7728/FLAG6b632fd29 [2018-12-09 09:16:10,614 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_f673e1f8-8cd2-4a42-b4b8-ac3f2eb0d615/bin-2019/uautomizer/data/8eeb21b9e/151554276f4b41389e29ce41a33f7728 [2018-12-09 09:16:10,616 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 09:16:10,616 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 09:16:10,617 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 09:16:10,617 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 09:16:10,619 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 09:16:10,619 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 09:16:10" (1/1) ... [2018-12-09 09:16:10,621 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@89db293 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:16:10, skipping insertion in model container [2018-12-09 09:16:10,621 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 09:16:10" (1/1) ... [2018-12-09 09:16:10,625 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 09:16:10,642 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 09:16:10,779 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 09:16:10,785 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 09:16:10,843 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 09:16:10,863 INFO L195 MainTranslator]: Completed translation [2018-12-09 09:16:10,863 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:16:10 WrapperNode [2018-12-09 09:16:10,863 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 09:16:10,863 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 09:16:10,864 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 09:16:10,864 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 09:16:10,869 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:16:10" (1/1) ... [2018-12-09 09:16:10,876 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:16:10" (1/1) ... [2018-12-09 09:16:10,888 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 09:16:10,888 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 09:16:10,888 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 09:16:10,888 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 09:16:10,894 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:16:10" (1/1) ... [2018-12-09 09:16:10,894 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:16:10" (1/1) ... [2018-12-09 09:16:10,895 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:16:10" (1/1) ... [2018-12-09 09:16:10,895 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:16:10" (1/1) ... [2018-12-09 09:16:10,898 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:16:10" (1/1) ... [2018-12-09 09:16:10,901 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:16:10" (1/1) ... [2018-12-09 09:16:10,902 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:16:10" (1/1) ... [2018-12-09 09:16:10,903 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 09:16:10,903 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 09:16:10,903 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 09:16:10,903 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 09:16:10,904 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:16:10" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f673e1f8-8cd2-4a42-b4b8-ac3f2eb0d615/bin-2019/uautomizer/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 [2018-12-09 09:16:10,935 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 09:16:10,935 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-09 09:16:10,935 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-09 09:16:10,935 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-09 09:16:10,935 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 09:16:10,935 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 09:16:11,040 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 09:16:11,040 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-09 09:16:11,040 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 09:16:11 BoogieIcfgContainer [2018-12-09 09:16:11,040 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 09:16:11,041 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-12-09 09:16:11,041 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-12-09 09:16:11,043 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-12-09 09:16:11,043 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-09 09:16:11,044 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 09.12 09:16:10" (1/3) ... [2018-12-09 09:16:11,044 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5d7132a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.12 09:16:11, skipping insertion in model container [2018-12-09 09:16:11,044 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-09 09:16:11,044 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:16:10" (2/3) ... [2018-12-09 09:16:11,045 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5d7132a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.12 09:16:11, skipping insertion in model container [2018-12-09 09:16:11,045 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-09 09:16:11,045 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 09:16:11" (3/3) ... [2018-12-09 09:16:11,046 INFO L375 chiAutomizerObserver]: Analyzing ICFG java_BubbleSort-alloca_true-valid-memsafety_true-termination.i [2018-12-09 09:16:11,078 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-09 09:16:11,079 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-12-09 09:16:11,079 INFO L375 BuchiCegarLoop]: Hoare is false [2018-12-09 09:16:11,079 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-12-09 09:16:11,079 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 09:16:11,079 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 09:16:11,079 INFO L379 BuchiCegarLoop]: Difference is false [2018-12-09 09:16:11,079 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 09:16:11,079 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-12-09 09:16:11,087 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2018-12-09 09:16:11,100 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-12-09 09:16:11,101 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 09:16:11,101 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 09:16:11,105 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-12-09 09:16:11,105 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-09 09:16:11,105 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-12-09 09:16:11,105 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2018-12-09 09:16:11,106 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-12-09 09:16:11,106 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 09:16:11,106 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 09:16:11,106 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-12-09 09:16:11,106 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-09 09:16:11,112 INFO L794 eck$LassoCheckResult]: Stem: 7#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 5#L-1true havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 10#L551true assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 15#L551-2true call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;sort_#in~x.base, sort_#in~x.offset, sort_#in~n := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc sort_#t~mem4, sort_#t~mem5, sort_#t~mem6, sort_#t~mem7, sort_~temp~0, sort_#t~post3, sort_#t~post2, sort_~x.base, sort_~x.offset, sort_~n, sort_~pass~0, sort_~i~0;sort_~x.base, sort_~x.offset := sort_#in~x.base, sort_#in~x.offset;sort_~n := sort_#in~n;havoc sort_~pass~0;havoc sort_~i~0;sort_~pass~0 := 1; 11#L543-3true [2018-12-09 09:16:11,112 INFO L796 eck$LassoCheckResult]: Loop: 11#L543-3true assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 8#L544-3true assume !true; 9#L543-2true sort_#t~post2 := sort_~pass~0;sort_~pass~0 := 1 + sort_#t~post2;havoc sort_#t~post2; 11#L543-3true [2018-12-09 09:16:11,116 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:16:11,116 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2018-12-09 09:16:11,117 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 09:16:11,118 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 09:16:11,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:16:11,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:16:11,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:16:11,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 09:16:11,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 09:16:11,195 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:16:11,195 INFO L82 PathProgramCache]: Analyzing trace with hash 47218, now seen corresponding path program 1 times [2018-12-09 09:16:11,195 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 09:16:11,195 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 09:16:11,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:16:11,196 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:16:11,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:16:11,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:16:11,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:16:11,214 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:16:11,214 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 09:16:11,217 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-09 09:16:11,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-09 09:16:11,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-09 09:16:11,227 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 2 states. [2018-12-09 09:16:11,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:16:11,231 INFO L93 Difference]: Finished difference Result 13 states and 16 transitions. [2018-12-09 09:16:11,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-09 09:16:11,232 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 16 transitions. [2018-12-09 09:16:11,233 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-12-09 09:16:11,235 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 9 states and 12 transitions. [2018-12-09 09:16:11,236 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-12-09 09:16:11,236 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2018-12-09 09:16:11,236 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 12 transitions. [2018-12-09 09:16:11,236 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-09 09:16:11,236 INFO L705 BuchiCegarLoop]: Abstraction has 9 states and 12 transitions. [2018-12-09 09:16:11,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 12 transitions. [2018-12-09 09:16:11,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-12-09 09:16:11,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-12-09 09:16:11,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 12 transitions. [2018-12-09 09:16:11,253 INFO L728 BuchiCegarLoop]: Abstraction has 9 states and 12 transitions. [2018-12-09 09:16:11,253 INFO L608 BuchiCegarLoop]: Abstraction has 9 states and 12 transitions. [2018-12-09 09:16:11,253 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-12-09 09:16:11,253 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 12 transitions. [2018-12-09 09:16:11,253 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-12-09 09:16:11,253 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 09:16:11,253 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 09:16:11,254 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-12-09 09:16:11,254 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-09 09:16:11,254 INFO L794 eck$LassoCheckResult]: Stem: 38#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 34#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 35#L551 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 42#L551-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;sort_#in~x.base, sort_#in~x.offset, sort_#in~n := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc sort_#t~mem4, sort_#t~mem5, sort_#t~mem6, sort_#t~mem7, sort_~temp~0, sort_#t~post3, sort_#t~post2, sort_~x.base, sort_~x.offset, sort_~n, sort_~pass~0, sort_~i~0;sort_~x.base, sort_~x.offset := sort_#in~x.base, sort_#in~x.offset;sort_~n := sort_#in~n;havoc sort_~pass~0;havoc sort_~i~0;sort_~pass~0 := 1; 41#L543-3 [2018-12-09 09:16:11,254 INFO L796 eck$LassoCheckResult]: Loop: 41#L543-3 assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 37#L544-3 assume !(sort_~i~0 < sort_~n - sort_~pass~0); 39#L543-2 sort_#t~post2 := sort_~pass~0;sort_~pass~0 := 1 + sort_#t~post2;havoc sort_#t~post2; 41#L543-3 [2018-12-09 09:16:11,254 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:16:11,254 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 2 times [2018-12-09 09:16:11,254 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 09:16:11,254 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 09:16:11,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:16:11,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:16:11,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:16:11,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 09:16:11,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 09:16:11,264 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:16:11,265 INFO L82 PathProgramCache]: Analyzing trace with hash 46877, now seen corresponding path program 1 times [2018-12-09 09:16:11,265 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 09:16:11,265 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 09:16:11,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:16:11,265 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 09:16:11,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:16:11,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:16:11,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:16:11,283 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:16:11,284 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 09:16:11,284 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-09 09:16:11,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 09:16:11,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 09:16:11,284 INFO L87 Difference]: Start difference. First operand 9 states and 12 transitions. cyclomatic complexity: 4 Second operand 3 states. [2018-12-09 09:16:11,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:16:11,303 INFO L93 Difference]: Finished difference Result 10 states and 13 transitions. [2018-12-09 09:16:11,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 09:16:11,304 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10 states and 13 transitions. [2018-12-09 09:16:11,304 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-12-09 09:16:11,305 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10 states to 10 states and 13 transitions. [2018-12-09 09:16:11,305 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-12-09 09:16:11,305 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-12-09 09:16:11,305 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 13 transitions. [2018-12-09 09:16:11,305 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-09 09:16:11,305 INFO L705 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2018-12-09 09:16:11,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 13 transitions. [2018-12-09 09:16:11,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-12-09 09:16:11,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-12-09 09:16:11,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2018-12-09 09:16:11,306 INFO L728 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2018-12-09 09:16:11,306 INFO L608 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2018-12-09 09:16:11,306 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-12-09 09:16:11,306 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 13 transitions. [2018-12-09 09:16:11,306 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-12-09 09:16:11,307 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 09:16:11,307 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 09:16:11,307 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-12-09 09:16:11,307 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-12-09 09:16:11,307 INFO L794 eck$LassoCheckResult]: Stem: 63#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 59#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 60#L551 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 68#L551-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;sort_#in~x.base, sort_#in~x.offset, sort_#in~n := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc sort_#t~mem4, sort_#t~mem5, sort_#t~mem6, sort_#t~mem7, sort_~temp~0, sort_#t~post3, sort_#t~post2, sort_~x.base, sort_~x.offset, sort_~n, sort_~pass~0, sort_~i~0;sort_~x.base, sort_~x.offset := sort_#in~x.base, sort_#in~x.offset;sort_~n := sort_#in~n;havoc sort_~pass~0;havoc sort_~i~0;sort_~pass~0 := 1; 67#L543-3 [2018-12-09 09:16:11,307 INFO L796 eck$LassoCheckResult]: Loop: 67#L543-3 assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 64#L544-3 assume !!(sort_~i~0 < sort_~n - sort_~pass~0);call sort_#t~mem4 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);call sort_#t~mem5 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 65#L545 assume sort_#t~mem4 > sort_#t~mem5;havoc sort_#t~mem4;havoc sort_#t~mem5;call sort_#t~mem6 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);sort_~temp~0 := sort_#t~mem6;havoc sort_#t~mem6;call sort_#t~mem7 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4);call write~int(sort_#t~mem7, sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);havoc sort_#t~mem7;call write~int(sort_~temp~0, sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 61#L544-2 sort_#t~post3 := sort_~i~0;sort_~i~0 := 1 + sort_#t~post3;havoc sort_#t~post3; 62#L544-3 assume !(sort_~i~0 < sort_~n - sort_~pass~0); 66#L543-2 sort_#t~post2 := sort_~pass~0;sort_~pass~0 := 1 + sort_#t~post2;havoc sort_#t~post2; 67#L543-3 [2018-12-09 09:16:11,307 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:16:11,307 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 3 times [2018-12-09 09:16:11,307 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 09:16:11,307 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 09:16:11,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:16:11,308 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:16:11,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:16:11,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 09:16:11,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 09:16:11,316 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:16:11,316 INFO L82 PathProgramCache]: Analyzing trace with hash 1398152922, now seen corresponding path program 1 times [2018-12-09 09:16:11,317 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 09:16:11,317 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 09:16:11,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:16:11,317 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 09:16:11,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:16:11,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 09:16:11,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 09:16:11,330 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:16:11,330 INFO L82 PathProgramCache]: Analyzing trace with hash -1893874754, now seen corresponding path program 1 times [2018-12-09 09:16:11,330 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 09:16:11,330 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 09:16:11,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:16:11,331 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:16:11,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:16:11,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 09:16:11,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 09:16:11,514 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 09:16:11,515 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 09:16:11,515 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 09:16:11,515 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 09:16:11,515 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-09 09:16:11,516 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 09:16:11,516 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 09:16:11,516 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 09:16:11,516 INFO L131 ssoRankerPreferences]: Filename of dumped script: java_BubbleSort-alloca_true-valid-memsafety_true-termination.i_Iteration3_Lasso [2018-12-09 09:16:11,516 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 09:16:11,516 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 09:16:11,535 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 09:16:11,626 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 09:16:11,628 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 09:16:11,629 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 09:16:11,630 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 09:16:11,632 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 09:16:11,633 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 09:16:11,634 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 09:16:11,636 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 09:16:11,638 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 09:16:11,639 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 09:16:11,837 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 09:16:11,840 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-09 09:16:11,841 INFO L122 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 [2018-12-09 09:16:11,842 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 09:16:11,842 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 09:16:11,843 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 09:16:11,843 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 09:16:11,843 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 09:16:11,844 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 09:16:11,844 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 09:16:11,849 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 09:16:11,849 INFO L122 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 [2018-12-09 09:16:11,849 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 09:16:11,849 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 09:16:11,850 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 09:16:11,850 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 09:16:11,851 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 09:16:11,851 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 09:16:11,853 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 09:16:11,853 INFO L122 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 [2018-12-09 09:16:11,854 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 09:16:11,854 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 09:16:11,854 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 09:16:11,854 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 09:16:11,857 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 09:16:11,857 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 09:16:11,884 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-09 09:16:11,913 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-12-09 09:16:11,913 INFO L444 ModelExtractionUtils]: 31 out of 37 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-12-09 09:16:11,914 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-09 09:16:11,915 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-09 09:16:11,916 INFO L518 LassoAnalysis]: Proved termination. [2018-12-09 09:16:11,916 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_sort_~pass~0, ULTIMATE.start_sort_~n) = -1*ULTIMATE.start_sort_~pass~0 + 1*ULTIMATE.start_sort_~n Supporting invariants [] [2018-12-09 09:16:11,924 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2018-12-09 09:16:11,938 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:16:11,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:16:11,949 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 09:16:11,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:16:11,957 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 09:16:11,964 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-09 09:16:11,966 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 [2018-12-09 09:16:11,967 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 10 states and 13 transitions. cyclomatic complexity: 4 Second operand 3 states. [2018-12-09 09:16:11,986 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 10 states and 13 transitions. cyclomatic complexity: 4. Second operand 3 states. Result 16 states and 22 transitions. Complement of second has 4 states. [2018-12-09 09:16:11,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-12-09 09:16:11,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-09 09:16:11,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 12 transitions. [2018-12-09 09:16:11,988 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 4 letters. Loop has 6 letters. [2018-12-09 09:16:11,989 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 09:16:11,989 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 10 letters. Loop has 6 letters. [2018-12-09 09:16:11,989 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 09:16:11,989 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 4 letters. Loop has 12 letters. [2018-12-09 09:16:11,989 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 09:16:11,990 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 22 transitions. [2018-12-09 09:16:11,990 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-09 09:16:11,990 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 15 states and 21 transitions. [2018-12-09 09:16:11,990 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2018-12-09 09:16:11,991 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2018-12-09 09:16:11,991 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 21 transitions. [2018-12-09 09:16:11,991 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 09:16:11,991 INFO L705 BuchiCegarLoop]: Abstraction has 15 states and 21 transitions. [2018-12-09 09:16:11,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 21 transitions. [2018-12-09 09:16:11,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2018-12-09 09:16:11,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-12-09 09:16:11,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 20 transitions. [2018-12-09 09:16:11,992 INFO L728 BuchiCegarLoop]: Abstraction has 14 states and 20 transitions. [2018-12-09 09:16:11,992 INFO L608 BuchiCegarLoop]: Abstraction has 14 states and 20 transitions. [2018-12-09 09:16:11,992 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-12-09 09:16:11,992 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 20 transitions. [2018-12-09 09:16:11,993 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-09 09:16:11,993 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 09:16:11,993 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 09:16:11,993 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-12-09 09:16:11,993 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-09 09:16:11,993 INFO L794 eck$LassoCheckResult]: Stem: 157#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 151#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 152#L551 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 163#L551-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;sort_#in~x.base, sort_#in~x.offset, sort_#in~n := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc sort_#t~mem4, sort_#t~mem5, sort_#t~mem6, sort_#t~mem7, sort_~temp~0, sort_#t~post3, sort_#t~post2, sort_~x.base, sort_~x.offset, sort_~n, sort_~pass~0, sort_~i~0;sort_~x.base, sort_~x.offset := sort_#in~x.base, sort_#in~x.offset;sort_~n := sort_#in~n;havoc sort_~pass~0;havoc sort_~i~0;sort_~pass~0 := 1; 164#L543-3 assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 154#L544-3 [2018-12-09 09:16:11,993 INFO L796 eck$LassoCheckResult]: Loop: 154#L544-3 assume !!(sort_~i~0 < sort_~n - sort_~pass~0);call sort_#t~mem4 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);call sort_#t~mem5 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 158#L545 assume sort_#t~mem4 > sort_#t~mem5;havoc sort_#t~mem4;havoc sort_#t~mem5;call sort_#t~mem6 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);sort_~temp~0 := sort_#t~mem6;havoc sort_#t~mem6;call sort_#t~mem7 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4);call write~int(sort_#t~mem7, sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);havoc sort_#t~mem7;call write~int(sort_~temp~0, sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 153#L544-2 sort_#t~post3 := sort_~i~0;sort_~i~0 := 1 + sort_#t~post3;havoc sort_#t~post3; 154#L544-3 [2018-12-09 09:16:11,993 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:16:11,993 INFO L82 PathProgramCache]: Analyzing trace with hash 28695756, now seen corresponding path program 1 times [2018-12-09 09:16:11,993 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 09:16:11,994 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 09:16:11,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:16:11,994 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:16:11,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:16:11,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 09:16:11,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 09:16:12,001 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:16:12,001 INFO L82 PathProgramCache]: Analyzing trace with hash 54716, now seen corresponding path program 1 times [2018-12-09 09:16:12,001 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 09:16:12,001 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 09:16:12,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:16:12,002 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:16:12,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:16:12,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 09:16:12,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 09:16:12,008 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:16:12,008 INFO L82 PathProgramCache]: Analyzing trace with hash 176800017, now seen corresponding path program 1 times [2018-12-09 09:16:12,008 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 09:16:12,008 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 09:16:12,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:16:12,009 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:16:12,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:16:12,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 09:16:12,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 09:16:12,163 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 09:16:12,163 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 09:16:12,164 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 09:16:12,164 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 09:16:12,164 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-09 09:16:12,164 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 09:16:12,164 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 09:16:12,164 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 09:16:12,164 INFO L131 ssoRankerPreferences]: Filename of dumped script: java_BubbleSort-alloca_true-valid-memsafety_true-termination.i_Iteration4_Lasso [2018-12-09 09:16:12,164 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 09:16:12,164 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 09:16:12,166 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 09:16:12,167 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 09:16:12,168 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 09:16:12,169 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 09:16:12,170 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 09:16:12,171 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 09:16:12,172 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 09:16:12,255 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 09:16:12,256 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 09:16:12,257 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 09:16:12,258 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 09:16:12,423 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 09:16:12,423 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-09 09:16:12,423 INFO L122 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 [2018-12-09 09:16:12,424 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 09:16:12,424 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 09:16:12,424 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 09:16:12,424 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 09:16:12,425 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 09:16:12,425 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 09:16:12,425 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 09:16:12,425 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 09:16:12,426 INFO L122 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 [2018-12-09 09:16:12,426 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 09:16:12,426 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 09:16:12,426 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 09:16:12,427 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 09:16:12,427 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 09:16:12,427 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 09:16:12,427 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 09:16:12,428 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 09:16:12,428 INFO L122 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 [2018-12-09 09:16:12,428 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 09:16:12,428 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 09:16:12,429 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 09:16:12,429 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 09:16:12,430 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 09:16:12,430 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 09:16:12,431 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 09:16:12,431 INFO L122 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 [2018-12-09 09:16:12,432 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 09:16:12,432 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 09:16:12,432 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 09:16:12,432 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 09:16:12,432 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 09:16:12,432 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 09:16:12,433 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 09:16:12,433 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 09:16:12,433 INFO L122 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 [2018-12-09 09:16:12,434 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 09:16:12,434 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 09:16:12,434 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 09:16:12,434 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 09:16:12,434 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 09:16:12,434 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 09:16:12,435 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 09:16:12,435 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 09:16:12,435 INFO L122 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 [2018-12-09 09:16:12,436 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 09:16:12,436 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 09:16:12,436 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 09:16:12,436 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 09:16:12,437 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 09:16:12,437 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 09:16:12,438 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 09:16:12,439 INFO L122 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 [2018-12-09 09:16:12,439 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 09:16:12,439 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 09:16:12,439 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 09:16:12,439 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 09:16:12,440 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 09:16:12,440 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 09:16:12,444 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 09:16:12,445 INFO L122 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 [2018-12-09 09:16:12,445 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 09:16:12,445 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-09 09:16:12,446 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 09:16:12,446 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 09:16:12,447 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-09 09:16:12,447 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 09:16:12,451 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 09:16:12,452 INFO L122 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 [2018-12-09 09:16:12,452 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 09:16:12,452 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 09:16:12,453 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 09:16:12,453 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 09:16:12,453 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 09:16:12,453 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 09:16:12,453 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 09:16:12,454 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 09:16:12,455 INFO L122 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 [2018-12-09 09:16:12,455 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 09:16:12,455 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 09:16:12,455 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 09:16:12,455 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 09:16:12,456 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 09:16:12,456 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 09:16:12,458 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 09:16:12,458 INFO L122 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 [2018-12-09 09:16:12,458 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 09:16:12,459 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 09:16:12,459 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 09:16:12,459 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 09:16:12,461 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 09:16:12,461 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 09:16:12,472 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-09 09:16:12,479 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-12-09 09:16:12,479 INFO L444 ModelExtractionUtils]: 32 out of 37 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-09 09:16:12,480 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-09 09:16:12,480 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-09 09:16:12,481 INFO L518 LassoAnalysis]: Proved termination. [2018-12-09 09:16:12,481 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_sort_~x.offset, ULTIMATE.start_sort_~i~0, v_rep(select #length ULTIMATE.start_sort_~x.base)_2) = -1*ULTIMATE.start_sort_~x.offset - 4*ULTIMATE.start_sort_~i~0 + 1*v_rep(select #length ULTIMATE.start_sort_~x.base)_2 Supporting invariants [] [2018-12-09 09:16:12,489 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2018-12-09 09:16:12,491 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-12-09 09:16:12,503 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:16:12,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:16:12,510 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 09:16:12,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:16:12,514 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 09:16:12,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:16:12,524 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 [2018-12-09 09:16:12,525 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states and 20 transitions. cyclomatic complexity: 8 Second operand 3 states. [2018-12-09 09:16:12,537 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states and 20 transitions. cyclomatic complexity: 8. Second operand 3 states. Result 30 states and 44 transitions. Complement of second has 7 states. [2018-12-09 09:16:12,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-12-09 09:16:12,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-09 09:16:12,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2018-12-09 09:16:12,537 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 5 letters. Loop has 3 letters. [2018-12-09 09:16:12,537 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 09:16:12,537 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 8 letters. Loop has 3 letters. [2018-12-09 09:16:12,537 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 09:16:12,538 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 5 letters. Loop has 6 letters. [2018-12-09 09:16:12,538 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 09:16:12,538 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 44 transitions. [2018-12-09 09:16:12,539 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-09 09:16:12,539 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 20 states and 28 transitions. [2018-12-09 09:16:12,539 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2018-12-09 09:16:12,540 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2018-12-09 09:16:12,540 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 28 transitions. [2018-12-09 09:16:12,540 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 09:16:12,540 INFO L705 BuchiCegarLoop]: Abstraction has 20 states and 28 transitions. [2018-12-09 09:16:12,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 28 transitions. [2018-12-09 09:16:12,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 14. [2018-12-09 09:16:12,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-12-09 09:16:12,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 19 transitions. [2018-12-09 09:16:12,541 INFO L728 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2018-12-09 09:16:12,541 INFO L608 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2018-12-09 09:16:12,541 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-12-09 09:16:12,541 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 19 transitions. [2018-12-09 09:16:12,541 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-09 09:16:12,541 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 09:16:12,541 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 09:16:12,542 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:16:12,542 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-09 09:16:12,542 INFO L794 eck$LassoCheckResult]: Stem: 265#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 259#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 260#L551 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 271#L551-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;sort_#in~x.base, sort_#in~x.offset, sort_#in~n := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc sort_#t~mem4, sort_#t~mem5, sort_#t~mem6, sort_#t~mem7, sort_~temp~0, sort_#t~post3, sort_#t~post2, sort_~x.base, sort_~x.offset, sort_~n, sort_~pass~0, sort_~i~0;sort_~x.base, sort_~x.offset := sort_#in~x.base, sort_#in~x.offset;sort_~n := sort_#in~n;havoc sort_~pass~0;havoc sort_~i~0;sort_~pass~0 := 1; 272#L543-3 assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 267#L544-3 assume !!(sort_~i~0 < sort_~n - sort_~pass~0);call sort_#t~mem4 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);call sort_#t~mem5 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 268#L545 assume !(sort_#t~mem4 > sort_#t~mem5);havoc sort_#t~mem4;havoc sort_#t~mem5; 263#L544-2 sort_#t~post3 := sort_~i~0;sort_~i~0 := 1 + sort_#t~post3;havoc sort_#t~post3; 264#L544-3 assume !(sort_~i~0 < sort_~n - sort_~pass~0); 269#L543-2 sort_#t~post2 := sort_~pass~0;sort_~pass~0 := 1 + sort_#t~post2;havoc sort_#t~post2; 270#L543-3 assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 262#L544-3 [2018-12-09 09:16:12,542 INFO L796 eck$LassoCheckResult]: Loop: 262#L544-3 assume !!(sort_~i~0 < sort_~n - sort_~pass~0);call sort_#t~mem4 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);call sort_#t~mem5 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 266#L545 assume sort_#t~mem4 > sort_#t~mem5;havoc sort_#t~mem4;havoc sort_#t~mem5;call sort_#t~mem6 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);sort_~temp~0 := sort_#t~mem6;havoc sort_#t~mem6;call sort_#t~mem7 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4);call write~int(sort_#t~mem7, sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);havoc sort_#t~mem7;call write~int(sort_~temp~0, sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 261#L544-2 sort_#t~post3 := sort_~i~0;sort_~i~0 := 1 + sort_#t~post3;havoc sort_#t~post3; 262#L544-3 [2018-12-09 09:16:12,542 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:16:12,542 INFO L82 PathProgramCache]: Analyzing trace with hash 1421271829, now seen corresponding path program 1 times [2018-12-09 09:16:12,542 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 09:16:12,542 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 09:16:12,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:16:12,543 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:16:12,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:16:12,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:16:12,570 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:16:12,571 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 09:16:12,571 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f673e1f8-8cd2-4a42-b4b8-ac3f2eb0d615/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 09:16:12,577 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:16:12,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:16:12,587 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 09:16:12,596 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:16:12,611 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 09:16:12,611 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-12-09 09:16:12,611 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-09 09:16:12,611 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:16:12,611 INFO L82 PathProgramCache]: Analyzing trace with hash 54716, now seen corresponding path program 2 times [2018-12-09 09:16:12,611 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 09:16:12,611 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 09:16:12,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:16:12,612 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:16:12,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:16:12,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 09:16:12,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 09:16:12,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 09:16:12,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-09 09:16:12,671 INFO L87 Difference]: Start difference. First operand 14 states and 19 transitions. cyclomatic complexity: 7 Second operand 7 states. [2018-12-09 09:16:12,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:16:12,700 INFO L93 Difference]: Finished difference Result 27 states and 36 transitions. [2018-12-09 09:16:12,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 09:16:12,701 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 36 transitions. [2018-12-09 09:16:12,701 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-09 09:16:12,702 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 25 states and 34 transitions. [2018-12-09 09:16:12,702 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2018-12-09 09:16:12,702 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2018-12-09 09:16:12,702 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 34 transitions. [2018-12-09 09:16:12,702 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 09:16:12,702 INFO L705 BuchiCegarLoop]: Abstraction has 25 states and 34 transitions. [2018-12-09 09:16:12,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 34 transitions. [2018-12-09 09:16:12,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 17. [2018-12-09 09:16:12,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-09 09:16:12,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 23 transitions. [2018-12-09 09:16:12,703 INFO L728 BuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2018-12-09 09:16:12,703 INFO L608 BuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2018-12-09 09:16:12,703 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-12-09 09:16:12,703 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 23 transitions. [2018-12-09 09:16:12,704 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-09 09:16:12,704 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 09:16:12,704 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 09:16:12,704 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-12-09 09:16:12,704 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-09 09:16:12,704 INFO L794 eck$LassoCheckResult]: Stem: 350#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 344#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 345#L551 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 355#L551-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;sort_#in~x.base, sort_#in~x.offset, sort_#in~n := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc sort_#t~mem4, sort_#t~mem5, sort_#t~mem6, sort_#t~mem7, sort_~temp~0, sort_#t~post3, sort_#t~post2, sort_~x.base, sort_~x.offset, sort_~n, sort_~pass~0, sort_~i~0;sort_~x.base, sort_~x.offset := sort_#in~x.base, sort_#in~x.offset;sort_~n := sort_#in~n;havoc sort_~pass~0;havoc sort_~i~0;sort_~pass~0 := 1; 356#L543-3 assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 357#L544-3 assume !!(sort_~i~0 < sort_~n - sort_~pass~0);call sort_#t~mem4 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);call sort_#t~mem5 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 360#L545 assume !(sort_#t~mem4 > sort_#t~mem5);havoc sort_#t~mem4;havoc sort_#t~mem5; 348#L544-2 sort_#t~post3 := sort_~i~0;sort_~i~0 := 1 + sort_#t~post3;havoc sort_#t~post3; 349#L544-3 assume !!(sort_~i~0 < sort_~n - sort_~pass~0);call sort_#t~mem4 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);call sort_#t~mem5 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 352#L545 assume !(sort_#t~mem4 > sort_#t~mem5);havoc sort_#t~mem4;havoc sort_#t~mem5; 358#L544-2 sort_#t~post3 := sort_~i~0;sort_~i~0 := 1 + sort_#t~post3;havoc sort_#t~post3; 359#L544-3 assume !(sort_~i~0 < sort_~n - sort_~pass~0); 353#L543-2 sort_#t~post2 := sort_~pass~0;sort_~pass~0 := 1 + sort_#t~post2;havoc sort_#t~post2; 354#L543-3 assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 347#L544-3 [2018-12-09 09:16:12,704 INFO L796 eck$LassoCheckResult]: Loop: 347#L544-3 assume !!(sort_~i~0 < sort_~n - sort_~pass~0);call sort_#t~mem4 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);call sort_#t~mem5 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 351#L545 assume sort_#t~mem4 > sort_#t~mem5;havoc sort_#t~mem4;havoc sort_#t~mem5;call sort_#t~mem6 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);sort_~temp~0 := sort_#t~mem6;havoc sort_#t~mem6;call sort_#t~mem7 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4);call write~int(sort_#t~mem7, sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);havoc sort_#t~mem7;call write~int(sort_~temp~0, sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 346#L544-2 sort_#t~post3 := sort_~i~0;sort_~i~0 := 1 + sort_#t~post3;havoc sort_#t~post3; 347#L544-3 [2018-12-09 09:16:12,704 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:16:12,704 INFO L82 PathProgramCache]: Analyzing trace with hash 1373641048, now seen corresponding path program 2 times [2018-12-09 09:16:12,704 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 09:16:12,705 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 09:16:12,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:16:12,705 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 09:16:12,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:16:12,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 09:16:12,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 09:16:12,717 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:16:12,717 INFO L82 PathProgramCache]: Analyzing trace with hash 54716, now seen corresponding path program 3 times [2018-12-09 09:16:12,717 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 09:16:12,717 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 09:16:12,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:16:12,718 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 09:16:12,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:16:12,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 09:16:12,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 09:16:12,724 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:16:12,724 INFO L82 PathProgramCache]: Analyzing trace with hash -307910395, now seen corresponding path program 1 times [2018-12-09 09:16:12,724 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 09:16:12,724 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 09:16:12,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:16:12,725 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 09:16:12,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:16:12,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:16:12,999 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:16:13,000 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 09:16:13,000 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f673e1f8-8cd2-4a42-b4b8-ac3f2eb0d615/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 09:16:13,006 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:16:13,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:16:13,016 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 09:16:13,058 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2018-12-09 09:16:13,060 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:16:13,062 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-12-09 09:16:13,063 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:16:13,065 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:16:13,066 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:16:13,066 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:3 [2018-12-09 09:16:13,073 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-09 09:16:13,088 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 09:16:13,088 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 7] total 19 [2018-12-09 09:16:13,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-09 09:16:13,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2018-12-09 09:16:13,132 INFO L87 Difference]: Start difference. First operand 17 states and 23 transitions. cyclomatic complexity: 8 Second operand 19 states. [2018-12-09 09:16:13,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:16:13,443 INFO L93 Difference]: Finished difference Result 60 states and 79 transitions. [2018-12-09 09:16:13,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-09 09:16:13,443 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 60 states and 79 transitions. [2018-12-09 09:16:13,444 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2018-12-09 09:16:13,445 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 60 states to 60 states and 79 transitions. [2018-12-09 09:16:13,445 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2018-12-09 09:16:13,445 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2018-12-09 09:16:13,445 INFO L73 IsDeterministic]: Start isDeterministic. Operand 60 states and 79 transitions. [2018-12-09 09:16:13,445 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 09:16:13,445 INFO L705 BuchiCegarLoop]: Abstraction has 60 states and 79 transitions. [2018-12-09 09:16:13,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states and 79 transitions. [2018-12-09 09:16:13,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 41. [2018-12-09 09:16:13,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-12-09 09:16:13,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 54 transitions. [2018-12-09 09:16:13,447 INFO L728 BuchiCegarLoop]: Abstraction has 41 states and 54 transitions. [2018-12-09 09:16:13,447 INFO L608 BuchiCegarLoop]: Abstraction has 41 states and 54 transitions. [2018-12-09 09:16:13,447 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-12-09 09:16:13,447 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 54 transitions. [2018-12-09 09:16:13,448 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2018-12-09 09:16:13,448 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 09:16:13,448 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 09:16:13,449 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:16:13,449 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-09 09:16:13,449 INFO L794 eck$LassoCheckResult]: Stem: 521#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 515#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 516#L551 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 526#L551-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;sort_#in~x.base, sort_#in~x.offset, sort_#in~n := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc sort_#t~mem4, sort_#t~mem5, sort_#t~mem6, sort_#t~mem7, sort_~temp~0, sort_#t~post3, sort_#t~post2, sort_~x.base, sort_~x.offset, sort_~n, sort_~pass~0, sort_~i~0;sort_~x.base, sort_~x.offset := sort_#in~x.base, sort_#in~x.offset;sort_~n := sort_#in~n;havoc sort_~pass~0;havoc sort_~i~0;sort_~pass~0 := 1; 527#L543-3 assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 528#L544-3 assume !!(sort_~i~0 < sort_~n - sort_~pass~0);call sort_#t~mem4 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);call sort_#t~mem5 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 543#L545 assume !(sort_#t~mem4 > sort_#t~mem5);havoc sort_#t~mem4;havoc sort_#t~mem5; 519#L544-2 sort_#t~post3 := sort_~i~0;sort_~i~0 := 1 + sort_#t~post3;havoc sort_#t~post3; 520#L544-3 assume !!(sort_~i~0 < sort_~n - sort_~pass~0);call sort_#t~mem4 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);call sort_#t~mem5 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 523#L545 assume sort_#t~mem4 > sort_#t~mem5;havoc sort_#t~mem4;havoc sort_#t~mem5;call sort_#t~mem6 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);sort_~temp~0 := sort_#t~mem6;havoc sort_#t~mem6;call sort_#t~mem7 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4);call write~int(sort_#t~mem7, sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);havoc sort_#t~mem7;call write~int(sort_~temp~0, sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 537#L544-2 sort_#t~post3 := sort_~i~0;sort_~i~0 := 1 + sort_#t~post3;havoc sort_#t~post3; 551#L544-3 assume !(sort_~i~0 < sort_~n - sort_~pass~0); 549#L543-2 sort_#t~post2 := sort_~pass~0;sort_~pass~0 := 1 + sort_#t~post2;havoc sort_#t~post2; 546#L543-3 assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 518#L544-3 [2018-12-09 09:16:13,449 INFO L796 eck$LassoCheckResult]: Loop: 518#L544-3 assume !!(sort_~i~0 < sort_~n - sort_~pass~0);call sort_#t~mem4 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);call sort_#t~mem5 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 522#L545 assume sort_#t~mem4 > sort_#t~mem5;havoc sort_#t~mem4;havoc sort_#t~mem5;call sort_#t~mem6 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);sort_~temp~0 := sort_#t~mem6;havoc sort_#t~mem6;call sort_#t~mem7 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4);call write~int(sort_#t~mem7, sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);havoc sort_#t~mem7;call write~int(sort_~temp~0, sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 517#L544-2 sort_#t~post3 := sort_~i~0;sort_~i~0 := 1 + sort_#t~post3;havoc sort_#t~post3; 518#L544-3 [2018-12-09 09:16:13,449 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:16:13,449 INFO L82 PathProgramCache]: Analyzing trace with hash 1371794006, now seen corresponding path program 2 times [2018-12-09 09:16:13,449 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 09:16:13,450 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 09:16:13,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:16:13,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:16:13,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:16:13,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 09:16:13,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 09:16:13,461 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:16:13,461 INFO L82 PathProgramCache]: Analyzing trace with hash 54716, now seen corresponding path program 4 times [2018-12-09 09:16:13,461 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 09:16:13,461 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 09:16:13,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:16:13,462 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 09:16:13,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:16:13,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 09:16:13,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 09:16:13,467 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:16:13,468 INFO L82 PathProgramCache]: Analyzing trace with hash 501436231, now seen corresponding path program 3 times [2018-12-09 09:16:13,468 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 09:16:13,468 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 09:16:13,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:16:13,468 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 09:16:13,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:16:13,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 09:16:13,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 09:16:13,724 WARN L180 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 98 [2018-12-09 09:16:13,767 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 09:16:13,768 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 09:16:13,768 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 09:16:13,768 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 09:16:13,768 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-09 09:16:13,768 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 09:16:13,768 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 09:16:13,768 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 09:16:13,768 INFO L131 ssoRankerPreferences]: Filename of dumped script: java_BubbleSort-alloca_true-valid-memsafety_true-termination.i_Iteration7_Lasso [2018-12-09 09:16:13,768 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 09:16:13,768 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 09:16:13,770 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 09:16:13,772 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 09:16:13,910 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 09:16:13,912 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 09:16:13,913 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 09:16:13,914 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 09:16:13,916 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 09:16:13,917 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 09:16:13,918 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 09:16:13,919 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 09:16:13,920 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 09:16:14,082 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 09:16:14,082 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-09 09:16:14,082 INFO L122 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 [2018-12-09 09:16:14,083 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 09:16:14,083 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 09:16:14,083 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 09:16:14,083 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 09:16:14,083 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 09:16:14,083 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 09:16:14,083 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 09:16:14,084 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 09:16:14,084 INFO L122 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 [2018-12-09 09:16:14,085 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 09:16:14,085 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-09 09:16:14,085 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 09:16:14,085 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 09:16:14,086 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-09 09:16:14,086 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 09:16:14,089 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 09:16:14,089 INFO L122 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 [2018-12-09 09:16:14,089 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 09:16:14,090 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 09:16:14,090 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 09:16:14,090 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 09:16:14,091 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 09:16:14,091 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 09:16:14,093 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 09:16:14,093 INFO L122 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 [2018-12-09 09:16:14,093 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 09:16:14,094 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 09:16:14,094 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 09:16:14,094 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 09:16:14,095 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 09:16:14,095 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 09:16:14,098 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 09:16:14,098 INFO L122 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 [2018-12-09 09:16:14,098 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 09:16:14,099 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 09:16:14,099 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 09:16:14,099 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 09:16:14,100 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 09:16:14,100 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 09:16:14,107 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-09 09:16:14,120 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2018-12-09 09:16:14,120 INFO L444 ModelExtractionUtils]: 29 out of 37 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-12-09 09:16:14,121 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-09 09:16:14,121 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-09 09:16:14,121 INFO L518 LassoAnalysis]: Proved termination. [2018-12-09 09:16:14,121 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_sort_~i~0, ULTIMATE.start_sort_~pass~0, ULTIMATE.start_sort_~n) = -1*ULTIMATE.start_sort_~i~0 - 1*ULTIMATE.start_sort_~pass~0 + 1*ULTIMATE.start_sort_~n Supporting invariants [] [2018-12-09 09:16:14,135 INFO L297 tatePredicateManager]: 7 out of 7 supporting invariants were superfluous and have been removed [2018-12-09 09:16:14,145 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:16:14,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:16:14,154 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 09:16:14,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:16:14,158 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 09:16:14,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:16:14,165 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 [2018-12-09 09:16:14,165 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 41 states and 54 transitions. cyclomatic complexity: 17 Second operand 3 states. [2018-12-09 09:16:14,185 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 41 states and 54 transitions. cyclomatic complexity: 17. Second operand 3 states. Result 74 states and 102 transitions. Complement of second has 7 states. [2018-12-09 09:16:14,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-12-09 09:16:14,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-09 09:16:14,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2018-12-09 09:16:14,186 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 14 letters. Loop has 3 letters. [2018-12-09 09:16:14,186 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 09:16:14,186 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-09 09:16:14,192 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:16:14,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:16:14,200 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 09:16:14,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:16:14,204 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 09:16:14,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:16:14,213 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2018-12-09 09:16:14,213 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 41 states and 54 transitions. cyclomatic complexity: 17 Second operand 3 states. [2018-12-09 09:16:14,222 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 41 states and 54 transitions. cyclomatic complexity: 17. Second operand 3 states. Result 74 states and 102 transitions. Complement of second has 7 states. [2018-12-09 09:16:14,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-12-09 09:16:14,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-09 09:16:14,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2018-12-09 09:16:14,223 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 14 letters. Loop has 3 letters. [2018-12-09 09:16:14,223 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 09:16:14,223 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-09 09:16:14,230 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:16:14,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:16:14,236 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 09:16:14,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:16:14,240 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 09:16:14,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:16:14,245 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-12-09 09:16:14,245 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 41 states and 54 transitions. cyclomatic complexity: 17 Second operand 3 states. [2018-12-09 09:16:14,255 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 41 states and 54 transitions. cyclomatic complexity: 17. Second operand 3 states. Result 67 states and 92 transitions. Complement of second has 6 states. [2018-12-09 09:16:14,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-12-09 09:16:14,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-09 09:16:14,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 19 transitions. [2018-12-09 09:16:14,256 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 14 letters. Loop has 3 letters. [2018-12-09 09:16:14,256 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 09:16:14,256 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 17 letters. Loop has 3 letters. [2018-12-09 09:16:14,256 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 09:16:14,256 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 14 letters. Loop has 6 letters. [2018-12-09 09:16:14,257 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 09:16:14,257 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 67 states and 92 transitions. [2018-12-09 09:16:14,257 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-09 09:16:14,257 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 67 states to 0 states and 0 transitions. [2018-12-09 09:16:14,257 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-12-09 09:16:14,257 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-12-09 09:16:14,258 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-12-09 09:16:14,258 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-09 09:16:14,258 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-09 09:16:14,258 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-09 09:16:14,258 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-09 09:16:14,258 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-12-09 09:16:14,258 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-12-09 09:16:14,258 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-09 09:16:14,258 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-12-09 09:16:14,262 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 09.12 09:16:14 BoogieIcfgContainer [2018-12-09 09:16:14,262 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-12-09 09:16:14,262 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 09:16:14,262 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 09:16:14,262 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 09:16:14,262 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 09:16:11" (3/4) ... [2018-12-09 09:16:14,264 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-09 09:16:14,264 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 09:16:14,265 INFO L168 Benchmark]: Toolchain (without parser) took 3648.90 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 344.5 MB). Free memory was 957.1 MB in the beginning and 1.2 GB in the end (delta: -282.3 MB). Peak memory consumption was 62.1 MB. Max. memory is 11.5 GB. [2018-12-09 09:16:14,265 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 09:16:14,265 INFO L168 Benchmark]: CACSL2BoogieTranslator took 246.35 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 155.2 MB). Free memory was 957.1 MB in the beginning and 1.1 GB in the end (delta: -182.9 MB). Peak memory consumption was 25.7 MB. Max. memory is 11.5 GB. [2018-12-09 09:16:14,266 INFO L168 Benchmark]: Boogie Procedure Inliner took 24.71 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 09:16:14,266 INFO L168 Benchmark]: Boogie Preprocessor took 14.46 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 09:16:14,266 INFO L168 Benchmark]: RCFGBuilder took 137.37 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: 17.9 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. [2018-12-09 09:16:14,266 INFO L168 Benchmark]: BuchiAutomizer took 3221.25 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 189.3 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -117.3 MB). Peak memory consumption was 72.0 MB. Max. memory is 11.5 GB. [2018-12-09 09:16:14,267 INFO L168 Benchmark]: Witness Printer took 2.45 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 09:16:14,268 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 246.35 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 155.2 MB). Free memory was 957.1 MB in the beginning and 1.1 GB in the end (delta: -182.9 MB). Peak memory consumption was 25.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 24.71 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 14.46 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 137.37 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: 17.9 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 3221.25 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 189.3 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -117.3 MB). Peak memory consumption was 72.0 MB. Max. memory is 11.5 GB. * Witness Printer took 2.45 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 GB. There was no memory consumed. 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.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 7 terminating modules (4 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function -1 * pass + n and consists of 3 locations. One deterministic module has affine ranking function -1 * x + -4 * i + unknown-#length-unknown[x] and consists of 4 locations. One nondeterministic module has affine ranking function -1 * i + -1 * pass + n and consists of 4 locations. 4 modules have a trivial ranking function, the largest among these consists of 19 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.1s and 8 iterations. TraceHistogramMax:2. Analysis of lassos took 2.5s. Construction of modules took 0.1s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 4. Automata minimization 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 34 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 41 states and ocurred in iteration 6. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 1/1 HoareTripleCheckerStatistics: 83 SDtfs, 89 SDslu, 66 SDs, 0 SdLazy, 255 SolverSat, 54 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT0 conc1 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital185 mio100 ax100 hnf99 lsp96 ukn66 mio100 lsp61 div100 bol100 ite100 ukn100 eq178 hnf88 smp92 dnf100 smp100 tf100 neg100 sie103 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 6ms VariablesStem: 4 VariablesLoop: 2 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...